Rahnama, BehnamÖzdemir, Makbule CananKiran, YunusElçi, Atilla13.07.20192019-07-1613.07.20192019-07-162013978-0-7695-4987-3https://doi.org/10.1109/COMPSACW.2013.49https://hdl.handle.net/20.500.12451/4052IEEE 37th Annual Computer Software and Applications Conference (COMPSAC) -- JUL 22-26, 2013 -- Kyoto, JAPANWOS:000331223100056This research presents design and implementation of the shortest path algorithm for labyrinth discovery application in a multi-agent environment. Robot agents are unaware of the maze at the beginning; they learn as they discover it. Each agent solves a part of the maze and updates the shared memory so that other robots also benefit from each other's' discovery. Finding of the destination cell by an agent helps others to interconnect their discovered paths to the one ending with the destination cell. The proposed shortest path algorithm considers the cost for not only coordinate distance but also number of turns and moves required to traverse the path. The Shortest Path algorithm is compared against various available maze solving algorithms including Flood-Fill, Modified Flood-Fill and ALCK(EF). The presented algorithm can be used also as an additional layer to enhance the available methods at second and subsequent runs.eninfo:eu-repo/semantics/openAccessLabyrinthMaze SolvingCooperative RoboticsShortest PathConference Object32833210.1109/COMPSACW.2013.49N/AWOS:000331223100056N/A