• Journal of the Society of Naval Architects of Korea
• /
• v.58 no.3
• /
• pp.191-197
• /
• 2021

This study addresses autonomous ship collision avoidance in narrow channels using curvilinear coordinates. Navigation in narrow channels or fairways is known to be much more difficult and challenging compared with navigation in the open sea. It is not straightforward to apply the existing collision avoidance framework designed for use in the open sea to collision avoidance in narrow channels due to the complexity of the problem. In this study, to generalize the autonomous navigation procedure for collision avoidance in narrow channels, we introduce a curvilinear coordinate system for collision-free path planning using a parametric curve, B-spline. To demonstrate the feasibility of the proposed algorithm, ship traffic simulations were performed and the results are presented.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.25 no.3
• /
• pp.259-268
• /
• 2019

Even if only two ships are encountered, a collision may occur due to the mistaken judgment of the positional relationship. In other words, if an officer does not know a target ship's intention, there is always a risk of collision. In this paper, the experiments are conducted to investigate how the intention affects the action of collision avoidance in cooperative and non-cooperative situations. In non-cooperative situation, each ship chooses a course that minimizes costs based on the current situation. That is, it always performs a selfish selection. In a cooperative situation, the information is exchanged with a target ship and a course is selected based on this information. Each ship uses the Distributed Stochastic Search Algorithm so that a next-intended course can be selected by a certain probability and determines the course. In the experimental method, four virtual ships are set up to analyze the action of collision avoidance. Then, using the actual AIS data of eight ships in the strait of Dover, I compared and analyzed the action of collision avoidance in cooperative and non-cooperative situations. As a result of the experiment, the ships showed smooth trajectories in the cooperative situation, but the ship in the non-cooperative situation made frequent big changes to avoid a collision. In the case of the experiment using four ships, there was no collision in the cooperative situation regardless of the size of the safety domain, but a collision occurred between the ships when the size of the safety domain increased in cases of non-cooperation. In the case of experiments using eight ships, it was found that there are optimal parameters for collision avoidance. Also, it was possible to grasp the variation of the sailing distance and the costs according to the combination of the parameters, and it was confirmed that the setting of the parameters can have a great influence on collision avoidance among ships.

• International Journal of Aeronautical and Space Sciences
• /
• v.13 no.4
• /
• pp.474-483
• /
• 2012

In this paper, a collision avoidance maneuver was sought for low Earth orbit (LEO) and geostationary Earth orbit (GEO) satellites maintained in a keeping area. A genetic algorithm was used to obtain both the maneuver start time and the delta-V to reduce the probability of collision with uncontrolled space objects or debris. Numerical simulations demonstrated the feasibility of the proposed algorithm for both LEO satellites and GEO satellites.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.2
• /
• pp.64-70
• /
• 2002

This paper proposes a new construction method of neural networks. The construction method consists of two fundmental ideas, which are a parallel selection-style evaluation and rules evolution. A new collision avoidance algorithm using genetic and neural network is proposed to avoid moving obstacles such as mobile robots. The input parameters of this algorithm is position of moving obstacles and target. Output is a regenerated direction of mobile robot. This algorithm is very simple and so, it is available to application of real time process. The pattern of collision avoidance is learned through test execution.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.17 no.2
• /
• pp.115-121
• /
• 2022

This paper proposes a distributed model predictive formation control algorithm for a group of unmanned ground vehicles (UGVs) with guaranteeing collision avoidance between UGVs. Generally, the model predictive control based formation control has a disadvantage in that it takes a long time to compute control inputs when considering collision avoidance between UGVs. In this paper, in order to overcome this problem, the formation control algorithm is implemented in a distributed manner so that it could be individually controlled. Also, a collision-avoidance method considering real-time is proposed. The proposed formation control algorithm is implemented based on robot operating system (ROS), open source-based middleware. Through the various simulation tests, it is confirmed that the formation control of five UGVs is successfully performed while avoiding collisions between UGVs.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• v.1
• /
• pp.393-397
• /
• 2006

Significant increase of container flows in marine terminals requires more efficient automatic port systems. This paper presents a novel routing and collision avoidance algorithm of linear motor based shuttle cars using dynamic programming (DP). The proposed DP is accomplished online for determining optimal paths for each shuttle car. We apply our algorithm to Agile port terminal in USA.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.7
• /
• pp.631-636
• /
• 2007

An efficient obstacle avoidance algorithm is proposed in this paper to avoid dynamic obstacles using a collision vector while a tele-operated mobile robot is moving. For the verification of the algorithm, an operator watches through a monitor and controls the mobile robot with a force-reflection joystick. The force-reflection joystick transmits a virtual force to the operator through the Inter-net, which is generated by an adaptive impedance algorithm. To keep the mobile robot safe from collisions in an uncertain environment, the adaptive impedance algorithm generates the virtual force which changes the command of the operator by pushing the operator's hand to a direction to avoid the obstacle. In the conventional virtual force algorithm, the avoidance of moving obstacles was not solved since the operator cannot recognize the environment realistically by the limited communication bandwidth and the narrow view-angle of the camera. To achieve the dynamic obstacle avoidance, the adaptive virtual force algorithm is proposed based on the collision vector that is a normal vector from the obstacle to the mobile robot. To verify the effectiveness of the proposed algorithm, mobile robot navigation experiments with multiple moving obstacles have been performed, and the results are demonstrated.

• Journal of Astronomy and Space Sciences
• /
• v.30 no.1
• /
• pp.11-15
• /
• 2013

A collision-free formation reconfiguration trajectory subject to the linearized Hill's dynamics of relative motion is analytically developed by extending an algorithm for gravity-free space. Based on the initial solution without collision avoidance constraints, the final solution to minimize the designated performance index and avoid collision is found, based on a gradient method. Simple simulations confirm that satellites reconfigure their positions along the safe trajectories, while trying to spend minimum energies. The algorithm is applicable to wide range of formation flying under the Hill's dynamics.

• International Journal of Aeronautical and Space Sciences
• /
• v.12 no.3
• /
• pp.252-259
• /
• 2011

This paper is focused on dynamic modeling and control system design as well as vision based collision avoidance for multi-rotor unmanned aerial vehicles (UAVs). Multi-rotor UAVs are defined as rotary-winged UAVs with multiple rotors. These multi-rotor UAVs can be utilized in various military situations such as surveillance and reconnaissance. They can also be used for obtaining visual information from steep terrains or disaster sites. In this paper, a quad-rotor model is introduced as well as its control system, which is designed based on a proportional-integral-derivative controller and vision-based collision avoidance control system. Additionally, in order for a UAV to navigate safely in areas such as buildings and offices with a number of obstacles, there must be a collision avoidance algorithm installed in the UAV's hardware, which should include the detection of obstacles, avoidance maneuvering, etc. In this paper, the optical flow method, one of the vision-based collision avoidance techniques, is introduced, and multi-rotor UAV's collision avoidance simulations are described in various virtual environments in order to demonstrate its avoidance performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.3A
• /
• pp.267-277
• /
• 2011

Like other wireless network protocols, IEEE 802.15.4 adopts CA (Collision Avoidance)algorithm to avoid the early collision of a new packet by randomizing its first transmission time rather than its immediate delivery. The traditional CA scheme of IEEE 802.15.4, however, selects the random access time from the predetermined range without considering the degree of current congestion. It probably causes either a long delay to settle in the suitable range for the current network load or frequent clashes especially during the long lasting heavy traffic period. This paper proposes an ACA(Adaptive Collision Avoidance) algorithm adapting the initial backoff range to the undergoing collision variations. It also introduces a mathematical model to predict the performance of ACA algorithm added to IEEE 802.15.4. With only small deviations from corresponding simulations, our analytical model shows that ACA technique can improve the throughput of IEEE 802.15.4 by up-to 41% maximally in addition to shortening the packet delays.