MAP-BASED LOCALIZATION USING THE PANORAMIC HORIZON

We present an approach to solve the localization problem, in which an observer is given a topographic map of an area and dropped off at an unknown location. The solution to this problem requires establishing correspondences between viewer-centered observable features and their location on the map. The feature we select is the panoramic horizon curve, defined as the sky-ground boundary perceived by the observer as he performs a fun 360 degrees in place In our approach, we first precompute offline, these horizon curves at a set of locations on a grid, from the topological map. These curves are approximated by polygons with different line fitting tolerances to gain robustness to noise in our representation. These polygons are grouped into overlapping super segments, which are then encoded and stored in a table. The online computation consists of acquiring the panoramic view and extracting (with human help) the horizon curve. This curve is approximated by a polygon and the resulting super segments, used as indices in the data base,allow us to retrieve candidate locations. The best candidate is selected during a verification step which applies geometric constraints. This process is using local features and can therefore tolerate significant occlusion likely to occur in real environments. We illustrate the performance of the approach on results obtained from real data.