TY - CHAP
T1 - Autonomous Exploration with Expectation-Maximization
AU - Wang, Jinkun
AU - Englot, Brendan
N1 - Publisher Copyright:
© 2020, Springer Nature Switzerland AG.
PY - 2020
Y1 - 2020
N2 - We consider the problem of autonomous mobile robot exploration in an unknown environment for the purpose of building an accurate feature-based map efficiently. Most literature on this subject is focused on the combination of a variety of utility functions, such as curbing robot pose uncertainty and the entropy of occupancy grid maps. However, the effect of uncertain poses is typically not well incorporated to penalize poor localization, which ultimately leads to an inaccurate map. Instead, we explicitly model unknown landmarks as latent variables, and predict their expected uncertainty, incorporating this into a utility function that is used together with sampling-based motion planning to produce informative and low-uncertainty motion primitives. We propose an iterative expectation-maximization algorithm to perform the planning process driving a robot’s step-by-step exploration of an unknown environment. We analyze the performance in simulated experiments, showing that our algorithm maintains the same coverage speed in exploration as competing algorithms, but effectively improves the quality of the resulting map.
AB - We consider the problem of autonomous mobile robot exploration in an unknown environment for the purpose of building an accurate feature-based map efficiently. Most literature on this subject is focused on the combination of a variety of utility functions, such as curbing robot pose uncertainty and the entropy of occupancy grid maps. However, the effect of uncertain poses is typically not well incorporated to penalize poor localization, which ultimately leads to an inaccurate map. Instead, we explicitly model unknown landmarks as latent variables, and predict their expected uncertainty, incorporating this into a utility function that is used together with sampling-based motion planning to produce informative and low-uncertainty motion primitives. We propose an iterative expectation-maximization algorithm to perform the planning process driving a robot’s step-by-step exploration of an unknown environment. We analyze the performance in simulated experiments, showing that our algorithm maintains the same coverage speed in exploration as competing algorithms, but effectively improves the quality of the resulting map.
UR - http://www.scopus.com/inward/record.url?scp=85107061276&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85107061276&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-28619-4_53
DO - 10.1007/978-3-030-28619-4_53
M3 - Chapter
AN - SCOPUS:85107061276
T3 - Springer Proceedings in Advanced Robotics
SP - 759
EP - 774
BT - Springer Proceedings in Advanced Robotics
ER -