About: Agent Subset Adversarial Search for Complex Non-cooperative Domains

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

About: Agent Subset Adversarial Search for Complex Non-cooperative Domains 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	We investigate reduction of the complexity of a multi-agent adversarial search in the domain of n-player games. We describe a method that decomposes the game into a set of smaller overlapping sub-games, solves each sub-game separately, and then combines the results into a global solution. This way, the exponential dependence of the adversarial search complexity on the number of agents can be reduced to polynomial. Still, the proposed method performs well in the domains with sparse agents' interactions. The method can be used with a generic adversarial search algorithm. For the experimental evaluation, we implement it on top of an existing adversarial search algorithm designed for complex domains and we evaluate its performance on a game, which is a model of a humanitarian relief operation in conflict environment. The results show that the method often finds the same solutions as the complete search, but the search efficiency is significantly improved. We investigate reduction of the complexity of a multi-agent adversarial search in the domain of n-player games. We describe a method that decomposes the game into a set of smaller overlapping sub-games, solves each sub-game separately, and then combines the results into a global solution. This way, the exponential dependence of the adversarial search complexity on the number of agents can be reduced to polynomial. Still, the proposed method performs well in the domains with sparse agents' interactions. The method can be used with a generic adversarial search algorithm. For the experimental evaluation, we implement it on top of an existing adversarial search algorithm designed for complex domains and we evaluate its performance on a game, which is a model of a humanitarian relief operation in conflict environment. The results show that the method often finds the same solutions as the complete search, but the search efficiency is significantly improved. (en)
Title	Agent Subset Adversarial Search for Complex Non-cooperative Domains Agent Subset Adversarial Search for Complex Non-cooperative Domains (en)
skos:prefLabel	Agent Subset Adversarial Search for Complex Non-cooperative Domains Agent Subset Adversarial Search for Complex Non-cooperative Domains (en)
skos:notation	RIV/68407700:21230/10:00173920!RIV11-MSM-21230___
http://linked.open...avai/riv/aktivita	P S Z
http://linked.open...avai/riv/aktivity	P(ME09053), S, Z(MSM6840770038)
http://linked.open...vai/riv/dodaniDat	2011
http://linked.open...aciTvurceVysledku	Lisý, Viliam Bošanský, Branislav Pěchouček, Michal
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	České vysoké učení technické v Praze / Fakulta elektrotechnická
http://linked.open...dnocenehoVysledku	245614
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/10:00173920
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	agent; multi-agent (en)
http://linked.open.../riv/klicoveSlovo	multi-agent agent
http://linked.open...ontrolniKodProRIV	[6700504B404E]
http://linked.open...v/mistoKonaniAkce	Copenhagen
http://linked.open...i/riv/mistoVydani	New Jersey
http://linked.open...i/riv/nazevZdroje	Proceedings of the IEEE Conference on Computational Intelligence and Games 2010
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	4 (xsd:int)
http://linked.open...vavai/riv/projekt	Adversarial planning in complex dynamic domains
http://linked.open...UplatneniVysledku	2010
http://linked.open...iv/tvurceVysledku	Bošanský, Branislav Lisý, Viliam Pěchouček, Michal Vaculín, Roman
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2010-08-18 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Decision Making and Control for Manufacturing III
number of pages	8 (xsd:int)
http://purl.org/ne...btex#hasPublisher	IEEE
https://schema.org/isbn	978-1-4244-6297-1
http://localhost/t...ganizacniJednotka	21230

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, 39 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software