A new class of pursuer strategies for the discrete-time lion and man problem

DOI10.1016/j.automatica.2018.11.015zbMath1411.91110OpenAlexW2902922746MaRDI QIDQ1737632

Andrea Garulli, Marco Casini

Publication date: 24 April 2019

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2018.11.015

zbMATH Keywords

game theorypursuit-evasion gamesautonomous agentsmobile roboticslion and man problem

Mathematics Subject Classification ID

Automated systems (robots, etc.) in control theory (93C85) Positional games (pursuit and evasion, etc.) (91A24) Software, source code, etc. for problems pertaining to systems and control theory (93-04)

Related Items (1)

On the advantage of centralized strategies in the three-pursuer single-evader game

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cooperative pursuit with Voronoi partitions
• Multi-player pursuit-evasion games with one superior evader
• Pursuit-evasion games in the presence of obstacles
• A framework for pursuit evasion games in
• Pursuing an evader through cooperative relaying in multi-agent surveillance networks
• On the Stackelberg strategy in nonzero-sum games
• Incremental Sampling-Based Algorithms for a Class of Pursuit-Evasion Games
• A Leapfrog Strategy for Pursuit-Evasion in a Polygonal Environment
• Pursuit-evasion in a two-dimensional domain
• Solution of David Gale's lion and man problem

This page was built for publication: A new class of pursuer strategies for the discrete-time lion and man problem