Sampling-based planning algorithms for multi-objective missions

Multiple objective navigation is commonly found in practice, where a path for an autonomous vehicle needs to be generated to simultaneously optimize a number of different objectives such as distance, safety, and visibility. Objectives can be weighted to solve a single objective optimization problem but appropriate weights may not be known a priori. In this paper, we formulate a series of missions for a group of vehicles that need to keep connectivity among themselves, surveil a group of targets, and minimize path lengths. These problems are solved by extending optimal sampling-based algorithms (RRT*) to support multiple objectives, non-additive costs and cooperative conditions. We present several increasingly complicated missions in obstacle-filled environments to illustrate and compare our ideas with existing methods.

[1]  Emilio Frazzoli,et al.  Anytime Motion Planning using the RRT* , 2011, 2011 IEEE International Conference on Robotics and Automation.

[2]  S. Darbha,et al.  Sampling-Based Path Planning for a Visual Reconnaissance Unmanned Air Vehicle , 2012 .

[3]  Ralph E. Steuer,et al.  Multiple Criteria Decision Making, Multiattribute Utility Theory: The Next Ten Years , 1992 .

[4]  Robert J. Baxley,et al.  Multi-user MISO broadcasting for indoor visible light communication , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.

[5]  Steven M. LaValle,et al.  Optimal motion planning for multiple robots having independent goals , 1998, IEEE Trans. Robotics Autom..

[6]  Bashra Kadhim Oleiwi,et al.  Multi Objective Optimization of Trajectory Planning of Non-holonomic Mobile Robot in Dynamic Environment Using Enhanced GA by Fuzzy Motion Control and A* , 2014 .

[7]  Kikuo Fujimura.  Path planning with multiple objectives , 1996, IEEE Robotics Autom. Mag..

[8]  M. Ehrgott.  Approximation algorithms for combinatorial multicriteria optimization problems , 2000 .

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

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

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

[12]  Arthur Warburton,et al.  Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems , 1987, Oper. Res..

[13]  J. Latombe,et al.  On nonholonomic mobile robots and optimal maneuvering , 1989, Proceedings. IEEE International Symposium on Intelligent Control 1989.

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

[15]  Marilena Vendittelli,et al.  Shortest Paths to Obstacles for a Polygonal Dubins Car , 2009, IEEE Transactions on Robotics.

[16]  Emilio Frazzoli,et al.  Incremental Sampling-Based Algorithms for a Class of Pursuit-Evasion Games , 2010, WAFR.

[17]  L. Dubins.  On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents , 1957 .

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

[19]  Emilio Frazzoli,et al.  Incremental Sampling-based Algorithms for Optimal Motion Planning , 2010, Robotics: Science and Systems.

[20]  Steven M. LaValle,et al.  RRT-connect: An efficient approach to single-query path planning , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[21]  Dale R. Shires,et al.  A Monte Carlo Method for Multi-Objective Correlated Geometric Optimization , 2014 .

[22]  Zbigniew Tarapata,et al.  Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms , 2007, Int. J. Appl. Math. Comput. Sci..