Probabilistic motion planning for non-Euclidean and multi-vehicle problems
- 6 July 2023
- journal article
- research article
- Published by Elsevier in Robotics and Autonomous Systems
- Vol. 168
Abstract
No abstract availableKeywords
All Related Versions
This publication has 29 references indexed in Scilit:
- Fast marching tree: A fast marching sampling-based method for optimal motion planning in many dimensionsThe International Journal of Robotics Research, 2015
- Optimal sampling-based motion planning under differential constraints: The driftless case2015
- Subdimensional expansion for multirobot path planningArtificial Intelligence, 2015
- Sampling-Based Robot Motion Planning: A ReviewIEEE Access, 2014
- Capt: Concurrent assignment and planning of trajectories for multiple robotsThe International Journal of Robotics Research, 2014
- Sampling-based optimal motion planning for non-holonomic dynamical systems2013
- A Practical and Optimal Path Planning for Autonomous Parking Using Fast Marching Algorithm and Support Vector MachineIEICE Transactions on Information and Systems, 2013
- Sampling-based algorithms for optimal motion planningThe International Journal of Robotics Research, 2011
- Probabilistic roadmaps for path planning in high-dimensional configuration spacesIEEE Transactions on Robotics and Automation, 1996
- Optimal paths for a car that goes both forwards and backwardsPacific Journal of Mathematics, 1990