• Aucun résultat trouvé

1. Marine robots to build maps

N/A
N/A
Protected

Academic year: 2021

Partager "1. Marine robots to build maps"

Copied!
44
0
0

Texte intégral

(1)

Marine robots to build maps Cycles Mapping Exploration

Ocean exploration with underwater robots

L. Jaulin

MOQESM'2020 Sea-Tech-Week, October 15, 2020

L. Jaulin Ocean exploration with underwater robots

(2)

Marine robots to build maps Cycles Mapping Exploration

1. Marine robots to build maps

L. Jaulin Ocean exploration with underwater robots

(3)

Marine robots to build maps Cycles Mapping Exploration

L. Jaulin Ocean exploration with underwater robots

(4)

Marine robots to build maps Cycles Mapping Exploration

Boatbot tows a magnetometer youtu.be/cxVs1fDdm1s

L. Jaulin Ocean exploration with underwater robots

(5)

Marine robots to build maps Cycles Mapping Exploration

L. Jaulin Ocean exploration with underwater robots

(6)

Marine robots to build maps Cycles Mapping Exploration

Magnetic map built in 2018

L. Jaulin Ocean exploration with underwater robots

(7)

Marine robots to build maps Cycles Mapping Exploration

2. Cycles

L. Jaulin Ocean exploration with underwater robots

(8)

Marine robots to build maps Cycles Mapping Exploration

Submeeting 2018

L. Jaulin Ocean exploration with underwater robots

(9)

Marine robots to build maps Cycles Mapping Exploration

L. Jaulin Ocean exploration with underwater robots

(10)

Marine robots to build maps Cycles Mapping Exploration

[3]

L. Jaulin Ocean exploration with underwater robots

(11)

Marine robots to build maps Cycles Mapping Exploration

L. Jaulin Ocean exploration with underwater robots

(12)

Marine robots to build maps Cycles Mapping Exploration

L. Jaulin Ocean exploration with underwater robots

(13)

Marine robots to build maps Cycles Mapping Exploration

L. Jaulin Ocean exploration with underwater robots

(14)

Marine robots to build maps Cycles Mapping Exploration

L. Jaulin Ocean exploration with underwater robots

(15)

Marine robots to build maps Cycles Mapping Exploration

L. Jaulin Ocean exploration with underwater robots

(16)

Marine robots to build maps Cycles Mapping Exploration

3. Mapping

L. Jaulin Ocean exploration with underwater robots

(17)

Marine robots to build maps Cycles Mapping Exploration

For topological navigation, the robot may follow paths. A path can correspond

1) to an isothermal front 2) to a magnetic path 3) to a parallel 4) to an isobath.

.

L. Jaulin Ocean exploration with underwater robots

(18)

Marine robots to build maps Cycles Mapping Exploration

1. Follow the 50m isobath until the 15-degree isotherm 2. Follow the 15-isotherm until the 50m isobath 3. Go to Step 1

L. Jaulin Ocean exploration with underwater robots

(19)

Marine robots to build maps Cycles Mapping Exploration

L. Jaulin Ocean exploration with underwater robots

(20)

Marine robots to build maps Cycles Mapping Exploration

4. Exploration

L. Jaulin Ocean exploration with underwater robots

(21)

Marine robots to build maps Cycles Mapping Exploration

Find the route without GPS, compass and clock

L. Jaulin Ocean exploration with underwater robots

(22)

Marine robots to build maps Cycles Mapping Exploration

L. Jaulin Ocean exploration with underwater robots

(23)

Marine robots to build maps Cycles Mapping Exploration

L. Jaulin Ocean exploration with underwater robots

(24)

Marine robots to build maps Cycles Mapping Exploration

L. Jaulin Ocean exploration with underwater robots

(25)

Marine robots to build maps Cycles Mapping Exploration

Formalization

L. Jaulin Ocean exploration with underwater robots

(26)

Marine robots to build maps Cycles Mapping Exploration

Given 

˙

x = f (x,u) , u (t) ∈ [u] (t) y = g (x) , y (t) ∈ [y] (t) x (0) = x 0

An observer is blind if dim y= 0 .

L. Jaulin Ocean exploration with underwater robots

(27)

Marine robots to build maps Cycles Mapping Exploration

Visible area. The robot has a state x . The visible area is V (x) Example. The robot is able to see all up to 3 km:

V (x) =

(z 1 , z 2 ) | q

(z 1 − x 1 ) 2 + (z 2 − x 2 ) 2 ≤ 3 · 10 3

.

L. Jaulin Ocean exploration with underwater robots

(28)

Marine robots to build maps Cycles Mapping Exploration

Explored zone Z is dened by [1]

x ˙ = f (x,u) , u (t) ∈ [u] (t) Z = S t≥0 V (x (t))

x (0) = x 0

L. Jaulin Ocean exploration with underwater robots

(29)

Marine robots to build maps Cycles Mapping Exploration

We have

\

x(·)∈ X (·)

[

t≥0

V (x (t))

| {z }

Z

⊂ Z ⊂ [

x(·)∈ X (·)

[

t≥0

V (x (t))

| {z }

Z

+

.

Z is the certainly explored zone.

Z + is the maybe explored zone.

Z + \ Z is the penumbra.

L. Jaulin Ocean exploration with underwater robots

(30)

Marine robots to build maps Cycles Mapping Exploration

L. Jaulin Ocean exploration with underwater robots

(31)

Marine robots to build maps Cycles Mapping Exploration

L. Jaulin Ocean exploration with underwater robots

(32)

Marine robots to build maps Cycles Mapping Exploration

L. Jaulin Ocean exploration with underwater robots

(33)

Marine robots to build maps Cycles Mapping Exploration

Spiral scan. We have [2]

[

t≥0

\

x∈ X (t)

V (x)

| {z }

{z | ∃t ∀x∈ X (t), z∈ V(x)}

⊂ Z = \

x(·)∈ X (·)

[

t≥0

V (x (t))

| {z }

{z | ∀x(·)∈ X (·),∃t, z∈ V(x)}

L. Jaulin Ocean exploration with underwater robots

(34)

Marine robots to build maps Cycles Mapping Exploration

L. Jaulin Ocean exploration with underwater robots

(35)

Marine robots to build maps Cycles Mapping Exploration

L. Jaulin Ocean exploration with underwater robots

(36)

Marine robots to build maps Cycles Mapping Exploration

L. Jaulin Ocean exploration with underwater robots

(37)

Marine robots to build maps Cycles Mapping Exploration

L. Jaulin Ocean exploration with underwater robots

(38)

Marine robots to build maps Cycles Mapping Exploration

L. Jaulin Ocean exploration with underwater robots

(39)

Marine robots to build maps Cycles Mapping Exploration

L. Jaulin Ocean exploration with underwater robots

(40)

Marine robots to build maps Cycles Mapping Exploration

Boustrophedon

L. Jaulin Ocean exploration with underwater robots

(41)

Marine robots to build maps Cycles Mapping Exploration

L. Jaulin Ocean exploration with underwater robots

(42)

Marine robots to build maps Cycles Mapping Exploration

Daurade DGA-TN

L. Jaulin Ocean exploration with underwater robots

(43)

Marine robots to build maps Cycles Mapping Exploration

During its boustrophedon Daurade explored Z ∈ [[ Z ]]

L. Jaulin Ocean exploration with underwater robots

(44)

Marine robots to build maps Cycles Mapping Exploration

B. Desrochers and L. Jaulin.

Computing a guaranteed approximation the zone explored by a robot.

IEEE Transaction on Automatic Control, 62(1):425430, 2017.

V. Drevelle, L. Jaulin, and B. Zerr.

Guaranteed characterization of the explored space of a mobile robot by using subpavings.

In Proc. Symp. Nonlinear Control Systems (NOLCOS'13), Toulouse, 2013.

L. Jaulin.

Isobath Following using an Altimeter as a Unique Exteroceptive Sensor.

In Sophia M. Schillai and Nicholas Townsend, editors, Robotic Sailing 2018, pages 105110, 2018.

L. Jaulin Ocean exploration with underwater robots

Références

Documents relatifs

In this paper a set membership approach, named Interval Analysis Localization (IAL) algo- rithm, will be considered for the global localization problem and compared to a Monte

Taking this uncertainty into account, it concludes that the dark gray zone is certainly illuminated (i.e., all corresponding points z are certainly seen at time t 1 ) and that

The computed set- interval of the explored area can be used after a search mission to ensure that space has been fully covered, to manually check possible but non-guaranteed

Unit´e de recherche INRIA Rennes, Irisa, Campus universitaire de Beaulieu, 35042 RENNES Cedex Unit´e de recherche INRIA Rhˆone-Alpes, 655, avenue de l’Europe, 38330 MONTBONNOT ST

The computed set- interval of the explored area can be used after a search mission to ensure that space has been fully covered, to manually check possible but non-guaranteed

These libraries are used in robotics and automatic control to verify dynamical properties of non-linear systems [10], to compute reachable sets [11, 12] or for state estimation

Taking this uncertainty into account, it concludes that the dark gray zone is certainly illuminated (i.e., all corresponding points z are certainly seen at time t 1 ) and that

To define probability models where averaging in the Wasserstein space amounts to take the expectation of an optimal transport map, we study statistical models for which the notion