3-dimensional shortest paths in the presence of polyhedral obstacles

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 324 LNCS, Issue , 1988, Pages 85-92

  Reif, John H ^a   Storer, James A ^b  

^a DUKE UNIVERSITY   (United States)

^b BRANDEIS UNIVERSITY   (United States)

Author keywords

Euclidean space; Minimal movement problem; Mover s problem; Quadratic curves; Robotics motion planning; Shortest path; Theory of real closed fields; Voronoi diagram

Indexed keywords

GEOMETRY; GRAPH THEORY; MOTION PLANNING;

EUCLIDEAN SPACES; MINIMAL MOVEMENT PROBLEM; QUADRATIC CURVES; REAL CLOSED FIELDS; ROBOTICS MOTION PLANNING; SHORTEST PATH; VORONOI DIAGRAMS;

ROBOT PROGRAMMING;

EID: 85029524999     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0017133     Document Type: Conference Paper

References (24)

1. C. Bajaj [1984]. "Reducibility among Geometrie Location-Allocation Optimization Problems", Technical Report TR84-607, Computer Science Dept., Cornell University, Ithaca, NY.
2. M. Ben-Or, D. Kozen, and J. Reif [1984]. "The Complexity of Elementary Algebra and Geometry", Proceedings 16th ACM Symposium on the Theory of Computing, Washington, DC, 457-464.
3. J. Canny and J. H. Reif [1987]. "New Lower Bounds for Robot Motion Planning Problems", Proceedings 28th Annual IEEE Symposium on the Foundations of Computer Science, Los Angeles, CA, 49-60.
4. A. L. Chistov and D. Yu. Grigor’ev [1985]. "Complexity of Quantifier Elimination in the Theory of Algebraically Closed Fields", Technical Report, Institute of the Academy of Sciences, Leningrad, USSR.
5. G. E. Collins [1975]. "Quantifier Elimination for Real Closed Fields by Cylindric Algebraic Decomposition", Proceedings Second GI Conference on Automata Theory and Formal Languages, Springer-Verlag LNCS 35, Berlin, 134-183.
6. W. R. Franklin and V. Alemanf 19841. "Minimal Paths Between Two Points On/Around A Convex Polyhedron", Technical Report, Electrical, Computer, and Systems Engineering Dept., Rensselaer Polytechnic Institute, Troy, NY.
7. W. R. Franklin, V. Akman, and C. Verrilli [1984], "Voronoi Diagrams with Barriers and on Polyhedra", Technical Report, Electrical, Computer, and Systems Engineering Dept., Rensselaer Polytechnic Institute, Troy, NY.
8. J. E. Hopcroft, D. A. Joseph, and S. H. Whitesides [1982]. "On the Movement of Robot Arms in 2-Dimensional Bounded Regions", Proceedings 23rd IEEE Symposium on Foundations of Computer Science", Chicago, IL, 280-289.
9. J. E. Hopcroft, D. A. Joseph, and S. H. Whitesides [1982b]. "Movement Problems for 2-Dimensional Linkages", Technical Report TR82-515, Computer Science Dept., Cornell University, Ithaca, NY.
10. J. E. Hopcroft, D. A. Joseph, and S. H. Whitesides [1982c]. "Determining Points of a Circular Region Reachable by Joints of a Robot Arm", Technical Report TR82-516, Computer Science Dept., Cornell University, Ithaca, NY.
11. J. E. Hopcroft and G. Wilfong [1984]. "On the Motion of Objects in Contact", Technical Report TR84-802, Computer Science Dept., Cornell University, Ithaca, NY.
12. J. E. Hopcroft and G. Wilfong [1984b], "Reducing Multiple Object Motion Planning to Graph Searching", Technical Report TR84-616, Computer Science Dept., Cornell University, Ithaca, NY.
13. D. A. Joseph and W. H. Plantinga [1985]. "On the Complexity of Reachability and Motion Planning Questions", Proceedings First Annual Conference of Computational Geometry, Baltimore, MD, 62-66.
14. K. Kedem and M. Sharir [1985]. "An Efficient Algorithm for Planning CollisionFree Translational Motion of a Convex Polyhedral Object in 2Dimensional Space Admidst Polygonal Obstacles", Proceedings First Annual Conference of Computational Geometry, Baltimore, MD, 7580.
15. D. Leven and M. Sharir [1985]. "An Efficient and Simple Motion Planning Algorithm for a Ladder Moving in Two-Dimensional Space Admidst Polygonal Barriers", Proceedings First Annual Conference of Computational Geometry, Baltimore, MD, 221-227.
16. T. Lozano-Perez [1980]. "Automatic Planning of Manipulation Transfer Movements", AI Memo 606, Artificial Intelligence Laboratory, MIT, Cambridge, MA.
17. T. Lozano-Perez and M. A. Wesley [1979]. "An Algorithm for Planning CollisionFree Paths among Polyhedral Obstacles", CACM22:10, 560-570.
18. C. O’Dunlaing, M. Sharir, and C. K. Yap [1983]. "Retraction: A New Approach to Motion Planning", Proceedings 15th ACM Symposium on the Theory of Computing, Boston, MA, 207-220.
19. J. O’Rourke, S. Suri, and H. Booth [1984]. "Shortest Paths on Polyhedral Surfaces", Technical Report, Dept, of Electrical Engineering and Computer Science, Johns Hopkins University.
20. C. H. Papadimitriou [1984]. "An Algorithm for Shortest Path Motion in Three Dimensions", Technical Report, Stanford University.
21. J. Reif [1979]. "Complexity of the Mover’s Problem", Proceedings 20th IEEE Symposium on Foundations of Computer Science”, San Juan, Puerto Rico, 421-427; also to appear in Planning, Geometry, and the Complexity of Robot Planning, ed. by J. Schwartz.
22. J. T. Schwartz and M. Sharir [1981]. "On the Piano Movers Problem 1: The Case of a 2-Dimensional Rigid Polygonal Body Moving Amidst Barriers", Technical Report TR39, Computer Science Dept., New York University, NY.
23. J. T. Schwartz and M. Sharir [1982]. "On the Piano Movers Problem 2: General Techniques for Computing Topological Properties of Real Algebraic Manifolds", Technical Report TR41, Computer Science Dept., New York University, NY.
24. M. Sharir and A. Schorr [1984]. "On Shortest Paths in Polyhedral Spaces", Proceedings 16™ ACM Symposium on the Theory of Computing, Washington, DC, 144-153.