• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.2
• /
• pp.268-275
• /
• 2011

This paper proposes two optimal path planning methods of a mobile robot using uDEAS (univariate Dynamic Encoding Algorithm for Searches). Before start of autonomous traveling, a self-controlled mobile robot must generate an optimal global path as soon as possible. To this end, numerical optimization method is applied to real time path generation of a mobile robot with an obstacle avoidance scheme and the basic path generation method based on the concept of knot and node points between start and goal points. The first improvement in the present work is to generate diagonal paths using three node points in the basic path. The second innovation is to make a smooth path plotted with the blending polynomial using uDEAS. Effectiveness of the proposed schemes are validated for several environments through simulation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.10 s.340
• /
• pp.39-50
• /
• 2005

In this paper, we propose a performance improving MAC algerian for the IEEE 802.11 DCF. WLAN based IEEE 802.11 uses two control methods called 'Distributed Coordination Function(UF)' and 'Point Coordination Function(PCF)'. The nF controls the Urnsmission based on carrier sense multiple access with collision detection(CSMA/CA), that decides a random backoff time with the range of contention window for each terminal. Normally, each terminal the CW double after collision, and reduces the CW to the minimum after successful transmission. This paper proposes an enhanced DCF algorithm that decreases the CW smoothly after successful transmission in order to reduce the collision Probability by utilizing the current status information of WLAN. We also analyze the throughput and delay performance for the unsaturated case mathematically. Simulation results show that our algorithm enhances the saturation throughput of WLAN. They also coincide well with the analytical results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.9
• /
• pp.841-851
• /
• 2014

Wireless technologies sharing the same frequency band and operating in the same environment often interfere with each other, causing severe decrease in performance. In this paper, we propose a algorithm based on traffic scheduling techniques that mitigate interference between different wireless systems operating in the 2.4-GHz industrial, medical, and scientific band. In particular, we consider IEEE 802.11 wireless local area networks (WLANs) and Bluetooth data transfer, showing that the proposed algorithms can work when the two systems are able to exchange information as well as when they operate independently of one another. Results indicate that the proposed algorithm remarkably mitigate the interference between the WLAN and Bluetooth technologies at the expense of a small additional delay in the data transfer.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.3
• /
• pp.456-463
• /
• 2021

In this paper, Ultra Wide-Band(UWB) radar sensor is employed to detect flying drones and avoid collision in dense clutter environments. UWB signal is preferred when high resolution range measurement is required for moving targets. However, the time varying motion of flying drones may increase clutter noises in return signals and deteriorates the target detection performance, which lead to the performance degradation of anti-collision radars. We adopt a dynamic clutter suppression algorithm to estimate the time-varying distances to the moving drones with enhanced accuracy. A modified Constant False Alarm Rate(CFAR) is developed using an adaptive filter algorithm to suppress clutter while the false detection performance is well maintained. For this purpose, a velocity dependent CFAR algorithm is implemented to eliminate the clutter noise against dynamic target motions. Experiments are performed against flying drones having arbitrary trajectories to verify the performance improvement.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.10 s.352
• /
• pp.8-17
• /
• 2006

Recently, the high-speed Internet users increase rapidly and broadband networks have been widely deployed. However, the current TCP congestion control algorithm was designed for relatively narrowband network environments, and thus its performance is inefficient for traffic transport in broadband networks. To remedy this problem, the TCP having an enhanced congestion control algorithm is required for broadband networks. In this paper, we propose an improved TCP congestion control that can sufficiently utilize the large available bandwidth in broadband networks. The proposed algorithm predicts the available bandwidth by using ACK information and RTT variation, and prevents large packet losses by adjusting congestion window size appropriately. Also, it can rapidly utilize the large available bandwidth by enhancing the legacy TCP algorithm in congestion avoidance phase. In order to evaluate the performance of the proposed algorithm, we use the ns-2 simulator. The simulation results show that the proposed algorithm improves not only the utilization of the available bandwidth but also RTT fairness and the fairness between contending TCP flows better than the HSTCP in high bandwidth delay product network environment.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.11_12
• /
• pp.682-691
• /
• 2005

We present a two-step evolution system that produces controllable virtual creatures in physically simulated 3D environment. Previous evolutionary methods for virtual creatures did not allow any user intervention during evolution process, because they generated a creature's shape, locomotion, and high-level behaviors such as target-following and obstacle avoidance simultaneously by one-time evolution process. In this work, we divide a single system into manageable two sub-systems, and this more likely allowsuser interaction. In the first stage, a body structure and low-level motor controllers of a creature for straight movement are generated by an evolutionary algorithm. Next, a high-level control to follow a given path is achieved by a neural network. The connection weights of the neural network are optimized by a genetic algorithm. The evolved controller could follow any given path fairly well. Moreover, users can choose or abort creatures according to their taste before the entire evolution process is finished. This paper also presents a new sinusoidal controller and a simplified hydrodynamics model for a capped-cylinder, which is the basic body primitive of a creature.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.25 no.1
• /
• pp.1-8
• /
• 2019

In December 2017, many collision accidents of small vessels, such as those between oil refineries and fishing boats, occurred near Yeonghung-do in Incheon. In order to prevent marine casualties from small vessels, the government is striving to improve the safety capabilities of ship operators by strengthening education and improving the working environment. They are providing education and refining training regulations for fishermen operating vessels under 5 tons. However, the situation includes certain vulnerabilities. In this study, we propose a collision prevention algorithm for small vessels using the Wireless Access in Vehicular Environments (WAVE) communication system, which is a new communication technique to prevent collisions with small ships. The collision avoidance algorithm used is based on DCPA/TCPA. Research analyses, simulation experiments and questionnaires have been conducted to define the criteria of DCPA/TCPA. As a result, the standard for DCPA was $8(L_a+L_b)$ and for TCPA was 2.5 min. Three different accident cases were selected, and this algorithm was applied to confirm alarm responses at certain times. This algorithm can provide information to the operators of small ships in advance to help them recognize potential collision situations.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.9 no.4
• /
• pp.11-22
• /
• 1999

Least-mean-square(LMS) adaptive filters have proven to be extremely useful in a number of signal processing tasks. However LMS adaptive filter suffer from a slow rate of convergence for a given steady-state mean square error as compared to the behavior of recursive least squares adaptive filter. In this paper an efficient signal interference control technique is introduced to improve the convergence speed of LMS algorithm with tap weighted vectors updating which were controled by reusing data which was abandoned data in the Adaptive transversal filter in the scheme with data recycling buffers. The computer simulation show that the character of convergence and the value of MSE of proposed algorithm are faster and lower than the existing LMS according to increasing the step-size parameter $\mu$ in the experimentally computed. learning curve. Also we find that convergence speed of proposed algorithm is increased by (B+1) time proportional to B which B is the number of recycled data buffer without complexity of computation. Adaptive transversal filter with proposed data recycling buffer algorithm could efficiently reject ISI of channel and increase speed of convergence in avoidance burden of computational complexity in reality when it was experimented having the same condition of LMS algorithm.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.149-158
• /
• 2005

This paper proposes a congestion avoidance algorithm which provides stable throughput and transmission rate regardless of buffer size by limiting the TCP congestion window in fixed bandwidth networks. Additive Increase, Multiplicative Decrease (AIMD) is the most commonly used congestion control algorithm. But, the AIMD-based TCP congestion control method causes unnecessary packet losses and retransmissions from the congestion window increment for available bandwidth verification when used in fixed bandwidth networks. In addition, the saw tooth variation of TCP throughput is inappropriate to be adopted for the applications that require low bandwidth variation. We present an algorithm in which congestion window can be limited under appropriate circumstances to avoid congestion losses while still addressing fairness issues. The maximum congestion window is determined from delay information to avoid queueing at the bottleneck node, hence stabilizes the throughput and the transmission rate of the connection without buffer and window control process. Simulations have performed to verify compatibility, steady state throughput, steady state packet loss count, and the variance of congestion window. The proposed algorithm can be easily adopted to the sender and is easy to deploy avoiding changes in network routers and user programs. The proposed algorithm can be applied to enhance the performance of the high-speed access network which is one of the fixed bandwidth networks.

• Computational Structural Engineering : An International Journal
• /
• v.1 no.2
• /
• pp.117-130
• /
• 2001

Investigations of low-rice unbounded reinforced concrete shear walls with or without openings are performed with comparison of analytical and experimental results. Theoretical analysis is based on nonlinear finite element algorithm, which incorporates concrete failure criterion and nonlinear constitutive relationships. Studios focus on the effects of height-to-length ratio of shear walls, opening ratio, horizontal and vertical reinforcement radios, and diagonal reinforcement. Analytical solutions conform well with experimental results. Equations for cracking, yielding and ultimate loads with corresponding lateral displacements are derived by regression using analytical results and experimental data. Also, failure modes of low-rise unbounded shear walls are theoretically investigated. An explanation of change in failure mode is ascertained by comparing analytical results and ACI code equations. Shear-flexural failure can be obtained with additional flexural reinforcement to increase a wall's capacity. This concept leads to a design method of reducing flexural reinforcement in low-rise bounded solid shear wall's. Avoidance of shear failure as well as less reinforcement congestion leer these walls is expected.