{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T13:12:19Z","timestamp":1783775539354,"version":"3.55.0"},"publisher-location":"Singapore","reference-count":25,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819228546","type":"print"},{"value":"9789819228522","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,12]],"date-time":"2026-07-12T00:00:00Z","timestamp":1783814400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,12]],"date-time":"2026-07-12T00:00:00Z","timestamp":1783814400000},"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":[],"published-print":{"date-parts":[[2027]]},"DOI":"10.1007\/978-981-92-2852-2_39","type":"book-chapter","created":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T12:30:04Z","timestamp":1783773004000},"page":"522-534","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["PHASE: PHasor-guided Adaptive Spatial task assignmEnt"],"prefix":"10.1007","author":[{"given":"Tianyue","family":"Ge","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huanchun","family":"Peng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qingqian","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ningbo","family":"Gu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nan","family":"Deng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Feng","family":"Hong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,12]]},"reference":[{"key":"39_CR1","unstructured":"Bureau of Public Roads: Traffic Assignment Manual for Application with a Large, High Speed Computer. U.S. Department of Commerce, Washington, D.C. (1964). urban Planning Division"},{"issue":"3","key":"39_CR2","doi-asserted-by":"publisher","first-page":"5816","DOI":"10.1109\/LRA.2021.3074883","volume":"6","author":"Z Chen","year":"2021","unstructured":"Chen, Z., Alonso-Mora, J., Bai, X., Harabor, D.D., Stuckey, P.J.: Integrated task assignment and path planning for capacitated multi-agent pickup and delivery. IEEE Robot. Autom. Lett. 6(3), 5816\u20135823 (2021)","journal-title":"IEEE Robot. Autom. Lett."},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"Chen, Z., Harabor, D., Li, J., Stuckey, P.J.: Traffic flow optimisation for lifelong multi-agent path finding. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 38, pp. 20674\u201320682 (2024)","DOI":"10.1609\/aaai.v38i18.30054"},{"issue":"2","key":"39_CR4","doi-asserted-by":"publisher","first-page":"2666","DOI":"10.1109\/LRA.2021.3062803","volume":"6","author":"M Damani","year":"2021","unstructured":"Damani, M., Luo, Z., Wenzel, E., Sartoretti, G.: Primal $$ _2 $$: pathfinding via reinforcement and imitation multi-agent learning-lifelong. IEEE Robot. Autom. Lett. 6(2), 2666\u20132673 (2021)","journal-title":"IEEE Robot. Autom. Lett."},{"key":"39_CR5","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X., et al.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD, vol. 96, pp. 226\u2013231 (1996)"},{"issue":"1\u20132","key":"39_CR6","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logist. Quart. 2(1\u20132), 83\u201397 (1955)","journal-title":"Naval Res. Logist. Quart."},{"issue":"1","key":"39_CR7","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1287\/trsc.2023.0268","volume":"59","author":"E Lam","year":"2025","unstructured":"Lam, E., Stuckey, P.J., Harabor, D.: Optimal multi-agent pickup and delivery using branch-and-cut-and-price algorithms. Transp. Sci. 59(1), 104\u2013124 (2025). https:\/\/doi.org\/10.1287\/trsc.2023.0268","journal-title":"Transp. Sci."},{"issue":"6","key":"39_CR8","doi-asserted-by":"publisher","first-page":"3701","DOI":"10.1109\/LRA.2023.3272272","volume":"8","author":"B Li","year":"2023","unstructured":"Li, B., Ma, H.: Double-deck multi-agent pickup and delivery: multi-robot rearrangement in large-scale warehouses. IEEE Robot. Autom. Lett. 8(6), 3701\u20133708 (2023)","journal-title":"IEEE Robot. Autom. Lett."},{"key":"39_CR9","doi-asserted-by":"crossref","unstructured":"Li, J., Ruml, W., Koenig, S.: EECBS: a bounded-suboptimal search for multi-agent path finding. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, pp. 12353\u201312362 (2021)","DOI":"10.1609\/aaai.v35i14.17466"},{"key":"39_CR10","doi-asserted-by":"crossref","unstructured":"Li, J., Tinka, A., Kiesel, S., Durham, J.W., Kumar, T.S., Koenig, S.: Lifelong multi-agent path finding in large-scale warehouses. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, pp. 11272\u201311281 (2021)","DOI":"10.1609\/aaai.v35i13.17344"},{"key":"39_CR11","doi-asserted-by":"publisher","unstructured":"Li, W., Chen, H., Jin, B., Tan, W., Zha, H., Wang, X.: Multi-agent path finding with prioritized communication learning. In: 2022 International Conference on Robotics and Automation (ICRA), pp. 10695\u201310701 (2022). https:\/\/doi.org\/10.1109\/ICRA46639.2022.9811643","DOI":"10.1109\/ICRA46639.2022.9811643"},{"key":"39_CR12","doi-asserted-by":"crossref","unstructured":"Liu, M., Ma, H., Li, J., Koenig, S.: Task and path planning for multi-agent pickup and delivery. In: Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS) (2019)","DOI":"10.65109\/QTKR1570"},{"key":"39_CR13","doi-asserted-by":"crossref","unstructured":"Ma, H., Li, J., Kumar, T., Koenig, S.: Lifelong multi-agent path finding for online pickup and delivery tasks. arXiv preprint arXiv:1705.10868 (2017)","DOI":"10.65109\/TNMO6004"},{"issue":"6198","key":"39_CR14","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1126\/science.1254295","volume":"345","author":"M Rubenstein","year":"2014","unstructured":"Rubenstein, M., Cornejo, A., Nagpal, R.: Programmable self-assembly in a thousand-robot swarm. Science 345(6198), 795\u2013799 (2014)","journal-title":"Science"},{"key":"39_CR15","doi-asserted-by":"crossref","unstructured":"Salzman, O., Stern, R.: 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, pp. 1711\u20131715 (2020)","DOI":"10.65109\/VUIA1313"},{"key":"39_CR16","unstructured":"Schulman, J., Wolski, F., Dhariwal, P., Radford, A., Klimov, O.: Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347 (2017)"},{"key":"39_CR17","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.artint.2014.11.006","volume":"219","author":"G Sharon","year":"2015","unstructured":"Sharon, G., Stern, R., Felner, A., Sturtevant, N.R.: Conflict-based search for optimal multi-agent pathfinding. Artif. Intell. 219, 40\u201366 (2015)","journal-title":"Artif. Intell."},{"key":"39_CR18","doi-asserted-by":"crossref","unstructured":"Skrynnik, A., Andreychuk, A., Nesterova, M., Yakovlev, K., Panov, A.: Learn to follow: Decentralized lifelong multi-agent pathfinding via planning and learning. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 38, pp. 17541\u201317549 (2024)","DOI":"10.1609\/aaai.v38i16.29704"},{"key":"39_CR19","doi-asserted-by":"crossref","unstructured":"Stern, R., et al.: Multi-agent pathfinding: definitions, variants, and benchmarks. In: Proceedings of the International Symposium on Combinatorial Search, vol. 10, pp. 151\u2013158 (2019)","DOI":"10.1609\/socs.v10i1.18510"},{"key":"39_CR20","doi-asserted-by":"publisher","unstructured":"Tang, M., Gan, L., Zhang, K.: Streaming multi-agent pathfinding. In: Kwok, J. (ed.) Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, IJCAI-25, pp. 267\u2013274. International Joint Conferences on Artificial Intelligence Organization (2025). https:\/\/doi.org\/10.24963\/ijcai.2025\/31, main Track","DOI":"10.24963\/ijcai.2025\/31"},{"key":"39_CR21","doi-asserted-by":"crossref","unstructured":"Wang, Y., Duhan, T., Li, J., Sartoretti, G.: Lns2+rl: combining multi-agent reinforcement learning with large neighborhood search in multi-agent path finding. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI-25), pp. 23343\u201323350 (2025)","DOI":"10.1609\/aaai.v39i22.34501"},{"key":"39_CR22","doi-asserted-by":"crossref","unstructured":"Wang, Y., Xiang, B., Huang, S., Sartoretti, G.: Scrimp: scalable communication for reinforcement-and imitation-learning-based multi-agent pathfinding. In: 2023 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 9301\u20139308. IEEE (2023)","DOI":"10.1109\/IROS55552.2023.10342305"},{"key":"39_CR23","doi-asserted-by":"crossref","unstructured":"Xu, Q., Li, J., Koenig, S., Ma, H.: Multi-goal multi-agent pickup and delivery. In: 2022 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 9964\u20139971. IEEE (2022)","DOI":"10.1109\/IROS47612.2022.9981785"},{"key":"39_CR24","unstructured":"Zhang, Y., Jiang, H., Bhatt, V., Nikolaidis, S., Li, J.: Guidance graph optimization for multi-agent path finding. arxiv 2024. arXiv preprint arXiv:2402.01446 (2024)"},{"key":"39_CR25","doi-asserted-by":"crossref","unstructured":"Zong, Z., Zheng, M., Li, Y., Jin, D.: MapDP: cooperative multi-agent reinforcement learning to solve pickup and delivery problems. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, pp. 9980\u20139988 (2022)","DOI":"10.1609\/aaai.v36i9.21236"}],"container-title":["Lecture Notes in Computer Science","Knowledge Science, Engineering and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-92-2852-2_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T12:30:10Z","timestamp":1783773010000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-92-2852-2_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,12]]},"ISBN":["9789819228546","9789819228522"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-981-92-2852-2_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,12]]},"assertion":[{"value":"12 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"KSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Knowledge Science, Engineering and Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ksem2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ksem2026.rosc.org.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}