Efficient and Safe Global Constraints for Handling Numerical Constraint Systems - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue SIAM Journal on Numerical Analysis Année : 2005

Efficient and Safe Global Constraints for Handling Numerical Constraint Systems

Résumé

Numerical constraint systems are often handled by branch and prune algorithms that combine splitting techniques, local consistencies, and interval methods. This paper first recalls the principles of Quad, a global constraint that works on a tight and safe linear relaxation of quadratic subsystems of constraints. Then, it introduces a generalization of Quad to polynomial constraint systems. It also introduces a method to get safe linear relaxations and shows how to compute safe bounds of the variables of the linear constraint system. Different linearization techniques are investigated to limit the number of generated constraints. QuadSolver, a new branch and prune algorithm that combines Quad, local consistencies, and interval methods, is introduced. QuadSolver has been evaluated on a variety of benchmarks from kinematics, mechanics, and robotics. On these benchmarks, it outperforms classical interval methods as well as constraint satisfaction problem solvers and it compares well with state-of-the-art optimization solvers.

Dates et versions

hal-00907765 , version 1 (21-11-2013)

Identifiants

Citer

Yahia Lebbah, Claude Michel, Michel Rueher, David Daney, Jean-Pierre Merlet. Efficient and Safe Global Constraints for Handling Numerical Constraint Systems. SIAM Journal on Numerical Analysis, 2005, 42 (5), pp. 2076-2097. ⟨10.1137/S0036142903436174⟩. ⟨hal-00907765⟩
169 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More