Multiplayer pursuit-evasion games in three-dimensional flow fields (Q2292123)

A game has players, strategies and scores to explain why the players win or lose. Games which are modelled with differential equations are called differential games. In pursuit-evasion games there are one or a group of moving pursuers that are pursuing one or a group of moving evaders that are running away. In this paper, authors considered a differential pursuit-evasion game with many pursuers and many evaders in a three- dimensional space subject to an external dynamic flow field. Two algorithms to partition the pursuer set from either the pursuer's perspective or the evader's perspective are presented. Within each partition, the problem is reduced into a multi-pursuer and single-evader differential game. The pursuit-evasion problem is first achieved by pairing each pursuer with the evader that first enters the attainability domain of this pursuer among all the evaders. An algorithm is presented to partition the pursuer set through the generation of the Zermelo-Voronoi Diagram from the initial positions of the evaders under the identical pursuer and time-invariant flow field assumption.