Abstract: The aim of this study is to provide a solution to air combat decision making for coordinated multiple target assignments of multi-fighters which use the tactical digital information links to share and exchange combat information. Based on combinatorial auction algorithms (CABOB), a new algorithm is proposed. To make the algorithm more applicable, a new bid tuple is designed; the reserve price and the upper bound of the mission are set which are used to pre-check the ability of the bidder to accomplish the mission. In order to achieve a coordinated attack, the dynamic bidding rank is used to improve the algorithm so it can support the bidders in sharing the items. And a new heuristic method to compute the upper bound of the expected contribution value is proposed to speed up the computation. Simulation results show that this algorithm provides better solutions than conventional methods. In addition, it also possesses better stability and scalability.

Key words: decision making, combinatorial auction, coordinated work, target assignment, heuristics, beyond visual range air-to-air combat