An anytime algorithm based on decentralized cooperative auction for dynamic joint fire distribution problem

The mathematic model for Dynamic Joint Fire Distribution (DJFD) problem is presented, which considers over cooperation between weapons and sensors while assigning weapons to targets against a background of air formation attacking to surface mobile targets. The constraint space which comprises resource constraints, shifting firepower constraints, temporal constraints and spatial constraints is analyzed. An anytime algorithm based on decentralized cooperative auction is developed in the paper for the DJFD problem. The algorithm has two main advantages: (1) the algorithm can assign targets asynchronously and accept new targets for assignment during the allocation process, (2) the algorithm can get a better solution compared with the ones which assign targets synchronously. The feasibility and the validity of the algorithm are verified in simulation. At the end, further researches needed are discussed.