• Proceedings of the KSME Conference
• /
• 2000.11a
• /
• pp.647-652
• /
• 2000

This paper proposes a collision warning/avoidance algorithm using a trajectory prediction method. This algorithm is based on 2-dimensional kinematics and the Kalman filter has been used to obtain the information of the object vehicle. This algorithm has been investigated via computer simulation and showed a good trajectory prediction performance. The proposed collision warning/avoidance algorithm would enhanced driver acceptance for a collision warning/avoidance system.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2023.05a
• /
• pp.265-266
• /
• 2023

With the development of science and technology, various research on ship collision avoidance has also developed rapidly. The research and development of ship collision avoidance technology has also received high attention from many researchers. This paper proposes a new collision avoidance algorithm for ships based on the artificial force field collision avoidance method. Using the simulation platform, the simulation results show that ships can successfully avoid collision in open water under single ship and multi ship situations, and the research results are relatively ideal.

• Journal of the Society of Naval Architects of Korea
• /
• v.56 no.1
• /
• pp.75-81
• /
• 2019

This study presents an automatic collision avoidance algorithm for autonomous navigation of unmanned surface vessels. The performance of the collision avoidance algorithm is heavily dependent on the estimation quality of the course and speed of traffic ships because collision avoidance maneuvers should be determined based on the predicted motions of the traffic ships and their trajectory uncertainties. In this study, the collision avoidance algorithm is implemented based on the Probabilistic Velocity Obstacle (PVO) approach considering the maritime collision regulations (COLREGs). In order to demonstrate the performance of the proposed algorithm, an extensive set of simulations was conducted and the results are discussed.

• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.1
• /
• pp.158-167
• /
• 1997

For the use of a mobile robot in dynamic environment, a collision-avoidance algorithm with moving obsta- cle is necessary. In this paper, a collsion-avoidance algorithm of a mobile robot is presented, when a mobile robot detects the collision with moving obstacle on the navigational path. Using reported positions of moving obstacle with sensors, the mobile robot predicts the next position of moving obstacle with possibility of collision. The velocity of moving obstacle is modeled as random walk process with Gaussian distribution. The optimal collision-avoidance path in which turning motion of the mobile robot is considered is generated with relative velocity between the mobile robot and moving obstacle. For the safety of collision-avoidance path, attractive potential with the safety factor is suggested. The simulation results using this algorithm show the mobile robot avoids collision with moving obstacle in many cases.

• Journal of the Society of Naval Architects of Korea
• /
• v.61 no.2
• /
• pp.106-114
• /
• 2024

In the 21st century, the rapid development of automation and artificial intelligence technologies is driving innovative changes in various industrial sectors. In the transportation industry, this is evident with the commercialization of autonomous vehicles. Moreover research into autonomous navigation technologies is actively underway in the aviation and maritime sectors. Consequently, for the practical implementation of autonomous ships, an effective collision avoidance algorithm has become a crucial element. Therefore, this study proposes a collision avoidance algorithm based on the Obstacle Zone by Target(OZT), which visually represents areas with a high likelihood of collisions with other ships or obstacles. The A-star algorithm was utilized to represent obstacles on a grid and assess collision risks. Subsequently, a collision avoidance algorithm was developed that performs fuzzy control based on calculated waypoints, allowing the vessel to return to its original course after avoiding the collision. Finally, the validity of the proposed algorithm was verified through collision avoidance simulations in various encounter scenarios.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.11
• /
• pp.1065-1070
• /
• 2004

Optimal collision avoidance algorithm for unmanned aerial vehicles based on proportional navigation guidance law is investigated this paper. Although proportional navigation guidance law is widely used in missile guidance problems, it can be used in collision avoidance problem by guiding the relative velocity vector to collision avoidance vector. The optimal navigation coefficient can be obtained if an obstacle if an obstacle moves at constant velocity vector. The stability of the proposed algorithm is also investigated. The stability can be obtained by choosing a proper navigation coefficient.

• Journal of Information Processing Systems
• /
• v.16 no.6
• /
• pp.1324-1342
• /
• 2020

Various modified algorithms of rapidly-exploring random tree (RRT) have been previously proposed. However, compared to the RRT algorithm for collision avoidance with global and static obstacles, it is not easy to find a collision avoidance and local path re-planning algorithm for dynamic obstacles based on the RRT algorithm. In this study, we propose boundary-RRT*, a novel-algorithm that can be applied to aerial vehicles for collision avoidance and path re-planning in a three-dimensional environment. The algorithm not only bounds the configuration space, but it also includes an implicit bias for the bounded configuration space. Therefore, it can create a path with a natural curvature without defining a bias function. Furthermore, the exploring space is reduced to a half-torus by combining it with simple right-of-way rules. When defining the distance as a cost, the proposed algorithm through numerical analysis shows that the standard deviation (σ) approaches 0 as the number of samples per unit time increases and the length of epsilon ε (maximum length of an edge in the tree) decreases. This means that a stable waypoint list can be generated using the proposed algorithm. Therefore, by increasing real-time performance through simple calculation and the boundary of the configuration space, the algorithm proved to be suitable for collision avoidance of aerial vehicles and replanning of local paths.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.25 no.2
• /
• pp.169-177
• /
• 2019

It is very important to understand the intention of a target ship to prevent collisions in multiple-ship situations. However, considering the intentions of a large number of ships at the same time is a great burden for the officer who must establish a collision avoidance plan. With a distributed algorithm, a ship can exchange information with a large number of target ships and search for a safe course. In this paper, I have applied a Distributed Stochastic Search Algorithm (DSSA), a distributed algorithm, for ship collision avoidance. A ship chooses the course that offers the greatest cost reduction or keeps its current course according to probability and constraints. DSSA is divided into five types according to the probability and constraints mentioned. In this paper, the five types of DSSA are applied for ship collision avoidance, and the effects on ship collision avoidance are analyzed. In addition, I have investigated which DSSA type is most suitable for collision avoidance. The experimental results show that the DSSA-A and B schemes offered effective ship collision avoidance. This algorithm is expected to be applicable for ship collision avoidance in a distributed system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.3B
• /
• pp.248-253
• /
• 2011

Collision avoidance algorithm of vessels have been studied to avoid collision and grounding of a vessel due to human error. In this paper, We propose a collision avoidance algorithm using bayesian estimation theory for safety sailing and reduced risk of collision accident. We calculate collision risk for efficient collision avoidance using bayesian algorithm and determined the safest and most effective collision risk is predicted by using re-planned with re-evaluated collision risk in the future(t=t'). Others ship position is assumed to be informed from AIS. Experimental results show that we estimate the safest and most effective collision risk.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1996.10a
• /
• pp.279-282
• /
• 1996

Collision avoidance is a method to direct a mobile robot without collision when traversing the environment. This kind of navigation is to reach a destination without getting lost. In this paper, we use a genetic algorithm for the path planning and collision avoidance. Genetic algorithm searches for path in the entire, continuous free space and unifies global path planning and local path planning. It is a efficient and effective method when compared with traditional collision avoidance algorithm.