Effective Planning in Resource-Competition Problems by Task Decomposition
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F22%3A00363597" target="_blank" >RIV/68407700:21230/22:00363597 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21730/22:00363597
Result on the web
<a href="https://doi.org/10.1609/socs.v15i1.21751" target="_blank" >https://doi.org/10.1609/socs.v15i1.21751</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1609/socs.v15i1.21751" target="_blank" >10.1609/socs.v15i1.21751</a>
Alternative languages
Result language
angličtina
Original language name
Effective Planning in Resource-Competition Problems by Task Decomposition
Original language description
Effective planning while competing for limited resources is crucial in many real-world applications such as on-demand transport companies competing for passengers. Planning techniques therefore have to take into account possible actions of an adversarial agent. Such a challenge that can be tackled by leveraging game-theoretical methods such as Double Oracle. This paper aims at the scalability issues arising from combining planning techniques with Double Oracle. In particular, we propose an abstraction-based heuristic for deciding how resources will be collected (e.g. which car goes for which passenger and in which order) and we propose a method for decomposing planning tasks into smaller ones (e.g. generate plans for each car separately). Our empirical evaluation shows that our proposed approach considerably improves scalability compared to the state-of-the-art techniques.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
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/EF16_019%2F0000765" target="_blank" >EF16_019/0000765: Research Center for Informatics</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2022
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
Proceedings of the Fifteenth International Symposium on Combinatorial Search
ISBN
978-1-57735-873-2
ISSN
—
e-ISSN
—
Number of pages
9
Pages from-to
47-55
Publisher name
Association for the Advancement of Artificial Intelligence (AAAI)
Place of publication
Palo Alto, California
Event location
Vídeň
Event date
Jul 21, 2022
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—