{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T14:36:14Z","timestamp":1780497374551,"version":"3.54.1"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Technion Autonomous Systems Program"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Sci. Eng."],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1109\/tase.2016.2602385","type":"journal-article","created":{"date-parts":[[2016,9,20]],"date-time":"2016-09-20T14:24:48Z","timestamp":1474381488000},"page":"383-390","source":"Crossref","is-referenced-by-count":22,"title":["Discretization-Based and Look-Ahead Algorithms for the Dubins Traveling Salesperson Problem"],"prefix":"10.1109","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1516-7941","authenticated-orcid":false,"given":"Izack","family":"Cohen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chen","family":"Epstein","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pantelis","family":"Isaiah","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saar","family":"Kuzi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tal","family":"Shima","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.06.001"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2006.1657388"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2006.872110"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.925814"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2005.847567"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"1301","DOI":"10.1109\/CDC.2002.1184695","article-title":"Optimal path planning for unmanned air vehicles with kinematic and tactical constraints","author":"yang","year":"2002","journal-title":"Proc 41st IEEE Conf Decision Control"},{"key":"ref16","article-title":"Combinatorial Optimization: Algorithms and Complexity","author":"papadimitriou","year":"1998"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2166311"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2006.376928"},{"key":"ref19","author":"boissonnat","year":"1994","journal-title":"Accessibility Region for a Car That Only Moves Forwards Along Optimal Paths"},{"key":"ref4","author":"isaacs","year":"1999","journal-title":"Differential Games A Mathematical Theory With Applications to Warfare and Pursuit Control and Optimization"},{"key":"ref3","first-page":"20","article-title":"Science goes exploring under the sea","volume":"8","author":"ouellette","year":"2002","journal-title":"Ind Phys"},{"key":"ref6","article-title":"Shortest paths of bounded curvature in the plane","author":"boissonnat","year":"1991"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.2307\/2372560"},{"key":"ref8","author":"applegate","year":"2006","journal-title":"The Traveling Salesman Problem—A Computational Study"},{"key":"ref7","article-title":"Shortest paths for the Reeds–Shepp car: A worked out example of the use of geometric techniques in nonlinear optimal control","author":"sussmann","year":"1991"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-008-9100-0"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1142\/S2301385014500022"},{"key":"ref1","author":"bertram","year":"2008","journal-title":"Unmanned Surface Vehicles - A Survey"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2014.12.041"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(91)90083-2"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1080\/0740817X.2016.1217101"},{"key":"ref24","article-title":"Worst-case analysis of a new heuristic for the travelling salesman problem","author":"christofides","year":"1976"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/321043.321046"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/16.1.30"}],"container-title":["IEEE Transactions on Automation Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8856\/7805318\/07572046.pdf?arnumber=7572046","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:39:13Z","timestamp":1641987553000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7572046\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":25,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tase.2016.2602385","relation":{},"ISSN":["1545-5955","1558-3783"],"issn-type":[{"value":"1545-5955","type":"print"},{"value":"1558-3783","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1]]}}}