How to Efficiently Compute Ranges over a Difference Between Boxes, with Applications to Underwater Localization - 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 : 2018

How to Efficiently Compute Ranges over a Difference Between Boxes, with Applications to Underwater Localization

Résumé

When using underwater autonomous vehicles, it is important to localize them. Underwater localization is very approximate. As a result, instead of a single location x, we get a set X of possible locations of a vehicle. Based on this set of possible locations, we need to find the range of possible values of the corresponding objective function f (x). For missions on the ocean floor, it is beneficial to take into account that the vehicle is in the water, i.e., that the location of this vehicle is not in a set X describing the under-floor matter. Thus, the actual set of possible locations of a vehicle is a difference set X − X. So, it is important to find the ranges of different functions over such difference sets. In this paper, we propose an effective algorithm for solving this problem.
Fichier principal
Vignette du fichier
jusVol12No3paper05.pdf (352.81 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01867533 , version 1 (04-09-2018)

Identifiants

  • HAL Id : hal-01867533 , version 1

Citer

Luc Jaulin, Martine Ceberio, Olga Kosheleva, Vladik Kreinovich. How to Efficiently Compute Ranges over a Difference Between Boxes, with Applications to Underwater Localization. Journal of Uncertain Systems, 2018, 12, pp.190 - 199. ⟨hal-01867533⟩
97 Consultations
28 Téléchargements

Partager

Gmail Facebook X LinkedIn More