Optimal Algorithms for a Pursuit-Evasion Problem in Grids
From MaRDI portal
Recommendations
Cited in
(23)- Standard directed search strategies and their applications
- Lower bound for the advantage coefficient in the search problem on graphs
- Some pursuit-evasion problems on grids
- A pursuit-evasion problem on a grid
- Helicopter search problems, bandwidth and pathwidth
- On the domination search number
- The searchlight problem for road networks
- The theory of guaranteed search on graphs
- Pursuit of a moving target with known constant speed on a directed acyclic graph under partial information
- Fast searching games on graphs
- Searching expenditure and interval graphs
- SEARCHING A PSEUDO 3-SIDED SOLID ORTHOCONVEX GRID
- Probabilistic Pursuits on the Grid
- An efficient algorithm for a visibility-based surveillance-evasion game
- Pursuit and evasion from a distance: algorithms and bounds
- Control sequencing in a game of identity pursuit-evasion
- Vision-based pursuit-evasion in a grid
- Vision-Based Pursuit-Evasion in a Grid
- On-line search in two-dimensional environment
- On-line search in two-dimensional environment
- A cops and robber game in multidimensional grids
- Gittins index based control policy for a class of pursuit-evasion problems
- An annotated bibliography on guaranteed graph searching
This page was built for publication: Optimal Algorithms for a Pursuit-Evasion Problem in Grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3833623)