A point-based approximate algorithm for one-sided partially observable pursuit-evasion games

DOI10.1007/978-3-319-47413-7_25MaRDI QIDQ3179204zbMATH OpenOpenAlexFDO

Authors Karel Horák, Branislav Bošanský

Publication date 21 December 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-47413-7_25

zbMATH Keywords

one-sided partial observabilityone-sided partially observable stochastic gamespursuit-evasion gamessecurity problems

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40) Stochastic games, stochastic differential games (91A15) Positional games (pursuit and evasion, etc.) (91A24)

Recommendations

• Incremental sampling-based algorithms for a class of pursuit-evasion games
• An efficient algorithm for a visibility-based surveillance-evasion game
• Solving partially observable agent-intruder games with an application to border security problems
• A framework for pursuit evasion games in
• Partially observable linear-quadratic stochastic pursuit-evasion games

Cites work

• Stochastic Games
• Zero-sum stochastic games with partial information

Cited in

(4)

• The Stackelberg equilibrium for one-sided zero-sum partially observable stochastic games
• Dynamic games in cyber-physical security: an overview
• Incremental sampling-based algorithms for a class of pursuit-evasion games
• Solving partially observable agent-intruder games with an application to border security problems

This page was built for publication: A point-based approximate algorithm for one-sided partially observable pursuit-evasion games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179204)