{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T05:25:41Z","timestamp":1745645141159},"reference-count":14,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[2003,6]]},"abstract":"<jats:p> In this paper, we consider the problem of computing shortest paths of bounded curvature amidst obstacles in the plane. More precisely, given two prescribed initial and final configurations (specifying the location and the direction of travel) and a set of obstacles in the plane, we want to compute a shortest C<jats:sup>1<\/jats:sup> path joining those two configurations, avoiding the obstacles, and with the further constraint that, on each C<jats:sup>2<\/jats:sup> piece, the radius of curvature is at least 1. In this paper, we consider the case of moderate obstacles and present a polynomial-time exact algorithm to solve this problem. <\/jats:p>","DOI":"10.1142\/s0218195903001128","type":"journal-article","created":{"date-parts":[[2003,8,12]],"date-time":"2003-08-12T10:44:18Z","timestamp":1060685058000},"page":"189-229","source":"Crossref","is-referenced-by-count":19,"title":["A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature  Amidst Moderate Obstacles"],"prefix":"10.1142","volume":"13","author":[{"given":"Jean-Daniel","family":"Boissonnat","sequence":"first","affiliation":[{"name":"INRIA Sophia-Antipolis, BP 93,  06902 Sophia Antipolis Cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvain","family":"Lazard","sequence":"additional","affiliation":[{"name":"INRIA Lorraine \u2014 LORIA, 615 rue du Jardin Botanique, B.P. 101, 54602 Villers-les-Nancy  Cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01891837"},{"key":"rf3","volume-title":"Fundamentals of mathematics, Geometry","volume":"1","author":"Behnke H.","year":"1986"},{"key":"rf5","first-page":"1","volume":"10","author":"Boissonnat J.-D.","journal-title":"Internal J. Intell. Syst."},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8165-5"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187740"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840397"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.2307\/2372560"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01530887"},{"key":"rf15","doi-asserted-by":"crossref","unstructured":"P.\u00a0Jacobs and J.\u00a0Canny, Nonholonomic Motion Planning, eds. Z.\u00a0Li and J.\u00a0Canny (Kluwer Academic Publishers, Norwell, MA, 1992)\u00a0pp. 271\u2013342.","DOI":"10.1007\/978-1-4615-3176-0_8"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187683"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4022-9"},{"volume-title":"Nonholonomic Motion Planning","year":"1992","author":"Li Z.","key":"rf19"},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1109\/70.326564"},{"key":"rf21","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1990.145.367"}],"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195903001128","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:28:48Z","timestamp":1565137728000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195903001128"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":14,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2003,6]]}},"alternative-id":["10.1142\/S0218195903001128"],"URL":"https:\/\/doi.org\/10.1142\/s0218195903001128","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"type":"print","value":"0218-1959"},{"type":"electronic","value":"1793-6357"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}