{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T10:36:14Z","timestamp":1779186974660,"version":"3.51.4"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"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":[[2020,4]]},"DOI":"10.1109\/lra.2020.2972787","type":"journal-article","created":{"date-parts":[[2020,2,11]],"date-time":"2020-02-11T02:00:05Z","timestamp":1581386405000},"page":"2483-2490","source":"Crossref","is-referenced-by-count":13,"title":["An Iterative Dynamic Programming Approach to the Multipoint Markov-Dubins Problem"],"prefix":"10.1109","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2855-9052","authenticated-orcid":false,"given":"Marco","family":"Frego","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0695-481X","authenticated-orcid":false,"given":"Paolo","family":"Bevilacqua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2418-6618","authenticated-orcid":false,"given":"Enrico","family":"Saccon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8813-8685","authenticated-orcid":false,"given":"Luigi","family":"Palopoli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5486-9989","authenticated-orcid":false,"given":"Daniele","family":"Fontanelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2018.03.029"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1002\/mma.4700"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.matcom.2019.10.001"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2017.7989282"},{"key":"ref10","article-title":"Accessibility region for a car that only moves forwards along optimal paths","author":"boissonnat","year":"1994"},{"key":"ref11","first-page":"2","article-title":"Shortest path synthesis for Dubins non-holonomic robot","author":"bui","year":"0","journal-title":"Proc IEEE Int Conf Robot Autom"},{"key":"ref12","article-title":"Dubins-curves: An open implementation of shortest paths for the forward only car","author":"walker","year":"2008"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2017.2666261"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2018.2847719"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.925814"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2017.2651940"},{"key":"ref17","first-page":"33","article-title":"T$^\\star$: Time-optimal risk-aware motion planning for curvature-constrained vehicles","volume":"4","author":"song","year":"2019","journal-title":"IEEE Robot Autom Lett"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2018.2795642"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.23919\/ECC.2018.8550215"},{"key":"ref28","article-title":"Clothoids: A C++ library with Matlab interface","author":"bertolazzi","year":"2019"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/0313012"},{"key":"ref27","first-page":"47","article-title":"Clothoids: A C++ library with Matlab interface for the handling of Clothoid curves","volume":"76","author":"bertolazzi","year":"2018","journal-title":"Rend Sem Mat Univ Pol Torino"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.2307\/2372560"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0921-8890(00)00127-5"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/99.660313"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01258291"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-019-00076-y"},{"key":"ref7","article-title":"A novel formalisation of the Markov-Dubins problem","author":"bevilacqua","year":"0","journal-title":"Proc Eur Control Conf"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-017-9923-8"},{"key":"ref9","article-title":"The shortest path synthesis for non-holonomic robots moving forwards","author":"bui","year":"1993"},{"key":"ref1","first-page":"250","article-title":"Some examples of the solution of a special kind of problem on greatest and least quantities","volume":"1","author":"markov","year":"1887","journal-title":"Soobshch Karkovsk Mat Obshch"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2923099"},{"key":"ref22","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","author":"lee","year":"2000","journal-title":"Algorithms - ESA 2000"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-016-0459-4"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2019.04.007"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/100816079"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.automatica.2017.08.020","article-title":"Semi-analytical minimum time solutions with velocity constraints for trajectory following of vehicles","volume":"86","author":"frego","year":"2017","journal-title":"Automatica"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.14733\/cadaps.2019.822-835"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/8932682\/08989830.pdf?arnumber=8989830","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:32:59Z","timestamp":1651080779000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8989830\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4]]},"references-count":33,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/lra.2020.2972787","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4]]}}}