{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T16:14:04Z","timestamp":1781367244028,"version":"3.54.1"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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","award":["62203093"],"award-info":[{"award-number":["62203093"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U22A2025"],"award-info":[{"award-number":["U22A2025"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62232007"],"award-info":[{"award-number":["62232007"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61991404"],"award-info":[{"award-number":["61991404"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001321","name":"Guangdong Basic and Applied Basic Research Foundation","doi-asserted-by":"publisher","award":["2021A1515110827"],"award-info":[{"award-number":["2021A1515110827"]}],"id":[{"id":"10.13039\/501100001321","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005047","name":"Natural Science Foundation of Liaoning Province","doi-asserted-by":"publisher","award":["2023-MSBA-074"],"award-info":[{"award-number":["2023-MSBA-074"]}],"id":[{"id":"10.13039\/501100005047","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Liaoning Provincial Science and Technology Plan Project\u2014Key Research and Development Department of Science and Technology","award":["2023JH2\/101300182"],"award-info":[{"award-number":["2023JH2\/101300182"]}]},{"name":"Fundo para o Desenvolvimento das Ciencias e da Tecnologia","award":["0047\/2021\/A1"],"award-info":[{"award-number":["0047\/2021\/A1"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["N2404021"],"award-info":[{"award-number":["N2404021"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Sci. Eng."],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/tase.2024.3440169","type":"journal-article","created":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T17:29:09Z","timestamp":1724779749000},"page":"6223-6233","source":"Crossref","is-referenced-by-count":24,"title":["Lexicographic Dual-Objective Path Finding in Multi-Agent Systems"],"prefix":"10.1109","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5858-4489","authenticated-orcid":false,"given":"Ziyan","family":"Zhao","sequence":"first","affiliation":[{"name":"State Key Laboratory of Synthetical Automation for Process Industries and the College of Information Science and Engineering, Northeastern University, Shenyang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Siyi","family":"Li","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Synthetical Automation for Process Industries and the College of Information Science and Engineering, Northeastern University, Shenyang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3404-9297","authenticated-orcid":false,"given":"Shixin","family":"Liu","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Synthetical Automation for Process Industries and the College of Information Science and Engineering, Northeastern University, Shenyang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5408-8752","authenticated-orcid":false,"given":"MengChu","family":"Zhou","sequence":"additional","affiliation":[{"name":"Macao Institute of Systems Engineering, Macau University of Science and Technology, Macau, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xingyang","family":"Li","sequence":"additional","affiliation":[{"name":"Faculty of Robot Science and Engineering, Northeastern University, Shenyang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6184-4771","authenticated-orcid":false,"given":"Xiaochun","family":"Yang","sequence":"additional","affiliation":[{"name":"Software College, Northeastern University, Shenyang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SMC53654.2022.9945343"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2024.3352658"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/tase.2024.3421889"},{"key":"ref4","article-title":"Lifelong multi-agent path finding for online pickup and delivery tasks","author":"Ma","year":"2017","journal-title":"arXiv:1705.10868"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2021.3135044"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v10i1.18510"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2015.2503143"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/tii.2024.3413335"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.001"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.11.006"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105809"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v30i1.6660"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v5i1.18315"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1982.4767270"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17466"},{"key":"ref17","first-page":"1","article-title":"Bounded suboptimal search: A direct approach using inadmissible estimates","volume-title":"Proc. 20nd Int. Joint Conf. Artif. Intell.","author":"Thayer"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v21i1.13474"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v25i1.13725"},{"key":"ref20","first-page":"1","article-title":"ICBS: Improved conflict-based search algorithm for multi-agent pathfinding","volume-title":"Proc. 24th Int. Joint Conf. Artif. Intell.","author":"Boyarski"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33016087"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v28i1.13883"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3096744"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2022.3183183"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2019.2953669"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2020.3027532"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/63"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2023.3292004"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.compind.2024.104131"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2024.124320"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2024.108477"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2022.3166815"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2020.1003539"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2021.3062994"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2019.2918691"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1002\/9781394188536"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/tase.2024.3360476"}],"container-title":["IEEE Transactions on Automation Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/8856\/10839176\/10649639.pdf?arnumber=10649639","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T17:49:23Z","timestamp":1741888163000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10649639\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/tase.2024.3440169","relation":{},"ISSN":["1545-5955","1558-3783"],"issn-type":[{"value":"1545-5955","type":"print"},{"value":"1558-3783","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}