Motion planning with many degrees of freedom-random reflections at C-space obstacles
暂无分享,去创建一个
[1] Tomás Lozano-Pérez,et al. An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.
[2] Oussama Khatib,et al. Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1986 .
[3] S. Sathiya Keerthi,et al. A fast procedure for computing the distance between complex objects in three-dimensional space , 1988, IEEE J. Robotics Autom..
[4] Elmer G. Gilbert,et al. A new algorithm for detecting the collision of moving objects , 1989, Proceedings, 1989 International Conference on Robotics and Automation.
[5] Oussama Khatib,et al. Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Autonomous Robot Vehicles.
[6] J. Michael McCarthy,et al. Introduction to theoretical kinematics , 1990 .
[7] J. Michael McCarthy,et al. An algebraic formulation of configuration-space obstacles for spatial robots , 1990, Proceedings., IEEE International Conference on Robotics and Automation.
[8] Jean-Claude Latombe,et al. Robot motion planning , 1970, The Kluwer international series in engineering and computer science.
[9] Ming C. Lin,et al. A fast algorithm for incremental distance calculation , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.
[10] Thomas Horsch,et al. Local motion planning avoiding obstacles with dual quaternions , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.