SANDROS: a motion planner with performance proportional to task difficulty
暂无分享,去创建一个
[1] B. Faverjon,et al. A local based approach for path planning of manipulators with a high number of degrees of freedom , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.
[2] J. Schwartz,et al. On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers , 1983 .
[3] B. Donald. Motion Planning with Six Degrees of Freedom , 1984 .
[4] John H. Reif,et al. Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[5] Brad E. Paden,et al. Path planning using a Jacobian-based freespace generation algorithm , 1989, Proceedings, 1989 International Conference on Robotics and Automation.
[6] Wyatt S. Newman,et al. Rapid computation of configuration space obstacles , 1990, Proceedings., IEEE International Conference on Robotics and Automation.
[7] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[8] Jean-Claude Latombe,et al. A Monte-Carlo algorithm for path planning with many degrees of freedom , 1990, Proceedings., IEEE International Conference on Robotics and Automation.
[9] Lawrence W. Stark,et al. A supervisory telerobotic control system using model-based vision feedback , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.
[10] Tsutomu Hasegawa,et al. Collision avoidance: divide-and-conquer approach by space characterization and intermediate goals , 1988, IEEE Trans. Syst. Man Cybern..
[11] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[12] S. Sathiya Keerthi,et al. A fast procedure for computing the distance between complex objects in three-dimensional space , 1988, IEEE J. Robotics Autom..
[13] John Canny,et al. The complexity of robot motion planning , 1988 .