{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T09:53:58Z","timestamp":1760608438946,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540481102"},{"type":"electronic","value":"9783540481133"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-48113-3_8","type":"book-chapter","created":{"date-parts":[[2007,5,14]],"date-time":"2007-05-14T09:57:10Z","timestamp":1179136630000},"page":"83-97","source":"Crossref","is-referenced-by-count":14,"title":["On the Probabilistic Foundations of Probabilistic Roadmap Planning"],"prefix":"10.1007","author":[{"given":"David","family":"Hsu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Claude","family":"Latombe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanna","family":"Kurniawati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"B. Burns and O. Brock. Sampling-based motion planning using predictive models. In Proc. IEEE Int. Conf. on Robotics & Automation, 2005."},{"key":"8_CR2","unstructured":"V. Boor, M.H. Overmars, and A.F. van der Stappen. The Gaussian sampling strategy for probbailistic roadmap planners. Proc. IEEE Int. Conf. on Robotics & Automation, pp. 1018\u20131023, 1999."},{"key":"8_CR3","unstructured":"H. Choset, K.M. Lynch, S. Hutchinson, G. Kantor, W. Burgard, L.E. Kavraki, and S. Thrun. Principles of Robot Motion: Theory, Algorithms, and Implementations, Chapter 7, MIT Press, 2005."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"M. Foskey, M. Garber, M.C. Lin, and D. Manocha. A Voronoi-based hybrid motion planner. In Proc. IEEE\/RSJ Int. Conf. on Intelligent Robots & Systems, pages 55\u201360, 2001.","DOI":"10.1109\/IROS.2001.973336"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"L. Guibas, C. Holleman, and L.E. Kavraki. A probabilistic roadmap planner for flexible objects with a workspace medial-axis based sampling approach. In Proc. IEEE\/RSJ Int. Conf. on Intelligent Robots & Systems, pages 254\u2013260, 1999.","DOI":"10.1109\/IROS.1999.813013"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"R. Geraerts and M.H. Overmars. A comparative study of probabilistic roadmap planners. In J.D. Boissonnat et al. (eds.), Algorithmic Foundations of Robotics V, pp. 43\u201357, Springer, 2004.","DOI":"10.1007\/978-3-540-45058-0_4"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"D. Hsu, T. Jiang, J. Reif, and Z. Sun. The bridge test for sampling narrow passages with probabilistic roadmap planners. In Proc. IEEE Int. Conf. on Robotics & Automation, pages 4420\u20134426, 2003.","DOI":"10.1109\/ROBOT.2003.1242285"},{"key":"8_CR8","first-page":"141","volume-title":"Robotics: The Algorithmic Perspective: 1998 Workshop on the Algorithmic Foundations of Robotics","author":"D. Hsu","year":"1998","unstructured":"D. Hsu, L.E. Kavraki, J.C. Latombe, R. Motwani, and S. Sorkin. On finding narrow passages with probabilistic roadmap planners. In P.K. Agarwal et al., editors, Robotics: The Algorithmic Perspective: 1998 Workshop on the Algorithmic Foundations of Robotics, pages 141\u2013154. A. K. Peters, Wellesley, MA, 1998."},{"key":"8_CR9","unstructured":"D. Hsu, J.C. Latombe, and R. Motwani. Path planning in expansive configuration spaces. In Proc. IEEE Int. Conf. on Robotics & Automation, pp. 2219\u20132226, 1997."},{"key":"8_CR10","unstructured":"D. Hsu, G. S\u00e1nchez-Ante, and, Z. Sun. Hybrid PRM sampling with a cost-sensitive adaptive strategy. In Proc. IEEE Int. Conf. on Robotics & Automation, 2005."},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"L.E. Kavraki, J.C. Latombe, R. Motwani, and P. Raghavan. Randomized query processing in robot motion planning. In Proc. ACM Symp. on Theory of Computing (STOC), pp. 353\u2013362, 1995.","DOI":"10.21236\/ADA326821"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1109\/70.508439","volume":"12","author":"L.E. Kavraki","year":"1996","unstructured":"L.E. Kavraki, P. \u0160vestka, J.C. Latombe, M.H. Overmars, Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. on Robotics & Automation, 12:566\u2013580, 1996.","journal-title":"IEEE Trans. on Robotics & Automation"},{"issue":"7\u20138","key":"8_CR13","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1177\/0278364904045481","volume":"23","author":"S.M. LaValle","year":"2004","unstructured":"S.M. LaValle, M.S. Branicky, and S.R. Lindermann. On the relationship between classical grid search and probabilistic roadmaps. Int. J. of Robotics Research, 23(7\u20138):673\u2013692, 2004.","journal-title":"Int. J. of Robotics Research"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"P. Leven and S. Hutchinson. Using manipulability to bias sampling during the construction of probabilistic roadmaps. In Proc. IEEE Int. Conf. on Robotics & Automation, pages 2134\u20132140, 2002.","DOI":"10.1109\/ROBOT.2002.1014855"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"S.R. Lindemann and S.M. LaValle. Incremental low-discrepancy lattice methods for motion planning. In Proc. IEEE Int. Conf. on Robotics & Automation, pages 2920\u20132927, 2003.","DOI":"10.1109\/ROBOT.2003.1242039"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"M. Lin and D. Manocha. Collision and proximity queries. In J.E. Goodman and J. O\u2019Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 35. CRC Press, 2004.","DOI":"10.1201\/9781420035315.ch35"},{"key":"8_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-03942-3","volume-title":"Geometric Discrepancy","author":"J. Matousek","year":"1999","unstructured":"J. Matousek. Geometric Discrepancy. Springer-Verlag, Berlin, 1999."},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"M. Saha and J.C. Latombe. Finding narrow passages with probabilistic roadmaps: The small step retraction method. In Proc. IEEE\/RSJ Int. Conf. on Intelligent Robots & Systems, 2005.","DOI":"10.1109\/IROS.2005.1545606"},{"issue":"6","key":"8_CR19","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1163\/156855300741960","volume":"14","author":"T. Sim\u00e9on","year":"2000","unstructured":"T. Sim\u00e9on, J.P. Laumond, and C. Nissoux. Visibility-based probabilistic roadmaps for motion planning. J. of Advanced Robotics, 14(6):477\u2013494, 2000.","journal-title":"J. of Advanced Robotics"},{"key":"8_CR20","unstructured":"Y. Yang and O. Brock. Adapting the Sampling Distribution in PRM Planners Based on an Approximated Medial Axis. In Proc. IEEE Int. Conf. on Robotics & Automation, 2004."}],"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-540-48113-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T07:43:50Z","timestamp":1737013430000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-48113-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540481102","9783540481133"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-48113-3_8","relation":{},"ISSN":["1610-7438"],"issn-type":[{"type":"print","value":"1610-7438"}],"subject":[],"published":{"date-parts":[[2007]]}}}