{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T16:54:34Z","timestamp":1769273674627,"version":"3.49.0"},"reference-count":19,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100004770","name":"Universit\u00e0 degli Studi di Parma","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004770","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1109\/tac.2022.3172169","type":"journal-article","created":{"date-parts":[[2022,5,3]],"date-time":"2022-05-03T19:57:53Z","timestamp":1651607873000},"page":"1910-1917","source":"Crossref","is-referenced-by-count":7,"title":["Solution Algorithms for the Bounded Acceleration Shortest Path Problem"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1426-0834","authenticated-orcid":false,"given":"Stefano","family":"Ardizzoni","sequence":"first","affiliation":[{"name":"Dipartimento di Ingegneria e Architettura, Universit&#x00E0; degli Studi di Parma, Parma, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3577-9398","authenticated-orcid":false,"given":"Luca","family":"Consolini","sequence":"additional","affiliation":[{"name":"Dipartimento di Ingegneria e Architettura, Universit&#x00E0; degli Studi di Parma, Parma, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9965-8803","authenticated-orcid":false,"given":"Mattia","family":"Laurini","sequence":"additional","affiliation":[{"name":"Dipartimento di Ingegneria e Architettura, Universit&#x00E0; degli Studi di Parma, Parma, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7138-8653","authenticated-orcid":false,"given":"Marco","family":"Locatelli","sequence":"additional","affiliation":[{"name":"Dipartimento di Ingegneria e Architettura, Universit&#x00E0; degli Studi di Parma, Parma, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"8","article-title":"Safe path planning using cell decomposition approximation","volume-title":"Proc. Int. Conf. Distance Learn. Simul. Commun.","author":"Abbadi","year":"2015"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.5815\/ijisa.2015.05.04"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2009.5160149"},{"key":"ref4","article-title":"Shortest paths in FIFO time-dependent networks: Theory and algorithms","author":"Dean","year":"2004"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2020.0985"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199805)31:3<193::AID-NET6>3.0.CO;2-A"},{"key":"ref7","volume-title":"Problem-Solving Methods in Artificial Intelligence","author":"Nilsson","year":"1971"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2003.12.001"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-48113-3_22"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-69814-4_56"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1177\/027836498600500304"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2017.8206519"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2015.07.001"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.3182\/20110828-6-IT-1002.03132"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2009.2028959"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfranklin.2020.05.024"},{"key":"ref17","article-title":"The bounded acceleration shortest path problem: Complexity and solution algorithms","author":"Ardizzoni","year":"2021"},{"issue":"1","key":"ref18","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0004-3702(77)90005-4","article-title":"On the optimality of A*","volume":"8","author":"Gelperin","year":"1977","journal-title":"Artif. Intell."},{"key":"ref19","volume-title":"Heuristic Search: Theory and Applications","author":"Edelkamp","year":"2011"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/10056266\/09767776.pdf?arnumber=9767776","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T22:56:19Z","timestamp":1705964179000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9767776\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3]]},"references-count":19,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tac.2022.3172169","relation":{},"ISSN":["0018-9286","1558-2523","2334-3303"],"issn-type":[{"value":"0018-9286","type":"print"},{"value":"1558-2523","type":"electronic"},{"value":"2334-3303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3]]}}}