{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T15:29:48Z","timestamp":1771514988888,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642362781","type":"print"},{"value":"9783642362798","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36279-8_17","type":"book-chapter","created":{"date-parts":[[2013,2,14]],"date-time":"2013-02-14T09:26:18Z","timestamp":1360833978000},"page":"279-296","source":"Crossref","is-referenced-by-count":19,"title":["Sparse Roadmap Spanners"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Dobson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Athanasios","family":"Krontiris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kostas E.","family":"Bekris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Agarwal, P.: Compact Representations for Shortest-Path Queries. Appeared at the IROS 2012 Workshop on Progress and Open Problems in Motion Planning (2011)"},{"key":"17_CR2","unstructured":"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\u2013168 (1998)"},{"issue":"4","key":"17_CR3","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1002\/rsa.20130","volume":"30","author":"S. Baswana","year":"2007","unstructured":"Baswana, S., Sen, S.: A Simple and Linear Time Randomized Algorithm for Computing Spanners in Weighted Graphs. Random Structures and Algorithms\u00a030(4), 532\u2013563 (2007)","journal-title":"Random Structures and Algorithms"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Geraerts, R., Overmars, M.H.: Creating High-Quality Roadmaps for Motion Planning in Virtual Environments. In: IROS, Beijing, China, pp. 4355\u20134361 (2006)","DOI":"10.1109\/IROS.2006.282009"},{"key":"17_CR5","unstructured":"Hsu, D., Kavraki, L., Latombe, J.C., Motwani, R., Sorkin, S.: On Finding Narrow Passages with Probabilistic Roadmap Planners. In: WAFR, Houston, TX (1998)"},{"issue":"3","key":"17_CR6","first-page":"233","volume":"21","author":"D. Hsu","year":"2002","unstructured":"Hsu, D., Kindel, R., Latombe, J.C., Rock, S.: Randomized Kinodynamic Motion Planning with Moving Obstacles. IJRR\u00a021(3), 233\u2013255 (2002)","journal-title":"IJRR"},{"key":"17_CR7","series-title":"STAR","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-540-68405-3_2","volume-title":"Algotithmic Foundation Robotics VII","author":"L. Jaillet","year":"2008","unstructured":"Jaillet, L., Simeon, T.: Path Deformation Roadmaps. In: Akella, S., Amato, N.M., Huang, W.H., Mishra, B. (eds.) Algotithmic Foundation Robotics VII. STAR, vol.\u00a047, pp. 19\u201334. Springer, Heidelberg (2008)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Kallman, M., Mataric, M.: Motion Planning Using Dynamic Roadmaps. In: ICRA, New Orleands, LA, vol.\u00a05, pp. 4399\u20134404 (2004)","DOI":"10.1109\/ROBOT.2004.1302410"},{"issue":"7","key":"17_CR9","first-page":"846","volume":"30","author":"S. Karaman","year":"2011","unstructured":"Karaman, S., Frazzoli, E.: Sampling-based Algorithms for Optimal Motion Planning. IJRR\u00a030(7), 846\u2013894 (2011)","journal-title":"IJRR"},{"issue":"1","key":"17_CR10","first-page":"166","volume":"14","author":"L.E. Kavraki","year":"1998","unstructured":"Kavraki, L.E., Kolountzakis, M.N., Latombe, J.C.: Analysis of Probabilistic Roadmaps for Path Planning. IEEE TRA\u00a014(1), 166\u2013171 (1998)","journal-title":"IEEE TRA"},{"issue":"4","key":"17_CR11","first-page":"566","volume":"12","author":"L.E. Kavraki","year":"1996","unstructured":"Kavraki, L.E., Svestka, P., Latombe, J.C., Overmars, M.: Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces. IEEE TRA\u00a012(4), 566\u2013580 (1996)","journal-title":"IEEE TRA"},{"issue":"2","key":"17_CR12","first-page":"229","volume":"20","author":"A.M. Ladd","year":"2004","unstructured":"Ladd, A.M., Kavraki, L.E.: Measure Theoretic Analysis of Probabilistic Path Planning. IEEE TRA\u00a020(2), 229\u2013242 (2004)","journal-title":"IEEE TRA"},{"key":"17_CR13","first-page":"378","volume":"20","author":"S.M. LaValle","year":"2001","unstructured":"LaValle, S.M., Kuffner, J.J.: Randomized Kinodynamic Planning. IJRR\u00a020, 378\u2013400 (2001)","journal-title":"IJRR"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Li, Y., Bekris, K.E.: Learning Approximate Cost-to-Go Metrics to Improve Sampling-based Motion Planning. In: IEEE ICRA, Shanghai, China (2011)","DOI":"10.1109\/ICRA.2011.5980427"},{"key":"17_CR15","unstructured":"Marble, J.D., Bekris, K.E.: Asymptotically Near-Optimal is Good Enough for Motion Planning. In: ISRR, Flagstaff, AZ (2011)"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Marble, J.D., Bekris, K.E.: Towards Small Asymptotically Near-Optimal Roadmaps. In: IEEE ICRA, Minnesota, MN (2012)","DOI":"10.1109\/ICRA.2012.6225296"},{"key":"17_CR17","series-title":"STAR","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-642-17452-0_17","volume-title":"Algorithmic Foundations of Robotics IX","author":"O. Nechushtan","year":"2010","unstructured":"Nechushtan, O., Raveh, B., Halperin, D.: Sampling-Diagram Automata: A Tool for Analyzing Path Quality in Tree Planners. In: Hsu, D., Isler, V., Latombe, J.-C., Lin, M.C. (eds.) Algorithmic Foundations of Robotics IX. STAR, vol.\u00a068, pp. 285\u2013301. Springer, Heidelberg (2010)"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Nieuwenhuisen, D., Overmars, M.H.: Using Cycles in Probabilistic Roadmap Graphs. In: IEEE ICRA, pp. 446\u2013452 (2004)","DOI":"10.1109\/ROBOT.2004.1307190"},{"issue":"1","key":"17_CR19","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/jgt.3190130114","volume":"13","author":"D. Peleg","year":"1989","unstructured":"Peleg, D., Sch\u00e4ffer, A.: Graph Spanners. Journal of Graph Theory\u00a013(1), 99\u2013116 (1989)","journal-title":"Journal of Graph Theory"},{"issue":"2","key":"17_CR20","first-page":"365","volume":"27","author":"B. Raveh","year":"2011","unstructured":"Raveh, B., Enosh, A., Halperin, D.: A Little More, a Lot Better: Improving Path Quality by a Path-Merging Algorithm. IEEE TRO\u00a027(2), 365\u2013370 (2011)","journal-title":"IEEE TRO"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Sanchez, G., Latombe, J.C.: A Single-Query, Bi-Directional Probabilistic Roadmap Planner with Lazy Collision Checking. In: ISRR, pp. 403\u2013418 (2001)","DOI":"10.1007\/3-540-36460-9_27"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Schmitzberger, E., Bouchet, J.L., Dufaut, M., Wolf, D., Husson, R.: Capture of Homotopy Classes with Probabilistic Roadmap. In: IEEE\/RSJ IROS, pp. 2317\u20132322 (2002)","DOI":"10.1109\/IRDS.2002.1041613"},{"issue":"6","key":"17_CR23","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1163\/156855300741960","volume":"41","author":"T. Simeon","year":"2000","unstructured":"Simeon, T., Laumond, J.P., Nissoux, C.: Visibility-based Probabilistic Roadmaps for Motion Planning. Advanced Robotics Journal\u00a041(6), 477\u2013494 (2000)","journal-title":"Advanced Robotics Journal"},{"key":"17_CR24","unstructured":"Varadhan, G., Manocha, D.: Star-shaped Roadmaps: A Deterministic Sampling Approach for Complete Motion Planning. IJRR (2007)"},{"key":"17_CR25","series-title":"STAR","first-page":"53","volume-title":"Algorithmic Foundations of Robotics","author":"D. Xie","year":"2008","unstructured":"Xie, D., Morales, M., Pearce, R., Thomas, S., Lien, J.L., Amato, N.M.: Incremental Map Generation (IMG). In: Akella, S., Amato, N.M., Huang, W.H., Mishra, B. (eds.) Algorithmic Foundations of Robotics. STAR, vol.\u00a047, pp. 53\u201368. Springer, Heidelberg (2008)"}],"container-title":["Springer Tracts in Advanced Robotics","Algorithmic Foundations of Robotics X"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36279-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T21:18:00Z","timestamp":1745961480000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-36279-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642362781","9783642362798"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36279-8_17","relation":{},"ISSN":["1610-7438","1610-742X"],"issn-type":[{"value":"1610-7438","type":"print"},{"value":"1610-742X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}