RAMP header logo
Demo Program



[1] E. Mazer, J.M. Ahuactzin, and P. Bessiere. The ariadne's clew algorithm. Journal of Artificial Intelligence Research, 9:295-316, 1998.

[2] S. LaValle and J. Kuffner. Rapidly-exploring random trees: Progress and prospects. Proc. Int. Workshop on the Algorithmic Foundations of Robotics, March 2000.

[3] J. Kuffner and S. LaValle. RRT-connect: An efficient approach to single-query path planning. In IEEE International Conference on Robotics and Automation, pages 995-1001, 2000.

[4] Kavraki, L, P. Svestka, J.C. Latombe, and M. Overmars. August 1994. ProbabilisticRoadmaps for Path Planning in High-Dimensional Configuration Spaces.Utrecht University, Utrecht, The Netherlands.

[5] R. Bohlin and L.E. Kavraki. Path planning using lazy PRM. In IEEE International Conference on Robotics and Automation, pages 521-528, 2000.

[6] Kamal Gupta. Practical global motion planning for many degrees of freedom: a novel approach within sequential framework. In Proceedings of IEEE International Conference on Robotics and Automation, p 2038-43, San Diego, CA, USA, 8-13 May 1994.

[7] P. C. Chen, Y. K. Hwang, SANDROS: A Dynamic Graph Search Algorithm for Motion Planning, IEEE Transactions on Robotics and Automation, Vol. 14, No. 3, June 1998, 390-403.

[8] A. Maciejewski and C. Klein. Obstacle avoidance for kinematically redundant manipulators in dynamically varying environments. International Journal of Robotics Research, 4:109-117, 1985.

[9] G. Oriolo, M. Ottavi, and M. Vendittelli. Probabilistic motion planning for redundant robots along given end-effector paths. In IEEE/RSJ International Conference on Intelligent Robots and Systems, pages 1657-1662, 2002.

[10] J. Ahuactzin and K. Gupta. The kinematic roadmap: A motion planning based global approach for inverse kinematics of redundant robots. IEEE Transactions on Robotics and Automation, 15:653-669, 1999.

[11] S. Lavalle, J. Yakey, and L. Kavraki. A probabilistic roadmap approach for systems with closed kinematic chains. In IEEE International Conference on Robotics and Automation, pages 1671-1676, 1999.

[12] L. Han and N. Amato. A kinematics-based probabilistic roadmap method for closed kinematic chains. In B. Donald, K. Lynch, and D. Rus, editors, Workshop on Algorithmic Foundations of Robotics, pages 233ĘC246, March 2000.

[13] Zhenwang Yao. Path planning with end-effector constraints. Master's thesis, School of Engineering Science, Simon Fraser University, 2004.

[14] http://www.cs.unc.edu/~geom/collide/index.shtml.

[15] http://www.win.tue.nl/~gino/solid/index.html.

Updated on May 10, 2007 by Zhenwang Yao .
SFU logo
RAMP Lab vertical logo