• Proceedings of the KIEE Conference
• /
• 2011.07a
• /
• pp.1898-1899
• /
• 2011

In this paper, we propose an obstacle avoidance algorithm for a network-based autonomous mobile robot. The obstacle avoidance algorithm is based on the VFH (Vector Field Histogram) algorithm and delay-compensative methods with the VFH algorithm are proposed for the network-based robot that is a unified system composed of distributed environmental sensors, mobile actuators, and the VFH controller. Firstly, the compensated readings of the sensors are used for building the polar histogram of the VFH algorithm. Secondly, a sensory fusion using the Kalman filter is proposed for the localization of the robot to compensate both the delay of the readings of an odometry sensor and the delay of the readings of the environmental sensors. The performance enhancements of the proposed obstacle avoidance algorithm from the viewpoint of efficient path generation and accurate goal positioning are also shown in this paper through some simulation experiments by the Marilou Robotics Studio Simulator.

• 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.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.10a
• /
• pp.504-510
• /
• 1998

In this paper, Fundamental rules governing group intelligence "obstacle avoidance" behavior of multiple autonomous mobile robots are represented by a small number of fuzzy rules. Complex lifelike behavior is considered as local interactions between simple individuals under small number of fundamental rules. The fuzzy rules for obstacle avoidance are generated from clustering the input-output data obtained from the obstacle avoidance algorithm. Simulation shows the fuzzy rules successfully realizes fundamental rules of the obstacle avoidance behavior.

• Journal of Astronomy and Space Sciences
• /
• v.30 no.4
• /
• pp.291-298
• /
• 2013

The concept of the satellite formation flight is area where it is actively study with expandability and safety compare to existing satellite. For execution of duty with more safety issue, it needs to consider hot topic of space debris for operation of formation flight. In this paper, it suggests heuristic algorithm to have avoidance maneuver for space debris towards operating flight formation. Indeed it covers, using common software, operating simulation to nearest space environment and not only to have goal of avoidance but also minimizing the usage of fuel and finding optimization for maximizing cycle of formation flight. For improvement on convergence speed of existing heuristic algorithm, it substitute to hybrid heuristic algorithm, PSOGSA, and the result of simulation, it represents the satisfaction of minimum range for successful avoidance maneuver and compare to not using avoidance maneuver, it keeps more than three times of formation maintenance performance. From these, it is meaningful results of showing several success goals like simple avoidance collision and fuel usage and decreasing number of times of maintaining formation maneuver.

• The Journal of Korea Robotics Society
• /
• v.4 no.2
• /
• pp.105-111
• /
• 2009

In this paper, we provide experimental results and verification for obstacle avoidance algorithm 'ELA(Emergency Level Around)', which is applicable to rescue robots. ELA is a low level intelligence-based obstacle avoidance algorithm, so can be used in fast mobile robots requiringhigh speed in operation with little computational load. Constructed system for experiments consist of laptop, sensors, peripheral devices and mobile robot platform VSTR(Variable Single-tracked Robot) to realize predetermined scenarios. Finally, experiment was conducted in indoor surroundings including miscellaneous things as well as dark environment to show fitness and robustness of ELA for rescue, and it is shown that VSTR navigates endowed area well with real-time obstacle avoidance based on ELA. Therefore, it is concluded that ELA can be a candidate algorithm to increase mobility of rescue robots in real situation.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1544-1549
• /
• 2004

A new collision avoidance algorithm is presented for two mobile robots in narrow corridor environments. When two robots meet each other in a narrow corridor, one should yield the way to the other robot. To solve the problem arising in this situation, they exchange their path to get information about crossing-points to check avoidance conditions, which are necessary for choosing the robot to yield. The conditions are summarized as follows. 1) If one robot blocks the path to the closest crossing-point in front of the other robot. 2) If the closest crossing-point of each robot is the same point. 3) Which robot is closer to the closest crossing-point. In this paper, we propose a path planning algorithm for the robot which yield the way. Simulation results are presented to verify the feasibility of the proposed collision avoidance algorithm.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.9
• /
• pp.799-808
• /
• 2004

In this paper, a new collision avoidance algorithm based on the dynamic model of a mobile robot is proposed. In order to avoid obstacles on the path of a mobile robot, intelligent force control is used to regulate accurate distance between a robot and an obstacle. Since uncertainties from robot and environment dynamics degrade the performance of a collision avoidance task, neural network is used to compensate for uncertainties so that the collision avoidance can be performed intelligently. Simulation studies are conducted to confirm the proposed collision avoidance tracking control algorithm.

• 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.

• Journal of Advanced Navigation Technology
• /
• v.22 no.6
• /
• pp.623-629
• /
• 2018

In this paper, we propose a real-time obstacle detection and avoidance path generation algorithm for UAV. 2-D Lidar is used to detect obstacles, and the detected obstacle data is used to generate real-time histogram for local avoidance path and a 2-D SLAM map used for global avoidance path generation to the target point. The VFH algorithm for local avoidance path generation generates a real-time histogram of how much the obstacles are distributed in the vector direction and distance, and this histogram is used to generate the local avoidance path when detecting near fixed or dynamic obstacles. We propose an algorithm, called modified $RRT^*-Smart$, to overcome existing limitations. That generates global avoidance path to the target point by creating lower costs because nodes are checked whether or not straight path to a target point, and given arbitrary lengths and directionality to the target points when nodes are created. In this paper, we prove the efficient avoidance maneuvering through various simulation experiment environment by creating efficient avoidance paths.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.10a
• /
• pp.327-330
• /
• 1995

If a mobile robot is used in a real situation, robot must face a moving obstacles. In that case, the collision avoidance algorithm for moving obstacle is a indispensible element in mobile robot control. We csrried out a research to find and evaluate the advanced algorithm for mobile robot. At first we generate the continous path for mobi;e robot. Then by creating a curved path for avoidance, the mobile robot can change its path smoothly. Smoothed path made the robot adapt more effectively to the changing of path. Under time-varying condition, computer simulation was performed to show the validation of proposed algorithm.