Consistency techniques for continuous constraints

We consider constraint satisfaction problems with variables in continuous, numerical domains. Contrary to most existing techniques, which focus on computing one single optimal solution, we address the problem of computing a compact representation of the space of all solutions admitted by the constraints. In particular, we show how globally consistent (also called decomposable) labelings of a constraint satisfaction problem can be computed.Our approach is based on approximating regions of feasible solutions by 2k-trees, a representation commonly used in computer vision and image processing. We give simple and stable algorithms for computing labelings with arbitrary degrees of consistency. The algorithms can process constraints and solution spaces of arbitrary complexity, but with a fixed maximal resolution.Previous work has shown that when constraints are convex and binary, path-consistency is sufficient to ensure global consistency. We show that for continuous domains, this result can be generalized to ternary and in fact arbitrary n-ary constraints using the concept of (3,2)-relational consistency. This leads to polynomial-time algorithms for computing globally consistent labelings for a large class of constraint satisfaction problems with continuous variables.

[1]  Boi Faltings,et al.  Arc-Consistency for Continuous Variables , 1994, Artif. Intell..

[2]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[3]  Martin C. Cooper.  An Optimal k-Consistency Algorithm , 1989, Artif. Intell..

[4]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..

[5]  Toshikazu Tanimoto,et al.  A Constraint Decomposition Method for Spatio-Temporal Configuration Problems , 1993, AAAI.

[6]  Eugene C. Freuder,et al.  An Efficient Cross Product Representation of the Constraint Satisfaction Problem Search Space , 1992, AAAI.

[7]  Eugene C. Freuder.  Synthesizing constraint expressions , 1978, CACM.

[8]  Peter van Beek,et al.  On the Minimality and Decomposability of Constraint Networks , 1992, AAAI.

[9]  Rina Dechter,et al.  From Local to Global Consistency , 1990, Artif. Intell..

[10]  Ernest Davis,et al.  Constraint Propagation with Interval Labels , 1987, Artif. Intell..

[11]  Frédéric Benhamou,et al.  Applying Interval Arithmetic to Real, Integer, and Boolean Constraints , 1997, J. Log. Program..

[12]  Boi Faltings,et al.  Global Consistency for Continuous Constraints , 1994, ECAI.

[13]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[14]  Peter van Beek,et al.  On the minimality and global consistency of row-convex constraint networks , 1995, JACM.

[15]  Jamila Sam.  Constraint consistency techniques for continuous domains , 1995 .

[16]  Pascal Van Hentenryck,et al.  CLP(Intervals) Revisited , 1994, ILPS.

[17]  David A. McAllester,et al.  Solving Polynomial Systems Using a Branch and Prune Approach , 1997 .

[18]  M. H. van Emden,et al.  Interval Computation as Deduction in CHIP , 1993, J. Log. Program..

[19]  William S. Havens,et al.  HIERARCHICAL ARC CONSISTENCY FOR DISJOINT REAL INTERVALS IN CONSTRAINT LOGIC PROGRAMMING , 1992, Comput. Intell..

[20]  Ian F. C. Smith,et al.  Dynamic Constraint Propagation with Continuous Variables , 1992, ECAI.

[21]  Olivier Lhomme,et al.  Consistency Techniques for Numeric CSPs , 1993, IJCAI.

[22]  Eero Hyvönen,et al.  Constraint Reasoning Based on Interval Arithmetic: The Tolerance Propagation Approach , 1992, Artif. Intell..

[23]  Eugene C. Freuder.  A Sufficient Condition for Backtrack-Free Search , 1982, JACM.

[24]  Ian F. C. Smith,et al.  Management of conflict for preliminary engineering design tasks , 1995, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

[25]  André Vellino,et al.  Constraint Arithmetic on Real Intervals , 1993, WCLP.