Active localization for planetary rovers

Hiroka Inoue, Masahiro Ono, Sakurako Tamaki, Shuichi Adachi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

This paper presents a path planning algorithm to reduce localization error by intelligently choosing a path that will result in low expected sensor errors. For example, Mars rovers can enhance localization accuracy by selectively driving over feature-rich terrain where visual odometry can be used. In general, having an accurate localization is vital for autonomous mobile exploration platforms such as rovers and aerial vehicles. However, typical path planning methods tend to narrowly focus on minimizing path length. Our proposed path planning algorithm, namely Error Propagation A∗ (EPA∗ ), intelligently balances path length and localization. EPA∗ is a graph search algorithm, where a linear error propagation law is derived before the search on each edge of the graph. Using the propagation law, EPA∗ can quickly find a path that minimizes a given objective function, which includes both path length and error covariance. We demonstrate the EPA∗ algorithm using the real data from Curiosity. The result demonstrates that the EPA∗ algorithm can find a path that balances the path length and the expected localization error, as expected.

Original languageEnglish
Title of host publication2016 IEEE Aerospace Conference, AERO 2016
PublisherIEEE Computer Society
Volume2016-June
ISBN (Electronic)9781467376761
DOIs
Publication statusPublished - 2016 Jun 27
Event2016 IEEE Aerospace Conference, AERO 2016 - Big Sky, United States
Duration: 2016 Mar 52016 Mar 12

Other

Other2016 IEEE Aerospace Conference, AERO 2016
CountryUnited States
CityBig Sky
Period16/3/516/3/12

Fingerprint

propagation
trajectory planning
Motion planning
planning method
Mars
sensor
mars
vehicles
platforms
Antennas
planning
sensors
Sensors
vehicle

ASJC Scopus subject areas

  • Aerospace Engineering
  • Space and Planetary Science

Cite this

Inoue, H., Ono, M., Tamaki, S., & Adachi, S. (2016). Active localization for planetary rovers. In 2016 IEEE Aerospace Conference, AERO 2016 (Vol. 2016-June). [7500599] IEEE Computer Society. https://doi.org/10.1109/AERO.2016.7500599

Active localization for planetary rovers. / Inoue, Hiroka; Ono, Masahiro; Tamaki, Sakurako; Adachi, Shuichi.

2016 IEEE Aerospace Conference, AERO 2016. Vol. 2016-June IEEE Computer Society, 2016. 7500599.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Inoue, H, Ono, M, Tamaki, S & Adachi, S 2016, Active localization for planetary rovers. in 2016 IEEE Aerospace Conference, AERO 2016. vol. 2016-June, 7500599, IEEE Computer Society, 2016 IEEE Aerospace Conference, AERO 2016, Big Sky, United States, 16/3/5. https://doi.org/10.1109/AERO.2016.7500599
Inoue H, Ono M, Tamaki S, Adachi S. Active localization for planetary rovers. In 2016 IEEE Aerospace Conference, AERO 2016. Vol. 2016-June. IEEE Computer Society. 2016. 7500599 https://doi.org/10.1109/AERO.2016.7500599
Inoue, Hiroka ; Ono, Masahiro ; Tamaki, Sakurako ; Adachi, Shuichi. / Active localization for planetary rovers. 2016 IEEE Aerospace Conference, AERO 2016. Vol. 2016-June IEEE Computer Society, 2016.
@inproceedings{5f0ffa65eece4e0889078804fd4ab2ce,
title = "Active localization for planetary rovers",
abstract = "This paper presents a path planning algorithm to reduce localization error by intelligently choosing a path that will result in low expected sensor errors. For example, Mars rovers can enhance localization accuracy by selectively driving over feature-rich terrain where visual odometry can be used. In general, having an accurate localization is vital for autonomous mobile exploration platforms such as rovers and aerial vehicles. However, typical path planning methods tend to narrowly focus on minimizing path length. Our proposed path planning algorithm, namely Error Propagation A∗ (EPA∗ ), intelligently balances path length and localization. EPA∗ is a graph search algorithm, where a linear error propagation law is derived before the search on each edge of the graph. Using the propagation law, EPA∗ can quickly find a path that minimizes a given objective function, which includes both path length and error covariance. We demonstrate the EPA∗ algorithm using the real data from Curiosity. The result demonstrates that the EPA∗ algorithm can find a path that balances the path length and the expected localization error, as expected.",
author = "Hiroka Inoue and Masahiro Ono and Sakurako Tamaki and Shuichi Adachi",
year = "2016",
month = "6",
day = "27",
doi = "10.1109/AERO.2016.7500599",
language = "English",
volume = "2016-June",
booktitle = "2016 IEEE Aerospace Conference, AERO 2016",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Active localization for planetary rovers

AU - Inoue, Hiroka

AU - Ono, Masahiro

AU - Tamaki, Sakurako

AU - Adachi, Shuichi

PY - 2016/6/27

Y1 - 2016/6/27

N2 - This paper presents a path planning algorithm to reduce localization error by intelligently choosing a path that will result in low expected sensor errors. For example, Mars rovers can enhance localization accuracy by selectively driving over feature-rich terrain where visual odometry can be used. In general, having an accurate localization is vital for autonomous mobile exploration platforms such as rovers and aerial vehicles. However, typical path planning methods tend to narrowly focus on minimizing path length. Our proposed path planning algorithm, namely Error Propagation A∗ (EPA∗ ), intelligently balances path length and localization. EPA∗ is a graph search algorithm, where a linear error propagation law is derived before the search on each edge of the graph. Using the propagation law, EPA∗ can quickly find a path that minimizes a given objective function, which includes both path length and error covariance. We demonstrate the EPA∗ algorithm using the real data from Curiosity. The result demonstrates that the EPA∗ algorithm can find a path that balances the path length and the expected localization error, as expected.

AB - This paper presents a path planning algorithm to reduce localization error by intelligently choosing a path that will result in low expected sensor errors. For example, Mars rovers can enhance localization accuracy by selectively driving over feature-rich terrain where visual odometry can be used. In general, having an accurate localization is vital for autonomous mobile exploration platforms such as rovers and aerial vehicles. However, typical path planning methods tend to narrowly focus on minimizing path length. Our proposed path planning algorithm, namely Error Propagation A∗ (EPA∗ ), intelligently balances path length and localization. EPA∗ is a graph search algorithm, where a linear error propagation law is derived before the search on each edge of the graph. Using the propagation law, EPA∗ can quickly find a path that minimizes a given objective function, which includes both path length and error covariance. We demonstrate the EPA∗ algorithm using the real data from Curiosity. The result demonstrates that the EPA∗ algorithm can find a path that balances the path length and the expected localization error, as expected.

UR - http://www.scopus.com/inward/record.url?scp=84978477001&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84978477001&partnerID=8YFLogxK

U2 - 10.1109/AERO.2016.7500599

DO - 10.1109/AERO.2016.7500599

M3 - Conference contribution

AN - SCOPUS:84978477001

VL - 2016-June

BT - 2016 IEEE Aerospace Conference, AERO 2016

PB - IEEE Computer Society

ER -