3-dimensional shortest paths in the presence of polyhedral obstacles
- 23 November 2005
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- New lower bound techniques for robot motion planning problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- An efficient algorithm for planning collision-free translational motion of a convex polygonal object in 2-dimensional space amidst polygonal obstaclesPublished by Association for Computing Machinery (ACM) ,1985
- On the complexity of reachability and motion planning questions (extended abstract)Published by Association for Computing Machinery (ACM) ,1985
- An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers (extended abstract)Published by Association for Computing Machinery (ACM) ,1985
- The complexity of elementary algebra and geometryPublished by Association for Computing Machinery (ACM) ,1984
- On shortest paths in polyhedral spacesPublished by Association for Computing Machinery (ACM) ,1984
- RetractionPublished by Association for Computing Machinery (ACM) ,1983
- On the movement of robot arms in 2-dimensional bounded regionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979