An interval partitioning algorithm for constraint satisfaction problems

Chandra Sekhar Pedamallu, Arun Kumar, Tibor Csendes, Janos Posfai

Research output: Contribution to journalArticle

8 Citations (Scopus)


We propose an efficient interval partitioning algorithm to solve the continuous constraint satisfaction problem (CSP). The method comprises a new dynamic tree search management system that also invokes local search in selected subintervals. This approach is compared with two classical tree search techniques and three other interval methods. We study some challenging kinematics problems for testing the algorithm. The goal in solving kinematics problems is to identify all real solutions of the system of equations defining the problem. In other words, it is desired to find all object positions and orientations that satisfy a coupled non-linear system of equations. The kinematics benchmarks used here arise in industrial applications.

Original languageEnglish
Pages (from-to)133-140
Number of pages8
JournalInternational Journal of Modelling, Identification and Control
Issue number1-2
Publication statusPublished - Sep 2011


  • Continuous constraint satisfaction problem
  • Interval partitioning with local search
  • Kinematics problems
  • Tree search strategies

ASJC Scopus subject areas

  • Modelling and Simulation
  • Computer Science Applications
  • Applied Mathematics

Fingerprint Dive into the research topics of 'An interval partitioning algorithm for constraint satisfaction problems'. Together they form a unique fingerprint.

  • Cite this