Set inversion for chi-algorithms, with application to guaranteed robot localization

Citation
L. Jaulin et al., Set inversion for chi-algorithms, with application to guaranteed robot localization, MATH COMP S, 52(3-4), 2000, pp. 197-210
Citations number
24
Categorie Soggetti
Engineering Mathematics
Journal title
MATHEMATICS AND COMPUTERS IN SIMULATION
ISSN journal
03784754 → ACNP
Volume
52
Issue
3-4
Year of publication
2000
Pages
197 - 210
Database
ISI
SICI code
0378-4754(20000630)52:3-4<197:SIFCWA>2.0.ZU;2-9
Abstract
Characterizing the set of all parameter vectors such that their image by a vector belongs to a given set is a set-inversion problem. The algorithm set inversion via interval analysis (STVIA) makes it possible to perform this task in an approximate but guaranteed way. In the examples treated so far, the function to be inverted was given either explicitly or by a sequential algorithm. In this paper, this approach is extended to the case of branchin g algorithms involving if statements. As an illustration, the static locali zation of a robot from bounded-error range measurements is considered. The notion of remoteness, introduced for an archetypal but realistic sonar mode l, allows this problem to be cast into the set-inversion framework. (C) 200 0 IMACS/Elsevier Science B.V. All rights reserved.