Resilient Active Information Acquisition with Teams of Robots

Emerging applications of collaborative autonomy, such as <italic>multitarget tracking</italic>, <italic>unknown map exploration</italic>, and <italic>persistent surveillance</italic>, require robots plan paths to navigate an environment while maximizing the information collected via on-board sensors. In this article, we consider such information acquisition tasks but in adversarial environments, where attacks may temporarily disable the robots’ sensors. We propose the first receding horizon algorithm, aiming for robust and adaptive multirobot planning against any number of attacks, which we call <italic>Resilient Active Information acquisitioN</italic> (<monospace>RAIN</monospace>). <monospace>RAIN</monospace> calls, in an online fashion, a <italic>robust trajectory planning</italic> (<monospace>RTP</monospace>) subroutine that plans attack-robust control inputs over a look-ahead planning horizon. We quantify <monospace>RTP</monospace>’s performance by bounding its suboptimality. We base our theoretical analysis on notions of curvature introduced in combinatorial optimization. We evaluate <monospace>RAIN</monospace> in three information acquisition scenarios: <italic>multitarget tracking</italic>, <italic>occupancy grid mapping</italic>, and <italic>persistent surveillance</italic>. The scenarios are simulated in C++ and a unity-based simulator. In all simulations, <monospace>RAIN</monospace> runs in real time, and exhibits superior performance against a state-of-the-art baseline information acquisition algorithm, even in the presence of a high number of attacks. We also demonstrate <monospace>RAIN</monospace>’s robustness and effectiveness against varying models of attacks (worst case and random), as well as varying replanning rates.