Revision as of 20:54, 12 May 2015 edit Awashburn8 (talk \| contribs) 8 edits m added application to search theory ← Previous edit		Revision as of 20:54, 12 May 2015 edit undo ClueBot NG (talk \| contribs) Bots, Pending changes reviewers, Rollbackers 6,477,476 edits m Reverting possible vandalism by Awashburn8 to version by Xezbeth. False positive? Report it. Thanks, ClueBot NG. (2233824) (Bot) Next edit →
Line 8: 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 application of the the WTA. The main one is to search for a lost object or person by heterogeneous searchers. The agents might be dog teams, aircraft, walkers, etc. The goal is to minimize the nondetection probability by assigning the agents to a partition of the space in which the lost object might be located. Search software Win CASIE III<ref>www.wcasie.com</ref>, for example, includes this capability. ==Formal mathematical definition==

Weapon target assignment problem: Difference between revisions