{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:29:54Z","timestamp":1775230194242,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319609157","type":"print"},{"value":"9783319609164","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,7,25]],"date-time":"2017-07-25T00:00:00Z","timestamp":1500940800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-60916-4_29","type":"book-chapter","created":{"date-parts":[[2017,7,24]],"date-time":"2017-07-24T03:53:33Z","timestamp":1500868413000},"page":"507-525","source":"Crossref","is-referenced-by-count":5,"title":["Deterministic Sampling-Based Motion Planning: Optimality, Complexity, and Performance"],"prefix":"10.1007","author":[{"given":"Lucas","family":"Janson","sequence":"first","affiliation":[]},{"given":"Brian","family":"Ichter","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Pavone","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,25]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Alterovitz, R., Patil, S., Derbakova, A.: Rapidly-exploring roadmaps: Weighing exploration vs. refinement in optimal motion planning. In: Proceedings of the IEEE Conference on Robotics and Automation, pp. 3706\u20133712 (2011)","DOI":"10.1109\/ICRA.2011.5980286"},{"key":"29_CR2","doi-asserted-by":"publisher","unstructured":"Arslan, O., Tsiotras, P.: Use of relaxation methods in sampling-based algorithms for optimal motion planning. In: Proceedings of the IEEE Conference on Robotics and Automation, pp. 2421\u20132428. Karlsruhe, Germany (2013). doi:\n10.1109\/ICRA.2013.6630906\n\n. \nhttp:\/\/ieeexplore.ieee.org\/xpls\/abs_all.jsp?arnumber=6630906","DOI":"10.1109\/ICRA.2013.6630906"},{"key":"29_CR3","doi-asserted-by":"publisher","unstructured":"Barraquand, J., Kavraki, L., Motwani, R., Latombe, J.-C., Li, T.-Y., Raghavan, P.: A random sampling scheme for path planning. Int. J. Robot. Res. 16(6), 759\u2013774 (2000). doi:\n10.1177\/027836499701600604\n\n. \nhttp:\/\/ijr.sagepub.com\/content\/16\/6\/759.short","DOI":"10.1177\/027836499701600604"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Bohlin, R., Kavraki, L.: Path planning using lazy PRM. In: Proceedings of the IEEE Conference on Robotics and Automation, pp. 521\u2013528 (2000)","DOI":"10.1109\/ROBOT.2000.844107"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Branicky, M.S., LaValle, S.M., Olson, K., Yang, L.: Quasi-randomized path planning. In: Proceedings of the IEEE Conference on Robotics and Automation, vol.\u00a02, pp. 1481\u20131487 (2001)","DOI":"10.1109\/ROBOT.2001.932820"},{"issue":"4","key":"29_CR6","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/BF00534948","volume":"64","author":"P Deheuvels","year":"1983","unstructured":"Deheuvels, P.: Strong bounds for multidimensional spacings. Zeitschrift f\u00fcr Wahrscheinlichkeitstheorie und Verwandte Gebiete 64(4), 411\u2013424 (1983)","journal-title":"Zeitschrift f\u00fcr Wahrscheinlichkeitstheorie und Verwandte Gebiete"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Dobson, A., Moustakides, G., Bekris, K.E.: Geometric probability results for bounding path quality in sampling-based roadmaps after finite computation. In: Proceedings of the IEEE Conference on Robotics and Automation (2015)","DOI":"10.1109\/ICRA.2015.7139775"},{"key":"29_CR8","doi-asserted-by":"publisher","unstructured":"Halton, J.H.: On the efficiency of certain quasirandom sequences of points in evaluating multidimensional integrals. Numerische Mathematik 2(1), 84\u201390 (1960). doi:\n10.1007\/BF01386213\n\n. \nhttp:\/\/link.springer.com\/article\/10.1007%2FBF01386213?LI=true","DOI":"10.1007\/BF01386213"},{"key":"29_CR9","doi-asserted-by":"publisher","unstructured":"Hsu, D., Latombe, J.-C., Motwani, R.: Path planning in expansive configuration spaces. Int. J. Comput. Geom. Appl. 9(4), 495\u2013512 (1999). doi:\n10.1142\/S0218195999000285\n\n. \nhttp:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195999000285","DOI":"10.1142\/S0218195999000285"},{"issue":"7","key":"29_CR10","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1177\/0278364906067174","volume":"25","author":"D Hsu","year":"2006","unstructured":"Hsu, D., Latombe, J.-C., Kurniawati, H.: On the probabilistic foundations of probabilistic roadmap planning. Int. J. Robot. Res. 25(7), 627\u2013643 (2006)","journal-title":"Int. J. Robot. Res."},{"key":"29_CR11","doi-asserted-by":"publisher","unstructured":"Janson, L., Schmerling, E., Clark, A., Pavone, M.: Fast marching tree: a fast marching sampling-based method for optimal motion planning in many dimensions. Int. J. Robot. Res. 34(7), 883\u2013921 (2015). doi:\n10.1177\/0278364915577958","DOI":"10.1177\/0278364915577958"},{"issue":"7","key":"29_CR12","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1177\/0278364911406761","volume":"30","author":"Sertac Karaman","year":"2011","unstructured":"Karaman, Sertac, Frazzoli, Emilio: Sampling-based algorithms for optimal motion planning. Int. J. Robot. Res. 30(7), 846\u2013894 (2011). doi:\n10.1177\/0278364911406761","journal-title":"Int. J. Robot. Res."},{"issue":"4","key":"29_CR13","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1109\/70.508439","volume":"12","author":"LE Kavraki","year":"1996","unstructured":"Kavraki, L.E., \u0160vestka, P., Latombe, J.C., Overmars, M.H.: Probabilistic roadmaps for path planning in high-dimensional spaces. IEEE Trans. Robot. Autom. 12(4), 566\u2013580 (1996). doi:\n10.1109\/70.508439","journal-title":"IEEE Trans. Robot. Autom."},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Lavalle, S.: Planning Algorithms. Cambridge University Press, Cambridge (2006)","DOI":"10.1017\/CBO9780511546877"},{"key":"29_CR15","doi-asserted-by":"publisher","unstructured":"LaValle, S.M., Kuffner, J.J.: Randomized kinodynamic planning. Int. J. Robot. Res. 20(5), 378\u2013400 (2001). doi:\n10.1177\/02783640122067453\n\n. \nhttp:\/\/ijr.sagepub.com\/content\/20\/5\/378.short","DOI":"10.1177\/02783640122067453"},{"issue":"7\u20138","key":"29_CR16","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1177\/0278364904045481","volume":"23","author":"SM LaValle","year":"2004","unstructured":"LaValle, S.M., Branicky, M.S., Lindemann, S.R.: On the relationship between classical grid search and probabilistic roadmaps. Int. J. Robot. Res. 23(7\u20138), 673\u2013692 (2004)","journal-title":"Int. J. Robot. Res."},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Lindemann, S.R., Yershova, A., LaValle, S.M.: Incremental grid sampling strategies in robotics. In: Workshop on Algorithmic Foundations of Robotics, pp. 313\u2013328 (2005)","DOI":"10.1007\/10991541_22"},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"Niederreiter, H.: Random number generation and Quasi-Monte Carlo methods. In: CBMS-NSF Regional Conference Series in Applied Mathematics. Society for Industrial & Applied Mathematics, vol. 63 (1992)","DOI":"10.1137\/1.9781611970081"},{"issue":"2","key":"29_CR19","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/j.jda.2009.03.001","volume":"8","author":"JB Orlin","year":"2010","unstructured":"Orlin, J.B., Madduri, K., Subramani, K., Williamson, M.: A faster algorithm for the single source shortest path problem with few distinct positive lengths. J. Discret. Algorithms 8(2), 189\u2013198 (2010)","journal-title":"J. Discret. Algorithms"},{"key":"29_CR20","doi-asserted-by":"publisher","unstructured":"Phillips, J.M., Bedrossian, N., Kavraki, L.E.: Guided expansive spaces trees: a search strategy for motion- and cost-constrained state spaces. In: Proceedings of the IEEE Conference on Robotics and Automation, vol.\u00a04, pp. 3968\u20133973. New Orleans, LA (2004). doi:\n10.1109\/ROBOT.2004.1308890\n\n. \nhttp:\/\/ieeexplore.ieee.org\/xpls\/abs_all.jsp?arnumber=1308890","DOI":"10.1109\/ROBOT.2004.1308890"},{"issue":"3","key":"29_CR21","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1002\/rob.20285","volume":"26","author":"M Pivtoraiko","year":"2009","unstructured":"Pivtoraiko, M., Knepper, R.A., Kelly, A.: Differentially constrained mobile robot motion planning in state lattices. J. Field Robot. 26(3), 308\u2013333 (2009)","journal-title":"J. Field Robot."},{"issue":"4","key":"29_CR22","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1109\/TRO.2005.847599","volume":"21","author":"E Plaku","year":"2005","unstructured":"Plaku, E., Bekris, K.E., Chen, B.Y., Ladd, A.M., Kavraki, L.E.: Sampling-based roadmap of trees for parallel motion planning. IEEE Trans. Robot. 21(4), 597\u2013608 (2005)","journal-title":"IEEE Trans. Robot."},{"issue":"3","key":"29_CR23","first-page":"89","volume":"10","author":"A Stentz","year":"1995","unstructured":"Stentz, A.: Optimal and efficient path planning for unknown and dynamic environments. Int. J. Robot. Autom. 10(3), 89\u2013100 (1995)","journal-title":"Int. J. Robot. Autom."},{"key":"29_CR24","doi-asserted-by":"publisher","unstructured":"\u015eucan, I.A., Moll, M., Kavraki, L.E.: The open motion planning library. IEEE Robot. Autom. Mag. 19(4), 72\u201382 (2012). doi:\n10.1109\/MRA.2012.2205651\n\n. \nhttp:\/\/ieeexplore.ieee.org\/xpls\/abs_all.jsp?arnumber=6377468","DOI":"10.1109\/MRA.2012.2205651"},{"key":"29_CR25","doi-asserted-by":"publisher","unstructured":"Sukharev, A.G.: Optimal strategies of the search for an extremum. USSR Comput. Math. Math. Phys. 11(4), 119\u2013137 (1971). doi:\n10.1016\/0041-5553(71)90008-5\n\n. \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/0041555371900085","DOI":"10.1016\/0041-5553(71)90008-5"},{"key":"29_CR26","unstructured":"Thrun, S., Burgard, W., Fox, D.: Probabilistic Robotics. MIT Press, Cambridge (2005)"},{"key":"29_CR27","doi-asserted-by":"crossref","unstructured":"Yershova, A., LaValle, S.M.: Deterministic sampling methods for spheres and SO(3). In: Proceedings of the IEEE Conference on Robotics and Automation, vol.\u00a04, pp. 3974\u20133980 (2004)","DOI":"10.1109\/ROBOT.2004.1308891"},{"issue":"7","key":"29_CR28","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1177\/0278364909352700","volume":"29","author":"A Yershova","year":"2010","unstructured":"Yershova, A., Jain, S., Lavalle, S.M., Mitchell, J.C.: Generating uniform incremental grids on SO(3) using the Hopf fibration. Int. J. Robot. Res. 29(7), 801\u2013812 (2010)","journal-title":"Int. J. Robot. Res."}],"container-title":["Springer Proceedings in Advanced Robotics","Robotics Research"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60916-4_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,24]],"date-time":"2017-07-24T04:05:40Z","timestamp":1500869140000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-60916-4_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,25]]},"ISBN":["9783319609157","9783319609164"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60916-4_29","relation":{},"ISSN":["2511-1256","2511-1264"],"issn-type":[{"value":"2511-1256","type":"print"},{"value":"2511-1264","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,25]]}}}