An algorithm for Path planning with polygon obstacles avoidance based on the virtual circle tangents

In this paper, a new algorithm called the virtual circle tangents is introduced for mobile robot navigation in an environment with polygonal shape obstacles. The algorithm relies on representing the polygonal shape obstacles by virtual circles, and then all the possible trajectories from source to target is constructed by computing the visible tangents between the robot and the virtual circle obstacles. A new method for searching the shortest path from source to target is suggested. Two states of the simulation are suggested, the first one is the off-line state and the other is the on-line state. The introduced method is compared with two other algorithms to study its performance. Index Terms — Path planning, polygonal obstacles avoidance, randomized incremental algorithm, visible tangent graph.

[1]  Shahin Mohammadi,et al.  A Voronoi-Based Reactive Approach for Mobile Robot Navigation , 2008, CSICC.

[2]  Meng Rui,et al.  A Study on Soccer Robot Path Planning with Fuzzy Artificial Potential Field , 2010, 2010 International Conference on Computing, Control and Industrial Engineering.

[3]  Guangzhao Cui,et al.  Path Planning of Mobile Robot Based on Improved Potential Field , 2013 .

[4]  Vladimir J. Lumelsky,et al.  Incorporating range sensing in the robot navigation function , 1990, IEEE Trans. Syst. Man Cybern..

[5]  Emo Welzl,et al.  Smallest enclosing disks (balls and ellipsoids) , 1991, New Results and New Trends in Computer Science.

[6]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[7]  A WesleyMichael,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979 .

[8]  Paul M. Griffin,et al.  Path planning for a mobile robot , 1992, IEEE Trans. Syst. Man Cybern..

[9]  Yoram Koren,et al.  Potential field methods and their inherent limitations for mobile robot navigation , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[10]  B. K. Rout,et al.  Geometrical approach to On line Trajectory generation, Obstacle avoidance and Footstep planning for a Humanoid Robot , 2015 .

[11]  Jan L. Cieśliński,et al.  Fast exact digital differential analyzer for circle generation , 2013, Appl. Math. Comput..

[12]  A comparison of standard one-step DDA circular interpolators with a new cheap two-step algorithm , 2014 .

[13]  Marina L. Gavrilova,et al.  Voronoi diagram in optimal path planning , 2007, 4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007).

[14]  Atsushi Yamashita,et al.  Effective improved artificial potential field-based regression search method for autonomous mobile robot path planning , 2013, Int. J. Mechatronics Autom..

[15]  Gabriel Hugh Elkaim,et al.  Real-Time Obstacle-Avoiding Path Planning for Mobile Robots , 2010 .

[16]  Xiaoping Yun,et al.  A wall-following method for escaping local minima in potential field based motion planning , 1997, 1997 8th International Conference on Advanced Robotics. Proceedings. ICAR'97.

[17]  Yunhui Liu,et al.  Proposal of tangent graph and extended tangent graph for path planning of mobile robots , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[18]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[19]  Tomás Lozano-Pérez,et al.  Automatic Planning of Manipulator Transfer Movements , 1981, IEEE Transactions on Systems, Man, and Cybernetics.