摘要
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 |