{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T14:49:46Z","timestamp":1773931786346,"version":"3.50.1"},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Yangtze River Delta Sci-Tech innovation Community Joint Research","award":["2023CSJGG1700"],"award-info":[{"award-number":["2023CSJGG1700"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1109\/lra.2024.3392084","type":"journal-article","created":{"date-parts":[[2024,4,22]],"date-time":"2024-04-22T17:44:44Z","timestamp":1713807884000},"page":"5607-5614","source":"Crossref","is-referenced-by-count":6,"title":["Adaptive Lifelong Multi-Agent Path Finding With Multiple Priorities"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0027-0222","authenticated-orcid":false,"given":"Yingjie","family":"Hua","sequence":"first","affiliation":[{"name":"School of Internet of Things Engineering, Jiangnan University, Wuxi, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7700-8719","authenticated-orcid":false,"given":"Yan","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Internet of Things Engineering, Jiangnan University, Wuxi, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5743-8095","authenticated-orcid":false,"given":"ZHicheng","family":"Ji","sequence":"additional","affiliation":[{"name":"School of Internet of Things Engineering, Jiangnan University, Wuxi, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103766"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17466"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2023.102026"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-33274-7_6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103752"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2903261"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICARCV.2018.8581181"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v15i1.21767"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2020.103417"},{"key":"ref10","first-page":"1152","article-title":"Task and path planning for multi-agent pickup and delivery","volume-title":"Proc. Int. Joint Conf. Auton. Agents Multiagent Syst.","author":"Liu","year":"2019"},{"key":"ref11","article-title":"Lifelong multi-agent path finding for online pickup and delivery tasks","author":"Ma","year":"2017"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/IROS47612.2022.9981785"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v29i1.3474"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v10i1.18487"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i13.17344"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91086-4_4"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i9.21266"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/568"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33017643"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1609\/aiide.v1i1.18726"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2015.2445780"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","article-title":"The Hungarian method for the assignment problem","volume":"2","author":"Yaw","year":"1955","journal-title":"Nav. Res Logist Quart"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/10504377\/10506672.pdf?arnumber=10506672","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T19:29:36Z","timestamp":1734982176000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10506672\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6]]},"references-count":22,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/lra.2024.3392084","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6]]}}}