Towards Generating Effective Plans in Zero-sum Games by Estimating Strategy ofan Adversary
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F20%3A00347228" target="_blank" >RIV/68407700:21230/20:00347228 - isvavai.cz</a>
Result on the web
<a href="https://plansig2020.files.wordpress.com/2020/12/plansig_2020_paper_5.pdf" target="_blank" >https://plansig2020.files.wordpress.com/2020/12/plansig_2020_paper_5.pdf</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Towards Generating Effective Plans in Zero-sum Games by Estimating Strategy ofan Adversary
Original language description
In a nutshell, zero-sum games represent scenarios where twoagents compete for the same goals such that each goal canbe achieved by at most one of the agents. The goals are, forexample, collecting limited resources or transporting passen-gers from their given location of origin to a required destina-tion. To achieve the goals, the agent might generate a plan.Plan generation, however, has to take possible actions of theadversary into consideration.In this paper, considering planning in zero-sum games, wepropose a heuristic approach for estimating strategies of theadversary, more specifically distribution of possible applica-tion times of its actions interfering with some of the agent’sactions. The agent’s actions in question have to be appliedbefore those of the adversary, whose estimated times hencerepresent their deadlines. Missing the deadlines can be repre-sented by action cost, so generated plans can be optimised forminimum total action cost. We empirically evaluate our ap-proach by comparing it to the baseline approach (plan gener-ation without taking adversary into account) and to the state-of-the-art approach leveraging the Double Oracle algorithmfor computing adversary strategies.
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA18-07252S" target="_blank" >GA18-07252S: MoRePlan: Modeling and Reformulating Planning Problems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů