An interval partitioning algorithm for constraint satisfaction problems

Chandra Sekhar Pedamallu, Arun Kumar, T. Csendes, Janos Posfai

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

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
Volume14
Issue number1-2
DOIs
Publication statusPublished - Sep 2011

Fingerprint

Constraint satisfaction problems
Constraint Satisfaction Problem
Partitioning
Kinematics
Search Trees
Interval
Interval Methods
Nonlinear Systems of Equations
Industrial Application
Coupled System
Local Search
Industrial applications
System of equations
Nonlinear systems
Benchmark
Testing

Keywords

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

ASJC Scopus subject areas

  • Computer Science Applications
  • Applied Mathematics
  • Modelling and Simulation

Cite this

An interval partitioning algorithm for constraint satisfaction problems. / Pedamallu, Chandra Sekhar; Kumar, Arun; Csendes, T.; Posfai, Janos.

In: International Journal of Modelling, Identification and Control, Vol. 14, No. 1-2, 09.2011, p. 133-140.

Research output: Contribution to journalArticle

Pedamallu, Chandra Sekhar ; Kumar, Arun ; Csendes, T. ; Posfai, Janos. / An interval partitioning algorithm for constraint satisfaction problems. In: International Journal of Modelling, Identification and Control. 2011 ; Vol. 14, No. 1-2. pp. 133-140.
@article{64621a3f5d45436683b9520de2ca5df1,
title = "An interval partitioning algorithm for constraint satisfaction problems",
abstract = "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.",
keywords = "Continuous constraint satisfaction problem, Interval partitioning with local search, Kinematics problems, Tree search strategies",
author = "Pedamallu, {Chandra Sekhar} and Arun Kumar and T. Csendes and Janos Posfai",
year = "2011",
month = "9",
doi = "10.1504/IJMIC.2011.042347",
language = "English",
volume = "14",
pages = "133--140",
journal = "International Journal of Modelling, Identification and Control",
issn = "1746-6172",
publisher = "Inderscience Enterprises Ltd",
number = "1-2",

}

TY - JOUR

T1 - An interval partitioning algorithm for constraint satisfaction problems

AU - Pedamallu, Chandra Sekhar

AU - Kumar, Arun

AU - Csendes, T.

AU - Posfai, Janos

PY - 2011/9

Y1 - 2011/9

N2 - 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.

AB - 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.

KW - Continuous constraint satisfaction problem

KW - Interval partitioning with local search

KW - Kinematics problems

KW - Tree search strategies

UR - http://www.scopus.com/inward/record.url?scp=80052439799&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80052439799&partnerID=8YFLogxK

U2 - 10.1504/IJMIC.2011.042347

DO - 10.1504/IJMIC.2011.042347

M3 - Article

AN - SCOPUS:80052439799

VL - 14

SP - 133

EP - 140

JO - International Journal of Modelling, Identification and Control

JF - International Journal of Modelling, Identification and Control

SN - 1746-6172

IS - 1-2

ER -