## An Interval Partitioning Algorithm for . . .

### BibTeX

@MISC{Pedamallu_aninterval,

author = {Chandra Sekhar Pedamallu and Arun Kumar and Tibor Csendes and Janos Posfai},

title = {An Interval Partitioning Algorithm for . . . },

year = {}

}

### OpenURL

### 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 nonlinear system of equations. The kinematics benchmarks used here arise in industrial applications.