An efficient algorithm for finding a collision-free path among polyhedral obstacles
暂无分享,去创建一个
[1] Micha Sharir,et al. On Shortest Paths in Polyhedral Spaces , 1986, SIAM J. Comput..
[2] Tomás Lozano-Pérez,et al. An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.
[3] Chanderjit L. Bajaj,et al. An efficient parallel solution for Euclidean shortest path in three dimensions , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.
[4] John F. Canny,et al. A Voronoi method for the piano-movers problem , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.
[5] Nils J. Nilsson,et al. A mobius automation: an application of artificial intelligence techniques , 1969, IJCAI 1969.
[6] Charles E. Thorpe,et al. Path Relaxation: Path Planning for a Mobile Robot , 1984, AAAI.
[7] Rodney A. Brooks,et al. Solving the Find-Path Problem by Good Representation of Free Space , 1983, Autonomous Robot Vehicles.
[8] Alex Meystel,et al. Navigation algorithm for a nested hierarchical system of robot path planning among polyhedral obstacles , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.
[9] Emo WELZL,et al. Constructing the Visibility Graph for n-Line Segments in O(n²) Time , 1985, Inf. Process. Lett..
[10] Tomás Lozano-Pérez,et al. Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.