Abstract:
A simple model is studied of a conflict where the pursuer catches up on a coalition of evaders. The distance to the coalition is that to the farthest evader. In the case of two evaders optimal pursuit strategies and a guaranteed range to the coalition are found. For more evaders the upperbound of that range is found, which is equivalent to the programmed way of choosing the pair of evaders to catch up on.
Fulltext:
PDF file (1723 kB)