Planning multiple paths with evolutionary speciation

Hocaoglu, C

doi:10.1109/4235.930309

2001-06-01

102

PRE

Hocaoglu, C

Sanderson, AC

DOI：10.1109/4235.930309

原文链接

原文求助

摘要

En 中文

This paper demonstrates a new approach to multidimensional path planning that is based on multiresolution path representation, where explicit configuration space computation is not required, and incorporates an evolutionary algorithm for solving the multimodal optimization problem, generating multiple alternative paths simultaneously. The multiresolution path representation reduces the expected search length for the path-planning problem and accordingly reduces the overall computational complexity. Resolution-independent constraints due to obstacle proximity and path length are introduced into the evaluation function. The resulting path-planning system has been evaluated on problems of two, three, four, and six degrees of freedom, The resulting paths are practical, consistent, and have acceptable execution times. The system can be applied for planning paths for mobile robots, assembly, and articulated manipulators. Generation of multiple alternative paths is an example of multimodal search and, in our previous work, a new approach to multimodal function optimization has been developed using a genetic algorithm (GA) with minimal representation size cluster analysis. This multiple-population GA identifies different species and is used as the basis far an evolutionary multipath-planning algorithm which generates multiple alternative paths simultaneously. The multipath algorithm is demonstrated on a number of two-dimensional path-planning problems.

Keyword:

evolutionary speciation

path planning