A comparison of two mutation operators for the path planning problem

This work presents a comparative analysis of two problem-sensitive mutation operators for the off-line path planning problem. Our aim is to study the behavior of an evolutionary algorithm in stationary environments in order to extend it to the on-line path planning problem. The main difference between the two mutation operators studied is that one of them defines a control mechanism for the extent of exploration. The results show that this last operator improves the quality of the paths found by the algorithm.