Multiagent Planning by Iterative Negotiation over Distributed Planning Graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F14%3A00224570" target="_blank" >RIV/68407700:21230/14:00224570 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Multiagent Planning by Iterative Negotiation over Distributed Planning Graphs
Original language description
Multiagent planning for cooperative agents in deterministic environments intertwines synthesis and coordination of the local plans of involved agents. Both of these processes require an underlying structure to describe synchronization of the plans. A distributed planning graph can act as such a structure, benefiting by its compact representation and efficient building. In this paper, we propose a general negotiation scheme for multiagent planning based on planning graphs. The scheme is designed as independent on a particular local plan synthesis approach. To demonstrate the proposed principle, we have implemented the negotiation scheme as an algorithm with a concrete technique for the local plan synthesis based on compilation of the local planning problems to SAT problems. Results of the negotiation further shape the SAT problems so that agents coordinate their plans and avoid possible conflicts in an iterative manner. The paper is concluded by showing a set of experiments which demons
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
IN - Informatics
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
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů