All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Heuristic Search Value Iteration for One-Sided Partially Observable Stochastic Games

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F17%3A00315202" target="_blank" >RIV/68407700:21230/17:00315202 - isvavai.cz</a>

  • Result on the web

    <a href="https://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14739/13812" target="_blank" >https://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14739/13812</a>

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Heuristic Search Value Iteration for One-Sided Partially Observable Stochastic Games

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GA15-23235S" target="_blank" >GA15-23235S: Abstractions and Extensive-Form Games with Imperfect Recall</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2017

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence

  • ISBN

    978-1-57735-780-3

  • ISSN

  • e-ISSN

  • Number of pages

    7

  • Pages from-to

    558-564

  • Publisher name

    AAAI Press

  • Place of publication

    Menlo Park

  • Event location

    San Francisco

  • Event date

    Feb 4, 2017

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article