{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:35:40Z","timestamp":1725521740219},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540921813"},{"type":"electronic","value":"9783540921820"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-92182-0_56","type":"book-chapter","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T02:38:06Z","timestamp":1228876686000},"page":"628-643","source":"Crossref","is-referenced-by-count":8,"title":["A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths"],"prefix":"10.1007","author":[{"given":"Jonathan","family":"Backer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Kirkpatrick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"56_CR1","doi-asserted-by":"publisher","first-page":"1814","DOI":"10.1137\/S0097539700374550","volume":"31","author":"P.K. Agarwal","year":"2002","unstructured":"Agarwal, P.K., Biedl, T., Lazard, S., Robbins, S., Suri, S., Whitesides, S.: Curvature-constrained shortest paths in a convex polygon. SIAM J. Comput.\u00a031(6), 1814\u20131851 (2002)","journal-title":"SIAM J. Comput."},{"key":"56_CR2","first-page":"343","volume-title":"ACM symposium on Theory of computing","author":"P.K. Agarwal","year":"1995","unstructured":"Agarwal, P.K., Raghavan, P., Tamaki, H.: Motion planning for a steering-constrained robot through moderate obstacles. In: ACM symposium on Theory of computing, pp. 343\u2013352. ACM Press, New York (1995)"},{"issue":"6","key":"56_CR3","doi-asserted-by":"publisher","first-page":"1739","DOI":"10.1137\/S0097539796307790","volume":"30","author":"P.K. Agarwal","year":"2001","unstructured":"Agarwal, P.K., Wang, H.: Approximation algorithms for curvature-constrained shortest paths. SIAM J. Comput.\u00a030(6), 1739\u20131772 (2001)","journal-title":"SIAM J. Comput."},{"key":"56_CR4","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/1247069.1247080","volume-title":"SCG 2007: Proceedings of the twenty-third annual symposium on Computational geometry","author":"J. Backer","year":"2007","unstructured":"Backer, J., Kirkpatrick, D.: Finding curvature-constrained paths that avoid polygonal obstacles. In: SCG 2007: Proceedings of the twenty-third annual symposium on Computational geometry, pp. 66\u201373. ACM, New York (2007)"},{"key":"56_CR5","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1145\/1064092.1064135","volume-title":"SCG 2005: Proceedings of the twenty-first annual symposium on Computational geometry","author":"S. Bereg","year":"2005","unstructured":"Bereg, S., Kirkpatrick, D.: Curvature-bounded traversals of narrow corridors. In: SCG 2005: Proceedings of the twenty-first annual symposium on Computational geometry, pp. 278\u2013287. ACM Press, New York (2005)"},{"issue":"3","key":"56_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1142\/S0218195903001128","volume":"13","author":"J.-D. Boissonnat","year":"2003","unstructured":"Boissonnat, J.-D., Lazard, S.: A polynomial-time algorithm for computing shortest paths of bounded curvature amidst moderate obstacles. Internat. J. Comput. Geom. Appl.\u00a013(3), 189\u2013229 (2003)","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"56_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/3-540-44676-1_21","volume-title":"Algorithms - ESA 2001","author":"C. Burnikel","year":"2001","unstructured":"Burnikel, C., Funke, S., Mehlhorn, K., Schirra, S., Schmitt, S.: A separation bound for real algebraic expressions. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, p. 254. Springer, Heidelberg (2001)"},{"key":"56_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/177424.177501","volume-title":"SCG 1994: Proceedings of the tenth annual symposium on Computational geometry","author":"J. Choi","year":"1994","unstructured":"Choi, J., Sellen, J., Yap, C.-K.: Approximate euclidean shortest path in 3-space. In: SCG 1994: Proceedings of the tenth annual symposium on Computational geometry, pp. 41\u201348. ACM Press, New York (1994)"},{"key":"56_CR9","doi-asserted-by":"publisher","first-page":"497","DOI":"10.2307\/2372560","volume":"79","author":"L.E. Dubins","year":"1957","unstructured":"Dubins, L.E.: On curves of minimal length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents. Amer. J. Math.\u00a079, 497\u2013516 (1957)","journal-title":"Amer. J. Math."},{"issue":"1","key":"56_CR10","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF01530887","volume":"3","author":"S. Fortune","year":"1991","unstructured":"Fortune, S., Wilfong, G.: Planning constrained motion. Ann. Math. Artificial Intelligence\u00a03(1), 21\u201382 (1991); Algorithmic motion planning in robotics","journal-title":"Ann. Math. Artificial Intelligence"},{"key":"56_CR11","first-page":"271","volume-title":"Nonholonomic Motion Planning","author":"P. Jacobs","year":"1992","unstructured":"Jacobs, P., Canny, J.: Planning smooth paths for mobile robots. In: Nonholonomic Motion Planning, pp. 271\u2013342. Kluwer Academic, Norwell (1992)"},{"issue":"5","key":"56_CR12","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0020-0190(85)90029-8","volume":"20","author":"C.H. Papadimitriou","year":"1985","unstructured":"Papadimitriou, C.H.: An algorithm for shortest-path motion in three dimensions. Inform. Process. Lett.\u00a020(5), 259\u2013263 (1985)","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"56_CR13","doi-asserted-by":"publisher","first-page":"367","DOI":"10.2140\/pjm.1990.145.367","volume":"145","author":"J.A. Reeds","year":"1990","unstructured":"Reeds, J.A., Shepp, L.A.: Optimal paths for a car that goes both forwards and backwards. Pacific J. Math.\u00a0145(2), 367\u2013393 (1990)","journal-title":"Pacific J. Math."},{"key":"56_CR14","unstructured":"Reif, J., Wang, H.: The complexity of the two dimensional curvature-constrained shortest-path problem. In: Workshop on the Algorithmic Foundations of Robotics, Natick, MA, USA, pp. 49\u201357. A. K. Peters, Ltd. (1998)"},{"issue":"1","key":"56_CR15","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1137\/S0097539798331975","volume":"30","author":"J. Reif","year":"2000","unstructured":"Reif, J., Wang, H.: Nonuniform discretization for kinodynamic motion planning and its applications. SIAM J. Comput.\u00a030(1), 161\u2013190 (2000)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92182-0_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T09:44:08Z","timestamp":1551692648000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92182-0_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540921813","9783540921820"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92182-0_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}