AAAI Publications, Thirty-First AAAI Conference on Artificial Intelligence

Font Size: 
Heuristic Search Value Iteration for One-Sided Partially Observable Stochastic Games
Karel Horák, Branislav Bošanský, Michal Pěchouček

Last modified: 2017-02-10


Security problems can be modeled as two-player partially observable stochastic games with one-sided partial observability and infinite horizon (one-sided POSGs). We seek for optimal strategies of player 1 that correspond to robust strategies against the worst-case opponent (player 2) that is assumed to have a perfect information about the game. We present a novel algorithm for approximately solving one-sided POSGs based on the heuristic search value iteration (HSVI) for POMDPs. Our results include (1) theoretical properties of one-sided POSGs and their value functions, (2) guarantees showing the convergence of our algorithm to optimal strategies, and (3) practical demonstration of applicability and scalability of our algorithm on three different domains: pursuit-evasion, patrolling, and search games.

Full Text: PDF