{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T14:29:33Z","timestamp":1768314573113,"version":"3.49.0"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"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,10]]},"DOI":"10.1109\/lra.2020.3007435","type":"journal-article","created":{"date-parts":[[2020,7,7]],"date-time":"2020-07-07T20:01:35Z","timestamp":1594152095000},"page":"5307-5314","source":"Crossref","is-referenced-by-count":15,"title":["Minimum Time\u2014Minimum Jerk Optimal Traffic Management for AGVs"],"prefix":"10.1109","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2855-9052","authenticated-orcid":false,"given":"Marco","family":"Frego","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0695-481X","authenticated-orcid":false,"given":"Paolo","family":"Bevilacqua","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8781-1011","authenticated-orcid":false,"given":"Stefano","family":"Divan","sequence":"additional","affiliation":[]},{"given":"Fabiano","family":"Zenatti","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8813-8685","authenticated-orcid":false,"given":"Luigi","family":"Palopoli","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8098-7965","authenticated-orcid":false,"given":"Francesco","family":"Biral","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5486-9989","authenticated-orcid":false,"given":"Daniele","family":"Fontanelli","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.23919\/ECC.2019.8795770"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICIInfS.2013.6732028"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.3182\/20060906-3-IT-2910.00023"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2017.08.020"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/mma.3114"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2018.03.029"},{"key":"ref16","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":"ref17","article-title":"Clothoids: A C++ library with Matlab interface","author":"bertolazzi","year":"2019"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2018.2795642"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33017651"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2007.909810"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139465"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2007.09.020"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ETFA.2013.6647973"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2015.2505646"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2015.2446614"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2015.2445780"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-018-9730-9"},{"key":"ref1","first-page":"9","article-title":"A probabilistic method for planning collision-free trajectories of multiple mobile robots","author":"bennewitz","year":"0","journal-title":"Proc 14th Eur Conf Artif Intell"},{"key":"ref20","first-page":"1093","article-title":"A polynomial algorithm in linear programming","volume":"244","author":"khachiyan","year":"1979","journal-title":"Doklady Akademii Nauk"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.23"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63499"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/MCS.2006.1700047"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80086-7"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1002\/oca.2376"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-008-9381-7"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/9133350\/09134875.pdf?arnumber=9134875","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:33:57Z","timestamp":1651080837000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9134875\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10]]},"references-count":26,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/lra.2020.3007435","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10]]}}}