Avoiding Fake Boundaries in Set Interval Computing - ENSTA Bretagne - École nationale supérieure de techniques avancées Bretagne Accéder directement au contenu
Article Dans Une Revue Journal of Uncertain Systems Année : 2017

Avoiding Fake Boundaries in Set Interval Computing

Anthony Welte
Luc Jaulin


Set intervals techniques are an efficient way of dealing with uncertainty in spatial localization problems. In these techniques, the desired set (e.g., set of possible locations) is represented by an expression that uses intersection, union, and complement of input sets – which are usually only known with interval uncertainty. To find the desired set, we can, in principle, perform the corresponding set-interval computations one-by-one. However, the estimates obtained by such straightforward computations often contain extra elements – e.g., fake boundaries. It was known that we can eliminate these fake boundaries (and other extra elements) if we first transform the original set expression into an appropriate DNF/CNF form. In this paper, we prove a new result, that any DNF/CNF form enables us to eliminate the extra elements – thus, we can use the shortest possible DNF/CNF form and therefore, speed up the corresponding computations.
Fichier principal
Vignette du fichier
jusVol11No2paper07.pdf (246.13 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-01698416 , version 1 (02-02-2018)


  • HAL Id : hal-01698416 , version 1


Anthony Welte, Luc Jaulin, Martine Ceberio, Vladik Kreinovich. Avoiding Fake Boundaries in Set Interval Computing. Journal of Uncertain Systems, 2017, 11 (2), pp.137 - 148. ⟨hal-01698416⟩
128 Consultations
67 Téléchargements


Gmail Facebook X LinkedIn More