Weapon target assignment problem: Difference between revisions

Revision as of 21:15, 12 May 2015

Revision as of 21:16, 12 May 2015

Line 9:

Both static and dynamic versions of WTA can be considered. In the static case, the weapons are assigned to targets once. The dynamic case involves many rounds of assignment where the state of the system after each exchange of fire (round) in considered in the next round. While the majority of work has been done on the static WTA problem, recently the dynamic WTA problem has received more attention.

In spite of the name, there are nonmilitary applications of the WTA. The main one is to search for a lost object or person by heterogeneous assets such as dogs, aircraft, walkers, etc. The problem is to assign the assets to a partition of the space in which the object is located to minimize the probability of not finding the object. The "value" of each element of the partition is the probability that the object is located there. For example [[www.wcasie.com Win CASIE III]] includes a function that solves the WTA.

==Formal mathematical definition==