Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Title A name given to the resource Faculty Publications Conference Paper Faculty Publications- Conference Papers Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Creator An entity primarily responsible for making the resource Biju, Abiya; Gayathri, M.P.; Jayapandian, N.; Chris, Alan; Thaleeparambil, Noeal Rajeev Title A name given to the resource Efficient Pathfinding in a Maze to overcome Challenges in Robotics and AI Using Breadth-First Search Date A point or period of time associated with an event in the lifecycle of the resource 01-01-2025 Source A related resource from which the described resource is derived 2025 IEEE 14th International Conference on Communication Systems and Network Technologies, CSNT 2025;pp.727-732 Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1109/CSNT64827.2025.10968383" target="_blank" rel="noreferrer noopener">https://doi.org/10.1109/CSNT64827.2025.10968383</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105004548317?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105004548317?origin=resultslist</a> Coverage The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant Biju A., Department of CSE, Christ University, Kengeri Campus, Bangalore, India; Gayathri M.P., Department of CSE, Christ University, Kengeri Campus, Bangalore, India; Jayapandian N., Department of CSE, Christ University, Kengeri Campus, Bangalore, India; Chris A., Department of Computer Science and Engineering, Christ University, Kengeri Campus, Bangalore, India; Thaleeparambil N.R., Department of Computer Science and Engineering, Christ University, Kengeri Campus, Bangalore, India Description An account of the resource Efficient pathfinding in a maze is a key obstacle in robotics, computer science, and artificial intelligence. The article is proposing a strategy using the Breadth-First Search (BFS) algorithm to establish the shortest path for a robot navigating from the top-left to the bottom-right corner of a maze depicted as a two-dimensional grid. The maze comprises open pathways and obstructions, signified by 0 and 1, respectively. The robot's permissible actions include up, down, left, and right, restricted by the boundaries of the grid and the position of obstacles. BFS, an approach well-suited for unweighted graphs, sequentially examines all available routes, ensuring that the first observed path to the goal is the shortest. A visited set removes redundant cell visits, reducing infinite loops and inefficient processing. The algorithm's efficiency is dramatically upgraded by harnessing a queue structure to maintain live routes and their associated steps. This approach assures effectiveness and extensiveness for grid-based navigation problems, making it especially appropriate for real-world robotic applications where minimizing traversal cost is critical. Additionally, the paper discusses the algorithm's execution, complexities, and potential upgrades for larger grids or dynamic environments. Experimental results demonstrate BFS's resilience and efficacy in solving pathfinding challenges in various maze configurations. This work contributes to developing stable navigation techniques, integral to advancing autonomous robotic navigation and related fields. 2025 IEEE. Subject The topic of the resource Breadth-First Search; Dijkstras; Pathfinding; Robotic Applications; Unweighted Graphs Publisher An entity responsible for making the resource available Institute of Electrical and Electronics Engineers Inc. Relation A related resource ISBN: 979-833153193-5; Language A language of the resource English Type The nature or genre of the resource Conference paper Rights Information about rights held in and over the resource Restricted Access; Hardcopy may be available in the library Format The file format, physical medium, or dimensions of the resource online