Randomized Pursuit-Evasion with Local Visibility
From MaRDI portal
Recommendations
Cited in
(25)- Locating a robber on a graph via distance queries
- Cops and Robber game with a fast robber on expander graphs and random graphs
- Cops, a fast robber and defensive domination on interval graphs
- Zero-visibility cops and robber and the pathwidth of a graph
- Multi-target consensus circle pursuit for multi-agent systems via a distributed multi-flocking method
- Locally optimizing strategies for approaching the furthest evader
- Variations on cops and robbers
- Chasing a fast robber on planar graphs and random graphs
- Evasive navigation of an autonomous mobile robot in hostile unknown environments
- A leapfrog strategy for pursuit-evasion in a polygonal environment
- Cops and invisible robbers: the cost of drunkenness
- Randomized Pursuit-Evasion in Graphs
- scientific article; zbMATH DE number 2086681 (Why is no real title available?)
- The fast robber on interval and chordal graphs
- Control sequencing in a game of identity pursuit-evasion
- Randomized pursuit-evasion with limited visibility
- Cops and robber on some families of oriented graphs
- Vision-Based Pursuit-Evasion in a Grid
- Variations of cops and robbers game on grids
- Pursuit evasion on polyhedral surfaces
- A cop-winning strategy on strongly cop-win graphs
- Static and expanding grid coverage with ant robots: complexity results
- Cops and robber on butterflies and solid grids
- The role of information in the cop-robber game
- Bounds for cops and robber pursuit
This page was built for publication: Randomized Pursuit-Evasion with Local Visibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470813)