Research Article
Analysis of intelligent path planning using BFS in complex environment
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 186 - Issue 81 |
| Published: April 2025 |
| Authors: T. Sneha, B. Pavithra, N. Vaishnavi, K. Lohith, N. Suresh Kumar |
10.5120/ijca2025924766
|
T. Sneha, B. Pavithra, N. Vaishnavi, K. Lohith, N. Suresh Kumar . Analysis of intelligent path planning using BFS in complex environment. International Journal of Computer Applications. 186, 81 (April 2025), 32-38. DOI=10.5120/ijca2025924766
@article{ 10.5120/ijca2025924766,
author = { T. Sneha,B. Pavithra,N. Vaishnavi,K. Lohith,N. Suresh Kumar },
title = { Analysis of intelligent path planning using BFS in complex environment },
journal = { International Journal of Computer Applications },
year = { 2025 },
volume = { 186 },
number = { 81 },
pages = { 32-38 },
doi = { 10.5120/ijca2025924766 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2025
%A T. Sneha
%A B. Pavithra
%A N. Vaishnavi
%A K. Lohith
%A N. Suresh Kumar
%T Analysis of intelligent path planning using BFS in complex environment%T
%J International Journal of Computer Applications
%V 186
%N 81
%P 32-38
%R 10.5120/ijca2025924766
%I Foundation of Computer Science (FCS), NY, USA
Abstract
Breadth-First Search (BFS) is a method to explore or search through graphs step by step. In this task, the BFS is used to find the shortest path from source to destination. In the present paper the workflow of BFS is presented node by node by moving level by level and checking all nearby rooms before going deeper. In the present work the time and memory consumed is analyzed during the graph traversing by BFS. The queue is considered to track the search nodes and find the best path. Along the way, also returned which rooms were checked, which paths were avoided, and how BFS helps in finding the shortest route. Finally, the shortest route is identified and calculated the path cost.
References
- B. S. Harapan, Pencarian Shortest Path Dinamik dengan Algoritma Bellman Based Flood Fill dan Implementasinya pada Robot Micromouse, Institut Teknologi Bandung, 2009.
- I. Elshamarka and B. S. S. Abu, Design and Implementation of a Robot for Maze-Solving using Flood-Fill Algorithm, Universiti Teknologi Petronas. 2012.
- R. K. Sreekanth, “Artificial intelligence algorithms,” IOSR Journal of Computer Engineering, vol. 6, no. 3 September-October 2012.
- D. Zai, H. Budiati and S.B. Berutu, "Simulation of the Shortest Route to Tourism Locations in Nias Using the Breadth-FirstSearch and Tabu Search Methods", InFact Journal ,Vol. 1 No. 2, Nov. 2016.
- B. Fu et al., "An improved A* algorithm for the industrial robot path planning with high success rate and short length,"Rob. Auton. Syst., vol. 106, pp. 26–37, 2018.
- S. K. Debnath et al., "A review on graph search algorithms for optimal energy efficient path planning for an unmanned airvehicle," Indones. J. Electr. Eng. Comput. Sci., vol. 15, no. 2, pp. 743–750, 2019.
- G. L. Andrade and D. H. Thomas, "An Optimized Breadth-First Search Algorithm for Routing in Optical AccessNetworks," IEEE Lat. Am. Trans., vol. 17, no. 7, pp. 1088–1095, 2019.
- R. Zhou and E. A. Hansen, "Breadth-first heuristic search," Artif. Intell., vol. 170, no. 4–5, pp. 385–408, 2006.
- D. C. Kozen, "Lecture 4. Depth-First and Breadth-First Search," in The Design and Analysis of Algorithms, Springer, NewYork, NY, 2011.
- F. Zhang et al., "An adaptive breadth-first search algorithm on integrated architectures," J. Supercomput., vol. 74, no. 11,pp. 6135–6155, 2018.
- A. N. Putri, "Search the blind breadth first search algorithm in 3d game engine maze third person shooter android based onintelligent agent". Transformatika Journal, Vol. 14, No. 1, Jul. 2016.
Index Terms
Keywords