Stealthy Terrain-Aware Multi-Agent Active Search

Stealthy multi-agent active search is the problem of making efficient sequential data-collection decisions to identify an unknown number of sparsely located targets while adapting to new sensing information and concealing the search agents' location from the targets. This problem is applicable...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Bakshi, Nikhil Angad, Schneider, Jeff
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 17.10.2023
Subjects
Algorithms
Multiagent systems
Parallel processing
Reconnaissance
Risk
Search methods
Terrain
Online AccessGet full text

Cover

More Information
Summary:Stealthy multi-agent active search is the problem of making efficient sequential data-collection decisions to identify an unknown number of sparsely located targets while adapting to new sensing information and concealing the search agents' location from the targets. This problem is applicable to reconnaissance tasks wherein the safety of the search agents can be compromised as the targets may be adversarial. Prior work usually focuses either on adversarial search, where the risk of revealing the agents' location to the targets is ignored or evasion strategies where efficient search is ignored. We present the Stealthy Terrain-Aware Reconnaissance (STAR) algorithm, a multi-objective parallelized Thompson sampling-based algorithm that relies on a strong topographical prior to reason over changing visibility risk over the course of the search. The STAR algorithm outperforms existing state-of-the-art multi-agent active search methods on both rate of recovery of targets as well as minimising risk even when subject to noisy observations, communication failures and an unknown number of targets.
ISSN:2331-8422