“Lion and Man”: Upper and Lower Bounds
From MaRDI portal
Publication:4024317
Recommendations
Cited in
(19)- \(k\)-capture in multiagent pursuit evasion, or the lion and the hyenas
- Approximate capture in Gromov-Hausdorff close spaces
- Generalized `Lion \& Man' game of R. Rado
- Smarter Lions: efficient cooperative pursuit in general bounded arenas
- Lion and man game in compact spaces
- Lion and man -- can both win?
- Equal-speed pursuit and evasion on manifolds
- The lion and man problem - revisited
- ``Lion-man game and the fixed point property in Hilbert spaces
- The lion and man game on polyhedral surfaces with obstacles
- A framework for pursuit evasion games in
- Capture bounds for visibility-based pursuit evasion
- A uniform betweenness property in metric spaces and its role in the quantitative analysis of the ``lion-man game
- Offline variants of the ``lion and man problem: some problems and techniques for measuring crowdedness and for safe path planning
- Bounds for cops and robber pursuit
- A discrete-time pursuit-evasion game in convex polygonal environments
- A leapfrog strategy for pursuit-evasion in a polygonal environment
- Lions and contamination, triangular grids, and Cheeger constants
- How many lions are needed to clear a grid?
This page was built for publication: “Lion and Man”: Upper and Lower Bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4024317)