Document Type



A herding dog and sheep problem is studied where the agent “dog” is considered the control action for moving the agent “sheep” to a fixed location using the dynamics of their interaction. The problem is solved for the deterministic case using dynamic programming. Proofs are provided for the correctness of the algorithms. The algorithm is analyzed for its complexity. A software package developed for experimentation is described.


Dog-sheep; Dynamic programming; Herding; Value function


©2001 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