返回
Adaptive Regret Minimization for Learning Complex Team-Based Tactics
DOI:10.1109/ACCESS.2019.2930640.png)
摘要
En 中文
This paper presents an approach and analysis for performing decentralized cooperative control of a team of decoys to achieve the Honeypot Ambush tactic. In this tactic, the threats are successfully lured into a designated region where they can be easily defeated. The decoys learn to cooperate by incorporating a game-theory-based online-learning method, known as regret minimization, to maximize the team's global reward. The decoy agents are assumed to have physical limitations and to be subject to certain stringent range constraints required for deceiving the networked threats. By employing an efficient coordination mechanism, the agents learn to be less greedy and allow weaker agents to catch up on their rewards to improve team performance. Such a coordination solution corresponds to achieving convergence to coarse correlated equilibrium. The numerical results verify the effectiveness of the proposed solution to achieve a global satisfaction outcome and to adapt to a wide spectrum of scenarios.
Keyword:
Multi-agent system
cooperative control
online learning
regret minimization
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Triggering and Control Codesign in Self-Triggered Model Predictive Control of Constrained Systems: With Guaranteed Performance约束系统的自触发模型预测控制中的触发和控制协同设计: 具有保证的性能
Coordinated behavior of cooperative agents using deep reinforcement learning基于深度强化学习的协作智能体协调行为
NEUROCOMPUTING
IF6.5
Model-Free Cooperative Control for Multi-Agent Systems Using the Approximate Dynamic Programming Approach
IEEE ACCESS
IF3.6
Decentralized cooperative aerial-surveillance using fixed-wing miniature UAVs
PROCEEDINGS OF THE IEEE
IF25.9

