2Kavraki L E, Svestka P, Latombe J-C, et al. Probabilistic roadmaps for path planning in high-dimensional configuration spaces[J]. IEEE Trans on Robotics and Automation, 1996, 12(4): 566-580.
3Bohlin R, Kavraki L E. Path planning using lazy PRM[C]. Proc of IEEE Int Conf on Robotics and Automation. San Francisco, 2000:521-528.
4Hart L, Amato N M. A kinematics-based probabilistic roadmap method for closed chain systems[C]. Algorithmic and Computational Robotics: New Directions. Wellesley: A K Petters, 2001: 233-246.
5Yang Y, Brock O. Adapting the sampling distribution in PRM planners based on an approximated medial axis[C]. Proc of IEEE Int Conf on Robotics and Automation. New Orleans, 2004: 4405-4410.
6LaValle S M. Planning algorithms[M]. Cambridge: Cambridge University Press, 2006.
7Barraquand J, Kavraki L E, Latombe J-C, et al. A random sampling scheme for path planning[J]. Int J of Robotics Research, 1997, 16(6): 759-774.
8Hsu D, Latombe J-C, Motwani R. Path planning in expansive configuration spaces[J]. Int J of Computatational Geometry & Applications, 1999, 9(4/5): 495-512.
9Nissoux C, Simeon T, Laumond J-P. Visibility-based probabilistic roadmaps[C]. Proc of IEEE/RSJ Int Conf on Intelligent Robots and Systems. Kyongju, 1999: 1316- 1321.
10Boor V, Overmars M H, van der Stappen A E The Gaussian sampling strategy for probabilistic roadmap planners[C]. Proc of IEEE Int Conf on Robotics and Automation. Detroit, 1999: 1018-1023.
