Evolutionary algorithm for path planning in mobile robot environment

摘要

An evolutionary algorithm is discussed for the path planning problem in mobile robot environment, which may contain a number of unknown obstacles. The evolutionary algorithm searches for paths in the entire, continuous free space. It unifies off-line and on-line planning processes and provides high safety measures without requiring complete information about the obstacles sensed.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>