Multiresolution approach for motion planning under differential constraints

In this paper, we present an incremental, multiresolution motion planning algorithm designed for systems with differential constraints. Planning for these systems is more difficult than ordinary path planning due to the presence of momentum (drift) or nonholonomic velocity constraints. Given a motion planning problem for such a system and that a solution to the problem exists, then a finite reachability graph containing a solution trajectory is guaranteed to exist, under very reasonable conditions. In general, this graph can be generated using sufficiently dense input space sampling, sufficiently small time step, and sufficiently large tree depth. We show how to find and search such a tree in an incremental, multiresolution way. We prove the completeness of our algorithm, discuss related practical concerns, and show experimental results for several systems

[1]  Steven M. LaValle,et al.  Resolution complete rapidly-exploring random trees , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[2]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

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

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

[5]  Mark H. Overmars,et al.  Multilevel Path Planning for Nonholonomic Robots Using Semiholonomic Subsystems , 1998, Int. J. Robotics Res..

[6]  Jean-Claude Latombe,et al.  Nonholonomic multibody mobile robots: Controllability and motion planning in the presence of obstacles , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[7]  Kevin M. Lynch,et al.  Kinematic controllability for decoupled trajectory planning in underactuated mechanical systems , 2001, IEEE Trans. Robotics Autom..

[8]  Steven M. LaValle,et al.  Incremental Grid Sampling Strategies in Robotics , 2004, WAFR.

[9]  Steven M. LaValle,et al.  Rapidly-Exploring Random Trees: Progress and Prospects , 2000 .

[10]  Steven M. LaValle,et al.  Incrementally reducing dispersion by increasing Voronoi bias in RRTs , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[11]  Jean-Paul Laumond,et al.  Feasible Trajectories for Mobile Robots with Kinematic and Environment Constraints , 1986, IAS.

[12]  Pierre Ferbach,et al.  A method of progressive constraints for nonholonomic motion planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

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

[14]  John H. Reif,et al.  Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[15]  Emilio Frazzoli,et al.  Incremental Search Methods for Reachability Analysis of Continuous and Hybrid Systems , 2004, HSCC.

[16]  E. Feron,et al.  Real-time motion planning for agile autonomous vehicles , 2000, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).

[17]  Oliver Brock,et al.  Sampling-Based Motion Planning Using Predictive Models , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[18]  S. LaValle,et al.  Resolution completeness for sampling-based motion planning with difierential constraints , 2022 .

[19]  Oliver Brock,et al.  Information theoretic construction of probabilistic roadmaps , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[20]  Munther A. Dahleh,et al.  Maneuver-based motion planning for nonlinear systems with symmetries , 2005, IEEE Transactions on Robotics.