返回
Game-theoretic planning for multiplayer defense task with online objective function parameter estimation☆
DOI:10.1016/j.isatra.2024.11.053.png)
摘要
En 中文
This work investigates a game-theoretic path planning algorithm with online objective function parameter estimation fora multiplayer intrusion-defense game, where the defenders aim to prevent intruders from entering the protected area. At first, an intruder is assigned to each defender to perform a one-to-one interception by solving an integer optimization problem. Then, the intrusion-defense game is formulated in a receding horizon manner by designing the objective function and constraints for the defenders and intruders, respectively. Their objective functions are coupled because they both consider the predicted interactions between the intruders and defenders. Therefore, a distributed proximal iterative best response scheme is designed for the group of defenders to cooperatively compute the Nash equilibrium. Each defender iteratively solves its own and its interception target's optimization problems, and shares information within the defender group. Since the defenders cannot know the parameters of the intruders' objective functions, an unscented Kalman filter-based estimator is constructed to online estimate the opponent's unknown parameters. Extensive simulation experiments verify the effectiveness of the proposed method.
Keyword:
Multiplayer intrusion-defense game
Receding horizon optimization
Task-assignment
Iterative best response
Unscented Kalman filter
期刊
IF:
6.5
论文数:
5.9K
被引数:
2.0W
机构
引用论文
Spacecraft orbital pursuit-evasion games with J2 perturbations and direction-constrained thrust
ACTA ASTRONAUTICA
IF3.4
Reinforcement learning-based formation-surrounding control for multiple quadrotor UAVs pursuit-evasion games基于强化学习的多四旋翼无人机追逃游戏编队包围控制
ISA TRANSACTIONS
IF6.5
Active Sugar Accumulation and Water Status of Watermelon Fruit Grown under Different Nutrient Concentrations in Hydroponic Culture
HortScience
IF0

