Journal of Intelligent & Robotic Systems

, Volume 74, Issue 3, pp 709–724

Policy Improvements for Probabilistic Pursuit-Evasion Game

Article

DOI: 10.1007/s10846-013-9857-z

Cite this article as:
Kwak, D.J. & Kim, H.J. J Intell Robot Syst (2014) 74: 709. doi:10.1007/s10846-013-9857-z
  • 345 Downloads

Abstract

This paper focuses on a pursuit-evasion game (PEG) which involves two teams: one side consists of pursuers trying to minimize the time required to capture evaders, and the other side consists of evaders trying to maximize the capture time by escaping the pursuers. In this paper, we propose a hybrid pursuit policy for a probabilistic PEG, which possesses the combined merits of local-max and global-max pursuit policies proposed in previous literature. A method to find optimal pursuit and evasion polices for two competitive parties of the pursuers and evaders is also proposed. For this, we employ an episodic parameter optimization (EPO) algorithm to learn good values for the weighting parameters of a hybrid pursuit policy and an intelligent evasion policy. The EPO algorithm is performed during the numerous repeated simulation runs of the PEG and the reward of each episode is updated using reinforcement learning, and the optimal weighting parameters are selected by using particle swarm optimization. We analyze the trend of the optimal parameter values with respect to the number of the pursuers and evaders. The proposed strategy is validated both in simulations and experiments with small ground robots.

Keywords

Pursuit-evasion game Probabilistic game Multiple robots Reinforcement learning Particle swarm optimization 

Copyright information

© Springer Science+Business Media Dordrecht 2013

Authors and Affiliations

  1. 1.School of Mechanical and Aerospace EngineeringSeoul National UniversitySeoulKorea