智能科学与技术学报2023，Vol.5Issue(4)：464-476,13.DOI:10.11959/j.issn.2096-6652.202341
面向对抗条件下资源分配的在线多阶段布洛托博弈求解方法
Online multi-stage Colonel Blotto game solving method for resource allocation under contested condition
陈少飞 1邹明我 1苏小龙 1罗俊仁 1冯俊侨1
作者信息
- 1. 国防科技大学智能科学学院,湖南 长沙 410073
- 折叠
摘要
Abstract
The allocation of combat resources on the future battlefield is a multi-stage confrontation problem with total re-source budget constraints,which is characterized by high complexity of environment,dynamic uncertainty,and strong game confrontation.Based on the Blotto game model,the research firstly modelled the resource allocation problem in the multi-stage confrontation scenario as a two-level online Blotto game,then transformed the original problem into an online shortest path problem on a directed acyclic graph to realize the intuitive formulation of the resource allocation problem.The resource allocation problem was analyzed and solved by referring to the Lagrange game.In addition,the LagrangeBwK-Exp3-G algorithm was proposed to minimize the high probability regret of the resource allocation problem under the condition of multi-stage antagonism,and the high-probability regret bound of the algorithm on the time range T was obtained by mathematical derivation.Finally,a multi-channel power allocation experiment of satellite communica-tion under the condition of multi-stage confrontation was designed to verify the good performance of LagrangeBwK-Exp3-G algorithm.关键词
多阶段对抗/布洛托博弈/资源分配/高概率遗憾Key words
multi-stage adversarial/Blotto game/resource allocation/high probability regret分类
信息技术与安全科学引用本文复制引用
陈少飞,邹明我,苏小龙,罗俊仁,冯俊侨..面向对抗条件下资源分配的在线多阶段布洛托博弈求解方法[J].智能科学与技术学报,2023,5(4):464-476,13.
