Adversarial Cooperative Path-finding: Complexity and Algorithms

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10287449" target="_blank" >RIV/00216208:11320/14:10287449 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Adversarial Cooperative Path-finding: Complexity and Algorithms

Popis výsledku v původním jazyce

The paper addresses a problem of adversarial co-operative path-finding (ACPF) which extends the well-studied problem of cooperative path-finding (CPF) with adversaries. In addition to cooperative path-finding where non-colliding paths for multiple agentsconnecting their initial positions and desti-nations are searched, consideration of agents controlled by the adversary is included in ACPF. This work is focused on both theoretical properties and practical solving techniques of the considered problem. We study computational complexity of the problem where we show that it is PSPACE-hard and belongs to the EXPTIME complexity class. Possible methods suitable for practical solving of the problem are introduced and thoroughly evaluated. Suggested solving approaches include greedy algo-rithms, minimax methods, Monte Carlo Tree Search, and adap-tation of an algorithm for the cooperative version of the prob-lem. Solving methods for ACPF were compared in a tourna-ment in which all the pairs of

Název v anglickém jazyce

Adversarial Cooperative Path-finding: Complexity and Algorithms

Popis výsledku anglicky

The paper addresses a problem of adversarial co-operative path-finding (ACPF) which extends the well-studied problem of cooperative path-finding (CPF) with adversaries. In addition to cooperative path-finding where non-colliding paths for multiple agentsconnecting their initial positions and desti-nations are searched, consideration of agents controlled by the adversary is included in ACPF. This work is focused on both theoretical properties and practical solving techniques of the considered problem. We study computational complexity of the problem where we show that it is PSPACE-hard and belongs to the EXPTIME complexity class. Possible methods suitable for practical solving of the problem are introduced and thoroughly evaluated. Suggested solving approaches include greedy algo-rithms, minimax methods, Monte Carlo Tree Search, and adap-tation of an algorithm for the cooperative version of the prob-lem. Solving methods for ACPF were compared in a tourna-ment in which all the pairs of

Druh

D - Stať ve sborníku

CEP obor

JD - Využití počítačů, robotika a její aplikace

OECD FORD obor

—

Projekt

<a href="/cs/project/GAP103%2F10%2F1287" target="_blank" >GAP103/10/1287: PlanEx: Propojení plánování a provádění plánů</a><br>

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2014

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 26th International Conference on Tools with Artificial Intelligence

ISBN

978-1-4799-6572-4

ISSN

—

e-ISSN

—

Počet stran výsledku

8

Strana od-do

75-82

Název nakladatele

IEEE

Místo vydání

Greece

Místo konání akce

Greece

Datum konání akce

10. 11. 2014

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

WRD - Celosvětová akce

Kód UT WoS článku

—