Memetic Algorithm Based Path Planning for a Mobile Robot

In this paper, the problem of finding the optimal collision free path for a mobile robot, the path planning problem, is solved using an advanced evolutionary algorithm called memetic algorithm. What is new in this work is a novel representation of solutions for evolutionary algorithms that is efficient, simple and also compatible with memetic algorithm. The new representation makes it possible to solve the problem with a small population and in a few generations. It also makes the genetic operator simple and allows using an efficient local search operator within the evolutionary algorithm. The proposed algorithm is applied to two instances of path planning problem and the results are available. Keywords-- Path planning problem, Memetic Algorithm, Representation.

• Type: Conference
• Year: 2004
• Where: IJIT
• Authors: Neda Shahidi, Hadi Esmaeilzadeh, Marziye Abdollahi, Caro Lucas
• Keywords: Artificial Intelligence, Evolutionary Algorithm, IJIT 2004, Memetic Algorithm, Path Planning Problem