Goal-Based Game Tree Search for Complex Domains
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F10%3A00170647" target="_blank" >RIV/68407700:21230/10:00170647 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-11819-7_8" target="_blank" >http://dx.doi.org/10.1007/978-3-642-11819-7_8</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-11819-7_8" target="_blank" >10.1007/978-3-642-11819-7_8</a>
Alternative languages
Result language
angličtina
Original language name
Goal-Based Game Tree Search for Complex Domains
Original language 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 resultsobtained 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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/ME09053" target="_blank" >ME09053: Adversarial planning in complex dynamic domains</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Agents and Artificial Intelligence International Conference, ICAART 2009, Porto, Portugal, January 19-21, 2009. Revised Selected Papers
ISBN
978-3-642-11818-0
ISSN
1865-0929
e-ISSN
—
Number of pages
13
Pages from-to
97-109
Publisher name
Springer
Place of publication
Heidelberg
Event location
Porto
Event date
Jan 19, 2009
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000278079200008