An efficient algorithm for a visibility-based surveillance-evasion game
From MaRDI portal
(Redirected from Publication:484735)
Recommendations
- Surveillance for security as a pursuit-evasion game
- A visibility-based pursuit-evasion game with a circular obstacle
- Visibility-based pursuit-evasion in a polygonal environment
- A framework for pursuit evasion games in
- scientific article; zbMATH DE number 1754612
- A differential game of surveillance-evasion of two identical cars
- Optimal evading strategies and task allocation in multi-player pursuit-evasion problems
- On the existence of Nash equilibrium for a two player pursuit-evasion game with visibility constraints
- Optimal Algorithms for a Pursuit-Evasion Problem in Grids
Cited in
(11)- A point-based approximate algorithm for one-sided partially observable pursuit-evasion games
- Evasive path planning under surveillance uncertainty
- On the existence of Nash equilibrium for a two player pursuit-evasion game with visibility constraints
- Incremental sampling-based algorithms for a class of pursuit-evasion games
- Automatic differentiation of non-holonomic fast marching for computing most threatening trajectories under sensors surveillance
- On the equivalence of pursuer strategies and the lack of Nash equilibrium in a visibility pursuit-evasion game
- Cooperative pursuit with Voronoi partitions
- Surveillance for security as a pursuit-evasion game
- Efficient path planning algorithms in reach-avoid problems
- A visibility-based pursuit-evasion game with a circular obstacle
- Smarter Lions: efficient cooperative pursuit in general bounded arenas
This page was built for publication: An efficient algorithm for a visibility-based surveillance-evasion game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q484735)
