{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T14:40:01Z","timestamp":1749566401853,"version":"3.41.0"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319293622"},{"type":"electronic","value":"9783319293639"}],"license":[{"start":{"date-parts":[[2016,8,26]],"date-time":"2016-08-26T00:00:00Z","timestamp":1472169600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-29363-9_24","type":"book-chapter","created":{"date-parts":[[2016,8,25]],"date-time":"2016-08-25T12:32:19Z","timestamp":1472128339000},"page":"419-436","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Asymptotically Near-Optimal Is Good Enough for Motion Planning"],"prefix":"10.1007","author":[{"given":"James D.","family":"Marble","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kostas E.","family":"Bekris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,26]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"I. Alth\u00f6fer, G. Das, D. Dobkin, D. Joseph, J. Soares, On sparse spanners of weighted graphs. Discrete Comput. Geom. 9(1), 81\u2013100 (1993)","DOI":"10.1007\/BF02189308"},{"key":"24_CR2","unstructured":"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\u2013168"},{"issue":"4","key":"24_CR3","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1002\/rsa.20130","volume":"30","author":"S Baswana","year":"2007","unstructured":"S. Baswana, S. Sen, A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs. Random Struct. Algorithms 30(4), 532\u2013563 (2007)","journal-title":"Random Struct. Algorithms"},{"key":"24_CR4","unstructured":"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)"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"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\u2013528","DOI":"10.1109\/ROBOT.2000.844107"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"D. Ferguson, A. Stentz, Anytime RRTs, in IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS) (Beijing, China, 2006), pp. 5369\u20135375","DOI":"10.1109\/IROS.2006.282100"},{"issue":"1\u20132","key":"24_CR7","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.comgeo.2005.10.001","volume":"35","author":"J Gao","year":"2006","unstructured":"J. Gao, L.J. Guibas, A. Nguyen, Deformable spanners and applications. Comput. Geometry Theory Appl. 35(1\u20132), 2\u201319 (2006)","journal-title":"Comput. Geometry Theory Appl."},{"key":"24_CR8","unstructured":"R. Geraerts, M.H. Overamrs, Creating small graphs for solving motion planning problems, in IEEE International Conference on Methods and Models in Automation and Robotics (MMAR) (2005), pp. 531\u2013536"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"R. Geraerts, M.H. Overmars, Creating high-quality roadmaps for motion planning in virtual environments, in IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS) (Beijing, China, 2006), pp. 4355\u20134361","DOI":"10.1109\/IROS.2006.282009"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1016\/j.robot.2007.06.002","volume":"55","author":"R Geraerts","year":"2007","unstructured":"R. Geraerts, M.H. Overmars, Reachability-based analysis for probabilistic roadmap planners. J. Robot. Auton. Syst. (RAS) 55, 824\u2013836 (2007)","journal-title":"J. Robot. Auton. Syst. (RAS)"},{"key":"24_CR11","unstructured":"L.J. Guibas, C. Holleman, L.E. Kavraki, A probabilistic roadmap planner for flexible objects with a workspace medial-axis-based sampling approach, in IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), vol. 1 (1999), pp. 254\u2013259"},{"issue":"3","key":"24_CR12","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1177\/027836402320556421","volume":"21","author":"D Hsu","year":"2002","unstructured":"D. Hsu, R. Kindel, J.C. Latombe, S. Rock, Randomized kinodynamic motion planning with moving obstacles. Int. J. Robot. Res. 21(3), 233\u2013255 (2002)","journal-title":"Int. J. Robot. Res."},{"key":"24_CR13","unstructured":"L. Jaillet, T. Simeon, Path deformation roadmaps, in Workshop on the Algorithmic Foundations of Robotics (WAFR) (New York City, NY, 2006)"},{"issue":"7","key":"24_CR14","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1177\/0278364911406761","volume":"30","author":"S Karaman","year":"2011","unstructured":"S. Karaman, E. Frazzoli, Sampling-based algorothms for optimal motion planning. Int. J. Robot. Res. 30(7), 846\u2013894 (2011)","journal-title":"Int. J. Robot. Res."},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"S. Karaman, M. Walter, A. Perez, E. Frazzoli, S. Teller, Anytime motion planning using the RRT, in IEEE International Conference on Robotics and Automation (ICRA) (Shanghai, China, 2011)","DOI":"10.1109\/ICRA.2011.5980479"},{"issue":"4","key":"24_CR16","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1109\/70.508439","volume":"12","author":"LE Kavraki","year":"1996","unstructured":"L.E. Kavraki, P. Svestka, J.C. Latombe, M. Overmars, Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. Robot. Autom. (TRA) 12(4), 566\u2013580 (1996)","journal-title":"IEEE Trans. Robot. Autom. (TRA)"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"J.M. Keil, Approximating the complete Euclidean graph, in 1st Scandinavian Workshop on Algorithm Theory (Springer, London, UK, 1988), pp. 208\u2013213","DOI":"10.1007\/3-540-19487-8_23"},{"key":"24_CR18","unstructured":"J. Kim, R.A. Pearce, N.M. Amato, Extracting optimal paths from roadmaps for motion planning, in IEEE International Conference on Robotics and Automation (ICRA), vol. 2 (Taipei, Taiwan, 2003), pp. 2424\u20132429"},{"issue":"5","key":"24_CR19","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1177\/02783640122067453","volume":"20","author":"SM LaValle","year":"2001","unstructured":"S.M. LaValle, J.J. Kuffner, Randomized kinodynamic planning. Int. J. Robot. Res. 20(5), 378\u2013400 (2001)","journal-title":"Int. J. Robot. Res."},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Y. Li, K.E. Bekris, Learning approximate cost-to-go metrics to improve sampling-based motion planning, in IEEE International Conference on Robotics and Automation (ICRA) (Shanghai, China, 2011)","DOI":"10.1109\/ICRA.2011.5980427"},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"T. Lozano-Perez, Spatial planning: a configuration space approach. IEEE Trans. Comput. 108\u2013120 (1983)","DOI":"10.1109\/TC.1983.1676196"},{"key":"24_CR22","doi-asserted-by":"crossref","unstructured":"J.D. Marble, K.E. Bekris, Computing spanners of asympotically optimal probabilistic roadmaps, in IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS) (San Francisco, CA, 2011)","DOI":"10.1109\/IROS.2011.6095070"},{"key":"24_CR23","unstructured":"M.A. Morales, R. Pearce, N.M. Amato, Metrics for analyzing the evolution of C-space models, in IEEE International Conference on Robotics and Automation (ICRA) (2006), pp. 1268\u20131273"},{"key":"24_CR24","doi-asserted-by":"crossref","unstructured":"O. Nechushtan, B. Raveh, D. Halperin, Sampling-diagrams automata: a tool for analyzing path quality in tree planners, in Workshop on the Algorithmic Foundations of Robotics (WAFR) (Singapore, 2010)","DOI":"10.1007\/978-3-642-17452-0_17"},{"key":"24_CR25","unstructured":"D. Nieuwenhuisen, M.H. Overmars, Using cycles in probabilistic roadmap graphs, in IEEE International Conference on Robotics and Automation (ICRA) (2004), pp. 446\u2013452"},{"key":"24_CR26","doi-asserted-by":"crossref","unstructured":"R. Pearce, M. Morales, N. Amato, Structural improvement filtering strategy for PRM, in Robotics: Science and Systems (RSS) (Zurich, Switzerland, 2008)","DOI":"10.15607\/RSS.2008.IV.022"},{"key":"24_CR27","doi-asserted-by":"crossref","unstructured":"D. Peleg, A. Scha\u00a8ffer, Graph spanners. J. Graph Theory 13(1), 99\u2013116 (1989)","DOI":"10.1002\/jgt.3190130114"},{"issue":"4","key":"24_CR28","first-page":"587","volume":"21","author":"E Plaku","year":"2005","unstructured":"E. Plaku, K.E. Bekris, B.Y. Chen, A.M. Ladd, L.E. Kavraki, Sampling-based roadmap of trees for parallel motion planning. IEEE Trans. Robot. Autom. (TRA) 21(4), 587\u2013608 (2005)","journal-title":"IEEE Trans. Robot. Autom. (TRA)"},{"issue":"2","key":"24_CR29","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1109\/TRO.2010.2098622","volume":"27","author":"B Raveh","year":"2011","unstructured":"B. Raveh, A. Enosh, D. Halperin, a little more, a lot better: improving path quality by a path-merging algorithm. IEEE Trans. Rob. 27(2), 365\u2013370 (2011)","journal-title":"IEEE Trans. Rob."},{"key":"24_CR30","unstructured":"G. Sanchez, J.C. Latombe, A single-query, bi-directional probabilistic roadmap planner with lazy collision checking, in International Symposium on Robotics Research (2001), pp. 403\u2013418"},{"key":"24_CR31","doi-asserted-by":"crossref","unstructured":"E. Schmitzberger, J.L. Bouchet, M. Dufaut, D. Wolf, R. Husson, Capture of homotopy classes with probabilistic roadmap, in IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS) (Switzerland, 2002), pp. 2317\u20132322","DOI":"10.1109\/IRDS.2002.1041613"},{"issue":"6","key":"24_CR32","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1163\/156855300741960","volume":"41","author":"T Simeon","year":"2000","unstructured":"T. Simeon, J.P. Laumond, C. Nissoux, Visibility-based probabilistic roadmaps for motion planning. Adv. Robot. J. 41(6), 477\u2013494 (2000)","journal-title":"Adv. Robot. J."},{"key":"24_CR33","unstructured":"I.A. Sucan, M. Moll, L.E. Kavraki, The open motion planning library (OMPL) (2010). http:\/\/ompl.kavrakilab.org"},{"issue":"11\u201312","key":"24_CR34","doi-asserted-by":"publisher","first-page":"1213","DOI":"10.1177\/0278364908097213","volume":"27","author":"R Wein","year":"2008","unstructured":"R. Wein, J. van den Berg, D. Halperin, Planning high-quality paths and corridors amidst obstacles. Int. J. Robot. Res. 27(11\u201312), 1213\u20131231 (2008)","journal-title":"Int. J. Robot. Res."},{"key":"24_CR35","unstructured":"D. Xie, M. Morales, R. Pearce, S. Thomas, J.L. Lien, N.M. Amato, Incremental map generation (IMG), in Workshop on Algorithmic Foundations of Robotics (WAFR) (New York City, NY, 2006)"}],"container-title":["Springer Tracts in Advanced Robotics","Robotics Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-29363-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T14:01:21Z","timestamp":1749564081000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-29363-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,26]]},"ISBN":["9783319293622","9783319293639"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-29363-9_24","relation":{},"ISSN":["1610-7438","1610-742X"],"issn-type":[{"type":"print","value":"1610-7438"},{"type":"electronic","value":"1610-742X"}],"subject":[],"published":{"date-parts":[[2016,8,26]]},"assertion":[{"value":"26 August 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}