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

Kód výsledku v 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>

Výsledek na webu

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

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

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

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

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

Projekt

—

Návaznosti

V - Vyzkumna aktivita podporovana z jinych verejnych zdroju

Rok uplatnění

2018

Kód důvěrnosti údajů

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

Název statě ve sborníku

Proceedings of the 31st International Florida Artificial Intelligence Research Society Conference

ISBN

978-1-57735-787-2

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

348-353

Název nakladatele

AAAI Press

Místo vydání

Menlo Park, California

Místo konání akce

Melbourne, FL

Datum konání akce

21. 5. 2018

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—