A discrete-time pursuit-evasion game in convex polygonal environments

DOI10.1016/j.sysconle.2018.12.008zbMath1426.91036OpenAlexW2911620209MaRDI QIDQ2328115

Matteo Criscuoli, Marco Casini, Andrea Garulli

Publication date: 9 October 2019

Published in: Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.sysconle.2018.12.008

zbMATH Keywords

game theorypursuit-evasion gamesautonomous agentslion and man problem

Mathematics Subject Classification ID

Discrete-time games (91A50) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (5)

On one simple pursuit problem of two rigidly coordinated evaders ⋮ On a discrete game problem with non-convex control vectograms ⋮ On the advantage of centralized strategies in the three-pursuer single-evader game ⋮ A linear group pursuit problem with fractional derivatives and different player capabilities ⋮ Approximate capture in Gromov-Hausdorff close spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Cooperative pursuit with Voronoi partitions
• A framework for pursuit evasion games in
• A Leapfrog Strategy for Pursuit-Evasion in a Polygonal Environment
• “Lion and Man”: Upper and Lower Bounds
• Pursuit-evasion in a two-dimensional domain
• Solution of David Gale's lion and man problem

This page was built for publication: A discrete-time pursuit-evasion game in convex polygonal environments