| Preface |
|
xi | |
| Notations |
|
xiii | |
| Abbreviations |
|
xvii | |
| Introduction |
|
xix | |
|
|
|
1 | (64) |
|
|
|
3 | (2) |
|
Chapter 1 Static Set-membership State Estimation |
|
|
5 | (36) |
|
|
|
5 | (3) |
|
|
|
8 | (11) |
|
|
|
8 | (2) |
|
|
|
10 | (4) |
|
1.2.3 Inclusion functions |
|
|
14 | (2) |
|
1.2.4 Pessimism and wrapping effect |
|
|
16 | (3) |
|
1.3 Constraint propagation |
|
|
19 | (6) |
|
1.3.1 Constraint networks |
|
|
19 | (2) |
|
|
|
21 | (3) |
|
1.3.3 Application to static range-only robot localization |
|
|
24 | (1) |
|
1.4 Set-inversion via interval analysis |
|
|
25 | (10) |
|
|
|
25 | (3) |
|
1.4.2 SIVIA algorithm for set-inversion |
|
|
28 | (1) |
|
1.4.3 Illustration involving contractions |
|
|
29 | (4) |
|
1.4.4 Kernel characterization of an interval function |
|
|
33 | (2) |
|
|
|
35 | (3) |
|
1.5.1 From sensors to reliable results |
|
|
36 | (1) |
|
1.5.2 Numerical libraries |
|
|
37 | (1) |
|
1.5.3 Reliable tool for proof purposes |
|
|
38 | (1) |
|
|
|
38 | (3) |
|
Chapter 2 Constraints Over Sets of Trajectories |
|
|
41 | (24) |
|
2.1 Towards dynamic state estimation |
|
|
41 | (3) |
|
2.1.1 Overall motivations |
|
|
41 | (2) |
|
2.1.2 The approach presented in this book |
|
|
43 | (1) |
|
|
|
44 | (6) |
|
|
|
44 | (1) |
|
|
|
45 | (3) |
|
|
|
48 | (2) |
|
|
|
50 | (7) |
|
|
|
52 | (2) |
|
2.3.2 Build a tube from real datasets |
|
|
54 | (3) |
|
2.3.3 Tubex, dedicated tube library |
|
|
57 | (1) |
|
2.4 Application: dead-reckoning of a mobile robot |
|
|
57 | (3) |
|
|
|
58 | (1) |
|
|
|
58 | (1) |
|
|
|
59 | (1) |
|
|
|
60 | (3) |
|
|
|
60 | (1) |
|
2.5.2 Extract the most probable trajectory from a tube |
|
|
61 | (1) |
|
2.5.3 Application to path planning |
|
|
62 | (1) |
|
|
|
63 | (2) |
|
Part 2 Constraints-related Contributions |
|
|
65 | (64) |
|
|
|
67 | (2) |
|
Chapter 3 Trajectories under Differential Constraints |
|
|
69 | (32) |
|
|
|
69 | (4) |
|
3.1.1 The differential problem |
|
|
69 | (1) |
|
3.1.2 Attempts with set-membership methods |
|
|
70 | (2) |
|
3.1.3 Contribution of this work |
|
|
72 | (1) |
|
3.2 Differential contractor for L d/t: x(·) = v(·) |
|
|
73 | (9) |
|
3.2.1 Definition and proof |
|
|
74 | (5) |
|
3.2.2 Contraction of the derivative |
|
|
79 | (1) |
|
|
|
80 | (2) |
|
3.3 Contractor-based approach for state estimation |
|
|
82 | (8) |
|
3.3.1 Constraint network of state equations |
|
|
84 | (1) |
|
3.3.2 Fixed-point propagations |
|
|
85 | (2) |
|
3.3.3 Theoretical example of interest x = - sin(x) |
|
|
87 | (3) |
|
|
|
90 | (9) |
|
3.4.1 Causal kinematic chain |
|
|
90 | (3) |
|
3.4.2 Higher-order differential constraints |
|
|
93 | (1) |
|
3.4.3 Kidnapped robot problem |
|
|
93 | (1) |
|
3.4.4 Actual experiment with the Daurade AUV |
|
|
94 | (5) |
|
|
|
99 | (2) |
|
Chapter 4 Trajectories Under Evaluation Constraints |
|
|
101 | (28) |
|
|
|
101 | (4) |
|
4.1.1 Contribution of this work |
|
|
101 | (1) |
|
4.1.2 Motivations to deal with time uncertainties |
|
|
102 | (3) |
|
4.2 Generic contractor for trajectory evaluation |
|
|
105 | (9) |
|
4.2.1 Tube contractor for the constraint Leval: z = y(t) |
|
|
105 | (8) |
|
|
|
111 | |
|
4.2.3 Application to state estimation |
|
|
113 | (1) |
|
|
|
114 | (13) |
|
4.3.1 Range-only robot localization with low-cost beacons |
|
|
114 | (7) |
|
4.3.2 Reliable correction of a drifting clock |
|
|
121 | (6) |
|
|
|
127 | (2) |
|
Part 3 Robotics-related Contributions |
|
|
129 | (82) |
|
|
|
131 | (2) |
|
Chapter 5 Looped Trajectories: From Detections to Proofs |
|
|
133 | (32) |
|
|
|
133 | (2) |
|
5.1.1 The difference between detection and verification |
|
|
133 | (1) |
|
5.1.2 Proprioceptive versus exteroceptive measurements |
|
|
134 | (1) |
|
5.1.3 The two-dimensional case |
|
|
135 | (1) |
|
5.2 Proprioceptive loop detections |
|
|
135 | (6) |
|
|
|
136 | (1) |
|
5.2.2 Loop detections in a bounded-error context |
|
|
137 | (1) |
|
5.2.3 Approximation of the solution set T |
|
|
138 | (3) |
|
5.3 Proving loops in detection sets |
|
|
141 | (10) |
|
5.3.1 Formalism: zero verification |
|
|
141 | (1) |
|
5.3.2 Topological degree for zero verification |
|
|
141 | (4) |
|
5.3.3 Loop existence test |
|
|
145 | (4) |
|
5.3.4 Reliable number of loops |
|
|
149 | (2) |
|
|
|
151 | (12) |
|
5.4.1 The Redermor mission |
|
|
152 | (4) |
|
5.4.2 The Daurade mission |
|
|
156 | (3) |
|
5.4.3 Optimality of the approach |
|
|
159 | (4) |
|
|
|
163 | (2) |
|
Chapter 6 A Reliable Temporal Approach for the SLAM Problem |
|
|
165 | (46) |
|
|
|
165 | (7) |
|
|
|
165 | (2) |
|
|
|
167 | (2) |
|
6.1.3 Inter-temporalities |
|
|
169 | (3) |
|
|
|
172 | (18) |
|
6.2.1 General assumptions |
|
|
172 | (1) |
|
6.2.2 Temporal resolution |
|
|
173 | (1) |
|
6.2.3 Lp⇒z: inter-temporal implication constraint |
|
|
174 | (4) |
|
6.2.4 The Cp⇒z contractor |
|
|
178 | (8) |
|
6.2.5 Temporal SLAM algorithm |
|
|
186 | (4) |
|
6.3 Underwater application: bathymetric SLAM |
|
|
190 | (13) |
|
|
|
190 | (4) |
|
6.3.2 Daurade's underwater mission, October 20, 2015 |
|
|
194 | (5) |
|
6.3.3 Daurade's underwater mission, October 19, 2015 |
|
|
199 | (3) |
|
6.3.4 Overview of the environment |
|
|
202 | (1) |
|
|
|
203 | (4) |
|
6.4.1 Relation to the state of the art |
|
|
203 | (2) |
|
6.4.2 About a Bayesian resolution |
|
|
205 | (1) |
|
|
|
205 | (1) |
|
6.4.4 Fluctuating measurements |
|
|
205 | (2) |
|
|
|
207 | (4) |
| Conclusion |
|
211 | (6) |
| References |
|
217 | (12) |
| Index |
|
229 | |