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”

Anytime Algorithms for Multi-agent Visibility-based Pursuit-evasion Games

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F12%3A00200109" target="_blank" >RIV/68407700:21230/12:00200109 - isvavai.cz</a>

  • Result on the web

    <a href="http://dl.acm.org/citation.cfm?id=2343896.2343974" target="_blank" >http://dl.acm.org/citation.cfm?id=2343896.2343974</a>

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Anytime Algorithms for Multi-agent Visibility-based Pursuit-evasion Games

  • Original language description

    We investigate algorithms for playing multi-agent visibility-based pursuit-evasion games. A team of pursuers attempts to maintain visibility contact with an evader who actively avoids tracking. We aim for applicability of the algorithms in real-world scenarios; hence, we impose hard constraints on the run-time of the algorithms and we evaluate them in a simulation model based on a real-world urban area. We compare Monte-Carlo tree search (MCTS) and iterative deepening minimax algorithms running on the information-set tree of the imperfect-information game. The experimental results demonstrate that both methods create comparable good strategies for the pursuer, while the later performs better in creating the evader's strategy.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GAP202%2F12%2F2054" target="_blank" >GAP202/12/2054: Security Games in Extensive Form</a><br>

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2012

  • 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 11th International Conference on Autonomous Agents and Multiagent Systems

  • ISBN

    978-0-9817381-3-0

  • ISSN

  • e-ISSN

  • Number of pages

    2

  • Pages from-to

    1301-1302

  • Publisher name

    IFAAMAS

  • Place of publication

    County of Richland

  • Event location

    Valencia

  • Event date

    Jun 4, 2012

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article