A Survey on Advances in the Theory of Computational Robotics
暂无分享,去创建一个
[1] Micha Sharir,et al. On shortest paths in polyhedral spaces , 1986, STOC '84.
[2] Micha Sharir,et al. Motion planning in the presence of moving obstacles , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[3] J. Reif,et al. Shortest Paths in Euclidean Space with Polyhedral Obstacles. , 1985 .
[4] J. Schwartz,et al. On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE- Hardness of the "Warehouseman's Problem" , 1984 .
[5] John H. Reif,et al. The complexity of elementary algebra and geometry , 1984, STOC '84.
[6] Paul G. Spirakis,et al. Strong NP-Hardness of Moving Many Discs , 1984, Inf. Process. Lett..
[7] Micha Sharir,et al. Retraction: A new approach to motion-planning , 1983, STOC.
[8] J. Schwartz,et al. On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .
[9] J. Schwartz,et al. On the Piano Movers' Problem: III. Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal Barriers , 1983 .
[10] J. Schwartz,et al. On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers , 1983 .
[11] Bernard Chazelle,et al. A theorem on polygon cutting with applications , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[12] John E. Hopcroft,et al. On the movement of robot arms in 2-dimensional bounded regions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[13] Christos H. Papadimitriou,et al. Symmetric Space-Bounded Computation , 1982, Theor. Comput. Sci..
[14] Tomás Lozano-Pérez,et al. An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.
[15] Walter J. Savitch,et al. Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..
[16] Nils J. Nilsson,et al. A mobius automation: an application of artificial intelligence techniques , 1969, IJCAI 1969.
[17] Paul G. Comba,et al. A Procedure for Detecting Intersections of Three-Dimensional Objects , 1968, JACM.
[18] J. T. Shwartz,et al. On the Piano Movers' Problem : III , 1983 .
[19] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[20] S. M. Udupa,et al. Collision Detection and Avoidance in Computer Controlled Manipulators , 1977, IJCAI.
[21] George E. Collins,et al. Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .
[22] Richard Paul Collins Paul,et al. Modelling, trajectory calculation and servoing of a computer controlled arm , 1972 .