1. I. Althöfer, G. Das, D. Dobkin, D. Joseph, J. Soares, On sparse spanners of weighted graphs. Discrete Comput. Geom. 9(1), 81–100 (1993)
2. N.M. Amato, O.B. Bayazit, L.K. Dale, C. Jones, D. Vallejo, OBPRM: an obstacle-based PRM for 3D workspaces, in Workshop on the Algorithmic Foundations of Robotics (WAFR) (1998), pp. 155–168
3. S. Baswana, S. Sen, A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs. Random Struct. Algorithms 30(4), 532–563 (2007)
4. K. Bekris, L. Kavraki, Informed and probabilistically complete search for motion planning under differential constraints, in First International Symposium on Search Techniques in Artificial Intelligence and Robotics (STAIR) (Chicago, IL, 2008)
5. R. Bohlin, L. Kavraki, Path planning using lazy PRM, in IEEE International Conference on Robotics and Automation (ICRA), vol. 1 (San Francisco, CA, 2000), pp. 521–528