A Comparative Study of Maze-Solving Algorithms: Performance, Complexity, and Practical Applications in AI and Robotics
Abstract & Details
Research Area
Computer Engineering
Keywords
computer science
maze solving algorithms
introduction to maze solving
A star
A *
Dijkstra
Abstract
Maze-solving is a fundamental problem in computer science and artificial intelligence, with applications in fields such as robotics, video games, and navigation systems. This paper presents a comparative study of several classic maze-solving algorithms, including Depth-First Search (DFS), Breadth-First Search (BFS), A* Algorithm, Dijkstra’s Algorithm, Random Mouse Algorithm, and Wall-Following Algorithm. Each algorithm is evaluated based on performance metrics such as execution time, space complexity, number of nodes expanded, and path length. The study includes implementations of each algorithm and an analysis of their performance across multiple test cases, including mazes of varying sizes and complexities. Through experimentation, we determine the strengths and weaknesses of each algorithm, providing insights into their suitability for different maze-solving scenarios. The findings highlight that while DFS and BFS offer simplicity, A* and Dijkstra provide optimal pathfinding at the cost of increased computational overhead. This paper aims to guide researchers and practitioners in selecting the most appropriate maze-solving algorithm for their specific applications.
License
This work is licensed under a Creative
Commons
Attribution-ShareAlike 4.0 International License.
Author Information
| # | Name | Institute / Affiliation |
|---|---|---|
| 1 | Nakka Sai Magh Reddy | CMR university |
How to Cite
Use the following formats to cite this article in your research.
APA Style
Reddy, Nakka Sai Magh (2024). A Comparative Study of Maze-Solving Algorithms: Performance, Complexity, and Practical Applications in AI and Robotics. International Journal of Advance Research and Innovative Ideas In Education, 10(5), 1892-1914.
MLA Style
Reddy, Nakka Sai Magh. "A Comparative Study of Maze-Solving Algorithms: Performance, Complexity, and Practical Applications in AI and Robotics." International Journal of Advance Research and Innovative Ideas In Education, vol. 10, no. 5, 2024, pp. 1892-1914.
IEEE Style
Nakka Sai Magh Reddy, "A Comparative Study of Maze-Solving Algorithms: Performance, Complexity, and Practical Applications in AI and Robotics," International Journal of Advance Research and Innovative Ideas In Education, vol. 10, no. 5, pp. 1892-1914, 2024.
Vancouver Style
Reddy Nakka Sai Magh. A Comparative Study of Maze-Solving Algorithms: Performance, Complexity, and Practical Applications in AI and Robotics. International Journal of Advance Research and Innovative Ideas In Education. 2024;10(5):1892-1914.
Harvard Style
Reddy, Nakka Sai Magh (2024) 'A Comparative Study of Maze-Solving Algorithms: Performance, Complexity, and Practical Applications in AI and Robotics', International Journal of Advance Research and Innovative Ideas In Education, 10(5), pp. 1892-1914.
Chicago Style
Reddy, Nakka Sai Magh. "A Comparative Study of Maze-Solving Algorithms: Performance, Complexity, and Practical Applications in AI and Robotics." International Journal of Advance Research and Innovative Ideas In Education 10, no. 5 (2024): 1892-1914.
Turabian Style
Reddy, Nakka Sai Magh. "A Comparative Study of Maze-Solving Algorithms: Performance, Complexity, and Practical Applications in AI and Robotics." International Journal of Advance Research and Innovative Ideas In Education 10, no. 5 (2024): 1892-1914.
Related Research
EduQuest AI: A Gamified Learning Platform for Interactive and Personalized Digital Education
Download PDF
Distributed Real-Time Stream Analytics and Ingestion Engine for High-Velocity Big Data Architectures
Download PDF