A Random Sampling Scheme for Path Planning
- 1 January 1996
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Exact robot navigation by means of potential functions: Some topological considerationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Randomized AlgorithmsPublished by Cambridge University Press (CUP) ,1995
- Approximate range searchingPublished by Association for Computing Machinery (ACM) ,1995
- Randomized Query Processing in Robot Motion Planning.Published by Defense Technical Information Center (DTIC) ,1994
- Planning motions with intentionsPublished by Association for Computing Machinery (ACM) ,1994
- Numerical potential field techniques for robot path planningIEEE Transactions on Systems, Man, and Cybernetics, 1992
- Robot Motion Planning: A Distributed Representation ApproachThe International Journal of Robotics Research, 1991
- A fast procedure for computing the distance between complex objects in three-dimensional spaceIEEE Journal on Robotics and Automation, 1988
- Reducing Multiple Object Motion Planning to Graph SearchingSIAM Journal on Computing, 1986
- On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE- Hardness of the "Warehouseman's Problem"The International Journal of Robotics Research, 1984