Pursuit Evasion: The Herding Noncooperative Dynamic Game-The Stochastic Model

This article proposes a solution to the herding problem, a class of pursuit evasion problem in a stochastic framework. The problem involves a pursuer agent trying to herd a stochastically moving evader agent into a pen. The problem is stated in terms of allowable sequential actions of the two agents. The solution is obtained by applying the principles of stochastic dynamic programming. Three algorithms for solution are presented with their accompanying results

Pursuit Evasion: The Herding Non-cooperative Dynamic Game

A class of pursuit evasion problems is studied. This problem involves a dog agent herding a sheep agent in order to take the sheep to a pen. The problem is stated in terms of the allowable sequential actions of the two agents and the game being played because of the choices each agent has. The solution is obtained using the dynamic programming principle applied in the game setting. The algorithm is analyzed and simulation results are presented