The allocation of combat resources on the future battlefield is a multi-stage confrontation problem with total resource 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 Calligraphy set 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 Marionettes the time range T was obtained by mathematical derivation.
Finally, a multi-channel power allocation experiment of satellite communication under the condition of multi-stage confrontation was designed to verify the good performance of LagrangeBwK-Exp3-G algorithm.