Author(s)

I. K. Kueviakoe, A. Lambert, P. Tarroux

LIMSI, CNRS, 91400 Orsay, France; ENS, 45 rue d'ULM, 75230 Paris, France.
LIMSI, CNRS, 91400 Orsay, France; Univ. Paris Sud, IEF, 91400 Orsay, France;.
LIVIC, IFSTTAR, 14 route de la minière, 78000 Versailles,France.

Interval constraint propagation (ICP) algorithms allow to solve problems described as constraint satisfaction problems (CSP). ICP has been successfully applied to vehicle localization in the last few years. Once the localization problem has been stated, a large class of ICP solvers can be used. This paper compares a few ICP algorithms, using the same experimental data, in order to rank their performances in terms of accuracy and computing time.

Interval Analysis, Constraint Propagation, Data Fusion, Vehicle Positioning, GPS

I. Kueviakoe, A. Lambert and P. Tarroux, "Comparison of Interval Constraint Propagation Algorithms for Vehicle Localization," Journal of Software Engineering and Applications, Vol. 5 No. 12B, 2012, pp. 157-162. doi: 10.4236/jsea.2012.512B030.