Landmark Augmentation for Mobile Robot Localization Safety

As more robots, such as autonomous vehicles, are deployed in life-critical situations it is imperative to consider safety, and in particular, localization safety. While it would be ideal to guarantee localization safety without having to modify the environment, this is not always possible and one ma...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE robotics and automation letters 2021-01, Vol.6 (1), p.119-126
Hauptverfasser: Chen, Yihe, Hafez, Osama Abdul, Pervan, Boris, Spenko, Matthew
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:As more robots, such as autonomous vehicles, are deployed in life-critical situations it is imperative to consider safety, and in particular, localization safety. While it would be ideal to guarantee localization safety without having to modify the environment, this is not always possible and one may have to add landmarks or active beacons for landmark-based localization. As such, this work introduces a method to identify the minimum places in an environment where landmarks can be added to ensure localization safety, as quantified using integrity risk, the probability of undetected sensor errors causing localization failure while accounting for measurement faults. The letter formulates the problem as a systematic minimization: given the robot's trajectory and the current landmark map, add the minimum number of new landmarks such that the integrity risk along the trajectory is below a given safety threshold. The letter proposes three algorithms: a naive approach, Integrity-based Landmark Generator (I-LaG), and Fast I-LaG. The computationally expensive naive algorithm serves as a reference to illustrate simple scenarios. I-LaG adds relatively fewer landmarks than the Fast I-Lag algorithm but is more computationally expensive. Simulation and experimental results validate the proposed algorithms.
ISSN:2377-3766
2377-3766
DOI:10.1109/LRA.2020.3032067