Navigation Among Three-Dimensional Shapes

In this paper a heuristic approach to the navigation problem is presented, in which the task complexity is distributed among different components whose global performance is guaranteed by a run time correction mechanism. It is shown i) how information about free space is coded in a symbolic data base, ii) how some motion capabilities of the actor can be represented and iii) that the selected path can be covered in different ways on the basis of different strategies.