Minkowski Operations of Sets with Application to Robot Localization

Benoit Desrochers
(DGA-TN)
Luc Jaulin
(Ensta Bretagne, Lab-Sticc)

This papers shows that using separators, which is a pair of two complementary contractors, we can easily and efficiently solve the localization problem of a robot with sonar measurements in an unstructured environment. We introduce separators associated with the Minkowski sum and the Minkowski difference in order to facilitate the resolution. A test-case is given in order to illustrate the principle of the approach.

In Erika Ábrahám and Sergiy Bogomolov: Proceedings 3rd International Workshop on Symbolic and Numerical Methods for Reachability Analysis (SNR 2017), Uppsala, Sweden, 22nd April 2017, Electronic Proceedings in Theoretical Computer Science 247, pp. 34–45.
Published: 8th April 2017.

ArXived at: https://dx.doi.org/10.4204/EPTCS.247.3 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org