{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T09:41:18Z","timestamp":1762076478737,"version":"build-2065373602"},"reference-count":32,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,10,9]],"date-time":"2022-10-09T00:00:00Z","timestamp":1665273600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,10,9]],"date-time":"2022-10-09T00:00:00Z","timestamp":1665273600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,10,9]]},"DOI":"10.1109\/smc53654.2022.9945343","type":"proceedings-article","created":{"date-parts":[[2022,11,18]],"date-time":"2022-11-18T20:49:04Z","timestamp":1668804544000},"page":"1862-1867","source":"Crossref","is-referenced-by-count":2,"title":["Conflict-Based Search and Improvement Strategies for Solving a New Lexicographic Bi-Objective Multi-Agent Path Finding Problem"],"prefix":"10.1109","author":[{"given":"Siyi","family":"Li","sequence":"first","affiliation":[{"name":"Northeastern University,College of Information Science and Engineering,Shenyang,China,110819"}]},{"given":"Xingyang","family":"Li","sequence":"additional","affiliation":[{"name":"Northeastern University,Faculty of Robot Science and Engineering,Shenyang,China,110819"}]},{"given":"Mengchu","family":"Zhou","sequence":"additional","affiliation":[{"name":"New Jersey Institute of Technology,Department of Electrical and Computer Engineering,Newark,NJ,USA,07102"}]},{"given":"Ziyan","family":"Zhao","sequence":"additional","affiliation":[{"name":"Northeastern University,College of Information Science and Engineering,Shenyang,China,110819"}]},{"given":"Shixin","family":"Liu","sequence":"additional","affiliation":[{"name":"Northeastern University,College of Information Science and Engineering,Shenyang,China,110819"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICNSC.2019.8743188"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.12.063"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2020.1003114"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v27i1.8541"},{"key":"ref11","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":"Proceedings of the Annual Symposium on Combinatorial Search (SOCS)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1982.4767270"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1609\/icaps.v25i1.13725","article-title":"Don’t Split, Try To Work It Out: Bypassing Conflicts in Multi-Agent Pathfinding","author":"boyarski","year":"2015","journal-title":"Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS)"},{"key":"ref14","first-page":"740","article-title":"ICBS: Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding","author":"boyarski","year":"2015","journal-title":"Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33016087"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v30i1.6661"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/63"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2021.04.140"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2901834"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICNSC48988.2020.9238060"},{"key":"ref4","first-page":"4423","article-title":"CoBots: Robust symbiotic autonomous mobile service robots","author":"veloso","year":"2015","journal-title":"Proceedings of the International Joint Conference on Artificial Intelligence(IJCAI)"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2020.1003177"},{"key":"ref3","first-page":"9","article-title":"Coordinating hundreds of cooperative, autonomous vehicles in warehouses","volume":"29","author":"wurman","year":"2008","journal-title":"AI Magazine"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2020.3027532"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/WOCC48579.2020.9114917"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2019.2953669"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2021.3133601"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2020.1003539"},{"key":"ref2","first-page":"837","article-title":"Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks","author":"ma","year":"2017","journal-title":"International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"ref1","first-page":"131","article-title":"Multi-Agent Path Finding for UAV Traffic Management","author":"ho","year":"2019","journal-title":"Proceedings of the International Conference on Autonomous and Multiagent Systems (AAMAS)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17466"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v30i1.6660"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/179"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2021.1003817"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2021.3062994"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2020.1003462"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/SMC42975.2020.9283072"}],"event":{"name":"2022 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","start":{"date-parts":[[2022,10,9]]},"location":"Prague, Czech Republic","end":{"date-parts":[[2022,10,12]]}},"container-title":["2022 IEEE International Conference on Systems, Man, and Cybernetics (SMC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9945068\/9945069\/09945343.pdf?arnumber=9945343","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T19:55:44Z","timestamp":1670874944000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9945343\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,9]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/smc53654.2022.9945343","relation":{},"subject":[],"published":{"date-parts":[[2022,10,9]]}}}