Planning a time-minimal motion among moving obstacles
暂无分享,去创建一个
[1] S. Sitharama Iyengar,et al. Robot navigation in unknown terrains using learned visibility graphs. Part I: The disjoint convex obstacle case , 1987, IEEE Journal on Robotics and Automation.
[2] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[3] Hanan Samet,et al. Accessibility: a new approach to path planning among moving obstacles , 1988, Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition.
[4] Sue Whitesides,et al. Computational Geometry and Motion Planning , 1985 .
[5] Leonidas J. Guibas,et al. Visibility of disjoint polygons , 2005, Algorithmica.
[6] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[7] Tomás Lozano-Pérez,et al. An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.
[8] Micha Sharir,et al. Motion Planning in the Presence of Moving Obstacles , 1985, FOCS.
[9] David M. Mount,et al. An Output Sensitive Algorithm for Computing Visibility Graphs , 1987, FOCS.
[10] John F. Canny,et al. New lower bound techniques for robot motion planning problems , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[11] S. N. Maheshwari,et al. Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles , 1988, SCG '88.
[12] Emo WELZL,et al. Constructing the Visibility Graph for n-Line Segments in O(n²) Time , 1985, Inf. Process. Lett..
[13] S. Zucker,et al. Toward Efficient Trajectory Planning: The Path-Velocity Decomposition , 1986 .
[14] Chee Yap,et al. Algorithmic motion planning , 1987 .
[15] Tomás Lozano-Pérez,et al. On multiple moving objects , 2005, Algorithmica.