Exploring Maze Navigation: A Comparative Study of DFS, BFS, and A Search Algorithms

A comparative study was conducted using Python and Pmaze to evaluate the performance of DFS, BFS, and A* search algorithms in path planning for a maze. The main objective of the project was to compare the efficiency of these algorithms in terms of path cost and algorithmic complexity. No physical ro...

Full description

Saved in:
Bibliographic Details
Published inStatistics, optimization & information computing Vol. 12; no. 3; pp. 761 - 781
Main Authors ELKARI, Badr, OURABAH, Loubna, SEKKAT, Hiba, HSAINE, Ayoub, ESSAIOUAD, Chama, BOUARGANE, Yassine, El Moutaouakil, Karim
Format Journal Article
LanguageEnglish
Published 21.02.2024
Online AccessGet full text
ISSN2311-004X
2310-5070
2310-5070
DOI10.19139/soic-2310-5070-1939

Cover

More Information
Summary:A comparative study was conducted using Python and Pmaze to evaluate the performance of DFS, BFS, and A* search algorithms in path planning for a maze. The main objective of the project was to compare the efficiency of these algorithms in terms of path cost and algorithmic complexity. No physical robot was used in this study as it focused solely on the analysis of search algorithms. This study contributes to the advancement of knowledge in the field of path planning by exploring different approaches for mazes using Python and Pmaze.
ISSN:2311-004X
2310-5070
2310-5070
DOI:10.19139/soic-2310-5070-1939