This paper presents a model-based approach for computing real-time optimal decision strategies in the pursuitevasion game of Ms. Pac-Man. The game of Ms. Pac-Man is an excellent benchmark problem of pursuit-evasion game with multiple, active adversaries that adapt their pursuit policies based on Ms. Pac-Man’s state and decisions. In addition to evading the adversaries, the agent must pursue mul...

This paper describes evolution of artifical intelligent in the Game of Tag. In our simulator, artificial agents are classified as ’it’ (predator) and ’non-it’ (prey) and assigned symmetrical goals : pursuit and evasion respectively. Instead of using explicit fitness functions, predators and preys are evolved solely based on their pursuit and evasion records. Each agent has own artifical intelli...

Complex pursuit-evasion games with state variable inequality constraints are investigated. Necessary conditions of the first and the second order for optimal trajectories are developed, which enable the calculation of optimal open-loop strategies. The necessary conditions on singular surfaces induced by state constraints and nonsmooth data are discussed in detail. These conditions lead to multi...

B Abstract. Complex pursuit-evasion games with state variable inequality constraints are investigated. Necessary conditions of the rst and the second order for optimal trajectories are developed, which enable the calculation of optimal open-loop strategies. The necessary conditions on singular surfaces induced by state constraints and nonsmooth data are discussed in detail. These conditions lea...

The paper presents an extension of cost-cumulant control theory over a finite horizon for a class of two-team pursuit-evasion games wherein the evolution of the states of the game in response to decision strategies selected by pursuit and evasion teams from non-inferior sets of admissible controls is described by stochastic linear differential equation and integral quadratic cost. Since the sum...

We consider the pursuit and evasion game on finite, connected, undirected graphs known as cops and robbers. Meyniel conjectured that for every graph on n vertices O(n 1