1. Agarwal, P.: Compact Representations for Shortest-Path Queries. Appeared at the IROS 2012 Workshop on Progress and Open Problems in Motion Planning (2011)
2. Amato, N.M., Bayazit, O.B., Dale, L.K., Jones, C., Vallejo, D.: OBPRM: An Obstacle-based PRM for 3D Workspaces. In: WAFR, pp. 155–168 (1998)
3. Baswana, S., Sen, S.: A Simple and Linear Time Randomized Algorithm for Computing Spanners in Weighted Graphs. Random Structures and Algorithms 30(4), 532–563 (2007)
4. Geraerts, R., Overmars, M.H.: Creating High-Quality Roadmaps for Motion Planning in Virtual Environments. In: IROS, Beijing, China, pp. 4355–4361 (2006)
5. Hsu, D., Kavraki, L., Latombe, J.C., Motwani, R., Sorkin, S.: On Finding Narrow Passages with Probabilistic Roadmap Planners. In: WAFR, Houston, TX (1998)