An improved genetic algorithm for mobile robotic path planning

Abstract

Proposed an improved genetic algorithm based on rough sets reduction theory, optimized the genetic operators, and overcame the weakness of the traditional genetic algorithm, such as huge number of initial population and slow velocity of optimization and convergence. The experiments both in simple and complex environment have been carried on. The simulation result indicated that the method can reduce the scale of the population, minimize the searching scope, and improve the velocity of the convergence and optimization for the mobile robotic path planning.