Dynamic Programming Solution for a Class of Pursuit Evasion Problems: The Herding Problem

Authors

Pushkin Kachroo, University of Nevada, Las VegasFollow
S. A. Shedied, Virginia Polytechnic Institute and State UniversityFollow
J. S. Bay, Virginia TechFollow
H. Vanlandingham, Virginia TechFollow

Document Type

Article

Publication Date

2001

Publication Title

IEEE Transactions on Systems, Man, and Cybernetics Part C

Volume

31

Issue

1

First page number:

35

Last page number:

41

Abstract

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.

Keywords

Dog-sheep; Dynamic programming; Herding; Value function

Comments

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

Repository Citation

Kachroo, P., Shedied, S. A., Bay, J. S., Vanlandingham, H. (2001). Dynamic Programming Solution for a Class of Pursuit Evasion Problems: The Herding Problem. IEEE Transactions on Systems, Man, and Cybernetics Part C, 31(1), 35-41.
https://digitalscholarship.unlv.edu/ece_fac_articles/48