{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T11:05:30Z","timestamp":1782385530757,"version":"3.54.5"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Delta-NTU Corporate Laboratory"},{"name":"National Research Foundation Corporate Laboratory University Scheme"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1109\/lra.2020.3044834","type":"journal-article","created":{"date-parts":[[2020,12,14]],"date-time":"2020-12-14T20:54:19Z","timestamp":1607979259000},"page":"405-412","source":"Crossref","is-referenced-by-count":103,"title":["Efficient Trajectory Planning for Multiple Non-Holonomic Mobile Robots via Prioritized Trajectory Optimization"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1793-6775","authenticated-orcid":false,"given":"Juncheng","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0984-144X","authenticated-orcid":false,"given":"Maopeng","family":"Ran","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7137-4136","authenticated-orcid":false,"given":"Lihua","family":"Xie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICCA.2019.8899955"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2018.8594299"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2017.2663526"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2018.8462878"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2927938"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1177\/0278364917741532"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2018.2853613"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA40945.2020.9197162"},{"key":"ref16","first-page":"495","article-title":"An effective algorithmic framework for near optimal multi-robot path planning","author":"yu","year":"0","journal-title":"Proc of Robotics Res"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"1125","DOI":"10.1109\/LRA.2019.2894217","article-title":"Persistent and robust execution of mapf schedules in warehouses","volume":"4","author":"h\u00f6nig","year":"0","journal-title":"IEEE Robot Autom Lett"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2020.2976329"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2017.2656241"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-012-9321-0"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2012.6225009"},{"key":"ref27","article-title":"Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem","author":"barer","year":"0","journal-title":"the 7th Annual Symposium on Combinatorial Search"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2016.7759300"},{"key":"ref6","first-page":"835","article-title":"Prioritized planning algorithms for trajectory coordination of multiple mobile robots","volume":"12","author":"?\u00e1p","year":"0","journal-title":"IEEE Trans Automat Sci Eng"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0559-y"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2012.6385823"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2018.2794582"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7140034"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2016.2582745"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2019.2926390"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MSPEC.2008.4547508"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2008.4543489"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2018.2890572"},{"key":"ref21","first-page":"3","article-title":"Reciprocal n-body collision avoidance","author":"van den berg","year":"0","journal-title":"Proc of Robotics Res"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915576234"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2020.2964159"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2011.6094900"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2018.2793890"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/9285111\/09293348.pdf?arnumber=9293348","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:28Z","timestamp":1652194468000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9293348\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4]]},"references-count":31,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/lra.2020.3044834","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4]]}}}