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”

Maintaining Ad-Hoc Communication Network in Area Protection Scenarios with Adversarial Agents

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F18%3A00321311" target="_blank" >RIV/68407700:21240/18:00321311 - isvavai.cz</a>

  • Result on the web

    <a href="https://sites.google.com/site/flairs31conference/" target="_blank" >https://sites.google.com/site/flairs31conference/</a>

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Maintaining Ad-Hoc Communication Network in Area Protection Scenarios with Adversarial Agents

  • Original language description

    We address a problem of area protection in graph-based scenarios with multiple mobile agents where connectivity is maintained among agents to ensure they can communicate. The problem consists of two adversarial teams of agents that move in an undirected graph shared by both teams. Agents are placed in vertices of the graph; at most one agent can occupy a vertex; and they can move into adjacent vertices in a conflict free way. Teams have asymmetric goals: the aim of one team - attackers - is to invade into given area while the aim of the opponent team - defenders - is to protect the area from being entered by attackers by occupying selected vertices. The team of defenders need to maintain connectivity of vertices occupied by its own agents in a visibility graph. The visibility graph models possibility of communication between pairs of vertices.

  • 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

  • Continuities

    V - Vyzkumna aktivita podporovana z jinych verejnych zdroju

Others

  • Publication year

    2018

  • 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 31st International Florida Artificial Intelligence Research Society Conference

  • ISBN

    978-1-57735-787-2

  • ISSN

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

    348-353

  • Publisher name

    AAAI Press

  • Place of publication

    Menlo Park, California

  • Event location

    Melbourne, FL

  • Event date

    May 21, 2018

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article