Pursuit evasion: the herding noncooperative dynamic game - the stochastic model

Author

Kachroo, Pushkin ; Shedied, Samy A. ; Vanlandingham, Hugh

Author_Institution

Bradley Dept. of Electr. Eng., Virginia Polytech. Inst. & State Univ., Blacksburg, VA, USA

Volume

32

Issue

1

fYear

2002

fDate

2/1/2002 12:00:00 AM

Firstpage

37

Lastpage

42

Abstract

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

Keywords

dynamic programming; game theory; games of skill; search problems; software agents; stochastic programming; admissible policy search stochastic shortest path; allowable sequential actions; herding noncooperative dynamic game; policy iteration; pursuer agent; pursuit evasion; stochastic dynamic programming; stochastic model; stochastically moving evader agent; value function; value iteration; Fuzzy logic; Genetic algorithms; Genetic mutations; Knowledge acquisition; Neural networks; Probability; Problem-solving; Rough sets; Shortest path problem; Stochastic processes;

fLanguage

English

Journal_Title

Systems, Man, and Cybernetics, Part C: Applications and Reviews, IEEE Transactions on

Publisher

ieee

ISSN

1094-6977

Type

jour

DOI

10.1109/TSMCC.2002.1009131

Filename

1009131