Dynamic hierarchy for multiagent air combat

We consider application of Linguistic Geometry to the simplified air combat problems. The first example (Air Combat 1) requires an extremely deep search making this problem practically intractable employing conventional approaches. In the second example (Air Combat 2) the concurrent motions of agents are allowed which results in a significant growth of the branching factor. In both cases the Linguistic Geometry tools solved the problems demonstrating a dramatic search reduction, down to tens of moves