In this paper we develop a probabilistic framework for pursuit-evasion games. We propose a "greedy" policy to control a swarm of autonomous agents in the pursuit of one or several evaders. At each instant of time this policy directs the pursuers to the locations that maximize the probability of finding an evader at that particular time instant. It is shown that, under mild assumptions, this policy guarantees that an evader is found in finite time and that the expected time needed to find the evader is also finite. Simulations are included to illustrate the results.
A greedy policy for directing a group of moving agents to "swarm" locations with the highest probabilities of finding an evader is proposed REF and shown to find an evader in finite time.
Multiple-agent probabilistic pursuit-evasion games
Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304)
Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304)
Computer Science