期刊名称：International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN：2277-6451
电子版ISSN：2277-128X
出版年度：2012
卷号：2
期号：7
出版社：S.S. Mishra
摘要：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. The constraints are defied su ch that path generated does not crash with the obstacles. Two constraints are defined i.e. site fix penalty and route fix penalty. To test fast efficiency of proposed BFO algorithm results are compared with genetic algorithm (GA) and differential evolution (DE). From the experimental result it is clear that the proposed method BFO algo. Gives better path or optimal path. Th e main problem in path navigation is to find a motion route from starting point to goal point with some optimization criteria. Bacterial foraging optimization algorithm (BFOA) has been widely accepted as a global optimization algorithm of current interest for distributed optimization and control
