Abstract
This paper introduces a generalization of the nvalue constraint that bounds the number of distinct values taken by a set of variables.The generalized constraint (called nvector) bounds the number of distinct (multi-dimensional) vectors. The first contribution of this paper is to show that this global constraint has a significant role to play with continuous domains, by taking the example of simultaneous localization and map building (SLAM). This type of problem arises in the context of mobile robotics. The second contribution is to prove that enforcing bound consistency on this constraint is NP-complete. A simple contractor (or propagator) is proposed and applied on a real application.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beldiceanu, N.: Pruning for the minimum Constraint Family and for the number of distinct values Constraint Family. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 211–224. Springer, Heidelberg (2001)
Bessière, C., Hébrard, E., Hnich, B., Kiziltan, Z., Walsh, T.: Filtering Algorithms for the NValue Constraint. In: Barták, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol. 3524, pp. 79–93. Springer, Heidelberg (2005)
Bessière, C., Hébrard, E., Hnich, B., Walsh, T.: The Complexity of Global Constraints. In: AAAI 2004, pp. 112–117 (2004)
Chabert, G.: Techniques d’Intervalles pour la Résolution de Systèmes d’Équations. PhD Thesis, Université de Nice-Sophia Antipolis (2007)
Chabert, G., Jaulin, L.: Contractor Programming. Artificial Intelligence 173, 1079–1100 (2009)
Gupta, U.I., Lee, D.T., Leung, Y.T.: Efficient Algorithms for Interval Graphs and Circular-Arc Graphs. Networks 12, 459–467 (1982)
Jaulin, L.: Localization of an Underwater Robot using Interval Constraint Propagation. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 244–255. Springer, Heidelberg (2006)
Jaulin, L.: A Nonlinear Set-membership Approach for the Localization and Map Building of an Underwater Robot using Interval Constraint Propagation. IEEE Transaction on Robotics 25(1), 88–98 (2009)
Moore, R.: Interval Analysis. Prentice-Hall, Englewood Cliffs (1966)
Rim, C.S., Nakajima, K.: On Rectangle Intersection and Overlap Graphs. IEEE Transactions on Circuits and Systems 42(9), 549–553 (1995)
Tamassia, R., Tollis, I.G.: Planar Grid Embedding in Linear Time. IEEE Trans. Circuits Systems 36, 1230–1234 (1989)
Uehara, R.: NP-Complete Problems on a 3-connected Cubic Planar Graph and their Applications. Technical Report Technical Report TWCU-M-0004, Tokyo Woman’s Christian University (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chabert, G., Jaulin, L., Lorca, X. (2009). A Constraint on the Number of Distinct Vectors with Application to Localization. In: Gent, I.P. (eds) Principles and Practice of Constraint Programming - CP 2009. CP 2009. Lecture Notes in Computer Science, vol 5732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04244-7_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-04244-7_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04243-0
Online ISBN: 978-3-642-04244-7
eBook Packages: Computer ScienceComputer Science (R0)