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 u22pursueru22 agent trying to herd a stochastically moving u22evaderu22 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.