{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T20:06:38Z","timestamp":1785614798039,"version":"3.56.0"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"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":[[2021,10]]},"DOI":"10.1109\/lra.2021.3096744","type":"journal-article","created":{"date-parts":[[2021,7,28]],"date-time":"2021-07-28T19:54:05Z","timestamp":1627502045000},"page":"7153-7160","source":"Crossref","is-referenced-by-count":22,"title":["Subdimensional Expansion for Multi-Objective Multi-Agent Path Finding"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2880-8653","authenticated-orcid":false,"given":"Zhongqiang","family":"Ren","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9223-7456","authenticated-orcid":false,"given":"Sivakumar","family":"Rathinam","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5434-7945","authenticated-orcid":false,"given":"Howie","family":"Choset","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","first-page":"1443","article-title":"Structure and intractability of optimal multi-robot path planning on graphs","author":"yu","year":"0","journal-title":"Proc 27th AAAI Conf Artif Intell"},{"key":"ref32","first-page":"9","article-title":"Coordinating hundreds of cooperative, autonomous vehicles in warehouses","volume":"29","author":"wurman","year":"2008","journal-title":"AI Mag"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CEC48606.2020.9185585"},{"key":"ref30","first-page":"380","article-title":"Fast and memory-efficient multi-agent pathfinding","year":"0","journal-title":"Proc 8th Int Conf Automat Plan Scheduling"},{"key":"ref10","first-page":"294","article-title":"Push and swap: Fast cooperative path-finding with completeness guarantees","author":"luna","year":"0","journal-title":"Proc 22nd Int Joint Conf Artif Intell"},{"key":"ref11","first-page":"7643","article-title":"Searching with consistent prioritization for multi-agent path finding","volume":"33","year":"0","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref12","first-page":"218","article-title":"A new approach to multiobjective a* search","author":"mandow","year":"0","journal-title":"Proc 19th Int Joint Conf Artif Intell"},{"key":"ref13","author":"pearl","year":"1984","journal-title":"Intelligent Search Strategies for Computer Problem Solving"},{"key":"ref14","article-title":"Multi-objective conflict-based search for multi-agent path finding","author":"ren","year":"0","journal-title":"Proc IEEE Int Conf Robot Automat"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1613\/jair.3987"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.01.007"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-46618-2_15"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1609\/aiide.v1i1.18726","article-title":"Cooperative pathfinding","volume":"1","author":"silver","year":"2005","journal-title":"AIIDE"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1609\/icaps.v27i1.13866","article-title":"Path planning for multiple agents under uncertainty","volume":"27","author":"wagner","year":"0","journal-title":"Proc 27th Int Conf Automat Plan Scheduling"},{"key":"ref4","first-page":"29","article-title":"Search-based optimal solvers for the multi-agent pathfinding problem: Summary and challenges","author":"felner","year":"0","journal-title":"Proc 10th Annu Symp Combinatorial Search"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.001"},{"key":"ref3","volume":"491","author":"ehrgott","year":"2005","journal-title":"Multicriteria Optimization"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2012.6225297"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4171"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"12353","DOI":"10.1609\/aaai.v35i14.17466","article-title":"EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding","volume":"35","author":"li","year":"0","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2017.7989656"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2019.XV.072"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1145\/358172.358406","article-title":"Optimal paths in graphs with stochastic or multidimensional weights","volume":"26","author":"prescott","year":"1983","journal-title":"Commun ACM"},{"key":"ref1","first-page":"740","article-title":"ICBS: Improved conflict-based search algorithm for multi-agent pathfinding","author":"boyarski","year":"0","journal-title":"Proc 24th Int Joint Conf Artif Intell"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S1474-0346(03)00018-1"},{"key":"ref22","first-page":"151","article-title":"Multi-agent pathfinding: Definitions, variants, and benchmarks","author":"stern","year":"0","journal-title":"Twelfth Annual Symposium on Combinatorial Search"},{"key":"ref21","first-page":"173","article-title":"Finding optimal solutions to cooperative pathfinding problems","author":"standley","year":"0","journal-title":"Proc 24th AAAI Conf Artif Intell"},{"key":"ref24","article-title":"Modifying optimal SAT-based approach to multi-agent path-finding problem to suboptimal variants","author":"surynek","year":"0"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1145\/115234.115368","volume":"38","author":"bradley","year":"1991","journal-title":"J ACM"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1609\/icaps.v30i1.6655","volume":"30","author":"ulloa","year":"0","journal-title":"Proc Int Conf Automated Planning Scheduling"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6630691"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/9475905\/09484849.pdf?arnumber=9484849","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,5]],"date-time":"2023-01-05T19:53:51Z","timestamp":1672948431000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9484849\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10]]},"references-count":33,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/lra.2021.3096744","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10]]}}}