Adaptive Sampling-Based Motion Planning for Mobile Robots with Differential Constraints

This paper presents a sampling-based motion planner geared towards mobile robots with differential constraints. The planner conducts the search for a trajectory to the goal region by using sampling to expand a tree of collision-free and dynamically-feasible motions. To guide the tree expansion, a workspace decomposition is used to partition the motion tree into groups. Priority is given to tree expansions from groups that are close to the goal according to the shortest-path distances in the workspace decomposition. To counterbalance the greediness of the shortest-path heuristic, when the planner fails to expand the tree from one region to the next, the costs of the corresponding edges in the workspace decomposition are increased. Such cost increases enable the planner to quickly discover alternative routes to the goal when progress along the current route becomes difficult or impossible. Comparisons to related work show significant speedups.

[1]  S. LaValle,et al.  Randomized Kinodynamic Planning , 2001 .

[2]  Lydia E. Kavraki,et al.  Impact of workspace decompositions on discrete search leading continuous exploration (DSLX) motion planning , 2008, 2008 IEEE International Conference on Robotics and Automation.

[3]  Steven M. LaValle,et al.  Motion Planning : The Essentials , 2011 .

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

[5]  Kenneth Y. Goldberg,et al.  Motion Planning in Medicine: Optimization and Simulation Algorithms for Image-Guided Procedures , 2008, Springer Tracts in Advanced Robotics.

[6]  Erion Plaku,et al.  Guiding sampling-based tree search for motion planning with dynamics via probabilistic roadmap abstractions , 2014, 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[7]  Gregory S. Chirikjian,et al.  Algorithmic Foundation of Robotics VIII, Selected Contributions of the Eight International Workshop on the Algorithmic Foundations of Robotics, WAFR 2008, Guanajuato, Mexico, December 7-9, 2008 , 2009, WAFR.

[8]  Didier Devaurs,et al.  Enhancing the transition-based RRT to deal with complex cost spaces , 2013, 2013 IEEE International Conference on Robotics and Automation.

[9]  Jean-Paul Laumond,et al.  Control of Probabilistic Diffusion in Motion Planning , 2008, WAFR.

[10]  Dinesh Manocha,et al.  Fast Proximity Queries with Swept Sphere Volumes , 1999 .

[11]  Libor Preucil,et al.  European Robotics Symposium 2008 , 2008 .

[12]  Dinesh Manocha,et al.  Fast distance queries with rectangular swept sphere volumes , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[13]  Jonathan Richard Shewchuk,et al.  Delaunay refinement algorithms for triangular mesh generation , 2002, Comput. Geom..

[14]  Sergey Brin,et al.  Near Neighbor Search in Large Metric Spaces , 1995, VLDB.

[15]  Karl Johan Åström,et al.  PID Controllers: Theory, Design, and Tuning , 1995 .

[16]  Erion Plaku,et al.  Robot Motion Planning with Dynamics as Hybrid Search , 2013, AAAI.

[17]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

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

[19]  Howie Choset,et al.  Principles of Robot Motion: Theory, Algorithms, and Implementation ERRATA!!!! 1 , 2007 .

[20]  Lydia E. Kavraki,et al.  A Sampling-Based Tree Planner for Systems With Complex Dynamics , 2012, IEEE Transactions on Robotics.

[21]  Steven M. LaValle,et al.  Motion Planning Part I: The Essentials , 2011 .

[22]  Jean-Claude Latombe,et al.  Randomized Kinodynamic Motion Planning with Moving Obstacles , 2002, Int. J. Robotics Res..

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

[24]  Lydia E. Kavraki,et al.  Motion Planning With Dynamics by a Synergistic Combination of Layers of Planning , 2010, IEEE Transactions on Robotics.