MORRF*: Sampling-Based Multi-Objective Motion Planning

Many robotic tasks require solutions that maximize multiple performance objectives. For example, in path-planning, these objectives often include finding short paths that avoid risk and maximize the information obtained by the robot. Although there exist many algorithms for multi-objective optimization, few of these algorithms apply directly to robotic path-planning and fewer still are capable of finding the set of Pareto optimal solutions. We present the MORRF* (Multi-Objective Rapidly exploring Random Forest*) algorithm, which blends concepts from two different types of algorithms from the literature: Optimal rapidly exploring random tree (RRT*) for efficient path finding [Karaman and Frazzoli, 2010] and a decomposition-based approach to multi-objective optimization [Zhang and Li, 2007]. The random forest uses two types of tree structures: a set of reference trees and a set of subproblem trees. We present a theoretical analysis that demonstrates that the algorithm asymptotically produces the set of Pareto optimal solutions, and use simulations to demonstrate the effectiveness and efficiency of MORRF* in approximating the Pareto set.

[1]  Jasbir S. Arora,et al.  Survey of multi-objective optimization methods for engineering , 2004 .

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

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

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

[5]  Kalyanmoy Deb,et al.  Multi-objective path planning using spline representation , 2011, 2011 IEEE International Conference on Robotics and Biomimetics.

[6]  José António Tenreiro Machado,et al.  Robot Trajectory Planning Using Multi-objective Genetic Algorithm Optimization , 2004, GECCO.

[7]  Y. Charlie Hu,et al.  Deployment Strategy for Mobile Robots with Energy and Timing Constraints , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[8]  Michael A. Goodrich,et al.  Supporting task-oriented collaboration in human-robot teams using semantic-based path planning , 2014, Defense + Security Symposium.

[9]  P. B. Sujit,et al.  Multiple UAV path planning using anytime algorithms , 2009, 2009 American Control Conference.

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

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

[12]  Timothy W. McLain,et al.  Learning Real-Time A* Path Planner for Unmanned Air Vehicle Target Sensing , 2006, J. Aerosp. Comput. Inf. Commun..

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

[14]  Kalyanmoy Deb,et al.  An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints , 2014, IEEE Transactions on Evolutionary Computation.