Guarding a Target Area from a Heterogeneous Group of Cooperative Attackers
Yoonjae Lee, Goutam Das, Daigo Shishika, Efstathios Bakolas

TL;DR
This paper studies a multi-agent guarding problem with heterogeneous attackers of different speeds and importance weights, proposing equilibrium control policies and analyzing cooperative behaviors.
Contribution
It introduces a novel approach to model and solve a multi-agent guarding problem with heterogeneous attackers, including equilibrium control policies and validation methods.
Findings
Heterogeneity influences attacker cooperation
Proposed control policies achieve effective guarding
Numerical examples demonstrate emergent cooperation
Abstract
In this paper, we investigate a multi-agent target guarding problem in which a single defender seeks to capture multiple attackers aiming to reach a high-value target area. In contrast to previous studies, the attackers herein are assumed to be heterogeneous in the sense that they have not only different speeds but also different weights representing their respective degrees of importance (e.g., the amount of allocated resources). The objective of the attacker team is to jointly minimize the weighted sum of their final levels of proximity to the target area, whereas the defender aims to maximize the same value. Using geometric arguments, we construct candidate equilibrium control policies that require the solution of a (possibly nonconvex) optimization problem. Subsequently, we validate the optimality of the candidate control policies using parametric optimization techniques. Lastly, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNetwork Security and Intrusion Detection · Distributed Control Multi-Agent Systems · Advanced Malware Detection Techniques
