Deterministic Multiagent Planning Techniques: Experimental Comparison (Short paper)

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F13%3A00206024" target="_blank" >RIV/68407700:21230/13:00206024 - isvavai.cz</a>
Result on the web
<a href="http://icaps13.icaps-conference.org/wp-content/uploads/2013/05/dmap13-proceedings.pdf" target="_blank" >http://icaps13.icaps-conference.org/wp-content/uploads/2013/05/dmap13-proceedings.pdf</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Deterministic Multiagent Planning Techniques: Experimental Comparison (Short paper)
Original language description
Deterministic domain-independent planning techniques for multiagent systems stem from principles of classical planning. Three most recently studied approaches comprise (i) DisCSP+Planning utilizing Distributed Constraint Satisfaction Problem solving forcoordination of the agents and individual planning using local search, (ii) multiagent adaptation of A* with local heuristics and (iii) distribution of the GraphPlan approach based on merging of planning graphs. In this work, we summarize the principlesof these three approaches and describe a novel implementation and optimization of the multiagent GraphPlan approach. We experimentally validate the influence of parametrization of the inner extraction phase of individual plans and compare the best results with the former two multiagent planning techniques.
Czech name
—
Czech description
—

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)

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

Similar results(10)