Multi-Swarm Herding: Protecting against Adversarial Swarms.

Abstract

This paper studies a defense approach against one or more swarms of adversarial agents. In our earlier work, we employ a closed formation (‘StringNet’) of defending agents (defenders) around a swarm of adversarial agents (attackers) to confine their motion within given bounds, and guide them to a safe area. The control design relies on the assumption that the adversarial agents remain close enough to each other, i.e., within a prescribed connectivity region. To handle situations when the attackers no longer stay within such a connectivity region, but rather split into smaller swarms (clusters) to maximize the chance or impact of attack, this paper proposes an approach to learn the attacking sub-swarms and reassign defenders towards the attackers. We use a ‘Density-based Spatial Clustering of Application with Noise (DBSCAN)’ algorithm to identify the spatially distributed swarms of the attackers. Then, the defenders are assigned to each identified swarm of attackers by solving a constrained generalized assignment problem. Simulations are provided to demonstrate the effectiveness of the approach.

Bib

@inproceedings{DBLP:conf/cdc/ChipadeP20,
  author       = {Vishnu S. Chipade and
                  Dimitra Panagou},
  title        = {Multi-Swarm Herding: Protecting against Adversarial Swarms},
  booktitle    = {59th {IEEE} Conference on Decision and Control, {CDC} 2020, Jeju Island,
                  South Korea, December 14-18, 2020},
  pages        = {5374--5379},
  publisher    = {{IEEE}},
  year         = {2020},
  url          = {https://doi.org/10.1109/CDC42340.2020.9303837},
  doi          = {10.1109/CDC42340.2020.9303837},
  timestamp    = {Fri, 04 Mar 2022 13:31:02 +0100},
  biburl       = {https://dblp.org/rec/conf/cdc/ChipadeP20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}