Adversarial Search with Procedural Knowledge Heuristic

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F09%3A00157252" target="_blank" >RIV/68407700:21230/09:00157252 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Adversarial Search with Procedural Knowledge Heuristic
Original language description
We introduce an adversarial planning algorithm based on game tree search, which is applicable in large-scale multiplayer domains. In order to tackle the scalability issues of game tree search, the algorithm utilizes procedural knowledge capturing how individual players tend to achieve their goals in the domain; the information is used to limit the search only to the part of the game tree that is consistent with pursuing players' goals. We impose no specific requirements on the format of the procedural knowledge; any programming language or agent specification paradigm can be employed. We evaluate the algorithm both theoretically and empirically, confirming that the proposed approach can lead to a substantial search reduction with only a minor negativeimpact on the quality of produced solutions.
Czech name
—
Czech description
—

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)

Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems
ISBN
978-0-9817381-7-8
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
—
Publisher name
ACM Press
Place of publication
New York
Event location
Budapest
Event date
May 10, 2009
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)