{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T15:28:38Z","timestamp":1781018918204,"version":"3.54.1"},"reference-count":25,"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.9560985","type":"proceedings-article","created":{"date-parts":[[2021,10,20]],"date-time":"2021-10-20T00:28:35Z","timestamp":1634689715000},"page":"8786-8791","source":"Crossref","is-referenced-by-count":16,"title":["Multi-objective Conflict-based Search for Multi-agent Path Finding"],"prefix":"10.1109","author":[{"given":"Zhongqiang","family":"Ren","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sivakumar","family":"Rathinam","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Howie","family":"Choset","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2013.2283256"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.1109\/LRA.2021.3096744","article-title":"Subdimensional expansion for multi-objective multi-agent path finding","author":"ren","year":"2021"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1613\/jair.3987"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2011.2161872"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-46618-2_15"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"ref16","first-page":"117","article-title":"Cooperative pathfinding","author":"silver","year":"2005"},{"key":"ref17","article-title":"Multi-agent pathfinding: Definitions, variants, and benchmarks","author":"stern","year":"2019"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/115234.115368"},{"key":"ref19","article-title":"Modifying optimal sat-based approach to multi-agent path-finding problem to suboptimal variants","author":"surynek","year":"2017"},{"key":"ref4","volume":"16","author":"deb","year":"2001","journal-title":"Multi-Objective Optimization Using Evolutionary Algorithms"},{"key":"ref3","article-title":"Optimal and bounded-suboptimal multi-agent motion planning","author":"cohen","year":"2019","journal-title":"Twelfth Annual Symposium on Combinatorial Search"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref5","volume":"491","author":"ehrgott","year":"2005","journal-title":"Multicriteria Optimization"},{"key":"ref8","article-title":"Lifelong multi-agent path finding for online pickup and delivery tasks","author":"ma","year":"2017","journal-title":"Autonomous Agents and Multiagent Syst"},{"key":"ref7","article-title":"Push and swap: Fast cooperative path-finding with completeness guarantees","author":"luna","year":"2011","journal-title":"Twenty-Second International Joint Conference on Artificial Intelligence"},{"key":"ref2","article-title":"Icbs: improved conflict-based search algorithm for multi-agent pathfinding","author":"boyarski","year":"2015","journal-title":"Twenty-Fourth International Joint Conference on Artificial Intelligence"},{"key":"ref1","article-title":"Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem","author":"barer","year":"2014","journal-title":"Seventh Annual Symposium on Combinatorial Search"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1754399.1754400"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6630691"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.001"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1609\/icaps.v30i1.6655","article-title":"A simple and fast bi-objective search algorithm","volume":"30","author":"ulloa","year":"2020","journal-title":"Proceedings of the International Conference on Automated Planning and Scheduling"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CEC48606.2020.9185585"},{"key":"ref23","first-page":"380","article-title":"Fast and memory-efficient multi-agent pathfinding","author":"wang","year":"2008","journal-title":"ICAPS"},{"key":"ref25","doi-asserted-by":"crossref","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":"Twenty-Seventh AAAI Conference on Artificial Intelligence"}],"event":{"name":"2021 IEEE International Conference on Robotics and Automation (ICRA)","location":"Xi'an, China","start":{"date-parts":[[2021,5,30]]},"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\/09560985.pdf?arnumber=9560985","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T22:33:16Z","timestamp":1673562796000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9560985\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,30]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/icra48506.2021.9560985","relation":{},"subject":[],"published":{"date-parts":[[2021,5,30]]}}}