论文信息 - Complexity of the mover's problem and generalizations - 字舞流文

Complexity of the mover's problem and generalizations

This paper concerns the problem of moving a polyhedron through Euclidean space while avoiding polyhedral obstacles.

John H. Reif | J. Reif

[1] Paul G. Comba,et al. A Procedure for Detecting Intersections of Three-Dimensional Objects , 1968, JACM.

[2] Nils J. Nilsson,et al. A mobius automation: an application of artificial intelligence techniques , 1969, IJCAI 1969.

[3] Nils J. Nilsson,et al. A Mobile Automaton: An Application of Artificial Intelligence Techniques , 1969, IJCAI.

[4] Walter J. Savitch,et al. Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[5] Richard Paul Collins Paul,et al. Modelling, trajectory calculation and servoing of a computer controlled arm , 1972 .

[6] S. M. Udupa,et al. Collision Detection and Avoidance in Computer Controlled Manipulators , 1977, IJCAI.

[7] Richard Paul,et al. Robots, Models, and Automation , 1979, Computer.

[8] Tomás Lozano-Pérez,et al. An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[9] Kenneth Jay Supowit,et al. Topics in Computational Geometry , 1981 .