Planning and Decision-Making in Complex Dynamic Adversarial Domains

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

Result language
angličtina
Original language name
Planning and Decision-Making in Complex Dynamic Adversarial Domains
Original language description
We briefly introduce the main research topics in multi-agent planning and identify their weaknesses in adversarial settings. The main problem is that the conflicting goals and lack of trust and coordination among the agents causes huge computational complexity of the problem. We introduce two methods to deal with the complexity. The first is incorporating procedural background knowledge to adversarial search and the second is decomposition of the full problem to a set of smaller problems, solving them separately and the aggregating the results to global solution. Other important issues in adversarial planning are partial information about the state of the world, its sharing among the players and its intentional manipulation by opponents ? deception. Wesummarize our achievements in dealing with these issues and refer to other sources describing our research.
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>V - Vyzkumna aktivita podporovana z jinych verejnych zdroju

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

Similar results(10)