On the complexity of reachability and motion planning questions (extended abstract)
暂无分享,去创建一个
Deborah A. Joseph | W. Harry Plantinga | Brooks | D. Joseph | W. Harry Plantinga | H. lozano-Perez | Wesley | Reif | Schwartz
[1] J. Schwartz,et al. On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .
[2] Tomás Lozano-Pérez,et al. An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.
[3] John E. Hopcroft,et al. Movement Problems for 2-Dimensional Linkages , 1984, SIAM J. Comput..
[4] 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).
[5] J. Schwartz,et al. On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE- Hardness of the "Warehouseman's Problem" , 1984 .
[6] E. J.,et al. ON THE COMPLEXITY OF MOTION PLANNING FOR MULTIPLE INDEPENDENT OBJECTS ; PSPACE HARDNESS OF THE " WAREHOUSEMAN ' S PROBLEM " . * * ) , 2022 .
[7] William E. Howden,et al. The sofa problem , 1968, Comput. J..
[8] John H. Reif,et al. Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[9] R. Brooks. Planning Collision- Free Motions for Pick-and-Place Operations , 1983 .