Professor of School of Engineering, Design and Built Environment, Western Sydney University, Australia. His research interests cover Industry 4.0, Additive Manufacturing, Advanced Engineering Materials and Structures (Metals and Composites), Multi-scale Modelling of Materials and Structures, Metal Forming and Metal Surface Treatment.
2024-02-24
2024-01-04
2023-11-02
Abstract—Maze exploration is a field of science that continues to be researched and developed. Various algorithms, techniques, and scenarios result in faster trips and shortest distances. Various international competitions in the maze field are also held to encourage quicker and better labyrinth exploration innovations. Usually, maze exploration uses a mobile robot that moves autonomously in pathfinding to reach the target location. This study aims to generate and test a multi-agent algorithm to find the closest distance to reach a target in an unknown maze. So the question is how multi-agents can work together to reach the target using the shortest possible path. For this reason, a flood fill algorithm usually used for single-agent has been developed into an improved flood fill algorithm that can be applied to multi-agents. The result is an algorithm that can be applied to find targets through unknown maze exploration using multi-agent. Index Terms— maze robot, flood fill algorithm, multi-agent, pathfinding Cite: Semuil Tjiharjadi, Sazalinsyah Razali, H. A. Sulaiman, and Gerry Fernando, "Design of Multi-Agent Pathfinding Robot Using Improved Flood Fill Algorithm in Maze Exploration," International Journal of Mechanical Engineering and Robotics Research, Vol. 11, No. 8, pp. 631-638, August 2022. DOI: 10.18178/ijmerr.11.8.631-638 Copyright © 2022 by the authors. This is an open access article distributed under the Creative Commons Attribution License (CC BY-NC-ND 4.0), which permits use, distribution and reproduction in any medium, provided that the article is properly cited, the use is non-commercial and no modifications or adaptations are made.
