{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T00:03:28Z","timestamp":1773446608325,"version":"3.50.1"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1109\/lra.2018.2890433","type":"journal-article","created":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T19:41:01Z","timestamp":1546371661000},"page":"391-398","source":"Crossref","is-referenced-by-count":17,"title":["Near-Optimal Path Planning for a Car-Like Robot Visiting a Set of Waypoints With Field of View Constraints"],"prefix":"10.1109","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9223-7456","authenticated-orcid":false,"given":"Sivakumar","family":"Rathinam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satyanarayana G.","family":"Manyam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuntao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2008.4543594"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1177\/0278364912458464"},{"key":"ref12","author":"gutin","year":"2002","journal-title":"The Traveling Salesman Problem and Its Variations"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/3-540-45253-2_29","article-title":"Approximation of curvature-constrained shortest paths through a sequence of points","volume":"1879","author":"lee","year":"2000","journal-title":"Algorithms—ESA 2000"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/100816079"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2006.872110"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2005.1470055"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2018.8460661"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2017.8206451"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/IECON.2015.7392728"},{"key":"ref28","author":"lawler","year":"1976","journal-title":"Combinatorial Optimization and Matroids"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/9.489204"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/70.326564"},{"key":"ref3","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":"ref6","doi-asserted-by":"publisher","DOI":"10.1177\/027836402320556403"},{"key":"ref29","author":"applegate","year":"2007","journal-title":"The Traveling Salesman Problem A Computational Study (Princeton Series in Applied Mathematics)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.2307\/2372560"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2007.4434966"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2006.1641938"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01258291"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2002.1014794"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1990.145.367"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/WI-IAT.2009.132"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2009.2039379"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2006.886841"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1115\/1.4039099"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2013.12.003"},{"key":"ref26","author":"pontryagin","year":"1964","journal-title":"The Mathematical Theory of Optimal Processes"},{"key":"ref25","first-page":"1","author":"laumond","year":"1998","journal-title":"Guidelines in nonholonomic motion planning for mobile robots"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/8581687\/08598791.pdf?arnumber=8598791","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:12:40Z","timestamp":1657746760000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8598791\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":29,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/lra.2018.2890433","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4]]}}}