Pursuit evasion: The herding non-cooperative dynamic game

Document Type



A class of pursuit evasion problems is studied. This problem involves a "dog" agent herding a "sheep" agent in order to take the sheep to a pen. The problem is stated in terms of the allowable sequential actions of the two agents and the game being played because of the choices each agent has. The solution is obtained using the dynamic programming principle applied in the game setting. The algorithm is analyzed and simulation results are presented.


Dog-sheep; Dynamic programming; Game theory; Herding problem; Value function


Use Find in Your Library, contact the author, or use interlibrary loan to garner a copy of the article. Publisher copyright policy allows author to archive post-print (author’s final manuscript). When post-print is available or publisher policy changes, the article will be deposited

UNLV article access

Search your library