Bench-MR: A Motion Planning Benchmark for Wheeled Mobile Robots

Planning smooth and energy-efficient paths for wheeled mobile robots is a central task for applications ranging from autonomous driving to service and intralogistic robotics. Over the past decades, several sampling-based motion-planning algorithms, extend functions and post-smoothing algorithms have been introduced for such motion-planning systems. Choosing the best combination of components for an application is a tedious exercise, even for expert users. We therefore present Bench-MR, the first open-source motion-planning benchmarking framework designed for sampling-based motion planning for nonholonomic, wheeled mobile robots. Unlike related software suites, Bench-MR is an easy-to-use and comprehensive benchmarking framework that provides a large variety of sampling-based motion-planning algorithms, extend functions, collision checkers, post-smoothing algorithms and optimization criteria. It aids practitioners and researchers in designing, testing, and evaluating motion-planning systems, and comparing them against the state of the art on complex navigation scenarios through many performance metrics. Through several experiments, we demonstrate how Bench-MR can be used to gain extensive insights from the benchmarking results it generates.

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

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

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

[4]  Lydia E. Kavraki,et al.  Resolution Independent Density Estimation for motion planning in high-dimensional spaces , 2013, 2013 IEEE International Conference on Robotics and Automation.

[5]  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.

[6]  Nikolaus Correll,et al.  C-FOREST: Parallel Shortest Path Planning With Superlinear Speedup , 2013, IEEE Transactions on Robotics.

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

[8]  Riku Murai,et al.  PathBench: A Benchmarking Platform for Classical and Learned Path Planning Algorithms , 2021, 2021 18th Conference on Robots and Vision (CRV).

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

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

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

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

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

[14]  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.

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

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

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

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

[19]  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).

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

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

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

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

[24]  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.

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

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

[27]  Steven M. LaValle,et al.  On the Relationship between Classical Grid Search and Probabilistic Roadmaps , 2004, Int. J. Robotics Res..

[28]  Jean-Claude Latombe,et al.  A Single-Query Bi-Directional Probabilistic Roadmap Planner with Lazy Collision Checking , 2001, ISRR.

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

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

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

[32]  Cyrill Stachniss,et al.  On measuring the accuracy of SLAM algorithms , 2009, Auton. Robots.

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

[34]  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).

[35]  Mike Stilman,et al.  Kinodynamic RRTs with Fixed Time Step and Best-Input Extension Are Not Probabilistically Complete , 2014, WAFR.

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

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

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

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

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

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

[42]  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).

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

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

[45]  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).