{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T09:53:15Z","timestamp":1777715595800,"version":"3.51.4"},"reference-count":18,"publisher":"SAGE Publications","issue":"5","license":[{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The International Journal of Robotics Research"],"published-print":{"date-parts":[[1998,5]]},"abstract":"<jats:p>This paper addresses the problem of finding a shortest collision- free path for a carlike point robot maneuvering around polygonal obstacles in a room bounded by a polygonal line. The authors introduce a sufficient set of 56 subpath types for the no-obstacle case in which a subpath is defined as a piece of a path that starts and ends at either the initial position, the final position, or any position on a cell boundary. The authors propose a near-optimal algorithm that consists of finding a shortest path in a search graph where the arcs represent subpaths whose types belong to the sufficient set. The authors then study an algorithm in which the robot is allowed to turn on the spot at a certain cost. Finally, the authors compare the solutions derived from both algorithms.<\/jats:p>","DOI":"10.1177\/027836499801700504","type":"journal-article","created":{"date-parts":[[2007,3,11]],"date-time":"2007-03-11T03:05:13Z","timestamp":1173582313000},"page":"512-530","source":"Crossref","is-referenced-by-count":4,"title":["A Shortest Path Algorithm for a Carlike Robot in a Polygonal Environment"],"prefix":"10.1177","volume":"17","author":[{"given":"Guy","family":"Desaulniers","sequence":"first","affiliation":[{"name":"GERAD and \u00c9cole Polytechnique Montr\u00e9al, Qu\u00e9bec, Canada H3T 2A7"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fran\u00e7ois","family":"Soumis","sequence":"additional","affiliation":[{"name":"GERAD and \u00c9cole Polytechnique Montr\u00e9al, Qu\u00e9bec, Canada H3T 2A7"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Charles","family":"Laurent","sequence":"additional","affiliation":[{"name":"AD OPT Technologies Inc. Montr\u00e9al, Qu\u00e9bec, Canada H3V 1G4"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[1998,5,1]]},"reference":[{"key":"atypb1","author":"Avnaim, F.","year":"1988","journal-title":"IEEE Int. Conf. Robotics and Automation"},{"key":"atypb2","author":"Barraquand, J.","year":"1991","journal-title":"IEEE Int. Conf. Robotics and Automation"},{"key":"atypb3","author":"Boissonnat, J.-D.","year":"1992","journal-title":"IEEE Int. Conf. Robotics and Automation"},{"key":"atypb4","volume-title":"The shortest path synthesis for non-holonomic robots moving forwards. Research Report 2153","author":"Bui, X.-N.","year":"1994"},{"key":"atypb5","volume-title":"Optimisation du chemin d'un v\u00e9hicule autonome","author":"Desaulniers, G.","year":"1993"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1016\/0921-8890(96)80512-4"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1109\/70.478429"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.2307\/2372560"},{"key":"atypb9","author":"Jacobs, P.","year":"1989","journal-title":"IEEE Int. Conf. Robotics and Automation"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4022-9"},{"key":"atypb11","unstructured":"Laumond, J.P. 1987. Feasible trajectories for mobile robots with kinematics and environment constraints. Intelligent Autonomous Systems, eds. L. O. Hertzberger and F.C.A. Groen. New York: North-Holland , pp. 346-354."},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1109\/70.326564"},{"key":"atypb13","author":"Laumond, J.-P.","year":"1990","journal-title":"IEEE Int. Workshop Intelligent Robots and Systems"},{"key":"atypb14","author":"Mirtich, B.","year":"1992","journal-title":"IEEE Int. Conf. Robotics and Automation"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1990.145.367"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.3160360305"},{"key":"atypb17","author":"Sou\u00e8res, P.","year":"1993","journal-title":"European Control Conf. ECC."},{"key":"atypb18","volume-title":"Shortest paths for the Reeds-Shepp car: A worked out example of the use of geometric techniques in nonlinear optimal control. Report SYCON-91-10","author":"Sussmann, H.J.","year":"1991"}],"container-title":["The International Journal of Robotics Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/027836499801700504","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/027836499801700504","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T10:15:36Z","timestamp":1777457736000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/027836499801700504"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["10.1177\/027836499801700504"],"URL":"https:\/\/doi.org\/10.1177\/027836499801700504","relation":{},"ISSN":["0278-3649","1741-3176"],"issn-type":[{"value":"0278-3649","type":"print"},{"value":"1741-3176","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}