{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:42:22Z","timestamp":1742913742013,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031212024"},{"type":"electronic","value":"9783031212031"}],"license":[{"start":{"date-parts":[[2022,11,12]],"date-time":"2022-11-12T00:00:00Z","timestamp":1668211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,11,12]],"date-time":"2022-11-12T00:00:00Z","timestamp":1668211200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-21203-1_27","type":"book-chapter","created":{"date-parts":[[2022,11,11]],"date-time":"2022-11-11T07:35:25Z","timestamp":1668152125000},"page":"458-474","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Task Selection Algorithm for\u00a0Multi-Agent Pickup and\u00a0Delivery with\u00a0Time Synchronization"],"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":[[2022,11,12]]},"reference":[{"key":"27_CR1","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). https:\/\/doi.org\/10.1016\/j.artint.2022.103662","journal-title":"Artif. Intell."},{"unstructured":"Farinelli, A., Contini, A., Zorzi, D.: Decentralized task assignment for multi-item pickup and delivery in logistic scenarios. In: Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems, pp. 1843\u20131845. IFAAMAS (2020)","key":"27_CR2"},{"doi-asserted-by":"publisher","unstructured":"Gong, X., Wang, T., Huang, T., Cui, Y.: Toward safe and efficient humanswarm collaboration: a hierarchical multi-agent pickup and delivery framework. IEEE Trans. Intell. Veh. 1\u201313 (2022). https:\/\/doi.org\/10.1109\/TIV.2022.3172342","key":"27_CR3","DOI":"10.1109\/TIV.2022.3172342"},{"doi-asserted-by":"publisher","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: German\/Austrian Conference on Artificial Intelligence, pp. 107\u2013114. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-030-00111-7_10","key":"27_CR4","DOI":"10.1007\/978-3-030-00111-7_10"},{"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)","key":"27_CR5","DOI":"10.1609\/aaai.v35i13.17344"},{"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), pp. 1152\u20131160. IFAAMAS (2019)","key":"27_CR6"},{"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. IFAAMAS (2017)","key":"27_CR7"},{"doi-asserted-by":"publisher","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: The 30th AAAI Conference on Artificial Intelligence (2016). https:\/\/doi.org\/10.1609\/aaai.v30i1.10409","key":"27_CR8","DOI":"10.1609\/aaai.v30i1.10409"},{"issue":"1","key":"27_CR9","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0020-0190(94)90047-7","volume":"49","author":"E Nuutila","year":"1994","unstructured":"Nuutila, E., Soisalon-Soininen, E.: On finding the strongly connected components in a directed graph. Inf. Process. Lett. 49(1), 9\u201314 (1994). https:\/\/doi.org\/10.1016\/0020-0190(94)90047-7","journal-title":"Inf. Process. Lett."},{"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 28th International Joint Conference on Artificial Intelligence, IJCAI-19, pp. 535\u2013542 (2019). https:\/\/doi.org\/10.24963\/ijcai.2019\/76","key":"27_CR10","DOI":"10.24963\/ijcai.2019\/76"},{"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":"27_CR11"},{"key":"27_CR12","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."},{"issue":"2","key":"27_CR13","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972). https:\/\/doi.org\/10.1137\/0201010","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"publisher","unstructured":"Wu, X., et al.: Multi-agent pickup and delivery with task deadlines. In: IEEE\/WIC\/ACM International Conference on Web Intelligence and Intelligent Agent Technology, pp. 360\u2013367. Association for Computing Machinery (2021). https:\/\/doi.org\/10.1145\/3486622.3493915","key":"27_CR14","DOI":"10.1145\/3486622.3493915"},{"issue":"1","key":"27_CR15","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\u201320 (2008). https:\/\/doi.org\/10.1609\/aimag.v29i1.2082","journal-title":"AI Mag."},{"doi-asserted-by":"publisher","unstructured":"Yamauchi, T., Miyashita, Y., Sugawara, T.: Path and action planning in non-uniform environments for multi-agent pickup and delivery tasks. In: European Conference on Multi-Agent Systems, pp. 37\u201354. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-82254-5_3","key":"27_CR16","DOI":"10.1007\/978-3-030-82254-5_3"},{"unstructured":"Yamauchi, T., Miyashita, Y., Sugawara, T.: Standby-based deadlock avoidance method for multi-agent pickup and delivery tasks. In: Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, pp. 1427\u20131435. IFAAMAS (2022)","key":"27_CR17"},{"doi-asserted-by":"publisher","unstructured":"Yoshida, N., Noda, I., Sugawara, T.: Distributed service area control for ride sharing by using multi-agent deep reinforcement learning. In: Proceedings of the 13th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, pp. 101\u2013112. INSTICC, SciTePress (2021). https:\/\/doi.org\/10.5220\/0010310901010112","key":"27_CR18","DOI":"10.5220\/0010310901010112"}],"container-title":["Lecture Notes in Computer Science","PRIMA 2022: Principles and Practice of Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21203-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,11]],"date-time":"2022-11-11T07:39:00Z","timestamp":1668152340000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21203-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,12]]},"ISBN":["9783031212024","9783031212031"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21203-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022,11,12]]},"assertion":[{"value":"12 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRIMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Multi-Agent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Valencia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"prima2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/prima2022.webs.upv.es\/","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":"100","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":"31","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":"15","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","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","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)"}},{"value":"1 (demo paper)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}