A Global Path Planning Algorithm Based on Bidirectional SVGA

For path planning algorithms based on visibility graph, constructing a visibility graph is very time-consuming. To reduce the computing time of visibility graph construction, this paper proposes a novel global path planning algorithm, bidirectional SVGA (simultaneous visibility graph construction and path optimization by A?). This algorithm does not construct a visibility graph before the path optimization. However it constructs a visibility graph and searches for an optimal path at the same time. At each step, a node with the lowest estimation cost is selected to be expanded. According to the status of this node, different through lines are drawn. If this line is free-collision, it is added to the visibility graph. If not, some vertices of obstacles which are passed through by this line are added to the OPEN list for expansion. In the SVGA process, only a few visible edges which are in relation to the optimal path are drawn and the most visible edges are ignored. For taking advantage of multicore processors, this algorithm performs SVGA in parallel from both directions. By SVGA and parallel performance, this algorithm reduces the computing time and space. Simulation experiment results in different environments show that the proposed algorithm improves the time and space efficiency of path planning.

[1]  Hassan Mathkour,et al.  Comparative study of soft computing techniques for mobile robot navigation in an unknown environment , 2015, Comput. Hum. Behav..

[2]  Inna Sharf,et al.  Sampling-based A* algorithm for robot path-planning , 2014, Int. J. Robotics Res..

[3]  Andrej Babinec,et al.  Modelling of Mechanical and Mechatronic Systems MMaMS 2014 Path planning with modified A star algorithm for a mobile robot , 2014 .

[4]  Han-Pang Huang,et al.  Dynamic visibility graph for path planning , 2004, 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566).

[5]  Munsang Kim,et al.  Variants of the Quantized Visibility Graph for Efficient Path Planning , 2011, Adv. Robotics.

[6]  Yan Ming-zhong Survey on technology of mobile robot path planning , 2010 .

[7]  Tran Van Hoai,et al.  Some Advanced Techniques in Reducing Time for Path Planning Based on Visibility Graph , 2011, 2011 Third International Conference on Knowledge and Systems Engineering.

[8]  K. R. Guruprasad EgressBug: A Real Time Path Planning Algorithm for a Mobile Robot in an Unknown Environment , 2011, ADCONS.

[9]  Li Fu-xianga Mapping algorithm using adaptive size of occupancy grids based on quadtree , 2011 .

[10]  Oscar Montiel,et al.  Optimal Path Planning Generation for Mobile Robots using Parallel Evolutionary Artificial Potential Field , 2015, J. Intell. Robotic Syst..

[11]  Ryan N. Smith,et al.  Convergence-guaranteed time-varying RRT path planning for profiling floats in 4-dimensional flow , 2014, ICRA 2014.

[12]  Rahul Brungi,et al.  Artificial Intelligence in Robot Path Planning , 2015 .

[13]  Yu Wan Cen,et al.  A Path-Planning Algorithm for AGV Based on the Combination between Ant Colony Algorithm and Immune Regulation , 2011 .

[14]  Sven Koenig,et al.  PA*SE: Parallel A* for Slow Expansions , 2014, ICAPS.

[15]  P. Raja,et al.  Optimal path planning of mobile robots: A review , 2012 .

[16]  Duc-Lung Vu,et al.  Global path planning for autonomous robots using modified visibility-graph , 2013, 2013 International Conference on Control, Automation and Information Sciences (ICCAIS).

[17]  Tiancheng Li,et al.  Fan-shaped Grid Based Global Path Planning for Mobile Robot: Fan-shaped Grid Based Global Path Planning for Mobile Robot , 2010 .

[18]  Li Pin Path Planning Based on Visibility Graph and A* Algorithm , 2014 .

[20]  Gao Yang Fan-shaped Grid Based Global Path Planning for Mobile Robot , 2010 .