Date Added: Jul 2011
The proposed Navigation Strategy using GA(Genetic Algorithm) finds an optimal path in the simulated grid environment. GA forces to find a path that is connected to the robot start and target positions via predefined points. Each point in the environmental model is called genome and the path connecting Start and Target is called as Chromosome. According to the problem formulation, the length of the algorithm chromosomes (number of genomes) is dynamic. Moreover every genome is not a simple digit. In this case, every genome represents the nodes in the 2D grid environment. After implementing the cross over and mutation concepts the resultant chromosome (path) is subjected to optimization process which gives the optimal path as a result.