{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T01:21:53Z","timestamp":1770081713983,"version":"3.49.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach. Intell. Res."],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1007\/s11633-025-1569-x","type":"journal-article","created":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T14:11:43Z","timestamp":1770041503000},"page":"147-167","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Energy-limited Lifelong Multi-agent Pickup and Delivery"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5914-4178","authenticated-orcid":false,"given":"Mingkai","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9220-0792","authenticated-orcid":false,"given":"Lu","family":"Gan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4222-9060","authenticated-orcid":false,"given":"Yuanhang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0287-6949","authenticated-orcid":false,"given":"Xiaoyang","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0272-3045","authenticated-orcid":false,"given":"Hongji","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5930-4170","authenticated-orcid":false,"given":"Jin","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,2]]},"reference":[{"issue":"2","key":"1569_CR1","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1109\/TETCI.2022.3141105","volume":"6","author":"J Duan","year":"2022","unstructured":"J. Duan, S. Yu, H. L. Tan, H. Zhu, C. Tan. A survey of embodied AI: From simulators to research tasks. IEEE Transactions on Emerging Topics in Computational Intelligence, vol. 6, no. 2, pp. 230\u2013244, 2022. DOI: https:\/\/doi.org\/10.1109\/TETCI.2022.3141105.","journal-title":"IEEE Transactions on Emerging Topics in Computational Intelligence"},{"key":"1569_CR2","volume-title":"Aligning cyber space with physical world: A comprehensive survey on embodied AI","author":"Y Liu","year":"2025","unstructured":"Y. Liu, W. Chen, Y. Bai, X. Liang, G. Li, W. Gao, L. Lin. Aligning cyber space with physical world: A comprehensive survey on embodied AI, [Online], Available: https:\/\/arxiv.org\/abs\/2407.06886, 2025."},{"key":"1569_CR3","volume-title":"From machine learning to robotics: Challenges and opportunities for embodied intelligence","author":"N Roy","year":"2025","unstructured":"N. Roy, I. Posner, T. Barfoot, P. Beaudoin, Y. Bengio, J. Bohg, O. Brock, I. Depatie, D. Fox, D. Koditschek, T. Lozano-Perez, V. Mansinghka, C. Pal, B. Richards, D. Sadigh, S. Schaal, G. Sukhatme, D. Therien, M. Toussaint, M. Van de Panne. From machine learning to robotics: Challenges and opportunities for embodied intelligence, [Online], Available: https:\/\/arxiv.org\/abs\/2110.15245, 2025."},{"key":"1569_CR4","doi-asserted-by":"publisher","unstructured":"P. R. Wurman, R. D\u2019Andrea, M. Mountz. Coordinating hundreds of cooperative, autonomous vehicles in warehouses. AI Magazine, vol. 29, no. 1, Article number 9, 2008. DOI: https:\/\/doi.org\/10.1609\/aimag.v29i1.2082.","DOI":"10.1609\/aimag.v29i1.2082"},{"key":"1569_CR5","doi-asserted-by":"publisher","first-page":"9925","DOI":"10.1609\/aaai.v34i06.6547","volume-title":"Proceedings of the 34th AAAI Conference on Artificial Intelligence","author":"N M Kou","year":"2020","unstructured":"N. M. Kou, C. Peng, H. Ma, T. K. S. Kumar, S. Koenig. Idle time optimization for target assignment and path finding in sortation centers. In Proceedings of the 34th AAAI Conference on Artificial Intelligence, New York, USA, pp. 9925\u20139932, 2020. DOI: https:\/\/doi.org\/10.1609\/aaai.v34i06.6547."},{"key":"1569_CR6","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2024\/28","volume-title":"Proceedings of the 32nd International Joint Conference on Artificial Intelligence","author":"M Tang","year":"2024","unstructured":"M. Tang, Y. Li, H. Liu, Y. Chen, M. Liu, L. Wang. MGCBS: An optimal and efficient algorithm for solving multi-goal multi-agent path finding problem. In Proceedings of the 32nd International Joint Conference on Artificial Intelligence, Jeju, Republic of Korea, Article number 28, 2024. DOI: https:\/\/doi.org\/10.24963\/ijcai.2024\/28."},{"key":"1569_CR7","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/611","volume-title":"Proceedings of the 32nd International Joint Conference on Artificial Intelligence","author":"Y Zhang","year":"2023","unstructured":"Y. Zhang, M. C. Fontaine, V. Bhatt, S. Nikolaidis, J. Li. Multi-robot coordination and layout design for automated warehousing. In Proceedings of the 32nd International Joint Conference on Artificial Intelligence, Macao, China, Article number 611, 2023. DOI: https:\/\/doi.org\/10.24963\/ijcai.2023\/611."},{"key":"1569_CR8","doi-asserted-by":"publisher","unstructured":"J. Gao, Y. Li, X. Li, K. Yan, K. Lin, X. Wu. A review of graph-based multi-agent pathfinding solvers: From classical to beyond classical. Knowledge-Based Systems, vol. 283, Article number 111121, 2023. DOI: https:\/\/doi.org\/10.1016\/j.knosys.2023.111121.","DOI":"10.1016\/j.knosys.2023.111121"},{"issue":"1","key":"1569_CR9","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1609\/socs.v10i1.18510","volume":"10","author":"R Stern","year":"2019","unstructured":"R. Stern, N. Sturtevant, A. Felner, S. Koenig, H. Ma, T. Walker, J. Li, D. Atzmon, L. Cohen, T. K. Kumar, R. Bart\u00e1k, E. Boyarski. Multi-agent pathfinding: Definitions, variants, and benchmarks. In Proceedings of the 12th Annual Symposium on Combinatorial Search, Napa, USA, vol. 10, no. 1, pp. 151\u2013158, 2019. DOI: https:\/\/doi.org\/10.1609\/socs.v10i1.18510.","journal-title":"Proceedings of the 12th Annual Symposium on Combinatorial Search"},{"key":"1569_CR10","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1609\/icaps.v34i1.31534","volume":"34","author":"Y Zhang","year":"2024","unstructured":"Y. Zhang, Z. Chen, D. Harabor, P. Le Bodic, P. J. Stuckey. Planning and execution in multi-agent path finding: Models and algorithms. In Proceedings of the 34th International Conference on Automated Planning and Scheduling, Alberta, Canada, vol. 34, pp. 707\u2013715, 2024. DOI: https:\/\/doi.org\/10.1609\/icaps.v34i1.31534.","journal-title":"Proceedings of the 34th International Conference on Automated Planning and Scheduling"},{"key":"1569_CR11","first-page":"2183","volume-title":"Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems","author":"S H Chan","year":"2024","unstructured":"S. H. Chan, Z. Chen, D. L. Lin, Y. Zhang, D. Harabor, S. Koenig, T. W. Huang, T. Phan. Anytime multi-agent path finding using operation parallelism in large neighborhood search. In Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, Auckland, New Zealand, pp. 2183\u20132185, 2024."},{"key":"1569_CR12","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1609\/socs.v17i1.31565","volume":"17","author":"H Jiang","year":"2024","unstructured":"H. Jiang, Y. Zhang, R. Veerapaneni, J. Li. Scaling lifelong multi-agent path finding to more realistic settings: Research challenges and opportunities. In Proceedings of the 17th International Symposium on Combinatorial Search, Kananaskis, Canada, vol. 17, pp. 234\u2013242, 2024. DOI: https:\/\/doi.org\/10.1609\/socs.v17i1.31565.","journal-title":"Proceedings of the 17th International Symposium on Combinatorial Search"},{"key":"1569_CR13","first-page":"1711","volume-title":"Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems","author":"O Salzman","year":"2020","unstructured":"O. Salzman, R. Stern. Research challenges and opportunities in multi-agent path finding and multi-agent pickup and delivery problems. In Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems, Auckland, New Zealand, pp. 1711\u20131715, 2020."},{"key":"1569_CR14","doi-asserted-by":"publisher","first-page":"11272","DOI":"10.1609\/aaai.v35i13.17344","volume-title":"Proceedings of the 35th AAAI Conference on Artificial Intelligence","author":"J Li","year":"2021","unstructured":"J. Li, A. Tinka, S. Kiesel, J. W. Durham, T. K. S. Kumar, S. Koenig. Lifelong multi-agent path finding in large-scale warehouses. In Proceedings of the 35th AAAI Conference on Artificial Intelligence, pp. 11272\u201311281, 2021. DOI: https:\/\/doi.org\/10.1609\/aaai.v35i13.17344."},{"key":"1569_CR15","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-030-46212-3_24","volume-title":"Proceedings of the 5th International Conference on the Industry 4.0 Model for Advanced Manufacturing","author":"A Bogatarkan","year":"2020","unstructured":"A. Bogatarkan, E. Erdem, A. Kleiner, V. Patoglu. Multimodal multi-agent path finding with optimal resource utilization. Proceedings of the 5th International Conference on the Industry 4.0 Model for Advanced Manufacturing, L. Wang, V. D. Majstorovic, D. Mourtzis, E. Carpanzano, G. Moroni, L. M. Galantucci, Eds., Cham, Germany: Springer, pp. 313\u2013324, 2020. DOI: https:\/\/doi.org\/10.1007\/978-3-030-46212-3_24."},{"key":"1569_CR16","first-page":"837","volume-title":"Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems","author":"H Ma","year":"2017","unstructured":"H. Ma, J. Li, T. K. S. Kumar, S. Koenig. Lifelong multiagent path finding for online pickup and delivery tasks. In Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, S\u00e3o Paulo, Brazil, pp. 837\u2013845, 2017."},{"issue":"2","key":"1569_CR17","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1109\/LRA.2020.2967317","volume":"5","author":"H Wang","year":"2020","unstructured":"H. Wang, M. Rubenstein. Walk, stop, count, and swap: Decentralized multi-agent path finding with theoretical guarantees. IEEE Robotics and Automation Letters, vol. 5, no. 2, pp. 1119\u20131126, 2020. DOI: https:\/\/doi.org\/10.1109\/LRA.2020.2967317.","journal-title":"IEEE Robotics and Automation Letters"},{"key":"1569_CR18","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2018.8490436","volume-title":"Proceedings of IEEE Conference on Computational Intelligence and Games","author":"D Sigurdson","year":"2018","unstructured":"D. Sigurdson, V. Bulitko, W. Yeoh, C. Hern\u00e1ndez, S. Koenig. Multi-agent pathfinding with real-time heuristic search. In Proceedings of IEEE Conference on Computational Intelligence and Games, Maastricht, Netherlands, 2018. DOI: https:\/\/doi.org\/10.1109\/CIG.2018.8490436."},{"key":"1569_CR19","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/28","volume-title":"Proceedings of the 32nd International Joint Conference on Artificial Intelligence","author":"K Okumura","year":"2023","unstructured":"K. Okumura. Improving LaCAM for scalable eventually optimal multi-agent pathfinding. In Proceedings of the 32nd International Joint Conference on Artificial Intelligence, Macao, China, Article number 28, 2023. DOI: https:\/\/doi.org\/10.24963\/ijcai.2023\/28."},{"issue":"1","key":"1569_CR20","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1609\/aiide.v1i1.18726","volume":"1","author":"D Silver","year":"2005","unstructured":"D. Silver. Cooperative pathfinding. In Proceedings of the 1st Artificial Intelligence and Interactive Digital Entertainment, Marina Del Rey, USA, vol. 1, no. 1, pp. 117\u2013122, 2005. DOI: https:\/\/doi.org\/10.1609\/aiide.v1i1.18726.","journal-title":"Proceedings of the 1st Artificial Intelligence and Interactive Digital Entertainment"},{"key":"1569_CR21","doi-asserted-by":"publisher","first-page":"10256","DOI":"10.1609\/aaai.v36i9.21266","volume-title":"Proceedings of the 36th AAAI Conference on Artificial Intelligence","author":"J Li","year":"2022","unstructured":"J. Li, Z. Chen, D. Harabor, P. J. Stuckey, S. Koenig. MAPF-LNS2: Fast repairing for multi-agent path finding via large neighborhood search. In Proceedings of the 36th AAAI Conference on Artificial Intelligence, Vancouver, Canada, pp. 10256\u201310265, 2022. DOI: https:\/\/doi.org\/10.1609\/aaai.v36i9.21266."},{"key":"1569_CR22","doi-asserted-by":"publisher","first-page":"4127","DOI":"10.24963\/ijcai.2021\/568","volume-title":"Proceedings of the 13th International Joint Conference on Artificial Intelligence","author":"J Li","year":"2021","unstructured":"J. Li, Z. Chen, D. Harabor, P. J. Stuckey, S. Koenig. Anytime multi-agent path finding via large neighborhood search. In Proceedings of the 13th International Joint Conference on Artificial Intelligence, Montreal, Canada, pp. 4127\u20134135, 2021. DOI: https:\/\/doi.org\/10.24963\/ijcai.2021\/568."},{"issue":"1","key":"1569_CR23","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/BF01840371","volume":"2","author":"M Erdmann","year":"1987","unstructured":"M. Erdmann, T. Lozano-P\u00e9rez. On multiple moving objects. Algorithmica, vol. 2, no. 1, pp. 477\u2013521, 1987. DOI: https:\/\/doi.org\/10.1007\/BF01840371.","journal-title":"Algorithmica"},{"issue":"1","key":"1569_CR24","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1609\/socs.v6i1.18343","volume":"6","author":"E Boyarski","year":"2015","unstructured":"E. Boyarski, A. Felner, R. Stern, G. Sharon, O. Betzalel, D. Tolpin, E. Shimony. ICBS: The improved conflictbased search algorithm for multi-agent pathfinding. In Proceedings of the 8th Annual Symposium on Combinatorial Search, Ein Gedi, Israel, vol. 6, no. 1, pp. 223\u2013225, 2015. DOI: https:\/\/doi.org\/10.1609\/socs.v6i1.18343.","journal-title":"Proceedings of the 8th Annual Symposium on Combinatorial Search"},{"issue":"1","key":"1569_CR25","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E W Dijkstra","year":"1959","unstructured":"E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, vol. 1, no. 1, pp. 269\u2013271, 1959. DOI: https:\/\/doi.org\/10.1007\/BF01386390.","journal-title":"Numerische Mathematik"},{"key":"1569_CR26","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1609\/icaps.v29i1.3474","volume":"29","author":"F Grenouilleau","year":"2019","unstructured":"F. Grenouilleau, W. J. van Hoeve, J. N. Hooker. A multi-label A* algorithm for multi-agent pathfinding. In Proceedings of the 29th International Conference on Automated Planning and Scheduling, Berkeley, USA, vol. 29, pp. 181\u2013185, 2019. DOI: https:\/\/doi.org\/10.1609\/icaps.v29i1.3474.","journal-title":"Proceedings of the 29th International Conference on Automated Planning and Scheduling"},{"issue":"2","key":"1569_CR27","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P E Hart","year":"1968","unstructured":"P. E. Hart, N. J. Nilsson, B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, vol. 4, no. 2, pp. 100\u2013107, 1968. DOI: https:\/\/doi.org\/10.1109\/TSSC.1968.300136.","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"issue":"1\u20132","key":"1569_CR28","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H W Kuhn","year":"1955","unstructured":"H. W. Kuhn. The Hungarian method for the assignment problem. Naval Research Logistics Quarterly, vol. 2, no. 1\u20132, pp. 83\u201397, 1955. DOI: https:\/\/doi.org\/10.1002\/nav.3800020109.","journal-title":"Naval Research Logistics Quarterly"}],"container-title":["Machine Intelligence Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11633-025-1569-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11633-025-1569-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11633-025-1569-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T14:11:45Z","timestamp":1770041505000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11633-025-1569-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["1569"],"URL":"https:\/\/doi.org\/10.1007\/s11633-025-1569-x","relation":{},"ISSN":["2731-538X","2731-5398"],"issn-type":[{"value":"2731-538X","type":"print"},{"value":"2731-5398","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2]]},"assertion":[{"value":"30 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declared that they have no conflicts of interest to this work.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations of conflict of interest"}}]}}