Document Type

Article

Publication Date

2002

Publication Title

IEEE Transactions on Systems, Man, and Cybernetics Part C

Volume

32

Issue

1

First page number:

37

Last page number:

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

Admissible policy search stochastic shortest path; Dog-sheep; Dynamic programming; Game theory; Herding problem; Policy iteration; Stochastic processes; Value function; Value iteration

Comments

©2002 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

Identifier

DOI: 10.1109/TSMCC.2002.1009131

UNLV article access

Search your library

Share

COinS