Near-optimal probabilistic search using spatial Fourier sparse set

Kuo Shih Tseng, Bérénice Mettler

研究成果: 雜誌貢獻期刊論文同行評審

11 引文 斯高帕斯(Scopus)

摘要

Autonomous search is an essential research topic for rescue and other robotic applications. However, searching for targets efficiently is still an unsolved problem. To achieve this objective, a robot needs to simultaneously maximize environmental coverage, maximize probability of detection (PD) and minimize motion cost. The problems associated with these objectives are NP-hard. This research reformulates the three objective functions as a maximum cumulative PD problem with motion cost. Since the PD function depends on the environment, the robot needs to both learn the PD function and the cost-to-go (CTG) function. This research proposes a reinforcement learning algorithm to learn the PD and CTG functions simultaneously. Since the PD function is sparse in the Fourier domain under certain subgoal patterns, spatial Fourier sparse set is proposed to learn PD functions based on the compressed sensing technique. The learned PD and CTG functions can then be used to generate subgoals that achieve (1 - 1 / e) of the optimum due to the submodularity. Experiments conducted with this algorithm demonstrate that the robot can search for the target faster than prior learning approaches (e.g., PMAC and FSS) and the benchmark model (e.g., PD).

原文???core.languages.en_GB???
頁(從 - 到)329-351
頁數23
期刊Autonomous Robots
42
發行號2
DOIs
出版狀態已出版 - 1 2月 2018

指紋

深入研究「Near-optimal probabilistic search using spatial Fourier sparse set」主題。共同形成了獨特的指紋。

引用此