About: Goal-Based Game Tree Search for Complex Domains

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

About: Goal-Based Game Tree Search for Complex 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 present a novel approach to reducing adversarial search space by employing background knowledge represented in the form of higher-level goals that players tend to pursue in the game. The algorithm is derived from a simultaneous-move modification of the max n algorithm by limiting the search to those branches of the game tree that are consistent with pursuing player's goals. The algorithm has been tested on a real-world-based scenario modelled as a large-scale asymmetric game. The experimental results obtained indicate the ability of the goal-based heuristic to reduce the search space to a manageable level even in complex domains while maintaining the high quality of resulting strategies. We present a novel approach to reducing adversarial search space by employing background knowledge represented in the form of higher-level goals that players tend to pursue in the game. The algorithm is derived from a simultaneous-move modification of the max n algorithm by limiting the search to those branches of the game tree that are consistent with pursuing player's goals. The algorithm has been tested on a real-world-based scenario modelled as a large-scale asymmetric game. The experimental results obtained indicate the ability of the goal-based heuristic to reduce the search space to a manageable level even in complex domains while maintaining the high quality of resulting strategies. (en)
Title	Goal-Based Game Tree Search for Complex Domains Goal-Based Game Tree Search for Complex Domains (en)
skos:prefLabel	Goal-Based Game Tree Search for Complex Domains Goal-Based Game Tree Search for Complex Domains (en)
skos:notation	RIV/68407700:21230/10:00170647!RIV12-MSM-21230___
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(ME09053), Z(MSM6840770038)
http://linked.open...vai/riv/dodaniDat	2012
http://linked.open...aciTvurceVysledku	Pěchouček, Michal Jakob, Michal Bošanský, Branislav Lisý, Viliam
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	260863
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/10:00170647
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Game Tree Search; Procedural Knowledge; Goals; Complex domain; Articial Intelligence (en)
http://linked.open.../riv/klicoveSlovo	Procedural Knowledge Goals Game Tree Search Articial Intelligence Complex domain
http://linked.open...ontrolniKodProRIV	[E8B0F1D33120]
http://linked.open...v/mistoKonaniAkce	Porto
http://linked.open...i/riv/mistoVydani	Heidelberg
http://linked.open...i/riv/nazevZdroje	Agents and Artificial Intelligence International Conference, ICAART 2009, Porto, Portugal, January 19-21, 2009. Revised Selected Papers
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	4 (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 Jakob, Michal Lisý, Viliam Pěchouček, Michal
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open...ain/vavai/riv/wos	000278079200008
http://linked.open.../riv/zahajeniAkce	2009-01-19 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Decision Making and Control for Manufacturing III
issn	1865-0929
number of pages	13 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-642-11819-7_8
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
https://schema.org/isbn	978-3-642-11818-0
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, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software