{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:21:07Z","timestamp":1759332067664,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642174513"},{"type":"electronic","value":"9783642174520"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17452-0_17","type":"book-chapter","created":{"date-parts":[[2010,11,17]],"date-time":"2010-11-17T07:23:04Z","timestamp":1289978584000},"page":"285-301","source":"Crossref","is-referenced-by-count":19,"title":["Sampling-Diagram Automata: A Tool for Analyzing Path Quality in Tree Planners"],"prefix":"10.1007","author":[{"given":"Oren","family":"Nechushtan","sequence":"first","affiliation":[]},{"given":"Barak","family":"Raveh","sequence":"additional","affiliation":[]},{"given":"Dan","family":"Halperin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Asano, T., Kirkpatrick, D., Yap, C.: d 1-Optimal motion of a rod. In: 12th ACM Symposium on Computational Geometry, pp. 252\u2013263 (1996)","DOI":"10.1145\/237218.237394"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Bhatia, A., Kavraki, L.E., Vardi, M.Y.: Sampling-based motion planning with temporal goals. In: ICRA 2010, pp. 2689\u20132696 (2010)","DOI":"10.1109\/ROBOT.2010.5509503"},{"key":"17_CR3","first-page":"49","volume-title":"FOCS 1987","author":"J. Canny","year":"1987","unstructured":"Canny, J., Reif, J.: New lower bound techniques for robot motion planning problems. In: FOCS 1987, pp. 49\u201360. IEEE, Los Alamitos (1987)"},{"key":"17_CR4","volume-title":"Principles of Robot Motion: Theory, Algorithms, and Implementations","author":"H. Choset","year":"2005","unstructured":"Choset, H., Lynch, K.M., Hutchinson, S., Kantor, G.A., Burgard, W., Kavraki, L.E., Thrun, S.: Principles of Robot Motion: Theory, Algorithms, and Implementations. MIT Press, Cambridge (2005)"},{"issue":"8","key":"17_CR5","doi-asserted-by":"publisher","first-page":"3850","DOI":"10.1529\/biophysj.108.135285","volume":"95","author":"A. Enosh","year":"2008","unstructured":"Enosh, A., Raveh, B., Furman-Schueler, O., Halperin, D., Ben-Tal, N.: Generation, comparison and merging of pathways between protein conformations: Gating in k-channels. Biophysical Journal\u00a095(8), 3850\u20133860 (2008)","journal-title":"Biophysical Journal"},{"issue":"2","key":"17_CR6","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.automatica.2008.08.008","volume":"45","author":"G.E. Fainekos","year":"2009","unstructured":"Fainekos, G.E., Girard, A., Kress-Gazit, H., Pappas, G.J.: Temporal logic motion planning for dynamic robots. Automatica\u00a045(2), 343\u2013352 (2009)","journal-title":"Automatica"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Ferguson, D., Stentz, A.: Anytime RRTs. In: IEEE\/RSJ International Conference on Intelligent Robots and Systems, pp. 5369\u20135375 (2006)","DOI":"10.1109\/IROS.2006.282100"},{"issue":"8","key":"17_CR8","first-page":"845","volume":"26","author":"R. Geraerts","year":"2007","unstructured":"Geraerts, R., Overmars, M.: Creating high-quality paths for motion planning. IJRR\u00a026(8), 845\u2013863 (2007)","journal-title":"IJRR"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1142\/S0218195999000285","volume":"4","author":"D. Hsu","year":"1999","unstructured":"Hsu, D., Latombe, J., Motwani, R.: Path planning in expansive configuration spaces. Int. J. Comp. Geo. & App.\u00a04, 495\u2013512 (1999)","journal-title":"Int. J. Comp. Geo. & App."},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Karaman, S., Frazzoli, E.: Incremental sampling-based optimal motion planning. Robotics: Science and Systems (2010)","DOI":"10.15607\/RSS.2010.VI.034"},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1109\/70.660866","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 Trans. Robot. Automat.\u00a014(1), 166\u2013171 (1998)","journal-title":"IEEE Trans. Robot. Automat."},{"issue":"4","key":"17_CR12","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1109\/70.508439","volume":"12","author":"L.E. Kavraki","year":"1996","unstructured":"Kavraki, L.E., Svestka, P., Latombe, J.C., Overmars, M.H.: Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. Robot. Automat.\u00a012(4), 566\u2013580 (1996)","journal-title":"IEEE Trans. Robot. Automat."},{"key":"17_CR13","first-page":"2424","volume-title":"ICRA 2003","author":"J. Kim","year":"2003","unstructured":"Kim, J., Pearce, R.A., Amato, N.M.: Extracting optimal paths from roadmaps for motion planning. In: ICRA 2003, pp. 2424\u20132429. IEEE, Los Alamitos (2003)"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Kuffner, J.J., Lavalle, S.M.: RRT-Connect: An efficient approach to single-query path planning. In: ICRA 2000, pp. 995\u20131001 (2000)","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Lahijanian, M., Wasniewski, J., Andersson, S., Belta, C.: Motion planning and control from temporal logic specifications with probabilistic satisfaction guarantees. In: ICRA 2010, pp. 3227\u20133232 (2010)","DOI":"10.1109\/ROBOT.2010.5509686"},{"key":"17_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877","volume-title":"Planning Algorithms","author":"S.M. LaValle","year":"2006","unstructured":"LaValle, S.M.: Planning Algorithms. Cambridge University Press, Cambridge (2006)"},{"key":"17_CR17","first-page":"293","volume-title":"Algorithmic and Computational Robotics: New Directions","author":"S.M. LaValle","year":"2001","unstructured":"LaValle, S.M., Kuffner, J.J.: Rapidly-exploring random trees: Progress and prospects. In: Donald, B.R., Lynch, K.M., Rus, D. (eds.) Algorithmic and Computational Robotics: New Directions, pp. 293\u2013308. A K Peters, Wellesley (2001)"},{"key":"17_CR18","series-title":"Shortest paths and networks","first-page":"607","volume-title":"Handbook of discrete and computational geometry","author":"J.S.B. Mitchell","year":"2004","unstructured":"Mitchell, J.S.B.: Handbook of discrete and computational geometry. Shortest paths and networks,\u00a0ch. 27, pp. 607\u2013641. CRC Press, Inc., Boca Raton (2004)"},{"key":"17_CR19","unstructured":"Nechushtan, O., Raveh, B., Halperin, D.: Supplementary online proofs, http:\/\/acg.cs.tau.ac.il\/projects\/internal-projects\/sda\/SuppOnline.pdf"},{"key":"17_CR20","first-page":"446","volume-title":"ICRA 2004","author":"D. Nieuwenhuisen","year":"2004","unstructured":"Nieuwenhuisen, D., Overmars, M.H.: Useful cycles in probabilistic roadmap graphs. In: ICRA 2004, pp. 446\u2013452. IEEE, Los Alamitos (2004)"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Plaku, E., Bekris, K.E., Kavraki, L.E.: OOPS for motion planning: An online open-source programming system. In: ICRA 2007, pp. 3711\u20133716 (2007)","DOI":"10.1109\/ROBOT.2007.364047"},{"key":"17_CR22","unstructured":"Raveh, B., Enosh, A., Halperin, D.: A little more, a lot better: Improving path quality by a simple path merging algorithm. Computing Research Repository, abs\/1001.2391 (2010)"},{"key":"17_CR23","unstructured":"Reif, J., Wang, H.: The complexity of the two dimensional curvature-constrained shortest-path problem. In: WAFR 1998, pp. 49\u201357 (1998)"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Reif, J.H.: Complexity of the mover\u2019s problem and generalizations. In: Proceedings IEEE Symposium on Foundations of Computer Science, pp. 421\u2013427 (1979)","DOI":"10.1109\/SFCS.1979.10"}],"container-title":["Springer Tracts in Advanced Robotics","Algorithmic Foundations of Robotics IX"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17452-0_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T21:53:48Z","timestamp":1740693228000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17452-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174513","9783642174520"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17452-0_17","relation":{},"ISSN":["1610-7438","1610-742X"],"issn-type":[{"type":"print","value":"1610-7438"},{"type":"electronic","value":"1610-742X"}],"subject":[],"published":{"date-parts":[[2010]]}}}