Pruning for the Minimum Constraint Family and for the Number of Distinct Values Constraint Family
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Artificial Intelligence
The complexity of global constraints
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
A nonlinear set membership approach for the localization and map building of underwater robots
IEEE Transactions on Robotics
Localization of an underwater robot using interval constraint propagation
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Filtering algorithms for the NVALUE constraint
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
The conjunction of interval among constraints
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
| Hi-index | 0.00 |
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.