A Specific Quantifier Elimination for Inner Box Test in Distance Constraints with Uncertainties - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2006

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

Résumé

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.
Fichier principal
Vignette du fichier
RR-5883.pdf (549.42 Ko) Télécharger le fichier
Loading...

Dates et versions

inria-00071385 , version 1 (23-05-2006)

Identifiants

  • HAL Id : inria-00071385 , version 1

Citer

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⟩
54 Consultations
116 Téléchargements

Partager

Gmail Facebook X LinkedIn More