%0 Conference Paper
%F Oral
%T How to Efficiently Compute Ranges Over a Difference Between Boxes, With Applications to Underwater Localization
%+ Lab-STICC_ENSTAB_CID_PRASYS
%+ University of Texas [El Paso] (UTEP )
%A Jaulin, Luc
%A Ceberio, Martine
%A Kosheleva, Olga
%A Kreinovich, Vladik
%< avec comité de lecture
%B IEEE World Congress on Computational Intelligence 2018 ((WCCI 2018))
%C Rio de Janeiro, Brazil
%8 2018-07-08
%D 2018
%Z Engineering Sciences [physics]/AutomaticConference papers
%X 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.
%G English
%2 https://ensta-bretagne.hal.science/hal-01867550/document
%2 https://ensta-bretagne.hal.science/hal-01867550/file/tr18-02.pdf
%L hal-01867550
%U https://ensta-bretagne.hal.science/hal-01867550
%~ UNIV-BREST
%~ INSTITUT-TELECOM
%~ ENSTA-BRETAGNE
%~ CNRS
%~ UNIV-UBS
%~ ENSTA-BRETAGNE-STIC
%~ ENIB
%~ LAB-STICC
%~ TDS-MACS
%~ INSTITUTS-TELECOM