{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T00:31:48Z","timestamp":1769733108688,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T00:00:00Z","timestamp":1726012800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","award":["101073876"],"award-info":[{"award-number":["101073876"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,9,11]]},"DOI":"10.1145\/3688671.3688760","type":"proceedings-article","created":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T13:06:21Z","timestamp":1735304781000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Multi-robot maze exploration using an efficient cost-utility method"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-7060-848X","authenticated-orcid":false,"given":"Manousos","family":"Linardakis","sequence":"first","affiliation":[{"name":"Department of Informatics and Telematics, Harokopio University of Athens, Athens, GR"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0876-8167","authenticated-orcid":false,"given":"Iraklis","family":"Varlamis","sequence":"additional","affiliation":[{"name":"Department of Informatics and Telematics, Harokopio University of Athens, Athens, GR"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1686-421X","authenticated-orcid":false,"given":"George","family":"Papadopoulos","sequence":"additional","affiliation":[{"name":"Department of Informatics and Telematics, Harokopio University of Athens, Athens, GR"}]}],"member":"320","published-online":{"date-parts":[[2024,12,27]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"crossref","unstructured":"Ghanima Al-Sharrah. 2010. Ranking using the Copeland score: a comparison with the Hasse diagram. Journal of chemical information and modeling 50 5 (2010) 785\u2013791.","DOI":"10.1021\/ci100064q"},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"crossref","unstructured":"Shatha Alamri Hadeel Alamri Wejdan Alshehri Shuruq Alshehri Ahad Alaklabi and Tareq Alhmiedat. 2023. An autonomous maze-solving robotic system based on an enhanced wall-follower approach. Machines 11 2 (2023) 249.","DOI":"10.3390\/machines11020249"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"crossref","unstructured":"Shatha Alamri Shuruq Alshehri Wejdan Alshehri Hadeel Alamri Ahad Alaklabi and Tareq Alhmiedat. 2021. Autonomous maze solving robotics: Algorithms and systems. International Journal of Mechanical Engineering and Robotics Research 10 12 (2021) 668\u2013675.","DOI":"10.18178\/ijmerr.10.12.668-675"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/INVENTIVE.2016.7830181"},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"crossref","unstructured":"Nawaf\u00a0Hazim Barnouti Sinan Sameer\u00a0Mahmood Al-Dabbagh and Mustafa Abdul\u00a0Sahib Naser. 2016. Pathfinding in strategy games and maze solving using A* search algorithm. Journal of Computer and Communications 4 11 (2016) 15\u201325.","DOI":"10.4236\/jcc.2016.411002"},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"crossref","unstructured":"Jerome Barraquand Bruno Langlois and J-C Latombe. 1992. Numerical potential field techniques for robot path planning. IEEE transactions on systems man and cybernetics 22 2 (1992) 224\u2013241.","DOI":"10.1109\/21.148426"},{"key":"e_1_3_3_2_8_2","first-page":"8\u2013p","volume-title":"6th National conference on control architectures of robots","author":"Bautin Antoine","year":"2011","unstructured":"Antoine Bautin, Olivier Simonin, and Fran\u00e7ois Charpillet. 2011. Towards a communication free coordination for multi-robot exploration. In 6th National conference on control architectures of robots. 8\u2013p."},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"crossref","unstructured":"Wolfram Burgard Mark Moors Cyrill Stachniss and Frank\u00a0E Schneider. 2005. Coordinated multi-robot exploration. IEEE Transactions on robotics 21 3 (2005) 376\u2013386.","DOI":"10.1109\/TRO.2004.839232"},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.846439"},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"publisher","unstructured":"Flavio Cabrera-Mora and Jizhong Xiao. 2012. A Flooding Algorithm for Multirobot Exploration. IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) 42 3 (2012) 850\u2013863. 10.1109\/TSMCB.2011.2179799 https:\/\/dl.acm.org\/doi\/10.1109\/TSMCB.2011.2179799","DOI":"10.1109\/TSMCB.2011.2179799"},{"key":"e_1_3_3_2_12_2","unstructured":"Bojan Crnkovi\u0107 Stefan Ivi\u0107 and Mila Zovko. 2023. Fast algorithm for centralized multi-agent maze exploration. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2310.02121 (2023)."},{"key":"e_1_3_3_2_13_2","unstructured":"Michael Gold. 2023. Python Maze Creation. https:\/\/medium.com\/@msgold\/using-python-to-create-and-solve-mazes-672285723c96"},{"key":"e_1_3_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2012.6225274"},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"crossref","unstructured":"Faiza Gul Imran Mir Laith Abualigah and Putra Sumari. 2021. Multi-robot space exploration: An augmented arithmetic approach. IEEE Access 9 (2021) 107738\u2013107750.","DOI":"10.1109\/ACCESS.2021.3101210"},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"crossref","unstructured":"Faiza Gul Imran Mir Wan Rahiman and Tauqeer\u00a0Ul Islam. 2021. Novel implementation of multi-robot space exploration utilizing coordinated multi-robot exploration and frequency modified whale optimization algorithm. IEEE Access 9 (2021) 22774\u201322787.","DOI":"10.1109\/ACCESS.2021.3055852"},{"key":"e_1_3_3_2_17_2","volume-title":"Principles of population genetics","author":"Hartl Daniel\u00a0L","year":"1997","unstructured":"Daniel\u00a0L Hartl, Andrew\u00a0G Clark, and Andrew\u00a0G Clark. 1997. Principles of population genetics. Vol.\u00a0116. Sinauer associates Sunderland, MA."},{"key":"e_1_3_3_2_18_2","unstructured":"RSIS International. 2016. Survey on Area Exploration by Multi-robots. https:\/\/www.academia.edu\/19956517\/Survey_on_Area_Exploration_by_Multi_robots"},{"key":"e_1_3_3_2_19_2","doi-asserted-by":"crossref","unstructured":"Stefan Ivi\u0107. 2020. Motion control for autonomous heterogeneous multiagent area search in uncertain conditions. IEEE Transactions on Cybernetics 52 5 (2020) 3123\u20133135.","DOI":"10.1109\/TCYB.2020.3022952"},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"publisher","unstructured":"Stefan Ivi\u0107 Bojan Crnkovi\u0107 and Igor Mezi\u0107. 2017. Ergodicity-Based Cooperative Multiagent Area Coverage via a Potential Field. IEEE Transactions on Cybernetics 47 8 (2017) 1983\u20131993. 10.1109\/TCYB.2016.2634400","DOI":"10.1109\/TCYB.2016.2634400"},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"crossref","unstructured":"Miguel Juli\u00e1 Arturo Gil and Oscar Reinoso. 2012. A comparison of path planning strategies for autonomous exploration and mapping of unknown environments. Autonomous Robots 33 (2012) 427\u2013444.","DOI":"10.1007\/s10514-012-9298-8"},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"crossref","unstructured":"Jin\u00a0Hong Jung Sujin Park and Seong-Lyun Kim. 2010. Multi-robot path finding with wireless multihop communications. IEEE Communications Magazine 48 7 (2010) 126\u2013132.","DOI":"10.1109\/MCOM.2010.5496889"},{"key":"e_1_3_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2009.5354598"},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"crossref","unstructured":"Ertug Olcay Jens Bodeit and Boris Lohmann. 2020. Sensor-based exploration of an unknown area with multiple mobile agents. IFAC-PapersOnLine 53 2 (2020) 9621\u20139627.","DOI":"10.1016\/j.ifacol.2020.12.2607"},{"key":"e_1_3_3_2_25_2","doi-asserted-by":"publisher","unstructured":"Georgios\u00a0Th. Papadopoulos Margherita Antona and Constantine Stephanidis. 2021. Towards Open and Expandable Cognitive AI Architectures for Large-Scale Multi-Agent Human-Robot Collaborative Learning. IEEE Access 9 (2021) 73890\u201373909. 10.1109\/ACCESS.2021.3080517","DOI":"10.1109\/ACCESS.2021.3080517"},{"key":"e_1_3_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/SSRR.2010.5981557"},{"key":"e_1_3_3_2_27_2","doi-asserted-by":"crossref","unstructured":"Donald\u00a0G Saari and Vincent\u00a0R Merlin. 1996. The copeland method: I.: Relationships and the dictionary. Economic theory 8 (1996) 51\u201376.","DOI":"10.1007\/s001990050077"},{"key":"e_1_3_3_2_28_2","doi-asserted-by":"crossref","unstructured":"Rokas Semenas and Romualdas Bausys. 2020. Modelling of autonomous search and rescue missions by interval-valued neutrosophic WASPAS framework. Symmetry 12 1 (2020) 162.","DOI":"10.3390\/sym12010162"},{"key":"e_1_3_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCTICT.2016.7514570"},{"key":"e_1_3_3_2_30_2","unstructured":"Reid Simmons David Apfelbaum Wolfram Burgard Dieter Fox Mark Moors Sebastian Thrun and Hakan Younes. 2000. Coordination for Multi-Robot Exploration and Mapping. 852\u2013858."},{"key":"e_1_3_3_2_31_2","doi-asserted-by":"crossref","unstructured":"Semuil Tjiharjadi Sazalinsyah Razali HA Sulaiman and Gerry Fernando. 2022. Design of Multi-Agent Pathfinding Robot Using Improved Flood Fill Algorithm in Maze Exploration. International Journal of Mechanical Engineering and Robotics Research 11 8 (2022) 631\u2013638.","DOI":"10.18178\/ijmerr.11.8.631-638"},{"key":"e_1_3_3_2_32_2","doi-asserted-by":"crossref","unstructured":"Semuil Tjiharjadi Sazalinsyah Razali and Hamzah\u00a0Asyrani Sulaiman. 2022. A systematic literature review of multi-agent pathfinding for maze research. Journal of Advances in Information Technology Vol 13 4 (2022).","DOI":"10.12720\/jait.13.4.358-367"},{"key":"e_1_3_3_2_33_2","doi-asserted-by":"crossref","unstructured":"Israel\u00a0A Wagner Michael Lindenbaum and Alfred\u00a0M Bruckstein. 1999. Distributed covering by ant-robots using evaporating traces. IEEE Transactions on Robotics and Automation 15 5 (1999) 918\u2013933.","DOI":"10.1109\/70.795795"},{"key":"e_1_3_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/280765.280773"},{"key":"e_1_3_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2015.7353852"},{"key":"e_1_3_3_2_36_2","unstructured":"Yinan Zheng and Chao Zhai. 2022. Distributed coverage control of multi-agent systems in uncertain environments using heat transfer equations. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2204.09289 (2022)."},{"key":"e_1_3_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2007.363553"}],"event":{"name":"SETN 2024: 13th Hellenic Conference on Artificial Intelligence","location":"Piraeus Greece","acronym":"SETN 2024"},"container-title":["Proceedings of the 13th Hellenic Conference on Artificial Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3688671.3688760","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3688671.3688760","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:10:30Z","timestamp":1750295430000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3688671.3688760"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,11]]},"references-count":36,"alternative-id":["10.1145\/3688671.3688760","10.1145\/3688671"],"URL":"https:\/\/doi.org\/10.1145\/3688671.3688760","relation":{},"subject":[],"published":{"date-parts":[[2024,9,11]]},"assertion":[{"value":"2024-12-27","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}