Robust resource allocation heuristics for military village search missions
On the modern battlefield, cordon and search missions (a.k.a. village searches) are conducted daily. Creating resource allocations that assign different types of search teams (e.g., soldiers, robots, unmanned aerial vehicles, military working dogs) to target buildings of various sizes is difficult and time consuming in the static planning environment. Efficiently and effectively creating resource allocations when needed during mission execution (a dynamic environment) is even more challenging. There are currently no automated means to create these static and dynamic resource allocations for ...