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
Communication Dans Un Congrès 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
tr18-02.pdf (77.02 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

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

Identifiants

  • HAL Id : hal-01867550 , 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. IEEE World Congress on Computational Intelligence 2018 ((WCCI 2018)), Jul 2018, Rio de Janeiro, Brazil. ⟨hal-01867550⟩
116 Consultations
42 Téléchargements

Partager

More