Landmark Augmentation for Mobile Robot Localization Safety

التفاصيل البيبلوغرافية
العنوان: Landmark Augmentation for Mobile Robot Localization Safety
المؤلفون: Boris Pervan, Osama Abdul Hafez, Matthew Spenko, Yihe Chen
المصدر: IEEE Robotics and Automation Letters. 6:119-126
بيانات النشر: Institute of Electrical and Electronics Engineers (IEEE), 2021.
سنة النشر: 2021
مصطلحات موضوعية: 050210 logistics & transportation, 0209 industrial biotechnology, Control and Optimization, Landmark, Computer science, business.industry, Mechanical Engineering, 05 social sciences, Biomedical Engineering, Mobile robot, 02 engineering and technology, Computer Science Applications, Beacon, Human-Computer Interaction, 020901 industrial engineering & automation, Artificial Intelligence, Control and Systems Engineering, 0502 economics and business, Trajectory, Robot, Computer vision, Computer Vision and Pattern Recognition, Artificial intelligence, business, Generator (mathematics)
الوصف: 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.
تدمد: 2377-3774
DOI: 10.1109/lra.2020.3032067
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::79b9221edf7f1399686cd5234590201a
https://doi.org/10.1109/lra.2020.3032067
Rights: CLOSED
رقم الانضمام: edsair.doi...........79b9221edf7f1399686cd5234590201a
قاعدة البيانات: OpenAIRE
الوصف
تدمد:23773774
DOI:10.1109/lra.2020.3032067