From Public Plans to Global Solutions in Multiagent Planning
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F16%3A00242804" target="_blank" >RIV/68407700:21230/16:00242804 - isvavai.cz</a>
Result on the web
<a href="http://link.springer.com/chapter/10.1007%2F978-3-319-33509-4_2" target="_blank" >http://link.springer.com/chapter/10.1007%2F978-3-319-33509-4_2</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-33509-4_2" target="_blank" >10.1007/978-3-319-33509-4_2</a>
Alternative languages
Result language
angličtina
Original language name
From Public Plans to Global Solutions in Multiagent Planning
Original language description
Multiagent planning addresses the problem of coordinated sequential decision making of a team of cooperative agents. One possible approach to multiagent planning, which proved to be very efficient in practice, is to find an acceptable public plan. The approach works in two stages. At first, a public plan acceptable to all the involved agents is computed. Then, in the second stage, the public solution is extended to a global solution by filling in internal information by every agent. In the recently proposed distributed multiagent planner, the winner of the Competition of Distributed Multiagent Planners (CoDMAP 2015), this principle was utilized, however with unnecessary use of combination of both public and internal information for extension of the public solution. In this work, we improve the planning algorithm by enhancements of the global solution reconstruction phase. We propose a new method of global solution reconstruction which increases efficiency by restriction to internal information. Additionally, we employ reduction techniques downsizing the input planning problem. Finally, we experimentally evaluate the resulting planner and prove its superiority when compared to the previous approach.
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/GA13-22125S" target="_blank" >GA13-22125S: Deterministic Domain-independent Multi-agent Planning</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2016
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
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISBN
978-3-319-33508-7
ISSN
0302-9743
e-ISSN
—
Number of pages
13
Pages from-to
21-33
Publisher name
Springer
Place of publication
Heidelberg
Event location
Athens
Event date
Dec 17, 2015
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—