Guarding a Target Area from a Heterogeneous Group of Cooperative Attackers
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 provide numerical examples to illustrate how cooperative behaviors emerge within the attacker team due to their heterogeneity.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
A Cooperative Multi-Agent Probabilistic Framework for Search and Track Missions
In this work a robust and scalable cooperative multi-agent searching and tracking framework is proposed. Specifically, we study the problem of cooperative searching and tracking of multiple moving targets by a group of a…
Design of distributed guidance laws for multi-UAV cooperative attacking a moving target based on reducing surrounding area
In this paper, two cooperative guidance laws based on the area around the target of multiattackers are designed to deal with the problem of cooperative encirclement or simultaneous attack in the case of known target acce…
GHQ: Grouped Hybrid Q Learning for Heterogeneous Cooperative Multi-agent Reinforcement Learning
Previous deep multi-agent reinforcement learning (MARL) algorithms have achieved impressive results, typically in homogeneous scenarios. However, heterogeneous scenarios are also very common and usually harder to solve. …
Multi-agent Reinforcement LearningQ-Learningreinforcement-learningReinforcement Learning (RL)+3Decentralized Search and Track with Multiple Autonomous Agents
In this paper we study the problem of cooperative searching and tracking (SAT) of multiple moving targets with a group of autonomous mobile agents that exhibit limited sensing capabilities. We assume that the actual numb…
Inferring Group Intent as a Cooperative Game. An NLP-based Framework for Trajectory Analysis
This paper studies group target trajectory intent as the outcome of a cooperative game where the complex-spatio trajectories are modeled using an NLP-based generative model. In our framework, the group intent is specifie…