Randomized Query Processing in Robot Path Planning
Open Access
- 31 August 1998
- journal article
- Published by Elsevier BV in Journal of Computer and System Sciences
- Vol. 57 (1), 50-60
- https://doi.org/10.1006/jcss.1998.1578
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Motion planning with many degrees of freedom-random reflections at C-space obstaclesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Path planning in expansive configuration spacesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- 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
- New lower bound techniques for robot motion planning problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Reducing Multiple Object Motion Planning to Graph SearchingSIAM Journal on Computing, 1986
- On the Movement of Robot Arms in 2-Dimensional Bounded RegionsSIAM Journal on Computing, 1985
- On the complexity of reachability and motion planning questions (extended abstract)Published by Association for Computing Machinery (ACM) ,1985
- On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE- Hardness of the "Warehouseman's Problem"The International Journal of Robotics Research, 1984
- Movement Problems for 2-Dimensional LinkagesSIAM Journal on Computing, 1984