{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T15:36:38Z","timestamp":1777390598629,"version":"3.51.4"},"reference-count":33,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,12,4]],"date-time":"2023-12-04T00:00:00Z","timestamp":1701648000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,12,4]],"date-time":"2023-12-04T00:00:00Z","timestamp":1701648000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100016311","name":"Arm","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100016311","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000915","name":"Richard King Mellon Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000915","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,12,4]]},"DOI":"10.1109\/mrs60187.2023.10416794","type":"proceedings-article","created":{"date-parts":[[2024,2,5]],"date-time":"2024-02-05T18:32:59Z","timestamp":1707157979000},"page":"8-14","source":"Crossref","is-referenced-by-count":14,"title":["Solving Multi-Agent Target Assignment and Path Finding with a Single Constraint Tree"],"prefix":"10.1109","author":[{"given":"Yimin","family":"Tang","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, 5000 Forbes Ave,Robotics Institute,Pittsburgh,PA,USA,15213"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongqiang","family":"Ren","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, 5000 Forbes Ave,Robotics Institute,Pittsburgh,PA,USA,15213"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaoyang","family":"Li","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, 5000 Forbes Ave,Robotics Institute,Pittsburgh,PA,USA,15213"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katia","family":"Sycara","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, 5000 Forbes Ave,Robotics Institute,Pittsburgh,PA,USA,15213"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v24i1.7564"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v27i1.8541"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"ref4","first-page":"1144","article-title":"Optimal target assignment and path finding for teams of agents","volume-title":"Proceedings of the 2016 International Conference on Autonomous Agents Multiagent Systems, ser. AAMAS \u201916","author":"Ma"},{"key":"ref5","first-page":"757","article-title":"Conflict-based search with optimal task assignment","volume-title":"Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, ser. AAMAS \u201918","author":"H\u00f6nig"},{"key":"ref6","first-page":"131","article-title":"Multi-agent path finding for uav traffic management","volume-title":"Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, ser. AAMAS \u201919","author":"Ho"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2015.2414447"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i13.17344"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2502"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10409"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(87)90017-5"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1287\/opre.16.3.682"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1609\/aiide.v2i1.18756"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/aiide.v1i1.18726"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v15i1.21767"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103662"},{"key":"ref17","article-title":"Push and swap: Fast cooperative pathfinding with completeness guarantees","volume-title":"Proceedings of the TwentySecond International Joint Conference on Artificial Intelligence (IJCAI)","author":"Luna"},{"key":"ref18","first-page":"380","article-title":"Fast and memory-efficient multi-agent pathfinding","volume-title":"Proceedings of the Eighteenth International Conference on International Conference on Automated Planning and Scheduling, ser. ICAPS\u201908","author":"Wang"},{"key":"ref19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0303-9","volume-title":"Handbook of combinatorial optimization","volume":"4","author":"Du","year":"1998"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/0105003"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1956-045-5"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.21236\/ad0249662"},{"key":"ref24","volume-title":"The dynamic hungarian algorithm for the assignment problem with changing costs","author":"Mills-Tettey","year":"2007"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/IROS40897.2019.8968096"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v10i1.18487"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48506.2021.9561779"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2023.3266993"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3074883"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA46639.2022.9812020"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2023.103946"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.15575\/join.v6i1.692"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v10i1.18510"}],"event":{"name":"2023 International Symposium on Multi-Robot and Multi-Agent Systems (MRS)","location":"Boston, MA, USA","start":{"date-parts":[[2023,12,4]]},"end":{"date-parts":[[2023,12,5]]}},"container-title":["2023 International Symposium on Multi-Robot and Multi-Agent Systems (MRS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10416762\/10416768\/10416794.pdf?arnumber=10416794","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,6]],"date-time":"2024-02-06T22:45:11Z","timestamp":1707259511000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10416794\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,4]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/mrs60187.2023.10416794","relation":{},"subject":[],"published":{"date-parts":[[2023,12,4]]}}}