How to Efficiently Compute Ranges Over a Difference Between Boxes, With Applications to Underwater Localization

Luc Jaulin (1) , Martine Ceberio (2) , Olga Kosheleva (2) , Vladik Kreinovich (2)

1 Lab-STICC_ENSTAB_CID_PRASYS
2 UTEP - University of Texas [El Paso]

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.

Domaines: Automatique / Robotique

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⟩