{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T17:22:00Z","timestamp":1778692920733,"version":"3.51.4"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031271809","type":"print"},{"value":"9783031271816","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-27181-6_13","type":"book-chapter","created":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T04:34:21Z","timestamp":1678422861000},"page":"184-197","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Comparing Multi-Agent Path Finding Algorithms in\u00a0a\u00a0Real Industrial Scenario"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2418-6618","authenticated-orcid":false,"given":"Enrico","family":"Saccon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8813-8685","authenticated-orcid":false,"given":"Luigi","family":"Palopoli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9483-3940","authenticated-orcid":false,"given":"Marco","family":"Roveri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,11]]},"reference":[{"issue":"1","key":"13_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s41018-018-0045-4","volume":"3","author":"RD Arnold","year":"2018","unstructured":"Arnold, R.D., Yamaguchi, H., Tanaka, T.: Search and rescue with autonomous flying robots through behavior-based cooperative intelligence. J. Int. Humanit. Action 3(1), 1\u201318 (2018). https:\/\/doi.org\/10.1186\/s41018-018-0045-4","journal-title":"J. Int. Humanit. Action"},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Bhattacharya, S., Likhachev, M., Kumar, V.: Topological constraints in search-based robot path planning. Auton. Robots 33, 273\u2013290 (2012). https:\/\/doi.org\/10.1007\/s10514-012-9304-1","DOI":"10.1007\/s10514-012-9304-1"},{"key":"13_CR3","unstructured":"Boyarski, E., et al.: ICBS: the improved conflict-based search algorithm for multi-agent pathfinding (2015)"},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"Bragan\u00c3\u011fa, S., Costa, E., Castellucci, I., Arezes, P.M.: A brief overview of the use of collaborative robots in industry 4.0: human role and safety (2019). https:\/\/doi.org\/10.1007\/978-3-030-14730-3_68","DOI":"10.1007\/978-3-030-14730-3_68"},{"key":"13_CR5","doi-asserted-by":"publisher","unstructured":"Brett, P., Taylor, R., Proops, D., Coulson, C., Reid, A., Griffiths, M.: A surgical robot for cochleostomy, pp. 1229\u20131232. IEEE (2007). https:\/\/doi.org\/10.1109\/IEMBS.2007.4352519","DOI":"10.1109\/IEMBS.2007.4352519"},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Brumitt, B., Stentz, A.: Dynamic mission planning for multiple mobile robots, pp. 2396\u20132401. IEEE (1996). https:\/\/doi.org\/10.1109\/ROBOT.1996.506522","DOI":"10.1109\/ROBOT.1996.506522"},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Chen, Y.Z., Shen, S.F., Chen, T., Yang, R.: Path optimization study for vehicles evacuation based on Dijkstra algorithm. Procedia Eng. 71, 159\u2013165 (2014). https:\/\/doi.org\/10.1016\/j.proeng.2014.04.023","DOI":"10.1016\/j.proeng.2014.04.023"},{"key":"13_CR8","unstructured":"Corportation, I.: Ibm ilog cplex optimization studio"},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959). https:\/\/doi.org\/10.1007\/BF01386390","DOI":"10.1007\/BF01386390"},{"issue":"2","key":"13_CR10","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s12369-019-00572-5","volume":"12","author":"F Ferrari","year":"2019","unstructured":"Ferrari, F., et al.: Human\u2013robot interaction analysis for a smart walker for elderly: the ACANTO interactive guidance system. Int. J. Soc. Robot. 12(2), 479\u2013492 (2019). https:\/\/doi.org\/10.1007\/s12369-019-00572-5","journal-title":"Int. J. Soc. Robot."},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4, 100\u2013107 (1968). https:\/\/doi.org\/10.1109\/TSSC.1968.300136","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Javaid, M., Haleem, A., Singh, R.P., Suman, R.: Substantial capabilities of robotics in enhancing industry 4.0 implementation. Cogn. Robot. 1, 58\u201375 (2021). https:\/\/doi.org\/10.1016\/j.cogr.2021.06.001","DOI":"10.1016\/j.cogr.2021.06.001"},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"Kornhauser, D., Miller, G., Spirakis, P.: Coordinating pebble motion on graphs, the diameter of permutation groups, and applications, pp. 241\u2013250. IEEE (1984). https:\/\/doi.org\/10.1109\/SFCS.1984.715921","DOI":"10.1109\/SFCS.1984.715921"},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"Latombe, J.C.: Robot Motion Planning, vol. 124. Springer Science & Business Media, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-1-4615-4022-9","DOI":"10.1007\/978-1-4615-4022-9"},{"key":"13_CR15","doi-asserted-by":"publisher","unstructured":"Pouke, M.: Using GPS data to control an agent in a realistic 3D environment, pp. 87\u201392. IEEE, September 2013. https:\/\/doi.org\/10.1109\/NGMAST.2013.24","DOI":"10.1109\/NGMAST.2013.24"},{"key":"13_CR16","doi-asserted-by":"publisher","unstructured":"Qing, G., Zheng, Z., Yue, X.: Path-planning of automated guided vehicle based on improved Dijkstra algorithm, pp. 7138\u20137143. IEEE, May 2017. https:\/\/doi.org\/10.1109\/CCDC.2017.7978471","DOI":"10.1109\/CCDC.2017.7978471"},{"key":"13_CR17","unstructured":"Ratner, D., Warmuth, M.K.: Finding a shortest solution for the n $$\\times $$ n extension of the 15-puzzle is intractable (1986)"},{"key":"13_CR18","unstructured":"Roni, S., et al.: Multi-agent pathfinding: definitions, variants, and benchmarks. CoRR abs\/1906.08291 (2019)"},{"key":"13_CR19","unstructured":"R\u00f6ger, G., Helmert, M.: Non-optimal multi-agent pathfinding is solved (since 1984) (2012)"},{"key":"13_CR20","unstructured":"Saccon, E.: Comparison of Multi-Agent Path Finding Algorithms in an Industrial Scenario. Master\u2019s thesis, Department of Information Engineering and Computer Science - University of Trento, July 2022. https:\/\/www5.unitn.it\/Biblioteca\/en\/Web\/RichiestaConsultazioneTesi"},{"key":"13_CR21","doi-asserted-by":"publisher","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","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"13_CR22","doi-asserted-by":"publisher","unstructured":"Sharon, G., Stern, R., Goldenberg, M., Felner, A.: The increasing cost tree search for optimal multi-agent pathfinding. Artif. Intell. 195, 470\u2013495 (2013). https:\/\/doi.org\/10.1016\/j.artint.2012.11.006","DOI":"10.1016\/j.artint.2012.11.006"},{"key":"13_CR23","doi-asserted-by":"publisher","unstructured":"Srinivasan, A., Ham, T., Malik, S., Brayton, R.: Algorithms for discrete function manipulation, pp. 92\u201395. IEEE Computer Society Press. https:\/\/doi.org\/10.1109\/ICCAD.1990.129849","DOI":"10.1109\/ICCAD.1990.129849"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Standley, T.: Finding optimal solutions to cooperative pathfinding problems, vol. 24, pp. 173\u2013178 (2010)","DOI":"10.1609\/aaai.v24i1.7564"},{"key":"13_CR25","doi-asserted-by":"publisher","unstructured":"Stern, R.: Multi-agent path finding - an overview (2019). https:\/\/doi.org\/10.1007\/978-3-030-33274-7_6","DOI":"10.1007\/978-3-030-33274-7_6"},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Surynek, P.: An optimization variant of multi-robot path planning is intractable, vol. 2, July 2010","DOI":"10.5772\/12906"},{"key":"13_CR27","unstructured":"Veloso, M.M., Biswas, J., Coltin, B., Rosenthal, S.: CoBots: robust symbiotic autonomous mobile service robots, pp. 4423\u20134429, July 2015"},{"key":"13_CR28","doi-asserted-by":"publisher","unstructured":"Wang, H., Yu, Y., Yuan, Q.: Application of Dijkstra algorithm in robot path-planning, pp. 1067\u20131069. IEEE (2011). https:\/\/doi.org\/10.1109\/MACE.2011.5987118","DOI":"10.1109\/MACE.2011.5987118"},{"key":"13_CR29","doi-asserted-by":"publisher","unstructured":"Wurman, P.R., D\u2019Andrea, R., Mountz, M.: Coordinating hundreds of cooperative, autonomous vehicles in warehouses. AI Mag. 29, 9 (2008). https:\/\/doi.org\/10.1609\/aimag.v29i1.2082, https:\/\/ojs.aaai.org\/index.php\/aimagazine\/article\/view\/2082","DOI":"10.1609\/aimag.v29i1.2082"},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"Yu, J., LaValle, S.M.: Structure and intractability of optimal multi-robot path planning on graphs, pp. 1443\u20131449. AAAI Press (2013)","DOI":"10.1609\/aaai.v27i1.8541"}],"container-title":["Lecture Notes in Computer Science","AIxIA 2022 \u2013 Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-27181-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T04:36:13Z","timestamp":1678422973000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-27181-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031271809","9783031271816"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-27181-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"11 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIxIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference of the Italian Association for Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Udine","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"28 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aiia2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aixia2022.uniud.it\/","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":"54","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":"33","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":"61% - 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":"This proceeding includes one invited 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)"}}]}}