Path Planning Method For Robot Based On Differential Evolution Algorithm

As artificial intelligences wide application, robotics has fast development as a branch of it. The technology of the robot is typical representative of modern information technology and advanced manufacturing technology.Path planning is an important branch in the research field of the robot. It is a very complicated problem, and in obstacle environment, based on a certain evaluation criterion (such as the shortest length of path, the shortest time of moving, the minimal consuming of energy, and so on), from start point to destination point, plans an optimal (or sub-optimal) collision-free path. The main contents relate to many subjects, for example environment representing, planning method, path searching and artificial intelligence.Uses the good path planning technology of robot can save a large amount of robot activity duration and reduce the robot to wear, simultaneity save the manpower resources and reduce fund input at the same time, establish the good foundation for the application in many kinds of trades of the robot. Researchers are always caring for and thinking much about the study of path planning algorithm. They explore and research in many aspects, and some fruits are obtained, but still many problems needed to lucubrate.This paper presents a path-planning method based on differential evolution algorithm. According to the characteristic of path planning problem, every component of the algorithm are analyzed carefully, including environment representation, individual representation, path evaluation, differential evolution operators design and its parameters selection.In the end, this algorithm has to be tested against variety static environments. The simulation experiments show that this algorithm is able to plan a better path rapidly in any complex environment only if the path exists, and validated the effectiveness of the proposed approach.