Motion planning in the presence of movable obstacles

Proceedings of the 4th Annual Symposium on Computational Geometry, SCG 1988

Volumn , Issue , 1988, Pages 279-288

  Wilfong, Gordon ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY;

COLLISION-FREE; MOTION PLANNING ALGORITHMS; MOTION PLANNING PROBLEMS; NP-HARD; POLYGONAL ENVIRONMENT; PREPROCESSING TIME; QUERY TIME; STATIC ENVIRONMENT;

MOTION PLANNING;

EID: 84914171893     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/73393.73422     Document Type: Conference Paper

References (19)

1. Akman, V. Unobstructed Shortest Paths in Polyhedral Environments. Springer-Verlag Lecture Notes in Computer Science 251 (1987).
2. Aronov, B., Fortune, S., and Wilfong, G. Minimum Speed Motions. 1987.
3. Canny, J. A New Algebraic Method for Robot Motion Planning and Real Geometry. In Proc. 28th IEEE FOCS, 1987, pp. 39-48.
4. Fortune, S. and Wilfong, G. Planning Constrained Motion. In Proc. 20th ACM STOC, 1988.
5. Fortune, S., Wilfong, G., and Yap, C. Coordinated Motion of Two Robot Arms. In Proc. IEEE Int. Conf. Robotics and Automation, 1986, pp. 1216-1223.
6. Garey, M. and Johnson, D. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., 1979.
7. Hopcroft, J., Schwartz, J., and Shark, M. On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE Hardness of the "warehouseman's problem". Int. J. Robotics Research 3, 4 (1984), 76-88.
8. Kant, K. and Zucker, S. Toward Efficient Trajectory Planning: The Path-Velocity Decomposition. Int. J. Robotics Research 5, 3 (1986), 72-89.
9. Kedem, K. and Sharir, M. An Efficient Algorithm for Planning Collision-free Translational Motion of a Convex Polygonal Object in 2-dimensional Space Amidst Polygonal Obstacles. In Proc. Symp. Computational Geometry, 1985, pp. 75-80.
10. Kirkpatrick, D. Optimal Search in Planar Subdivisions. SIAM J. Comput. 12, 1 (1983), 28-35.
11. Lozano-Perez, T. and Wesley, M. An Algorithm for Planning Collision-free Paths Among Polyhedral Obstacles. CACM 22, 10 (1979), 560-570.
12. Lumelsky, V. and Stepanov, A. Path-Planning Strategies for a Point Mobile Automaton Moving Amidst Unknown Obstacles of Arbitrary Shape. Algorithmica 2, 4 (1987), 403-430.
13. O'Dunlaing, C. Motion Planning With Inertial Constraints. Algorithmica 2, 4 (1987), 431-475.
14. O'Dunlaing, C. and Yap, C. A "Retraction" Method for Planning the Motion of a Disc. J. of Algorithms 6 (1985), 104-111.
15. Reif, J. and Sharir, M. Motion Planning in the Presence of Moving Obstacles. In Proc. 25th IEEE FOCS, 1985, pp. 144-154.
16. Sarnak, N. and Tarjan, R. Planar Point Location Using Persistent Search Trees. CACM 29, 7 (1986), 669-679.
17. Schwartz, J. and Sharir, M. On the Piano Movers' Problem: II. General Techniques for Computing Topological Properties of Real Algebraic Manifolds. Adv. Appl. Math. 4 (1983), 298-351.
18. Sedgewick, R. Algorithms. Addison-Wesley, 1983.
19. Yap, C. Algorithmic Motion Planning. In Advances in Robotics, Volume 1: Algorithmic and Geometric Aspects, J. Schwartz and C. Yap, Eds. Lawrence Erlbaum Assoc, Hillsdale NJ, 1986.