A Fast Evolutionary Algorithm for Robot Path Planning

摘要

Robot path planning is a NP problem, traditional optimization methods are not very effective to it, which are easy to plunge into local minimum. In this paper, we devise an evolutionary algorithm to solve the robot path planning problems based on some new genetic operators.The problems in algorithm design mainly considered are how to select the evolutionary operators, how to avoid the solutions falling into the local optimal and how to enhance the efficiency of the evolution process and so on. The new algorithm has been carried on the operation to the test examples. The experiment results indicated that the new algorithm is efficiency for solving the robot path planning problems and the best path usually can be found.