Experimental Comparison of Global Motion Planning Algorithms for Wheeled Mobile Robots

Planning smooth and energy-efficient motions for wheeled mobile robots is a central task for applications ranging from autonomous driving to service and intralogistic robotics. Over the past decades, a wide variety of motion planners, steer functions and path-improvement techniques have been proposed for such non-holonomic systems. With the objective of comparing this large assortment of state-of-the-art motion-planning techniques, we introduce a novel open-source motion-planning benchmark for wheeled mobile robots, whose scenarios resemble real-world applications (such as navigating warehouses, moving in cluttered cities or parking), and propose metrics for planning efficiency and path quality. Our benchmark is easy to use and extend, and thus allows practitioners and researchers to evaluate new motion-planning algorithms, scenarios and metrics easily. We use our benchmark to highlight the strengths and weaknesses of several common state-of-the-art motion planners and provide recommendations on when they should be used.

[1]  Marco Pavone,et al.  An asymptotically-optimal sampling-based algorithm for Bi-directional motion planning , 2015, 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[2]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

[3]  L. Shepp,et al.  OPTIMAL PATHS FOR A CAR THAT GOES BOTH FORWARDS AND BACKWARDS , 1990 .

[4]  Jean-Paul Laumond,et al.  Guidelines in nonholonomic motion planning for mobile robots , 1998 .

[5]  Siddhartha S. Srinivasa,et al.  Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic , 2014, 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[6]  Siddhartha S. Srinivasa,et al.  Batch Informed Trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs , 2014, 2015 IEEE International Conference on Robotics and Automation (ICRA).

[7]  Nathan R. Sturtevant,et al.  Benchmarks for Grid-Based Pathfinding , 2012, IEEE Transactions on Computational Intelligence and AI in Games.

[8]  Kai Oliver Arras,et al.  RRT-based nonholonomic motion planning using any-angle path biasing , 2016, 2016 IEEE International Conference on Robotics and Automation (ICRA).

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

[10]  Daniele Nardi,et al.  Performance evaluation of pure-motion tasks for mobile robots with respect to world models , 2009, Auton. Robots.

[11]  Lydia E. Kavraki,et al.  Benchmarking Motion Planning Algorithms: An Extensible Infrastructure for Analysis and Visualization , 2014, IEEE Robotics & Automation Magazine.

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

[13]  Kostas E. Bekris,et al.  Sparse Roadmap Spanners , 2012, WAFR.

[14]  A. Astolfl,et al.  Exponential Stabilization of a Wheeled Mobile Robot Via Discontinuous Control , 2007 .

[15]  Wolfram Burgard,et al.  An Experimental Protocol for Benchmarking Robotic Indoor Navigation , 2014, ISER.

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

[17]  Lydia E. Kavraki,et al.  The Open Motion Planning Library , 2012, IEEE Robotics & Automation Magazine.

[18]  Ross A. Knepper,et al.  Differentially constrained mobile robot motion planning in state lattices , 2009, J. Field Robotics.

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

[20]  Kostas E. Bekris,et al.  Improving sparse roadmap spanners , 2013, 2013 IEEE International Conference on Robotics and Automation.

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

[22]  Stephen Balakirsky,et al.  Single-query, Bi-directional, Lazy roadmap planner applied to car-like robots , 2010, 2010 IEEE International Conference on Robotics and Automation.

[23]  Emilio Frazzoli,et al.  A Survey of Motion Planning and Control Techniques for Self-Driving Urban Vehicles , 2016, IEEE Transactions on Intelligent Vehicles.

[24]  I. Rañó Steps Towards the Automatic Evaluation of Robot Obstacle Avoidance Algorithms , 2006 .

[25]  Sebastian Thrun,et al.  ARA*: Anytime A* with Provable Bounds on Sub-Optimality , 2003, NIPS.

[26]  Gaurav S. Sukhatme,et al.  Gradient-Informed Path Smoothing for Wheeled Mobile Robots , 2018, 2018 IEEE International Conference on Robotics and Automation (ICRA).

[27]  Kai Oliver Arras,et al.  A novel RRT extend function for efficient and smooth mobile robot motion planning , 2014, 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[28]  Kenneth Y. Goldberg,et al.  Anytime Nonparametric A , 2011, AAAI.

[29]  Panagiotis Tsiotras,et al.  Use of relaxation methods in sampling-based algorithms for optimal motion planning , 2013, 2013 IEEE International Conference on Robotics and Automation.

[30]  Lydia E. Kavraki,et al.  Fast Tree-Based Exploration of State Space for Robots with Dynamics , 2004, WAFR.

[31]  Thomas Schamm,et al.  Hybrid curvature steer: A novel extend function for sampling-based nonholonomic motion planning in tight environments , 2017, 2017 IEEE 20th International Conference on Intelligent Transportation Systems (ITSC).

[32]  Siddhartha S. Srinivasa,et al.  Informed Sampling for Asymptotically Optimal Path Planning , 2018, IEEE Transactions on Robotics.

[33]  Matthias Althoff,et al.  CommonRoad: Composable benchmarks for motion planning on roads , 2017, 2017 IEEE Intelligent Vehicles Symposium (IV).

[34]  Rajeev Motwani,et al.  Path planning in expansive configuration spaces , 1997, Proceedings of International Conference on Robotics and Automation.

[35]  Steven M. LaValle,et al.  Randomized Kinodynamic Planning , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[36]  Marco Pavone,et al.  Deterministic sampling-based motion planning: Optimality, complexity, and performance , 2015, ISRR.

[37]  Michael Meurer,et al.  Dispertio: Optimal Sampling For Safe Deterministic Motion Planning , 2020, IEEE Robotics and Automation Letters.

[38]  Sachin Chitta,et al.  A generic infrastructure for benchmarking motion planners , 2012, 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[39]  Maxim Likhachev,et al.  Dynamic Multi-Heuristic A* , 2015, 2015 IEEE International Conference on Robotics and Automation (ICRA).

[40]  Thierry Fraichard,et al.  From Reeds and Shepp's to continuous-curvature paths , 1999, IEEE Transactions on Robotics.

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

[42]  Kris K. Hauser,et al.  An empirical study of optimal motion planning , 2014, 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[43]  Steven M. LaValle,et al.  Deterministic sampling methods for spheres and SO(3) , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[44]  Simha Sethumadhavan,et al.  RoboBench: Towards sustainable robotics system benchmarking , 2016, 2016 IEEE International Conference on Robotics and Automation (ICRA).

[45]  Kostas E. Bekris,et al.  Asymptotically optimal sampling-based kinodynamic planning , 2014, Int. J. Robotics Res..