Reducing the Collision Checking Time in Cluttered Environment for Sampling-Based Motion Planning
- 30 September 2020
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Adaptive Lazy Collision Checking for Optimal Sampling-based Motion PlanningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2018
- Fast probabilistic collision checking for sampling-based motion planning using locality-sensitive hashingThe International Journal of Robotics Research, 2016
- Lazy collision checking in asymptotically-optimal motion planningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2015
- A sampling algorithm for reducing the number of collision checking in probabilistic roadmapsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2014
- Efficient Collision Checking in Sampling-Based Motion PlanningSpringer Tracts in Advanced Robotics, 2013
- Planning AlgorithmsPublished by Cambridge University Press (CUP) ,2006
- Probabilistic roadmaps for path planning in high-dimensional configuration spacesIEEE Transactions on Robotics and Automation, 1996