International Journal of Advanced Research in Computer Science and Software Engineering (IJARCSSE)
The problem which is fast recognition in this days and age is path navigation problem with multiple obstacles. Its main purpose is to find a crash free path from an initial position to a goal position in an environment with obstacles. One major face up to in this area is to design effective algorithms that calculate the shortest pathway between sources to destination point and avoid obstacles. In this paper a new method proposed by using BFO algorithms, path navigation is solved by using bacterial foraging optimization algorithm.