Complete Path Planning That Simultaneously Optimizes Length and Clearance

This paper considers a fundamental, optimal path planning problem that requires simultaneously minimizing path length and maximizing obstacle clearance. We show that in even simple planar settings with point and disc obstacles, the set of alternative solutions such that no one is clearly better than another (the set of Pareto-optimal solutions) is uncountably infinite. In spite of this difficulty, we introduce a complete, efficient algorithm that computes the Pareto front and a data structure that finitely represents the complete set of all Pareto- optimal paths. Particular optimal paths can then be selected from the computed data structure during execution, based on any additional conditions or considerations.

[1]  Kalyanmoy Deb,et al.  Multi-objective optimal path planning using elitist non-dominated sorting genetic algorithms , 2012, Soft Computing.

[2]  Subir Kumar Ghosh,et al.  Visibility Algorithms in the Plane , 2007 .

[3]  Oscar Castillo,et al.  Multiple Objective Genetic Algorithms for Path-planning Optimization in Autonomous Mobile Robots , 2006, Soft Comput..

[4]  Gianni Ferretti,et al.  An Admissible Heuristic to Improve Convergence in Kinodynamic Planners Using Motion Primitives , 2020, IEEE Control Systems Letters.

[5]  Chelsea C. White,et al.  Multiobjective A* , 1991, JACM.

[6]  脇元 修一,et al.  IEEE International Conference on Robotics and Automation (ICRA) におけるフルードパワー技術の研究動向 , 2011 .

[7]  Steven M. LaValle,et al.  Human Perception-Optimized Planning for Comfortable VR-Based Telepresence , 2020, IEEE Robotics and Automation Letters.

[8]  Qingfu Zhang,et al.  MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.

[9]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[10]  Lawrence Mandow,et al.  A New Approach to Multiobjective A* Search , 2005, IJCAI.

[11]  Nancy M. Amato,et al.  MARRT: Medial Axis biased rapidly-exploring random trees , 2014, 2014 IEEE International Conference on Robotics and Automation (ICRA).

[12]  Jur P. van den Berg,et al.  Planning Near-Optimal Corridors Amidst Obstacles , 2006, WAFR.

[13]  Asgeir J. Sørensen,et al.  A Voronoi-diagram-based dynamic path-planning system for underactuated marine vessels☆ , 2017 .

[14]  Michael A. Goodrich,et al.  MORRF*: Sampling-Based Multi-Objective Motion Planning , 2015, IJCAI.

[15]  Mark H. Overmars,et al.  Clearance based path optimization for motion planning , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[16]  Steven M. LaValle,et al.  Optimal motion planning for multiple robots having independent goals , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[17]  Subhash Suri,et al.  A near-optimal algorithm for shortest paths among curved obstacles in the plane , 2013, SoCG '13.

[18]  Mark H. Overmars,et al.  Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles , 2006, WAFR.

[19]  Maurice Fallon,et al.  Multi-controller multi-objective locomotion planning for legged robots , 2019, 2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[20]  Efe Camci,et al.  Faster RRT-based Nonholonomic Path Planning in 2D Building Environments Using Skeleton-constrained Path Biasing , 2018, J. Intell. Robotic Syst..

[21]  Mansoor Davoodi Monfared,et al.  Bi-objective path planning using deterministic algorithms , 2017, Robotics Auton. Syst..

[22]  Jur P. van den Berg,et al.  The visibility--voronoi complex and its applications , 2005, EuroCG.

[23]  Ee-Chien Chang,et al.  Shortest path amidst disc obstacles is computable , 2005, Int. J. Comput. Geom. Appl..

[24]  Chee-Keng Yap,et al.  A "Retraction" Method for Planning the Motion of a Disc , 1985, J. Algorithms.

[25]  Subhash Suri,et al.  Efficient computation of Euclidean shortest paths in the plane , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[26]  Thierry Siméon,et al.  Sampling-Based Path Planning on Configuration-Space Costmaps , 2010, IEEE Transactions on Robotics.

[27]  Roland Geraerts,et al.  Planning short paths with clearance using explicit corridors , 2010, 2010 IEEE International Conference on Robotics and Automation.

[28]  Atsushi Watanabe,et al.  Passenger discomfort map for autonomous navigation in a robotic wheelchair , 2018, Robotics Auton. Syst..