Using Process Calculi for Plan Verification 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%2F15%3A00236074" target="_blank" >RIV/68407700:21230/15:00236074 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21730/15:00236074
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-27947-3_13" target="_blank" >http://dx.doi.org/10.1007/978-3-319-27947-3_13</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-27947-3_13" target="_blank" >10.1007/978-3-319-27947-3_13</a>
Alternative languages
Result language
angličtina
Original language name
Using Process Calculi for Plan Verification in Multiagent Planning
Original language description
Multiagent planning is a coordination technique used for deliberative acting of a team of agents. One of vital planning techniques uses declarative description of agents? plans based on Finite State Machines and their later coordination by intersection of such machines with successive verification of the resulting joint plans. In this work, we firstly introduce a method of multiagent planning which makes use of projections of other agent actions in order to iteratively search for a skeleton of a multiagent plan. Secondly, we describe integration of the static analysis provided by process calculi type systems for approximate verification of exchanged local plans. Furthermore, we introduce an alternative method to accomplish the above verification by a classical planner. Finally, we compare our approach with current state-of-the-art planner on an extensive benchmark set.
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
2015
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-27946-6
ISSN
0302-9743
e-ISSN
—
Number of pages
17
Pages from-to
245-261
Publisher name
Springer-Verlag
Place of publication
Berlin
Event location
Lisbon
Event date
Jan 10, 2015
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—