Efficient Pathfinding in a Maze to Overcome Challenges in Robotics and AI Using Breadth-First Search

Overview

Published at IEEE CSNT 2025, the IEEE International Conference on Communication Systems and Network Technologies. The paper looks at Breadth-First Search as a way to solve grid mazes for robotics and AI applications.

BFS guarantees the shortest path on an unweighted grid, which makes it a dependable baseline for robot navigation.