Skip to main content
SpringerLink
Log in

Clustering for Disconnected Solution Sets of Numerical CSPs

  • Conference paper
Recent Advances in Constraints (CSCLP 2003)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3010))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agarwal, P., de Berg, M., Gudmundsson, J., Hammar, M., Haverkort, H.: Box- Trees and R-Trees with Near-Optimal Query Time. In: Proceedings of the 17th ACM Symposium on Computational Geometry, pp. 124–133. ACM Press, New York (2001)

    Google Scholar 

  2. van den Bergen, G.: Efficient Collision Detection of Complex Deformable Models using AABB Trees. Journal of Graphics Tools 4(2), 7–25 (1997)

    Google Scholar 

  3. Fahn, C.S., Wang, J.L.: Efficient Time-Interrupted and Time-Continuous Collision Detection Among Polyhedral Objects in Arbitrary Motion. Journal of Information Science and Engineering 15, 769–799 (1999)

    Google Scholar 

  4. Zhou, Y., Suri, S.: Analysis of a Bounding Box Heuristic for Object Intersection. In: Proceedings of the 10th Annual Symposium on Discrete Algorithms, SODA 1999 (1999)

    Google Scholar 

  5. Ganovelli, F., Dingliana, J., O’Sullivan, C.: BucketTree: Improving Collision Detection Between Deformable Objects. In: Spring Conference on Computer Graphics, SCCG 2000 (2000)

    Google Scholar 

  6. Larsson, T., Akenine-Moller, T.: Collection Detection for Continuously Deforming Bodies. In: Eurographics 2001, Manchester, UK (2001)

    Google Scholar 

  7. Haverkort, H., de Berg, M., Gudmundsson, J.: Box-Trees for Collision Checking in Industrial Installations. In: Proceedings of the 18th ACM Symposium on Computational Geometry, pp. 53–62. ACM Press, New York (2002)

    Google Scholar 

  8. Fahn, C.S., Wang, J.L.: Adaptive Space Decomposition for Fast Visualization of Soft Object. Journal of Visualization and Computer Animation 14(1), 1–19 (2003)

    Article  Google Scholar 

  9. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)

    MATH  Google Scholar 

  10. Labroche, N., Monmarché, N., Venturini, G.: A New Clustering Algorithm Based on the Chemical Recognition System of Ants. In: Proceedings of the 15th European Conference on Artificial Intelligence (ECAI 2002), France, pp. 345–349. IOS Press, Amsterdam (2002)

    Google Scholar 

  11. Benhamou, F., Goualard, F.: Universally Quantified Interval Constraints. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 67–82. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  12. Kearfott, B.: Interval Computations: Introduction, Uses, and Resources. Euromath Bulletin 2(1), 95–112 (1996)

    MathSciNet  Google Scholar 

  13. Burkill, J.: Functions of Intervals. Proceedings of the London Mathematical Society 22, 375–446 (1924)

    Google Scholar 

  14. Sunaga, T.: Theory of an Interval Algebra and its Applications to Numerical Analysis. RAAG Memoirs 2, 29–46 (1958)

    Google Scholar 

  15. Moore, R.: Interval Arithmetic and Automatic Error Analysis in Digital Computing. PhD thesis, Stanford University, USA (1962)

    Google Scholar 

  16. Moore, R.: Interval Analysis. Prentice Hall, Englewood Cliffs (1966)

    MATH  Google Scholar 

  17. Hickey, T., Ju, Q., Van Emden, M.: Interval Arithmetic: from Principles to Implementation. Journal of the ACM (JACM) 48(5), 1038–1068 (2001)

    Article  Google Scholar 

  18. Jaulin, L., Kieffer, M., Didrit, O., Walter, E.: Applied Interval Analysis, 1st edn. Springer, Heidelberg (2001) ISBN 1-85233-219-0

    MATH  Google Scholar 

  19. Vu, X.H., Sam-Haroud, D., Silaghi, M.C.: Approximation techniques for nonlinear problems with continuum of solutions. In: Koenig, S., Holte, R.C. (eds.) SARA 2002. LNCS (LNAI), vol. 2371, pp. 224–241. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  20. Vu, X.H., Sam-Haroud, D., Silaghi, M.C.: Numerical Constraint Satisfaction Problems with Non-isolated Solutions. In: Bliek, C., Jermann, C., Neumaier, A. (eds.) COCOS 2002. LNCS, vol. 2861, pp. 194–210. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  21. Silaghi, M.C., Sam-Haroud, D., Faltings, B.: Search Techniques for Non-linear CSPs with Inequalities. In: Proceedings of the 14th Canadian Conference on AI (2001)

    Google Scholar 

  22. Lhomme, O.: Consistency Techniques for Numeric CSPs. In: Proceedings of IJCAI 1993 (1993)

    Google Scholar 

  23. Van Hentenryck, P.: A Gentle Introduction to NUMERICA. Artificial Intelligence 103, 209–235 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  24. Collavizza, H., Delobel, F., Rueher, M.: A Note on Partial Consistencies over Continuous Domains. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, p. 147. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  25. Granvilliers, L., Goualard, F., Benhamou, F.: Box Consistency through Weak Box Consistency. In: Proceedings of ICTAI 1999 (1999)

    Google Scholar 

  26. Benhamou, F., Goualard, F., Granvilliers, L., Puget, J.F.: Revising Hull and Box Consistency. In: Proceedings of the International Conference on Logic Programming (ICLP 1999), Las Cruces, USA, pp. 230–244 (1999)

    Google Scholar 

  27. Sam-Haroud, D., Faltings, B.: Consistency Techniques for Continuous Constraints. Constraints 1(1-2), 85–118 (1996)

    Article  MathSciNet  Google Scholar 

  28. Lottaz, C.: Collaborative Design using Solution Spaces. PhD thesis, Ecole Polytechnique Fédérale de Lausanne (EPFL), Switzerland (2000)

    Google Scholar 

  29. Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, London (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Artificial Intelligence Laboratory, Swiss Federal Institute of Technology in Lausanne (EPFL), CH-1015, Lausanne, Switzerland

    Xuan-Ha Vu, Djamila Sam-Haroud & Boi Faltings

Authors
  1. Xuan-Ha Vu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Djamila Sam-Haroud
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Boi Faltings
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Amsterdam, The Netherlands

    Krzysztof R. Apt

  2. Projet Contraintes, INRIA Rocquencourt, BP105, 78153, Domaine de Voluceau, Le Chesnay Cedex, France

    François Fages

  3. Dipartimento di Matematica Pura ed Applicata, Università di Padova, Via Trieste 63, 35121, Padova, Italy

    Francesca Rossi

  4. Department of Computer Science and Information Theory, Budapest University of Technology and Economics, Magyar tudósok körútja 2, H-1117, Hungary, Budapest

    Péter Szeredi

  5. Computer and Automation Research Institute, Hungarian Academy of Sciences, Kende u. 13-17, 1111, Budapest, Hungary

    Josef Váncza

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vu, XH., Sam-Haroud, D., Faltings, B. (2004). Clustering for Disconnected Solution Sets of Numerical CSPs. In: Apt, K.R., Fages, F., Rossi, F., Szeredi, P., Váncza, J. (eds) Recent Advances in Constraints. CSCLP 2003. Lecture Notes in Computer Science(), vol 3010. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24662-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24662-6_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21834-0

  • Online ISBN: 978-3-540-24662-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation