{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:38:18Z","timestamp":1764175098684,"version":"3.28.0"},"reference-count":37,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,5,30]],"date-time":"2021-05-30T00:00:00Z","timestamp":1622332800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,5,30]],"date-time":"2021-05-30T00:00:00Z","timestamp":1622332800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,5,30]],"date-time":"2021-05-30T00:00:00Z","timestamp":1622332800000},"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":[],"published-print":{"date-parts":[[2021,5,30]]},"DOI":"10.1109\/icra48506.2021.9560883","type":"proceedings-article","created":{"date-parts":[[2021,10,20]],"date-time":"2021-10-20T00:28:35Z","timestamp":1634689715000},"page":"7950-7956","source":"Crossref","is-referenced-by-count":5,"title":["Multi-Robot Motion Planning with Unlabeled Goals for Mobile Robots with Differential Constraints"],"prefix":"10.1109","author":[{"given":"Duong","family":"Le","sequence":"first","affiliation":[]},{"given":"Erion","family":"Plaku","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/IROS40897.2019.8968483"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1177\/0278364916672311"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"article-title":"Principles of Robot Motion: Theory, Algorithms, and Implementations","year":"2005","author":"choset","key":"ref30"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1177\/02783640122067453"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2015.2424031"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/0105003"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.5220\/0006184504510458"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1609\/icaps.v29i1.3474","article-title":"A multi-label a* algorithm for multi-agent pathfinding","volume":"29","author":"grenouilleau","year":"2019","journal-title":"International Conference on Automated Planning and Scheduling"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1609\/icaps.v29i1.3487","article-title":"Disjoint splitting for multi-agent path finding with conflict-based search","volume":"29","author":"li","year":"2019","journal-title":"International Conference on Automated Planning and Scheduling"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/179"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.001"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1609\/aaai.v27i1.8592","article-title":"A general formal framework for pathfinding problems with multiple agents","author":"erdem","year":"2013","journal-title":"AAAI Conference on Artificial Intelligence"},{"key":"ref17","first-page":"76","article-title":"A polynomialtime algorithm for non-optimal multi-agent pathfinding","author":"khorshid","year":"2011","journal-title":"Symposium on Combinatorial Search"},{"key":"ref18","first-page":"88","article-title":"Multi-agent pathfinding with simultaneous execution of single-agent primitives","author":"sajid","year":"2012","journal-title":"Symposium on Combinatorial Search"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4447"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2020.2967326"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"1443","DOI":"10.1609\/aaai.v27i1.8541","article-title":"Structure and intractability of optimal multi-robot path planning on graphs","author":"yu","year":"2013","journal-title":"AAAI Conference on Artificial Intelligence"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-51532-8_30"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2898087"},{"key":"ref6","first-page":"19","article-title":"Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem","author":"barer","year":"2014","journal-title":"Symposium on Combinatorial Search"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s10514-019-09832-9","article-title":"drrt*: Scalable and informed asymptotically-optimal multi-robot motion planning","volume":"44","author":"shome","year":"2020","journal-title":"Autonomous Robots"},{"key":"ref5","first-page":"117","article-title":"Cooperative pathfinding","volume":"1","author":"silver","year":"2005","journal-title":"AAAI Artificial Intelligence and Interactive Digital Entertainment"},{"key":"ref8","first-page":"668","article-title":"Complete algorithms for cooperative pathfinding problems","author":"standley","year":"2011","journal-title":"International Joint Conference on Artificial Intelligence"},{"key":"ref7","first-page":"80","article-title":"Improving collaborative pathfinding using map abstraction","author":"sturtevant","year":"2006","journal-title":"AAAI Artificial Intelligence and Interactive Digital Entertainment"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.11244"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4171"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1609\/icaps.v27i1.13854","article-title":"Cooperative multi-robot sampling-based motion planning with dynamics","author":"le","year":"2017","journal-title":"International Conference on Planning and Scheduling"},{"key":"ref20","first-page":"2024","article-title":"Multi-agent path finding on strongly biconnected digraphs","author":"botea","year":"2015","journal-title":"AAAI Conference on Artificial Intelligence"},{"key":"ref22","first-page":"151","article-title":"Multi-agent pathfinding: Definitions, variants, and benchmarks","author":"stern","year":"2019","journal-title":"Symposium on Combinatorial Search"},{"key":"ref21","first-page":"29","article-title":"Search-based optimal solvers for the multi-agent pathfinding problem: Summary and challenges","author":"felner","year":"2017","journal-title":"Symposium on Combinatorial Search"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2886245"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-33274-7_6"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2408"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2016.7759489"}],"event":{"name":"2021 IEEE International Conference on Robotics and Automation (ICRA)","start":{"date-parts":[[2021,5,30]]},"location":"Xi'an, China","end":{"date-parts":[[2021,6,5]]}},"container-title":["2021 IEEE International Conference on Robotics and Automation (ICRA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9560720\/9560666\/09560883.pdf?arnumber=9560883","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T22:52:20Z","timestamp":1673563940000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9560883\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,30]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/icra48506.2021.9560883","relation":{},"subject":[],"published":{"date-parts":[[2021,5,30]]}}}