Learned navigation in unknown terrains: A retraction method

The problem of learned navigation of a circular robot R, of radius delta (is greater than or equal to 0), through a terrain whose model is not a-priori known is considered. Two-dimensional finite-sized terrains populated by an unknown (but, finite) number of simple polygonal obstacles are also considered. The number and locations of the vertices of each obstacle are unknown to R. R is equipped with a sensor system that detects all vertices and edges that are visible from its present location. In this context two problems are covered. In the visit problem, the robot is required to visit a sequence of destination points, and in the terrain model acquisition problem, the robot is required to acquire the complete model of the terrain. An algorithmic framework is presented for solving these two problems using a retraction of the freespace onto the Voronoi diagram of the terrain. Algorithms are then presented to solve the visit problem and the terrain model acquisition problem