A Successive-Elimination Approach to Adaptive Robotic Source Seeking
A Successive-Elimination Approach to Adaptive Robotic Source Seeking
复制标题
自适应机器人寻源的逐次消除方法
DOI:
--
复制
发表时间:
2018
影响因子:
7.8
通讯作者:
C. Tomlin
中科院分区:
文献类型:
--
作者:
Esther Rolf;David Fridovich;Max Simchowitz;B. Recht;C. Tomlin
In this article, we study an adaptive source seeking problem, in which a mobile robot must identify the strongest emitter(s) of a signal in an environment with background emissions. Background signals may be highly heterogeneous and can mislead algorithms that are based on receding horizon control. We propose <inline-formula><tex-math notation="LaTeX">$mathtt {AdaSearch}$</tex-math></inline-formula>, a general algorithm for adaptive source seeking in the face of heterogeneous background noise. <inline-formula><tex-math notation="LaTeX">$mathtt {AdaSearch}$</tex-math></inline-formula> combines global trajectory planning with principled confidence intervals in order to concentrate measurements in promising regions while guaranteeing sufficient coverage of the entire area. Theoretical analysis shows that <inline-formula><tex-math notation="LaTeX">$mathtt {AdaSearch}$</tex-math></inline-formula> confers gains over a uniform sampling strategy when the distribution of background signals is highly variable. Simulation experiments demonstrate that when applied to the problem of radioactive source-seeking, <inline-formula><tex-math notation="LaTeX">$mathtt {AdaSearch}$</tex-math></inline-formula> outperforms both uniform sampling and a receding time horizon information-maximization approach based on the current literature. We also demonstrate <inline-formula><tex-math notation="LaTeX">$mathtt {AdaSearch}$</tex-math></inline-formula> in hardware, providing further evidence of its potential for real-time implementation.