Abstract: The resource assignment algorithm is a key technology of realizing integrated air and missile defense.In order to solve the problem of sensor-weapon-target dynamic assignment in ballistic missile defense,a distributed assignment algorithm based on contract net protocol is proposed.Firstly,a formal model of the sensor-weapon-target dynamic assignment problem is constructed,which considers the practical constraints such as the spatial capability of sensors and weapons,and the number of guidance channels and interceptor missiles.An objective function is designed to achieve the two main principles of earliest interception and maximum success probability in ballistic missile defense.Then,on the basis of the contract network protocol framework,we construct thedynamic process of sensor-weapon-target assignment,and design the bidding and awarding strategies ofsensors and weapons according to their characteristics respectively.In the bidding strategy of weapons,the replacement of assigned targets is considered,and a method of selecting the replacement target is proposed which estimates the effectiveness loss caused by the replacement target rebidding.Computer simulation experimental results show that the proposed algorithm can assign sensors and weapons dynamically.Compared to the assignment method of traditional ballistic missile defense system,the proposed algorithm leads to earlier interception and greater success probability,and achieves 43.7% effectiveness improvement.

Key words: Sensor-Weapon-Target assignment, Distributed task assignment, Dynamic task assignment, Contract net protocol, Ballistic missile defense