Time-minimal paths amidst moving obstacles in three dimensions
暂无分享,去创建一个
[1] Christos H. Papadimitriou,et al. An Algorithm for Shortest-Path Motion in Three Dimensions , 1985, Inf. Process. Lett..
[2] Joseph S. B. Mitchell,et al. The Discrete Geodesic Problem , 1987, SIAM J. Comput..
[3] John Canny,et al. The complexity of robot motion planning , 1988 .
[4] Jean-Claude Latombe,et al. Motion planning in the presence of moving obstacles , 1992 .
[5] David M. Mount,et al. The Number of Shortest Paths on the Surface of a Polyhedron , 1990, SIAM J. Comput..
[6] R. Kimmel,et al. Finding shortest paths on surfaces , 1994 .
[7] S. Zucker,et al. Toward Efficient Trajectory Planning: The Path-Velocity Decomposition , 1986 .
[8] Alfred M. Bruckstein,et al. Using multi-layer distance maps for motion planning on surfaces with moving obstacles , 1994, Proceedings of 12th International Conference on Pattern Recognition.
[9] Micha Sharir,et al. Approximating shortest paths on a convex polytope in three dimensions , 1997, JACM.
[10] S. Arimoto,et al. Path Planning Using a Tangent Graph for Mobile Robots Among Polygonal and Curved Obstacles , 1992 .
[11] Ioannis G. Tollis,et al. Path planning in the presence of vertical obstacles , 1990, IEEE Trans. Robotics Autom..
[12] Ren C. Luo,et al. Motion planning for mobile robots in a dynamic environment with moving obstacles , 1990, Proceedings., IEEE International Conference on Robotics and Automation.
[13] Kikuo Fujimura,et al. Motion Planning Amid Transient Obstacles , 1994, Int. J. Robotics Res..
[14] James A. Storer,et al. A single-exponential upper bound for finding shortest paths in three dimensions , 1994, JACM.
[15] Micha Sharir,et al. On Shortest Paths in Polyhedral Spaces , 1986, SIAM J. Comput..
[16] Christian Laugier,et al. Path-velocity decomposition revisited and applied to dynamic trajectory planning , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.