• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 한국해양정보통신학회 2005년도 춘계종합학술대회
• /
• pp.295-299
• /
• 2005

In this paper, path planning and tracking problems are mentioned to guarantee efficient and safe navigation of autonomous mobile robots. We focus on the path planning and also deal with the path tracking and obstacle avoidance. We improved the conventional distance transform (DT) algorithm for the path planning. Using the improved DT algorithm, we obtain paths with shorter distances compared to the conventional DT algorithm. In the stage of the path tracking, we employ the fuzzy logic controller to conduct the path tracking behavior and obstacle avoidance behavior. Through computer simulation studies, we show the effectiveness of the proposed navigational algorithm for autonomous mobile robots.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• 제64권10호
• /
• pp.1479-1485
• /
• 2015

Robot's technology was very simple and repetitive in the past. Nowadays, robots are required to perform intelligent operation. So, path planning has been studied extensively to create a path from start position to the goal position. In this paper, potential field algorithm was used for path planning in dynamic environments. It is used for a path plan of mobile robot because it is elegant mathematical analysis and simplicity. However, there are some problems. The problems are collision risk, avoidance path, time attrition. In order to resolve path problems, we amalgamated potential field algorithm with the artificial neural network system. The input of the neural network system is set using relative velocity and location between the robot and the obstacle. The output of the neural network system is used for the weighting factor of the repulsive potential function. The potential field algorithm problem of mobile robot's path planning can be improved by using artificial neural network system. The suggested algorithm was verified by simulations in various dynamic environments.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• 제21권12호
• /
• pp.1992-2007
• /
• 1997

A new algorithm for planning a collision-free path is developed based on linear prametric curve. In this paper robot is assumed to a point, and two linear parametric curve is used to construct a path connecting start and goal point, in which single intermediate connection point between start and goal point is considered. The intermediate connection point is set in polar coordinate(${\theta}{\delta}$) , and the interference between path and obstacle is mapped into CPS(connection point space), which is defined a CWS GM(circular work space geometry mapping). GM of all obstacles in workspace creates overlapping images of obstacle in CPS(Connection Point Space). The GM for all obstacles produces overlapping images of obstacle in CPS. The empty area of CPS that is not occupied by obstacle images represents collision-free paths in Euclidian Space. A GM based on connection point in elliptic coordinate(${\theta}{\delta}$) is also developed in that the total length of path is depend only on the variable .delta.. Hence in EWS GM(elliptic work space geometry mapping), increasing .delta. and finding the value of .delta. for collision-free path, the shortest path can be searched without carring out whole GM. The GM of obstacles expersses all possible collision-free path as empty spaces in CPS. If there is no empty space available in CPS, it indicates that path planning is not possible with given number of connection points, i.e. path planning is failed, and it is necessary to increase the number of connection point. A general case collision-free path planning is possible by appling GM to configuration space obstacles. Simulation of GM of obstacles in Euclidian space is carried out to measure performance of algorithm and the resulting obstacle images are reported.

• The Journal of Korea Robotics Society
• /
• 제16권2호
• /
• pp.112-121
• /
• 2021

Unlike a typical small-sized robot navigating in a free space, an autonomous vehicle has to travel in a designated road which has lanes to follow and traffic rules to obey. High-Definition (HD) maps, which include road markings, traffic signs, and traffic lights with high location accuracy, can help an autonomous vehicle avoid the need to detect such challenging road surroundings. With space constraints and a pre-built HD map, a new type of path planning algorithm can be conceived as a substitute for conventional grid-based path planning algorithms, which require substantial planning time to cover large-scale free space. In this paper, we propose an obstacle-avoiding, cost-based planning algorithm in a continuous space that aims to pursue a globally-planned path with the help of HD map information. Experimentally, the proposed algorithm is shown to outperform other state-of-the-art path planning algorithms in terms of computation complexity in a typical urban road setting, thereby achieving real-time performance and safe avoidance of obstacles.

• Journal of the Society of Naval Architects of Korea
• /
• 제50권5호
• /
• pp.298-306
• /
• 2013

Nowadays, a transporter manager plans the schedule of the block transportation by considering the experience of the manager, the production process of the blocks and the priority of the block transportation in shipyard. The schedule planning of the block transportation should be rearranged for the reflection of the path blocking cases occurred by unexpected obstacles or delays in transportation. In this paper, the optimal block transportation path planning system is developed for rearranging the schedule of the block transportation by considering the damaged path. $A^*$ algorithm is applied to calculate the new shortest path between the departure and arrival of the blocks transported through the damaged path. In this algorithm, the first node of the damaged path is considered as the starting position of the new shortest path, and then the shortest path calculation is completed if the new shortest path is connected to the one of nodes in the original path. In addition, the data structure for the algorithm is designed. This optimal block transportation path planning system is applied to the Philippine Subic shipyard and the ability of the rapid path modification is verified.

• Proceedings of the KIEE Conference
• /
• 대한전기학회 1997년도 추계학술대회 논문집 학회본부
• /
• pp.576-580
• /
• 1997

This paper presents a path planning algorithm for biped walking robot in 3-D workspace. Since the biped walking robot can generate path on some 3-D obstacles that cannot generate path in case of mobile robot, we have to make a new path planning algorithms. A 3-D-to-2-D mapping algorithm is proposed and two kinds of path planning algorithms are also proposed. They make it easier to generate an efficient path for biped walking robot under given environment. Some simulation results are shown to prove the effectiveness of proposed algorithms.

• The Journal of Korea Robotics Society
• /
• 제2권2호
• /
• pp.183-190
• /
• 2007

The most important thing for navigation of a mobile robot is to find the most suitable path and avoid the obstacles in the static and dynamic environment. This paper presents a method to search the optimal path in start space extended to time domain with considering a velocity and a direction of moving obstacles. A modified version of $A^*$ algorithm has been applied for path planning in this work and proposed a method of path search to avoid a collision with moving obstacle in space-tim domain with a velocity and an orientation of obstacles. The velocity and the direction for moving obstacle are assumed as linear form. The simulation result shows that a mobile robot navigates safely among moving obstacles of constant linear velocity. This work can be applied for not only a moving robot but also a legged humanoid robot and all fields where the path planning is required.

• Proceedings of the KIEE Conference
• /
• 대한전기학회 1998년도 하계학술대회 논문집 B
• /
• pp.715-718
• /
• 1998

There are a lot of paths which connect between the mobile robot and the goat point. To make a mobile robot arrive at the goal point fastly, The optimal path is needed and a path palnning is necessary. In this paper, we propose a new method of path planning to find a path for mobile robot. It is based on Ginetic Algorithm for serching the optimal grobal path planning. Simulations show the efficiency for the grobal path planning.

• Proceedings of the KIEE Conference
• /
• 대한전기학회 1996년도 하계학술대회 논문집 B
• /
• pp.1208-1211
• /
• 1996

In this paper, an efficient and robust robot path planning technique is discussed. Concentric Ripple Edge Evaluation and Progression( CREEP ) algorithm[1] has been elaborated and expanded to carry out 3-D path planning. Like the 2-D case, robot can always find a path, if one exists, in a densely cluttered, unknown and unstructured 3-D obstacle environment. 3-D space in which the robot is expected to navigate is modeled by stacking cubic cells. The generated path is resolution optimal once the terrain is fully explored by the robot or all the information about the terrain is given. Path planning times are significantly reduced by local path update. Accuracy and efficiency of wave propagation in CREEP algorithm are achieved by virtual concentric sphere wave propagation. Simulations in 2-D and 3-D spaces are performed and excellent results are demonstrated.

• Journal of Computational Design and Engineering
• /
• 제3권2호
• /
• pp.132-139
• /
• 2016

In this paper, a minimum time path planning strategy is proposed for multi points manufacturing problems in drilling/spot welding tasks. By optimizing the travelling schedule of the set points and the detailed transfer path between points, the minimum time manufacturing task is realized under fully utilizing the dynamic performance of robotic manipulator. According to the start-stop movement in drilling/spot welding task, the path planning problem can be converted into a traveling salesman problem (TSP) and a series of point to point minimum time transfer path planning problems. Cubic Hermite interpolation polynomial is used to parameterize the transfer path and then the path parameters are optimized to obtain minimum point to point transfer time. A new TSP with minimum time index is constructed by using point-point transfer time as the TSP parameter. The classical genetic algorithm (GA) is applied to obtain the optimal travelling schedule. Several minimum time drilling tasks of a 3-DOF robotic manipulator are used as examples to demonstrate the effectiveness of the proposed approach.