{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:44:27Z","timestamp":1762325067190,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030822538"},{"type":"electronic","value":"9783030822545"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-82254-5_3","type":"book-chapter","created":{"date-parts":[[2021,7,19]],"date-time":"2021-07-19T22:02:32Z","timestamp":1626732152000},"page":"37-54","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Path and Action Planning in\u00a0Non-uniform Environments for\u00a0Multi-agent Pickup and Delivery Tasks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5577-3703","authenticated-orcid":false,"given":"Tomoki","family":"Yamauchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1676-9346","authenticated-orcid":false,"given":"Yuki","family":"Miyashita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9271-4507","authenticated-orcid":false,"given":"Toshiharu","family":"Sugawara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,20]]},"reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1109\/TRO.2018.2793890","volume":"34","author":"J Alonso-Mora","year":"2018","unstructured":"Alonso-Mora, J., Beardsley, P., Siegwart, R.: Cooperative collision avoidance for nonholonomic robots. IEEE Trans. Rob. 34(2), 404\u2013420 (2018). https:\/\/doi.org\/10.1109\/TRO.2018.2793890","journal-title":"IEEE Trans. Rob."},{"issue":"12","key":"3_CR2","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1177\/0278364915576234","volume":"34","author":"D Bareiss","year":"2015","unstructured":"Bareiss, D., van den Berg, J.: Generalized reciprocal collision avoidance. Int. J. Robot. Res. 34(12), 1501\u20131514 (2015). https:\/\/doi.org\/10.1177\/0278364915576234","journal-title":"Int. J. Robot. Res."},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","first-page":"175","DOI":"10.3233\/AIC-190621","volume":"32","author":"R Bart\u00e1k","year":"2019","unstructured":"Bart\u00e1k, R., \u0160vancara, J., \u0160kopkov\u00e1, V., Nohejl, D., Krasi\u010denko, I.: Multi-agent path finding on real robots. AI Commun. 32(3), 175\u2013189 (2019). https:\/\/doi.org\/10.3233\/AIC-190621","journal-title":"AI Commun."},{"key":"3_CR4","unstructured":"Bellusci, M., Basilico, N., Amigoni, F.: Multi-agent path finding in configurable environments. In: Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems, pp. 159\u2013167 (2020)"},{"key":"3_CR5","unstructured":"Boyarski, E., et al.: ICBS: improved conflict-based search algorithm for multi-agent pathfinding. In: Twenty-Fourth International Joint Conference on Artificial Intelligence (2015)"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Boyrasky, E., Felner, A., Sharon, G., Stern, R.: Don\u2019t split, try to work it out: bypassing conflicts in multi-agent pathfinding. In: Twenty-Fifth International Conference on Automated Planning and Scheduling (2015)","DOI":"10.1609\/icaps.v25i1.13725"},{"key":"3_CR7","unstructured":"Felner, A., et al.: Search-based optimal solvers for the multi-agent pathfinding problem: summary and challenges. In: Tenth Annual Symposium on Combinatorial Search (2017)"},{"key":"3_CR8","unstructured":"Ho, F., Salta, A., Geraldes, R., Goncalves, A., Cavazza, M., Prendinger, H.: Multi-agent path finding for UAV traffic management. In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, pp. 131\u2013139. International Foundation for Autonomous Agents and Multiagent Systems (2019)"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"H\u00f6nig, W., et al.: Multi-agent path finding with kinematic constraints. In: Twenty-Sixth International Conference on Automated Planning and Scheduling (2016)","DOI":"10.24963\/ijcai.2017\/684"},{"key":"3_CR10","unstructured":"Kou, N.M., et al.: Multi-agent path planning with non-constant velocity motion. In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, pp. 2069\u20132071. International Foundation for Autonomous Agents and Multiagent Systems (2019)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-030-00111-7_10","volume-title":"KI 2018: Advances in Artificial Intelligence","author":"D Krakowczyk","year":"2018","unstructured":"Krakowczyk, D., Wolff, J., Ciobanu, A., Meyer, D.J., Hrabia, C.-E.: Developing a distributed drone delivery system with a hybrid behavior planning system. In: Trollmann, F., Turhan, A.-Y. (eds.) KI 2018. LNCS (LNAI), vol. 11117, pp. 107\u2013114. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00111-7_10"},{"issue":"2","key":"3_CR12","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1109\/LRA.2020.3044834","volume":"6","author":"J Li","year":"2021","unstructured":"Li, J., Ran, M., Xie, L.: Efficient trajectory planning for multiple non-holonomic mobile robots via prioritized trajectory optimization. IEEE Robot. Autom. Lett. 6(2), 405\u2013412 (2021). https:\/\/doi.org\/10.1109\/LRA.2020.3044834","journal-title":"IEEE Robot. Autom. Lett."},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"Li, J., Surynek, P., Felner, A., Ma, H., Kumar, T.K.S., Koenig, S.: Multi-agent path finding for large agents. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, no. 01, pp. 7627\u20137634 (2019). https:\/\/doi.org\/10.1609\/aaai.v33i01.33017627","DOI":"10.1609\/aaai.v33i01.33017627"},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"Li, M., et al.: Efficient ridesharing order dispatching with mean field multi-agent reinforcement learning. In: The World Wide Web Conference, pp. 983\u2013994. ACM (2019). https:\/\/doi.org\/10.1145\/3308558.3313433","DOI":"10.1145\/3308558.3313433"},{"key":"3_CR15","unstructured":"Liu, M., Ma, H., Li, J., Koenig, S.: Task and path planning for multi-agent pickup and delivery. In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, pp. 1152\u20131160. International Foundation for Autonomous Agents and Multiagent Systems (2019)"},{"key":"3_CR16","doi-asserted-by":"publisher","unstructured":"Ma, H., H\u00f6nig, W., Kumar, T.S., Ayanian, N., Koenig, S.: Lifelong path planning with kinematic constraints for multi-agent pickup and delivery. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 7651\u20137658 (2019). https:\/\/doi.org\/10.1609\/aaai.v33i01.33017651","DOI":"10.1609\/aaai.v33i01.33017651"},{"key":"3_CR17","unstructured":"Ma, H., et al.: Overview: generalizations of multi-agent path finding to real-world scenarios. arXiv preprint arXiv:1702.05515 (2017)"},{"key":"3_CR18","unstructured":"Ma, H., Li, J., Kumar, T., Koenig, S.: Lifelong multi-agent path finding for online pickup and delivery tasks. In: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, pp. 837\u2013845. International Foundation for Autonomous Agents and Multiagent Systems (2017)"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Ma, H., Tovey, C., Sharon, G., Kumar, T.S., Koenig, S.: Multi-agent path finding with payload transfers and the package-exchange robot-routing problem. In: Thirtieth AAAI Conference on Artificial Intelligence (2016)","DOI":"10.1609\/aaai.v30i1.10409"},{"key":"3_CR20","unstructured":"Machida, M.: Polynomial-time multi-agent pathfinding with heterogeneous and self-interested agents. In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, pp. 2105\u20132107. International Foundation for Autonomous Agents and Multiagent Systems (2019)"},{"key":"3_CR21","unstructured":"Morris, R., et al.: Planning, scheduling and monitoring for airport surface operations. In: Workshops at the Thirtieth AAAI Conference on Artificial Intelligence (2016)"},{"key":"3_CR22","doi-asserted-by":"publisher","unstructured":"Okumura, K., Machida, M., D\u00e9fago, X., Tamura, Y.: Priority inheritance with backtracking for iterative multi-agent path finding. In: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019, pp. 535\u2013542. International Joint Conferences on Artificial Intelligence Organization, July 2019. https:\/\/doi.org\/10.24963\/ijcai.2019\/76","DOI":"10.24963\/ijcai.2019\/76"},{"key":"3_CR23","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)"},{"key":"3_CR24","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). https:\/\/doi.org\/10.1016\/j.artint.2014.11.006","journal-title":"Artif. Intell."},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Silver, D.: Cooperative pathfinding. In: Proceedings of the First AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, AIIDE 2005, pp. 117\u2013122. AAAI Press (2005)","DOI":"10.1609\/aiide.v1i1.18726"},{"key":"3_CR26","doi-asserted-by":"publisher","unstructured":"Surynek, P.: On satisfisfiability modulo theories in continuous multi-agent path finding: compilation-based and search-based approaches compared. In: Proceedings of the 12th International Conference on Agents and Artificial Intelligence, ICAART, vol. 2, pp. 182\u2013193. INSTICC, SciTePress (2020). https:\/\/doi.org\/10.5220\/0008980101820193","DOI":"10.5220\/0008980101820193"},{"key":"3_CR27","doi-asserted-by":"publisher","unstructured":"Tang, S., Kumar, V.: Safe and complete trajectory generation for robot teams with higher-order dynamics. In: 2016 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 1894\u20131901 (2016). https:\/\/doi.org\/10.1109\/IROS.2016.7759300","DOI":"10.1109\/IROS.2016.7759300"},{"key":"3_CR28","unstructured":"Veloso, M., Biswas, J., Coltin, B., Rosenthal, S.: CoBots: robust symbiotic autonomous mobile service robots. In: Proceedings of the 24th International Conference on Artificial Intelligence, IJCAI 2015, pp. 4423\u20134429. AAAI Press (2015)"},{"issue":"2","key":"3_CR29","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1109\/LRA.2020.2967317","volume":"5","author":"H Wang","year":"2020","unstructured":"Wang, H., Rubenstein, M.: Walk, stop, count, and swap: decentralized multi-agent path finding with theoretical guarantees. IEEE Robot. Autom. Lett. 5(2), 1119\u20131126 (2020). https:\/\/doi.org\/10.1109\/LRA.2020.2967317","journal-title":"IEEE Robot. Autom. Lett."},{"key":"3_CR30","first-page":"55","volume":"42","author":"KHC Wang","year":"2011","unstructured":"Wang, K.H.C., Botea, A.: MAPP: a scalable multi-agent path planning algorithm with tractability and completeness guarantees. J. Artif. Intell. Res. 42, 55\u201390 (2011)","journal-title":"J. Artif. Intell. Res."},{"issue":"1","key":"3_CR31","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1609\/aimag.v29i1.2082","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 (2008). https:\/\/doi.org\/10.1609\/aimag.v29i1.2082","journal-title":"AI Mag."},{"key":"3_CR32","doi-asserted-by":"publisher","unstructured":"Yakovlev, K., Andreychuk, A., Rybeck\u00fd, T., Kulich, M.: On the application of safe-interval path planning to a variant of the pickup and delivery problem. In: Proceedings of the 17th International Conference on Informatics in Control, Automation and Robotics, ICINCO, vol. 1, pp. 521\u2013528. INSTICC, SciTePress (2020). https:\/\/doi.org\/10.5220\/0009888905210528","DOI":"10.5220\/0009888905210528"},{"key":"3_CR33","doi-asserted-by":"publisher","unstructured":"Yen, J.Y.: Finding the k shortest loopless paths in a network. Manag. Sci. 17(11), 712\u2013716 (1971). https:\/\/doi.org\/10.1287\/mnsc.17.11.712","DOI":"10.1287\/mnsc.17.11.712"},{"key":"3_CR34","doi-asserted-by":"crossref","unstructured":"Zhang, H., Li, J., Surynek, P., Koenig, S., Kumar, T.S.: Multi-agent path finding with mutex propagation. In: Proceedings of the International Conference on Automated Planning and Scheduling, vol. 30, pp. 323\u2013332 (2020)","DOI":"10.1609\/icaps.v30i1.6677"}],"container-title":["Lecture Notes in Computer Science","Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-82254-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,4]],"date-time":"2023-01-04T22:49:34Z","timestamp":1672872574000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-82254-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030822538","9783030822545"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-82254-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUMAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Multi-Agent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eumas2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/biu-ai.com\/EUMAS21\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.05","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}