Research ArticleOpen AccessGoogle Scholar indexed
Comparison of Interval Constraint Propagation Algorithms for Vehicle Localization
LIMSI, CNRS, 91400 Orsay, France; Univ. Paris Sud, IEF, 91400 Orsay, France;
LIVIC, IFSTTAR, 14 route de la minière, 78000 Versailles,France
LIMSI, CNRS, 91400 Orsay, France; ENS, 45 rue d'ULM, 75230 Paris, France
- 1 LIMSI, CNRS, 91400 Orsay, France; Univ. Paris Sud, IEF, 91400 Orsay, France;
- 2 LIVIC, IFSTTAR, 14 route de la minière, 78000 Versailles,France
- 3 LIMSI, CNRS, 91400 Orsay, France; ENS, 45 rue d'ULM, 75230 Paris, France
Journal of Software Engineering and Applications·Volume 05 (2013)·Pages 157–162·Published 17 January 2013·DOI10.4236/jsea.2012.512B030
Copy link · social · email
Abstract
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.
KeywordsInterval AnalysisConstraint PropagationData FusionVehicle PositioningGPS
- M. Clowes, “On seeing things,” Artificial intelligence, vol. 2,no. 1, pp. 79–116, 1971.
- D. Waltz, “Understanding line drawings of scenes with shadows,” Psychology of Computer Vision, McGraw-Hill,New York, 1975.
- A. Mackworth, “Consistency in networks of relations,” Artificial intelligence, vol. 8, no. 1, pp. 99–118, 1977.
- H. Gallaire, “Logic programming: Further develop-ments,” in IEEE Symposium on Logic Programming, pp. 88–99, 1985.
- J. Jaffar and J. Lassez, “Constraint logic programming,” in ACM SIGACT-SIGPLAN symposium on Principles of programming languages, pp. 111–119, 1987.
- P. Van Hentenryck, Y. Deville, and C. Teng, “A generic arc-consistency algorithm and its specializations,” Artificial Intelligence, vol. 57, no. 2, pp. 291–321, 1992.
- C. Bessiere, “Arc-consistency and arc-consistency again,” Ar-tificial intelligence, vol. 65, no. 1, pp. 179–190, 1994.
- Z. Yuanlin and R. Yap, “Arc consis-tency on n-ary monotonic and linear constraints,” International Conference on Principles and Practice of Constraint Programming, pp. 470–483, 2000.
- R. Dechter and J. Pearl, “Tree clustering for constraint networks,” Artificial Intelligence, vol. 38, no. 3, pp. 353–366, 1989.
- F. Rossi, C. Petrie, and V. Dhar, “On the equivalence of con-straint satisfaction problems,” in European Confe-rence on Artificial Intelligence, pp. 550–556, 1990.
- R. Mohr, G. Masini, et al., “Good old discrete relaxation,” in European Conference on Artificial Intelligence, pp. 651–656, 1988.
- J. Cleary, “Logical arithmetic,” Future computing systems, vol. 2, no. 2, pp. 125–149, 1987.
- E. Davis, “Constraint propagation with interval la-bels,” Artificial intelligence, vol. 32, no. 3, pp. 281–331, 1987.
- E. Hyvonen, “Constraint rea-soning based on interval arithmetic,” in Internation-al Joint Conference on Artificial Intelligence, pp. 1193–1198, 1989.
- F. Benhamou and W. Older, “Applying interval arithmetic to real, integer, and boolean constraints,” The Journal of Logic Pro-gramming, vol. 32, no. 1, pp. 1–24, 1997.
- F. Benhamou, F. Goualard, L. Granvilliers, and J. Pu-get, “Revising hull and box consistency,” in Int. Conf. on Logic Programming, Citeseer, 1999.