Document Type

Article

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.

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.

UNLV article access

Search your library

Share

COinS