{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T23:17:37Z","timestamp":1782947857519,"version":"3.54.5"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032304933","type":"print"},{"value":"9783032304940","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T00:00:00Z","timestamp":1782950400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T00:00:00Z","timestamp":1782950400000},"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-3-032-30494-0_7","type":"book-chapter","created":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T22:36:05Z","timestamp":1782945365000},"page":"100-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Integrated Congestion-Aware Framework for\u00a0Task Allocation and\u00a0Path Planning in\u00a0Multi-Agent Pickup and\u00a0Delivery"],"prefix":"10.1007","author":[{"given":"Dariush","family":"Ebrahimi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Meet","family":"Sable","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qing","family":"Dai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yash","family":"Ahuja","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Ajibola","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,2]]},"reference":[{"issue":"1","key":"7_CR1","first-page":"9","volume":"29","author":"PR Wurman","year":"2008","unstructured":"Wurman, P.R., D\u2019Andrea, R., Mountz, M.: Coordinating hundreds of cooperative, autonomous vehicles in warehouses. AI Mag. 29(1), 9\u201319 (2008)","journal-title":"AI Mag."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Li, J., et\u00a0al.: Departure scheduling and taxiway path planning under uncertainty. In: AIAA Aviation 2019 Forum (2019)","DOI":"10.2514\/6.2019-2930"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Li, J., et\u00a0al.: Scalable rail planning and replanning: winning the 2020 flatland challenge. In: Proceedings of the International Conference on Automated Planning and Scheduling, vol.\u00a031, pp. 477\u2013485 (2021)","DOI":"10.1609\/icaps.v31i1.15994"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Stern, R.: Multi-agent path finding - an overview. In: ARTIFICIAL INTELLIGENCE: 5th RAAI Summer School. Dolgoprudny, Russia (2019)","DOI":"10.1007\/978-3-030-33274-7_6"},{"key":"7_CR5","unstructured":"Wikipedia Contributors: Multi-agent pathfinding, Wikipedia, The Free Encyclopedia (2024). https:\/\/en.wikipedia.org\/w\/index.php?title=Multi-agent_pathfinding&oldid=1230323665"},{"key":"7_CR6","unstructured":"Kaduri, O., Boyarski, E., Stern, R.: Experimental evaluation of classical multi-agent path finding algorithms. In: AAAI Symposium on Combinatorial Search. https:\/\/ojs.aaai.org\/index.php\/SOCS\/article\/download\/18560\/18349\/22079"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"\u010c\u00e1p, M., Vok\u0159\u00ednek, J., Kleiner, A.: Complete decentralized method for on-line multi-robot trajectory planning in well-formed infrastructures. In: Proceedings of the International Conference on Automated Planning and Scheduling, pp. 324\u2013332 (2015)","DOI":"10.1609\/icaps.v25i1.13696"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Ma, H., Li, J., Kumar, T., Koenig, S.: Lifelong multi-agent pathfinding for online pickup and delivery tasks. In: Proceedings of the 16th International Conference on Autonomous Agents and MultiAgent Systems, pp. 837\u2013845 (2017)","DOI":"10.65109\/TNMO6004"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Grenouilleau, F., van Hoeve, W.-J., Hooker, J.N.: A multi-label a* algorithm for multi-agent pathfinding. In: Proceedings of the International Conference on Automated Planning and Scheduling, pp. 181\u2013185 (2019)","DOI":"10.1609\/icaps.v29i1.3474"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Henkel, C., Abbenseth, J., Toussaint, M.: An optimal algorithm to solve the combined task allocation and path finding problem. In: Proceedings of the IEEE\/RSJ International Conference on Intelligent Robots and Systems, pp. 4140\u20134146 (2019)","DOI":"10.1109\/IROS40897.2019.8968096"},{"issue":"9","key":"7_CR11","doi-asserted-by":"publisher","first-page":"5910","DOI":"10.1109\/LRA.2023.3301300","volume":"8","author":"F Kudo","year":"2023","unstructured":"Kudo, F., Cai, K.: A TSP-based online algorithm for multi-task multi-agent pickup and delivery. IEEE Robot. Autom. Lett. 8(9), 5910\u20135917 (2023)","journal-title":"IEEE Robot. Autom. Lett."},{"key":"7_CR12","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.\u00a038, no.\u00a018 (2024)","DOI":"10.1609\/aaai.v38i18.30054"},{"key":"7_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103662","volume":"305","author":"A Andreychuk","year":"2022","unstructured":"Andreychuk, A., Yakovlev, K., Surynek, P., Atzmon, D., Stern, R.: Multi-agent pathfinding with continuous time. Artif. Intell. 305, 103662 (2022)","journal-title":"Artif. Intell."},{"key":"7_CR14","unstructured":"Shen, B., Chen, Z., Cheema, M.A., Harabor, D.D., Stuckey, P.J.: Tracking progress in multi-agent path finding. arXiv preprint (2023)"},{"key":"7_CR15","unstructured":"Chan, S.-H., et\u00a0al.: The league of robot runners: competition goals, designs, and implementation (2023). https:\/\/www.leagueofrobotrunners.org\/"},{"key":"7_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103752","volume":"310","author":"K Okumura","year":"2022","unstructured":"Okumura, K., Machida, M., D\u00e9fago, X., Tamura, Y.: Priority inheritance with backtracking for iterative multi-agent path finding. Artif. Intell. 310, 103752 (2022)","journal-title":"Artif. Intell."},{"key":"7_CR17","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, no. 1, pp. 151\u2013158 (2021)","DOI":"10.1609\/socs.v10i1.18510"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-30494-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T22:36:18Z","timestamp":1782945378000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-30494-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,2]]},"ISBN":["9783032304933","9783032304940"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-30494-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,2]]},"assertion":[{"value":"2 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Braga","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"30 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccsa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}