{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T22:42:06Z","timestamp":1768257726897,"version":"3.49.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031201752","type":"print"},{"value":"9783031201769","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-20176-9_9","type":"book-chapter","created":{"date-parts":[[2022,10,28]],"date-time":"2022-10-28T20:03:45Z","timestamp":1666987425000},"page":"104-116","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Decentralized Multi-Agent Path Finding in\u00a0Warehouse Environments for\u00a0Fleets of\u00a0Mobile Robots with\u00a0Limited Communication Range"],"prefix":"10.1007","author":[{"given":"Abderraouf","family":"Maoudj","sequence":"first","affiliation":[]},{"given":"Anders Lyhne","family":"Christensen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,29]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Bobanac, V., Bogdan, S.: Routing and scheduling in multi-AGV systems based on dynamic banker algorithm. In: Proceedings of the 16th Mediterranean Conference on Control and Automation, pp. 1168\u20131173. IEEE (2008)","DOI":"10.1109\/MED.2008.4602057"},{"issue":"2","key":"9_CR2","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":"9_CR3","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1613\/jair.2502","volume":"31","author":"K Dresner","year":"2008","unstructured":"Dresner, K., Stone, P.: A multiagent approach to autonomous intersection management. J. Artif. Intell. Res. 31, 591\u2013656 (2008)","journal-title":"J. Artif. Intell. Res."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"H\u00f6nig, W., et al.: Multi-agent path finding with kinematic constraints. In: Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling (ICAPS), pp. 477\u2013485. AAAI Press (2016)","DOI":"10.1609\/icaps.v26i1.13796"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Lam, E., Le Bodic, P.: New valid inequalities in branch-and-cut-and-price for multi-agent path finding. In: Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS), pp. 184\u2013192. AAAI Press (2020)","DOI":"10.1609\/icaps.v30i1.6660"},{"key":"9_CR6","unstructured":"Li, J.: Source code for CBS, EECBS and PIBT. https:\/\/github.com\/Jiaoyang-Li\/CBSH2-RTC. https:\/\/github.com\/Jiaoyang-Li\/EECBS and https:\/\/github.com\/Kei18\/pibt2"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Li, J., Chen, Z., Harabor, D., Stuckey, P., Koenig, S.: Anytime multi-agent path finding via large neighborhood search. In: International Joint Conference on Artificial Intelligence, pp. 4127\u20134135. IJCAI (2021)","DOI":"10.24963\/ijcai.2021\/568"},{"key":"9_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103574","volume":"301","author":"J Li","year":"2021","unstructured":"Li, J., Harabor, D., Stuckey, P.J., Ma, H., Gange, G., Koenig, S.: Pairwise symmetry reasoning for multi-agent path finding search. Artif. Intell. 301, 103574 (2021)","journal-title":"Artif. Intell."},{"key":"9_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, pp. 12353\u201312362. AAAI Press (2021)","DOI":"10.1609\/aaai.v35i14.17466"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Ma, H., Harabor, D., Stuckey, P.J., Li, J., Koenig, S.: Searching with consistent prioritization for multi-agent path finding. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp. 7643\u20137650. AAAI Press (2019)","DOI":"10.1609\/aaai.v33i01.33017643"},{"key":"9_CR11","unstructured":"Ma, H., Li, J., Kumar, T., Koenig, S.: Lifelong multi-agent path finding for online pickup and delivery tasks. In: Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 837\u2013845. IFAAMAS (2017)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Okoso, A., Otaki, K., Nishi, T.: Multi-agent path finding with priority for cooperative automated valet parking. In: 2019 IEEE Intelligent Transportation Systems Conference (ITSC), pp. 2135\u20132140. IEEE (2019)","DOI":"10.1109\/ITSC.2019.8917112"},{"key":"9_CR13","doi-asserted-by":"crossref","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. IJCAI Organization (2019)","DOI":"10.24963\/ijcai.2019\/76"},{"key":"9_CR14","unstructured":"Rathi, A., Vadali, M., et al.: Dynamic prioritization for conflict-free path planning of multi-robot systems. arXiv preprint arXiv:2101.01978 (2021)"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Reijnen, R., Zhang, Y., Nuijten, W., Senaras, C., Goldak-Altgassen, M.: Combining deep reinforcement learning with search heuristics for solving multi-agent path finding in segment-based layouts. In: 2020 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 2647\u20132654. IEEE (2020)","DOI":"10.1109\/SSCI47803.2020.9308584"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1613\/jair.2408","volume":"31","author":"MRK Ryan","year":"2008","unstructured":"Ryan, M.R.K.: Exploiting subgraph structure in multi-robot path planning. J. Artif. Intell. Res. 31, 497\u2013542 (2008)","journal-title":"J. Artif. Intell. Res."},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Sajid, Q., Luna, R., Bekris, K.: Multi-agent pathfinding with simultaneous execution of single-agent primitives. In: International Symposium on Combinatorial Search, vol. 3, no. 1, pp. 88\u201396. AAAI Press (2012)","DOI":"10.1609\/socs.v3i1.18243"},{"issue":"3","key":"9_CR18","doi-asserted-by":"publisher","first-page":"2378","DOI":"10.1109\/LRA.2019.2903261","volume":"4","author":"G Sartoretti","year":"2019","unstructured":"Sartoretti, G., et al.: Primal: pathfinding via reinforcement and imitation multi-agent learning. IEEE Robot. Autom. Lett. 4(3), 2378\u20132385 (2019)","journal-title":"IEEE Robot. Autom. Lett."},{"issue":"5","key":"9_CR19","doi-asserted-by":"publisher","first-page":"1248","DOI":"10.1109\/TRO.2017.2705119","volume":"33","author":"J Stephan","year":"2017","unstructured":"Stephan, J., Fink, J., Kumar, V., Ribeiro, A.: Concurrent control of mobility and communication in multirobot systems. IEEE Trans. Rob. 33(5), 1248\u20131254 (2017)","journal-title":"IEEE Trans. Rob."},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Stern, R., et al.: Multi-agent pathfinding: definitions, variants, and benchmarks. In: Symposium on Combinatorial Search (SoCS), pp. 151\u2013158. AAAI Press (2019)","DOI":"10.1609\/socs.v10i1.18510"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Surynek, P.: A novel approach to path planning for multiple robots in bi-connected graphs. In: 2009 IEEE International Conference on Robotics and Automation, pp. 3613\u20133619. IEEE (2009)","DOI":"10.1109\/ROBOT.2009.5152326"},{"key":"9_CR22","unstructured":"Surynek, P., Felner, A., Stern, R., Boyarski, E.: Efficient SAT approach to multi-agent path finding under the sum of costs objective. In: Proceedings of the Twenty-second European Conference on Artificial Intelligence, ECAI, pp. 810\u2013818. IOS Press (2016)"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Van Den Berg, J.P., Overmars, M.H.: Prioritized motion planning for multiple robots. In: 2005 IEEE\/RSJ International Conference on Intelligent Robots and Systems, pp. 430\u2013435. IEEE (2005)","DOI":"10.1109\/IROS.2005.1545306"},{"issue":"4","key":"9_CR24","doi-asserted-by":"publisher","first-page":"2309","DOI":"10.1007\/s12652-021-02987-3","volume":"13","author":"D Yu","year":"2022","unstructured":"Yu, D., Hu, X., Liang, K., Ying, J.: A parallel algorithm for multi-AGV systems. J. Ambient. Intell. Humaniz. Comput. 13(4), 2309\u20132323 (2022)","journal-title":"J. Ambient. Intell. Humaniz. Comput."},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Yu, J., LaValle, S.M.: Structure and intractability of optimal multi-robot path planning on graphs. In: Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, pp. 1443\u20131449. AAAI Press (2013)","DOI":"10.1609\/aaai.v27i1.8541"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Guo, Q., Yuan, P.: Conflict-free route planning of automated guided vehicles based on conflict classification. In: 2017 IEEE International Conference on Systems, Man, and Cybernetics (SMC), pp. 1459\u20131464. IEEE (2017)","DOI":"10.1109\/SMC.2017.8122819"},{"key":"9_CR27","doi-asserted-by":"publisher","first-page":"82120","DOI":"10.1109\/ACCESS.2020.2991190","volume":"8","author":"Y Zhao","year":"2020","unstructured":"Zhao, Y., Liu, X., Wang, G., Wu, S., Han, S.: Dynamic resource reservation based collision and deadlock prevention for multi-AGV. IEEE Access 8, 82120\u201382130 (2020)","journal-title":"IEEE Access"}],"updated-by":[{"DOI":"10.1007\/978-3-031-20176-9_34","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2023,9,27]],"date-time":"2023-09-27T00:00:00Z","timestamp":1695772800000}}],"container-title":["Lecture Notes in Computer Science","Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20176-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,26]],"date-time":"2023-09-26T20:32:29Z","timestamp":1695760349000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20176-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031201752","9783031201769"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20176-9_9","relation":{"correction":[{"id-type":"doi","id":"10.1007\/978-3-031-20176-9_34","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"27 September 2023","order":2,"name":"change_date","label":"Change Date","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Correction","order":3,"name":"change_type","label":"Change Type","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"A correction has been published.","order":4,"name":"change_details","label":"Change Details","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ANTS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Malaga","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":"2 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"antsw2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ants2022.uma.es\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45","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":"19","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":"14","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":"42% - 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,0222","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":"2,3076","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":"4 extended abstracts","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)"}}]}}