• Journal of Navigation and Port Research
• /
• 제47권6호
• /
• pp.401-409
• /
• 2023

This study compared and analyzed the performance of a distributed area search algorithm and a distributed probability search algorithm based on information exchange between ships. The distributed algorithm is a method that can search for an optimal avoidance route based on information exchange between ships. In the distributed area search algorithm, only a ship with the maximum cost reduction among neighboring ships has priority, so the next expected location can be changed. The distributed stochastic search algorithm allows a non-optimal value to be searched with a certain probability so that a new value can be searched. A circular-based ship collision avoidance model was used for the ship-to-ship collision avoidance experiment. The experimental method simulated the distributed area search algorithm and the distributed stochastic search algorithm while increasing the number of ships from 2 to 50 that were the same distance from the center of the circle. The calculation time required for each algorithm, sailing distance, and number of message exchanges were compared and analyzed. As a result of the experiment, the DSSA(Distributed Stochastic Search Algorithm) recorded a 25%calculation time, 88% navigation distance, and 84% of number of message exchange rate compared to DLSA.

• Journal of Navigation and Port Research
• /
• 제27권2호
• /
• pp.103-109
• /
• 2003

Evaluating the risk of collision quantitatively plays a key role in developing the expert system of navigation and collision avoidance. This study analysed the existing methods of appraising the collision risk, examined the problem that are intrinsic to them, and developed a new approach to its evaluation by using the sech function as an alternative to them. This paper applied the new method in appraising the collision risk and suggested how to decide the safe range of ownship's action.

• Journal of the Korean Society of Marine Environment & Safety
• /
• 제19권1호
• /
• pp.17-22
• /
• 2013

If we were in a head-on or crossing situation with a target ship and did not know the target ship's intention to change her course, we might be confused about our decision making to change our course for collision avoidance and be in a danger of collision. In order to solve these problems, we need to develop an automatic system which enables mariners to easily detect a change in the target ship's course and efficiently avoid being on a collision course. In this paper, we proposed an early detection method on altering course of a target ship using the steering wheel signal. This method will contribute to the reduction of collision accidents and also be used to the VTS system and the analysis of marine accidents.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 한국항해항만학회 2007년도 추계학술대회 및 제23회 정기총회
• /
• pp.75-76
• /
• 2007

A mis-handling of the ship operators show high rate among the whole marine accidents. Since the port conditions have been getting worse. also as her size and speed increase, collision risk has been increased so that ship needs the automatic control system for collision. From that purpose, this research has been proceeded. The research has based on the MMG mathematical model, used Surge-Sway-Yaw motion equation, the information from the position and estimated time of collision point (DCPA and TCPA) to determine the collision risk with Fuzzy theory. To verify this system, ship was simulated when the ship encountered multitude of ships around the coast. The simulation result shows good application in avoiding ship collisions around the coast.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제13권7호
• /
• pp.1247-1254
• /
• 2009

The purpose of the present study was to compare and analyze the differential effects of in-vehicle electronic device usage types(searching for targeted destinations in navigational purpose, watching TV in entertain purpose, and dialing a cellular-phone in phone-usage purpose) on driver's front-to-rear-end collision avoidance behavior, and to find effective collision warning format for this behavior. The result indicated that (1) the drivers showed more impaired collision avoidance performances when they were asked to search the name of targeted destination than the other task requirements, and (2) auditory warning appeared to be most effective among the other types of warning. In particular, it was suggested that the "Visual-Only" collision warning could induce most undesirable result when the drivers were engaged in both visual and auditory information processing.

• Proceedings of the KIEE Conference
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• pp.490-492
• /
• 2004

This paper presents an obstacle avoidance of a mobile robot by the subgoal generation using infrared sensors. When an obstacle appears on the path which the robot is moving forward the robot has to get information, such as distance between the robot and the obstacle and the shape of the obstacle for avoidance behavior. Our collision avoidance algorithm needs the only distance between the robot and the obstacles. The distances are used for subgoal generation. Simulation results show that a robot can go to the goal, carrying out subgoal generation and avoiding obstacles.

• Journal of the Korean Society for Precision Engineering
• /
• 제29권12호
• /
• pp.1321-1330
• /
• 2012

This paper describes an advanced formation algorithm of clustered multiple robots for their navigation using flexible formation method for collision avoidance under static environment like narrow corridors. A group of clustered multiple robots finds the lowest path cost for navigation by changing its formation. The suggested flexible method of formation transforms the basic group of mobile robots into specific form when it is confronted by particular geographic feature. In addition, the proposed method suggests to choose a leader robot of the group for the obstacle avoidance and path planning. Firstly, the group of robots forms basic shapes such as triangle, square, pentagon and etc. depending on number of robots. Secondly, the closest to the target location robot is chosen as a leader robot. The chosen leader robot uses $A^*$ for reaching the goal location. The proposed approach improves autonomous formation characteristics and performance of all system.

• Journal of Communications and Networks
• /
• 제16권4호
• /
• pp.385-396
• /
• 2014

In this paper, we present a formal method for modeling and checking an enhanced version of the carrier sense multiple access with collision avoidance protocol related to the IEEE 802.11 MAC layer, which has been proposed as the standard protocol for wireless local area networks. We deal mainly with the distributed coordination function (DCF) procedure of this protocol throughout a sequence of transformation steps. First, we use the unified modeling language state machines to thoroughly capture the behavior of wireless stations implementing a DCF, and then translate them into the input language of the UPPAAL model checking tool, which is a network of communicating timed automata. Finally, we proceed by checking of some of the safety and liveness properties, such as deadlock-freedom, using this tool.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1989년도 한국자동제어학술회의논문집; Seoul, Korea; 27-28 Oct. 1989
• /
• pp.635-642
• /
• 1989

We formulated the multi-robot trajectory problem into a series of NLP problem, each of which is that of finding the optimal tip positions of the robots for the next time step. The NLP problem is composed of an objective function and three constraints, namely: a) Joint position limits, b) Joint velocity limits, and c) Collision-avoidance constraints. By solving a series of NLP problem, optimally coordinated trajectories can be determined without requiring any prior path information. This is a novel departure from the previous approach in which either all paths or at least one path is assumed to be given. Practical application of the developed method is for optimal synthesis of multiple robot trajectories in off-line. To test the validity and effectiveness of the method, numerical examples are illustrated.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.1939-1943
• /
• 1991

Path planning is an important task for optimal motion of a robot in structured or unstructured environment. The goal of this paper is to plan the shortest collision-free path in 3D, when a robot is navigated to pick up some tools or to repair some parts from various locations. To accomplish the goal of this paper, the Path Coordinator is proposed to have the capabilities of an obstacle avoidance strategy[3] and a traveling salesman problem strategy(TSP)[23]. The obstacle avoidance strategy is to plan the shortest collision-free path between each pair of n locations in 2D or in 3D. The TSP strategy is to compute a minimal system cost of a tour that is defined as a closed path navigating each location exactly once. The TSP strategy can be implemented by the Neural Network. The obstacle avoidance strategy in 2D can be implemented by the VGraph Algorithm. However, the VGraph Algorithm is not useful in 3D, because it can't compute the global optimality in 3D. Thus, the Path Coordinator is proposed to solve this problem, having the capabilities of selecting the optimal edges by the modified Genetic Algorithm[21] and computing the optimal nodes along the optimal edges by the Recursive Compensation Algorithm[5].