Parallel-processable recursive and heuristic method for path planning

Abstract

A problem of task planning of a robot can result in, another problem of finding a path that connects some given initial point and final point. The article suggests prospect of a 'wave front method' that can find one of the shortest paths in a computation time being proportional to the length of the shortest paths. This wave front method is based on an analogy of the Huygens' principle known in physics, and can be extended into the time dimension.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>