Smarter Lions: Efficient Cooperative Pursuit in General Bounded Arenas
From MaRDI portal
Publication:5111067
DOI10.1137/17M1152589zbMath1444.91040OpenAlexW3021733985MaRDI QIDQ5111067
Claire J. Tomlin, Dušan M. Stipanović, Haomiao Huang, Zhengyuan Zhou, Jonathan Richard Shewchuk
Publication date: 26 May 2020
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/17m1152589
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decomposition of differential games with multiple targets
- Cooperative pursuit with Voronoi partitions
- An efficient algorithm for a visibility-based surveillance-evasion game
- The complexity of pursuit on a graph
- A game of cops and robbers
- Note on a pursuit game played on graphs
- A framework for pursuit evasion games in
- The lion and man problem - revisited
- On a pursuit game on Cayley graphs
- Cops and robbers in graphs with large girth and Cayley graphs
- A pursuit-evasion problem on a grid
- Efficient path planning algorithms in reach-avoid problems
- Capture pursuit games on unbounded domains
- Optimal pursuit with countably many pursuers and one evader
- Incremental Sampling-Based Algorithms for a Class of Pursuit-Evasion Games
- “Lion and Man”: Upper and Lower Bounds
- Optimal Coordinated Motions of Multiple Agents Moving on a Plane
- Randomized Pursuit-Evasion in Graphs
- The Lion and the Christian, and Other Pursuit and Evasion Games
- A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games
- Multiplayer Reach-Avoid Games via Pairwise Outcomes
- “Lion and Man”: A Postscript
- Lion and Man: The General Case
- Lion and Man: The Boundary Constraint
- Solution of David Gale's lion and man problem
This page was built for publication: Smarter Lions: Efficient Cooperative Pursuit in General Bounded Arenas
