Near-optimal probabilistic search via submodularity and sparse regression

Kuo Shih Tseng, Bérénice Mettler

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

15 引文 斯高帕斯(Scopus)

摘要

The goal of search is to maximize the probability of target detection while covering most of the environment in minimum time. Existing approaches only consider one of these objectives at a time and most optimal search problems are NP-hard. In this research, a novel approach for search problems is proposed that considers three objectives: (1) coverage using the fewest sensors; (2) probabilistic search with the maximal probability of detection rate (PDR); and (3) minimum-time trajectory planning. Since two of three objective functions are submodular, the search problem is reformulated to take advantage of this property. The proposed sparse cognitive-based adaptive optimization and PDR algorithms are within (1 - 1 / e) of the optimum with high probability. Experiments show that the proposed approach is able to search for targets faster than the existing approaches.

原文???core.languages.en_GB???
頁(從 - 到)205-229
頁數25
期刊Autonomous Robots
41
發行號1
DOIs
出版狀態已出版 - 1 1月 2017

指紋

深入研究「Near-optimal probabilistic search via submodularity and sparse regression」主題。共同形成了獨特的指紋。

引用此