Path planning: A 2013 survey

In the recent decades an impressive progress was done in automation and robotic fields. Projects such as Google driverless car with “sense and avoid” capabilities or intelligent Unmanned Air Vehicle (UAV) are examples of interesting research works targeting a high degree of autonomy. In this context we underline the unavoidable requirement for improving path planning algo-rithms. Indeed, path planning is one of the essential tasks in the automation process of a system that moves in the environment while avoiding obstacles and respecting various constraints. In this paper we present a state-of-the-art of path planning in the field of automation, robotics and video games. Furthermore, we focus on widespread algorithms that can satisfy real-time constraints and dynamic re-planning.

[1]  S. LaValle,et al.  Randomized Kinodynamic Planning , 2001 .

[2]  Sven Koenig,et al.  Generalized Adaptive A* , 2008, AAMAS.

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

[4]  Sven Koenig,et al.  Incremental Phi*: Incremental Any-Angle Path Planning on Grids , 2009, IJCAI.

[5]  Marina L. Gavrilova,et al.  Collision Detection Optimization in a Multi-particle System , 2002, International Conference on Computational Science.

[6]  Pedro Meseguer,et al.  Tree Adaptive A , 2011, AAMAS.

[7]  Hanan Samet,et al.  Using Quadtrees to Represent Spatial Data , 1985 .

[8]  F. Islam,et al.  RRT∗-Smart: Rapid convergence implementation of RRT∗ towards optimal solution , 2012, 2012 IEEE International Conference on Mechatronics and Automation.

[9]  Anthony Stentz,et al.  The Focussed D* Algorithm for Real-Time Replanning , 1995, IJCAI.

[10]  Guan-Chun Luh,et al.  An immunological approach to mobile robot reactive navigation , 2008, Appl. Soft Comput..

[11]  Guanghui Li,et al.  An efficient improved artificial potential field based regression search method for robot path planning , 2012, 2012 IEEE International Conference on Mechatronics and Automation.

[12]  Donald Meagher,et al.  Geometric modeling using octree encoding , 1982, Comput. Graph. Image Process..

[13]  Horacio Martinez-Alfaro,et al.  Mobile robot path planning and tracking using simulated annealing and fuzzy logic control , 1998 .

[14]  Ralf Salomon,et al.  Implementation of Path Planning using Genetic Algorithms on Mobile Robots , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[15]  Salah Sukkarieh,et al.  3D Path Planning for a Rotary Wing UAV using a Gaussian Process O ccupancy Map , 2009 .

[16]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[17]  David M. Mount,et al.  An Output Sensitive Algorithm for Computing Visibility Graphs , 1987, FOCS.

[18]  Sebastian Thrun,et al.  Anytime Dynamic A*: An Anytime, Replanning Algorithm , 2005, ICAPS.

[19]  Tong Heng Lee,et al.  Application of evolutionary artificial potential field in robot soccer system , 2001, Proceedings Joint 9th IFSA World Congress and 20th NAFIPS International Conference (Cat. No. 01TH8569).

[20]  Ariel Felner,et al.  Theta*: Any-Angle Path Planning on Grids , 2007, AAAI.

[21]  Sven Koenig,et al.  Any-Angle Path Planning , 2013, AI Mag..

[22]  Maryam Yarmohamadi,et al.  Improvement of Robot Path Planning Using Particle Swarm Optimization in Dynamic Environments with Mobile Obstacles and Target , 2011 .

[23]  Sven Koenig,et al.  Incremental A* , 2001, NIPS.

[24]  Sven Koenig,et al.  Generalized Fringe-Retrieving A*: faster moving target search on state lattices , 2010, AAMAS.

[25]  Jonathan P. How,et al.  Receding horizon control of autonomous aerial vehicles , 2002, Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301).

[26]  S. LaValle.  Rapidly-exploring random trees : a new tool for path planning , 1998 .

[27]  Anthony Stentz,et al.  3D Field D: Improved Path Planning and Replanning in Three Dimensions , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[28]  Michael Brand,et al.  Ant Colony Optimization algorithm for robot path planning , 2010, 2010 International Conference On Computer Design and Applications.

[29]  Anthony Stentz,et al.  Optimal and efficient path planning for partially-known environments , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[30]  Bruce Randall Donald,et al.  Kinodynamic motion planning , 1993, JACM.

[31]  O. Castilho,et al.  Multiple Objective Optimization Genetic Algorithms For Path Planning In Autonomous Mobile Robots , 2005, Int. J. Comput. Syst. Signals.

[32]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[33]  Jon Louis Bentley,et al.  Quad trees a data structure for retrieval on composite keys , 1974, Acta Informatica.

[34]  Der-Tsai Lee.  Proximity and reachability in the plane. , 1978 .

[35]  AurenhammerFranz.  Voronoi diagramsa survey of a fundamental geometric data structure , 1991 .

[36]  John F. Canny,et al.  New lower bound techniques for robot motion planning problems , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[37]  Sven Koenig,et al.  Moving target D* Lite , 2010, AAMAS.

[38]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1986 .

[39]  S. N. Maheshwari,et al.  Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles , 2000, SIAM J. Comput..

[40]  Lydia E. Kavraki,et al.  Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..

[41]  S. Areibi,et al.  Genetic algorithm for dynamic path planning , 2004, Canadian Conference on Electrical and Computer Engineering 2004 (IEEE Cat. No.04CH37513).

[42]  Adi Botea,et al.  Hierarchical path planning for multi-size agents in heterogeneous environments , 2008, 2008 IEEE Symposium On Computational Intelligence and Games.

[43]  Steven M. LaValle,et al.  Multi-agent Path Planning and Network Flow , 2012, WAFR.

[44]  Yoshiaki Kuwata,et al.  Three Dimensional Receding Horizon Control for UAVs , 2004 .

[45]  Micha Sharir,et al.  On Shortest Paths in Polyhedral Spaces , 1986, SIAM J. Comput..

[46]  Emilio Frazzoli,et al.  Sampling-based algorithms for optimal motion planning , 2011, Int. J. Robotics Res..

[47]  Nathan R. Sturtevant,et al.  Partial Pathfinding Using Map Abstraction and Refinement , 2005, AAAI.

[48]  Giorgio Guglieri,et al.  Path Planning Strategies for UAVS in 3D Environments , 2011, Journal of Intelligent & Robotic Systems.