Skip to Main content Skip to Navigation

Contraintes globales et heuristiques de recherche pour les CSPs continus

Abstract : Distance constraints are widely used in many applications ranging from robotics to chemistry and CAD. Classical tehniques for solving such continuous constraints are based on a branch and prune algorithm which combines domain filtering techniques (local consistencies) and domain splitting.
The main drawback of these methods comes from the fact that constraints are handled independently and in a blind way i.e., local consistencies do not take advantage of the specific semantic properties of the constraints.

We introduce in this thesis two approaches for the design of a global constraint for distance relations. The first technique is based on the introduction of redundant constraints direcly infered from geometrical properties of the system. The second approach is a dedicated global filtering algorithm.
This work led to the design of a domain decomposition technique which exploits the particular structure of the distance relations.
Lastly, we generalize this splitting strategy to a larger class of numerical constraints.
Document type :
Complete list of metadata

Cited literature [117 references]  Display  Hide  Download
Contributor : Monique Oger <>
Submitted on : Wednesday, September 6, 2006 - 10:51:28 AM
Last modification on : Wednesday, October 14, 2020 - 4:23:44 AM
Long-term archiving on: : Tuesday, April 6, 2010 - 12:47:44 AM


  • HAL Id : tel-00091375, version 1



Heikel Batnini. Contraintes globales et heuristiques de recherche pour les CSPs continus. Génie logiciel [cs.SE]. Université Nice Sophia Antipolis, 2005. Français. ⟨tel-00091375⟩



Record views


Files downloads