Control Sequencing in a Game of Identity Pursuit-Evasion

DOI10.1137/140963765zbMath1321.49066OpenAlexW831287909MaRDI QIDQ5501220

Carl J. Wenk

Publication date: 3 August 2015

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/140963765

zbMATH Keywords

optimal controldynamic gamespursuit-evasion gamesequential decisions

Mathematics Subject Classification ID

Discrete-time control/observation systems (93C55) Dynamic programming (90C39) Dynamic games (91A25) Multistage and repeated games (91A20) Pursuit and evasion games (49N75) Positional games (pursuit and evasion, etc.) (91A24) Existence theories for optimal control problems involving relations other than differential equations (49J21)

Related Items (1)

Approximate solutions for expanding search games on general networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A game of cops and robbers
• An annotated bibliography on guaranteed graph searching
• Dynamic noncooperative game theory
• The theory of search games and rendezvous.
• Search Games with Multiple Hidden Objects
• Search Games on Trees with Asymmetric Travel Times
• Cop and Robber Games When the Robber Can Hide and Ride
• The Searchlight Scheduling Problem
• Multiagent Systems
• The “Princess and Monster” Game on an Interval
• Ambush Strategies in Search Games on Graphs
• Optimal Algorithms for a Pursuit-Evasion Problem in Grids
• Randomized Pursuit-Evasion in Graphs
• The Rendezvous Search Problem
• Cop and Robber Game and Hyperbolicity
• On Search Games That Include Ambush
• Randomized Pursuit-Evasion with Local Visibility
• Vision-Based Pursuit-Evasion in a Grid
• \(H^ \infty\)-optimal control and related minimax design problems. A dynamic game approach.

This page was built for publication: Control Sequencing in a Game of Identity Pursuit-Evasion