About: Adversarial Cooperative Path-finding: Complexity and Algorithms

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Adversarial Cooperative Path-finding: Complexity and Algorithms Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	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 agents connecting 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 suggested strategies were com-pared. Surprisingly frequent success rate of greedy methods and rather weaker results of Monte Carlo Tree Search were indicated by the conducted experimental evaluation. 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 agents connecting 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 suggested strategies were com-pared. Surprisingly frequent success rate of greedy methods and rather weaker results of Monte Carlo Tree Search were indicated by the conducted experimental evaluation. (en)
Title	Adversarial Cooperative Path-finding: Complexity and Algorithms Adversarial Cooperative Path-finding: Complexity and Algorithms (en)
skos:prefLabel	Adversarial Cooperative Path-finding: Complexity and Algorithms Adversarial Cooperative Path-finding: Complexity and Algorithms (en)
skos:notation	RIV/00216208:11320/14:10287449!RIV15-MSM-11320___
http://linked.open...avai/riv/aktivita	I P
http://linked.open...avai/riv/aktivity	I, P(GAP103/10/1287)
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Surynek, Pavel
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Univerzita Karlova v Praze / Matematicko-fyzikální fakulta
http://linked.open...dnocenehoVysledku	1764
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/14:10287449
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	PSPACE-hardness; complexity; Monte Carlo Tree Search; adversaries; cooperative path-finding (en)
http://linked.open.../riv/klicoveSlovo	Monte Carlo Tree Search complexity PSPACE-hardness adversaries cooperative path-finding
http://linked.open...ontrolniKodProRIV	[52A750AFF95A]
http://linked.open...v/mistoKonaniAkce	Greece
http://linked.open...i/riv/mistoVydani	Greece
http://linked.open...i/riv/nazevZdroje	Proceedings of the 26th International Conference on Tools with Artificial Intelligence
http://linked.open...in/vavai/riv/obor	JD
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	PlanEx: Bridging Planning and Execution
http://linked.open...UplatneniVysledku	2014
http://linked.open...iv/tvurceVysledku	Surynek, Pavel Ivanová, Marika
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2014-11-10 (xsd:date)
number of pages	8 (xsd:int)
http://purl.org/ne...btex#hasPublisher	IEEE
https://schema.org/isbn	978-1-4799-6572-4
http://localhost/t...ganizacniJednotka	11320

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software