Clustering for Disconnected Solution Sets of Numerical CSPs

This paper considers the issue of postprocessing the output of interval-based solvers for further exploitations when solving numerical CSPs with continuum of solutions. Most interval-based solvers cover the solution sets of such problems with a large collection of boxes. This makes it difficult to exploit their results for other purposes than simple querying. For many practical problems, it is highly desirable to run more complex queries on the representations of the solution set. We propose to use clustering techniques to regroup the output in order to provide some characteristics of the solution set. Three new clustering algorithms based on connectedness and their combinations are proposed.

[1]  Subhash Suri,et al.  Analysis of a bounding box heuristic for object intersection , 1999, SODA '99.

[2]  M. H. van Emden,et al.  Interval arithmetic: From principles to implementation , 2001, JACM.

[3]  Pascal Van Hentenryck.  A Gentle Introduction to NUMERICA , 1998, Artif. Intell..

[4]  Fabio Ganovelli,et al.  BucketTree: Improving Collision Detection Between Deformable Objects , 2000 .

[5]  Frédéric Goualard,et al.  Revising Hull and Box Consistency , 1999, ICLP.

[6]  Tomas Akenine-Möller,et al.  Collision Detection for Continuously Deforming Bodies , 2001, Eurographics.

[7]  Frédéric Goualard,et al.  Universally Quantified Interval Constraints , 2000, CP.

[8]  Nicolas Monmarché,et al.  A new clustering algorithm based on the chemical recognition system of ants , 2002 .

[9]  In-Kwon Lee,et al.  Adaptive space decomposition for fast visualization of soft objects , 2003, Comput. Animat. Virtual Worlds.

[10]  J. C. Burkill.  Functions of Intervals , 1924 .

[11]  C. Lottaz.  Collaborative design using solution spaces , 2000 .

[12]  Frédéric Goualard,et al.  Box consistency through weak box consistency , 1999, Proceedings 11th International Conference on Tools with Artificial Intelligence.

[13]  Gino van den Bergen.  A Fast and Robust GJK Implementation for Collision Detection of Convex Objects , 1999, J. Graphics, GPU, & Game Tools.

[14]  Luc Jaulin,et al.  Applied Interval Analysis , 2001, Springer London.

[15]  Chin-Shyurng Fahn,et al.  Efficient Time-Interupted and Time-Continuous Collision Detection Among Polyhedral , 1999, Journal of information science and engineering.

[16]  Marius-Calin Silaghi,et al.  Approximation Techniques for Non-linear Problems with Continuum of Solutions , 2002, SARA.

[17]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[18]  C. Fahn,et al.  Efficient Time-Interrupted and Time-Continuous Collision Detection Among Polyhedral Objects in Arbitrary Motion , 1999 .

[19]  Hélène Collavizza,et al.  A Note on Partial Consistencies over Continuous Domains , 1998, CP.

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

[21]  Gino van den Bergen.  Efficient Collision Detection of Complex Deformable Models using AABB Trees , 1997, J. Graphics, GPU, & Game Tools.

[22]  Joachim Gudmundsson,et al.  Box-Trees and R-Trees with Near-Optimal Query Time , 2001, SCG '01.

[23]  Boi Faltings,et al.  Consistency techniques for continuous constraints , 1996, Constraints.

[24]  Joachim Gudmundsson,et al.  Box-trees for collision checking in industrial installations , 2004, Comput. Geom..

[25]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[26]  Marius-Calin Silaghi,et al.  Numerical Constraint Satisfaction Problems with Non-isolated Solutions , 2002, COCOS.

[27]  R. B. Kearfott,et al.  Interval Computations: Introduction, Uses, and Resources , 2000 .

[28]  Ramon E. Moore.  Interval arithmetic and automatic error analysis in digital computing , 1963 .