{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T09:23:13Z","timestamp":1777713793933,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642073410","type":"print"},{"value":"9783540450580","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-45058-0_5","type":"book-chapter","created":{"date-parts":[[2012,6,27]],"date-time":"2012-06-27T15:51:48Z","timestamp":1340812308000},"page":"59-75","source":"Crossref","is-referenced-by-count":31,"title":["On the Relationship between Classical Grid Search and Probabilistic Roadmaps"],"prefix":"10.1007","author":[{"given":"Steven M.","family":"LaValle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael S.","family":"Branicky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","first-page":"155","volume-title":"Proceedings of the Workshop on Algorithmic Foundations of Robotics","author":"N. M. Amato","year":"1998","unstructured":"N. M. Amato, O. B. Bayazit, L. K. Dale, C. Jones, and D. Vallejo. OBPRM: An obstacle-based PRM for 3D workspaces. In Proceedings of the Workshop on Algorithmic Foundations of Robotics, pages 155\u2013168, 1998."},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1109\/ROBOT.1996.503582","volume-title":"IEEE Int. Conf. Robot. & Autom.","author":"N. M. Amato","year":"1996","unstructured":"N. M. Amato and Y. Wu. A randomized roadmap method for path and manipulation planning. In IEEE Int. Conf. Robot. & Autom., pages 113\u2013120, 1996."},{"key":"5_CR3","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/978-1-4471-1021-7_28","volume-title":"Proc. of the 7th International Symposium on Robotics Research","author":"J. Barraquand","year":"1996","unstructured":"J. Barraquand, L. Kavraki, J.-C. Latombe, T.-Y. Li, R. Motwani, and P. Ragha-van. A random sampling scheme for robot path planning. In G. Giralt and G. Hirzinger, editors, Proc. of the 7th International Symposium on Robotics Research, pages 249\u2013264. Springer, New York, NY, 1996."},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"1712","DOI":"10.1109\/ROBOT.1990.126256","volume-title":"IEEE Int. Conf. Robot. & Autom.","author":"J. Barraquand","year":"1990","unstructured":"J. Barraquand and J.-C. Latombe. A Monte-Carlo algorithm for path planning with many degrees of freedom. In IEEE Int. Conf. Robot. & Autom., pages 1712\u20131717, 1990."},{"key":"5_CR5","volume-title":"IEEE\/RS J Int. Conf on Intelligent Robots & Systems","author":"R. Bohlin","year":"2001","unstructured":"R. Bohlin. Path planning in practice; lazy evaluation on a multi-resolution grid. In IEEE\/RS J Int. Conf on Intelligent Robots & Systems, 2001."},{"key":"5_CR6","volume-title":"IEEE Int. Conf. Robot & Autom.","author":"R. Bohlin","year":"2000","unstructured":"R. Bohlin and L. Kavraki. Path planning using Lazy PRM. In IEEE Int. Conf. Robot & Autom., 2000."},{"key":"5_CR7","volume-title":"Handbook on Randomized Computation","author":"R. Bohlin","year":"2001","unstructured":"R. Bohlin and L. Kavraki. A randomized algorithm for robot path planning based on lazy evalaution. In S. Rajasekaran, P. Pardalos, J. Reif, and J. Rolim, editors, Handbook on Randomized Computation. Kluwer Academic, 2001."},{"key":"5_CR8","first-page":"1018","volume-title":"IEEE Int. Conf. Robot. & Autom.","author":"V. Boor","year":"1999","unstructured":"V. Boor, N. H. Overmars, and A. F. van der Stappen. The gaussian sampling strategy for probabilistic roadmap planners. In IEEE Int. Conf. Robot. & Autom., pages 1018\u20131023, 1999."},{"key":"5_CR9","first-page":"1481","volume-title":"Proc. IEEE InVl Conf. on Robotics and Automation","author":"M. Branicky","year":"2001","unstructured":"M. Branicky, S. M. LaValle, K. Olsen, and L. Yang. Quasi-randomized path planning. In Proc. IEEE InVl Conf. on Robotics and Automation, pages 1481\u20131487, 2001."},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0004-3702(87)90069-5","volume":"31","author":"B. R. Donald","year":"1987","unstructured":"B. R. Donald. A search algorithm for motion planning with six degrees of freedom. Artif IntelL, 31: 295\u2013353, 1987.","journal-title":"Artif IntelL"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1145\/174147.174150","volume":"40","author":"B. R. Donald","year":"1993","unstructured":"B. R. Donald, P. G. Xavier, J. Canny, and J. Reif. Kinodynamic planning. Journal of the ACM, 40: 1048\u201366, November 1993.","journal-title":"Journal of the ACM"},{"key":"5_CR12","first-page":"504","volume-title":"IEEE Int. Conf. Robot. & Autom.","author":"B. Faverjon","year":"1984","unstructured":"B. Faverjon. Obstacle avoidance using an octree in the configuration space of a manipulator. In IEEE Int. Conf. Robot. & Autom., pages 504\u2013512, 1984."},{"key":"5_CR13","first-page":"1152","volume-title":"IEEE Int. Conf. Robot & Autom.","author":"B. Faverjon","year":"1987","unstructured":"B. Faverjon and P. Tournassoud. A local based method for path planning of manipulators with a high number of degrees of freedom. In IEEE Int. Conf. Robot & Autom., pages 1152\u20131159, 1987."},{"key":"5_CR14","first-page":"1408","volume-title":"IEEE Int. Conf Robot & Autom.","author":"C. Holleman","year":"2000","unstructured":"C. Holleman and L. E. Kavraki. A framework for using the workspace medial axis in PRM planners. In IEEE Int. Conf Robot & Autom., pages 1408\u20131413, 2000."},{"key":"5_CR15","first-page":"141","volume-title":"Robotics: The Algorithmic Perspective","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 et al. P. Agarwal, editor, Robotics: The Algorithmic Perspective, pages 141\u2013154. A.K. Peters, Wellesley, MA, 1998."},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1142\/S0218195999000285","volume":"4","author":"D. Hsu","year":"1999","unstructured":"D. Hsu, J.-C. Latombe, and R. Motwani. Path planning in expansive configuration spaces. Int. J. Comput. Geom. & Appl, 4: 495\u2013512, 1999.","journal-title":"Int. J. Comput. Geom. & Appl"},{"issue":"1","key":"5_CR17","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/70.127236","volume":"8","author":"Y. K. Hwang","year":"1992","unstructured":"Y. K. Hwang and N. Ahuja. A potential field approach to path planning. IEEE Trans. Robot & Autom., 8 (l): 23\u201332, February 1992.","journal-title":"IEEE Trans. Robot & Autom."},{"issue":"3","key":"5_CR18","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1109\/70.388783","volume":"11","author":"L. E. Kavraki","year":"1995","unstructured":"L. E. Kavraki. Computation of configuration-space obstacles using the Fast Fourier Transform. IEEE Trans. Robot & Autom., 11 (3): 408\u2013413 1995.","journal-title":"IEEE Trans. Robot & Autom."},{"issue":"4","key":"5_CR19","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. Svestka, J.-C. Latombe, and M. H. Overmars. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. Robot. & Autom., 12 (4): 566\u2013580, June 1996.","journal-title":"IEEE Trans. Robot. & Autom."},{"key":"5_CR20","first-page":"3306","volume-title":"IEEE Int. Conf. Robot & Autom.","author":"F. Lamiraux","year":"1996","unstructured":"F. Lamiraux and J.-P. Laumond. On the expected complexity of random path planning. In IEEE Int. Conf. Robot & Autom., pages 3306\u20133311, 1996."},{"key":"5_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4022-9","volume-title":"Robot Motion Planning","author":"J.-C. Latombe","year":"1991","unstructured":"J.-C. Latombe. Robot Motion Planning. Kluwer Academic Publishers, Boston, MA, 1991."},{"key":"5_CR22","first-page":"293","volume-title":"Algorithmic and Computational Robotics: New Directions","author":"S. M. Lavalle","year":"2001","unstructured":"S. M. LaValle and J. J. Kuffner. Rapidly-exploring random trees: Progress and prospects. In B. R. Donald, K. M. Lynch, and D. Rus, editors, Algorithmic and Computational Robotics: New Directions, pages 293\u2013308. A K Peters, Wellesley, MA, 2001."},{"key":"5_CR23","volume-title":"Proc. International Symposium on Robotics Research","author":"P. Leven","year":"2000","unstructured":"P. Leven and S. Hutchinson. Real-time motion planning in changing environments. In Proc. International Symposium on Robotics Research, 2000."},{"key":"5_CR24","volume-title":"Incremental low-discrepancy lattice methods for motion planning. 2003. Submitted to IEEE International Conference on Robotics and Automation","author":"S. R. Lindemann","year":"2003","unstructured":"S. R. Lindemann and S. M. LaValle. Incremental low-discrepancy lattice methods for motion planning. 2003. Submitted to IEEE International Conference on Robotics and Automation."},{"key":"5_CR25","doi-asserted-by":"publisher","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":"5_CR26","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1613\/jair.468","volume":"9","author":"E. Mazer","year":"1998","unstructured":"E. Mazer, J. M. Ahuactzin, ana P. Bessi\u00e8re. The Ariadne\u2019s clew algorithm. J. Artificial Intell. Res., 9: 295\u2013316, November 1998.","journal-title":"J. Artificial Intell. Res."},{"key":"5_CR27","volume-title":"Proc. Int. Conf. of Society of Adaptive Behavior, Honolulu","author":"E. Mazer","year":"1992","unstructured":"E. Mazer, G. Talbi, J. M. Ahuactzin, and P. Bessi\u00e8re. The Ariadne\u2019s clew algorithm. In Proc. Int. Conf. of Society of Adaptive Behavior, Honolulu, 1992."},{"key":"5_CR28","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970081","volume-title":"Random Number Generation and Quasi-Monte-Carlo Methods","author":"H. Niederreiter","year":"1992","unstructured":"H. Niederreiter. Random Number Generation and Quasi-Monte-Carlo Methods. Society for Industrial and Applied Mathematics, Philadelphia, USA, 1992."},{"key":"5_CR29","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-1-4612-1702-2_6","volume-title":"Random and Quasi-Random Point Sets, Lecture Notes in Statistics","author":"H. Niederreiter","year":"1998","unstructured":"H. Niederreiter and C. P. Xing. Nets, (t,s)-sequences, and algebraic geometry. In P. Hellekalek and G. Larcher, editors, Random and Quasi-Random Point Sets, Lecture Notes in Statistics, Vol. 138, pages 267\u2013302. Springer-Verlag, Berlin, 1998.","edition":"138"},{"key":"5_CR30","volume-title":"Proc. Workshop on Algorithmic Foundation of Robotics","author":"C. Pisula","year":"2000","unstructured":"C. Pisula, K. Hoff, M. Lin, and D. Manoch. Randomized path planning for a rigid body based on hardware accelerated Voronoi sampling. In Proc. Workshop on Algorithmic Foundation of Robotics, 2000."},{"key":"5_CR31","volume-title":"Int. Symp. Robotics Research","author":"G. Sanchez","year":"2001","unstructured":"G. Sanchez and J.-C. Latombe. A single-query bi-directional probabilistic roadmap planner with lazy collision checking. In Int. Symp. Robotics Research, 2001."},{"key":"5_CR32","first-page":"14","volume-title":"Advanced Robotics Journal","author":"T. Simeon","year":"2000","unstructured":"T. Simeon, J.-P. Laumond., and C. Nissoux. Visibility based probabilistic roadmaps for motion planning. Advanced Robotics Journal, 14 (6), 2000.","edition":"6"},{"key":"5_CR33","volume-title":"Personal communication","author":"T. Simeon","year":"2002","unstructured":"Thierry Simeon, 2002. Personal communication."},{"issue":"4","key":"5_CR34","first-page":"1971","volume":"11","author":"A. G. Sukharev","year":"1971","unstructured":"A. G. Sukharev. Optimal strategies of the search for an extremum. U.S.S.R. Computational Mathematics and Mathematical Physics, 11 (4), 1971. Translated from Russian, Zh. Vuchisl. Mat i Mat Fiz11, 4, 910\u2013924, 1971.","journal-title":"Translated from Russian, Zh. Vuchisl. Mat i Mat Fiz11, 4, 910-924"},{"key":"5_CR35","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1016\/S0895-7177(00)00178-3","volume":"32","author":"X. Wang","year":"2000","unstructured":"X. Wang and F. J. Hickernell. Randomized halton sequences. Math. Comp. Modelling, 32: 887\u2013899, 2000.","journal-title":"Math. Comp. Modelling"},{"key":"5_CR36","first-page":"1024","volume-title":"IEEE Int. Conf. Robot. & Autom.","author":"S. A. Wilmarth","year":"1999","unstructured":"S. A. Wilmarth, N. M. Amato, and P. F. Stiller. MAPRM: A probabilistic roadmap planner with sampling on the medial axis of the free space. In IEEE Int. Conf. Robot. & Autom., pages 1024\u20131031, 1999."}],"container-title":["Springer Tracts in Advanced Robotics","Algorithmic Foundations of Robotics V"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45058-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,23]],"date-time":"2023-06-23T22:49:03Z","timestamp":1687560543000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45058-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783642073410","9783540450580"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45058-0_5","relation":{},"ISSN":["1610-7438","1610-742X"],"issn-type":[{"value":"1610-7438","type":"print"},{"value":"1610-742X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}