群体行为
数学优化
纳什均衡
博弈论
符号
分配问题
计算机科学
广义指派问题
匹配(统计)
理论计算机科学
数学
数理经济学
算术
统计
作者
Tao Zhang,Zhu Yiji,Dongying Ma,Chaoyong Li,Xiaodong Wang
标识
DOI:10.1109/taes.2024.3361436
摘要
The decision and control problem for swarm operations is crucial for autonomous military conflict management. In this paper, the underlying decision and control problem is treated as a non-cooperative game problem, in which the underlying target assignment problem is generalized to be a graph-theoretic problem. We introduce an algorithm to seek the desired Nash equilibrium with the help of the parallel maximum weight matching algorithm. Then, we prove that the proposed solution is $\epsilon$ -Nash with guaranteed computational efficiency, and is well suited for the swarm conflict. Simulation results verified the effectiveness of the proposed solutions.
科研通智能强力驱动
Strongly Powered by AbleSci AI