HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

A Specific Quantifier Elimination for Inner Box Test in Distance Constraints with Uncertainties

Carlos Grandón 1 Bertrand Neveu 1
1 COPRIN - Constraints solving, optimization and robust interval analysis
CRISAM - Inria Sophia Antipolis - Méditerranée , ENPC - École des Ponts ParisTech
Abstract : This document presents a specific quantifier elimination algorithm for distance constraints with uncertainties represented by constraints with existentially quantified parameters. Generally, the solution set of this type of constraints has a non-null volume, and therefore an interval based solver that implements a branch and prune algorithm will bisect again and again the boxes included inside the solution set, leading to inefficient computation. This situation can be strongly improved using a test for detecting inner boxes. In this work, we show how interval arithmetics can be successfully used for building an inner box test in some types of constraints and how it can be combined with a quantifier elimination algorithm for handling constraints with existentially quantified parameters.
Document type :
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 5:06:07 PM
Last modification on : Friday, February 4, 2022 - 3:17:51 AM
Long-term archiving on: : Tuesday, February 22, 2011 - 11:55:23 AM


  • HAL Id : inria-00071385, version 1



Carlos Grandón, Bertrand Neveu. A Specific Quantifier Elimination for Inner Box Test in Distance Constraints with Uncertainties. [Research Report] RR-5883, INRIA. 2006. ⟨inria-00071385⟩



Record views


Files downloads