Generating Multi-Agent Plans by Distributed Intersection of Finite State Machines

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F14%3A00224327" target="_blank" >RIV/68407700:21230/14:00224327 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.3233/978-1-61499-419-0-1111" target="_blank" >http://dx.doi.org/10.3233/978-1-61499-419-0-1111</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.3233/978-1-61499-419-0-1111" target="_blank" >10.3233/978-1-61499-419-0-1111</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Generating Multi-Agent Plans by Distributed Intersection of Finite State Machines

Popis výsledku v původním jazyce

Deterministic multi-agent planning described by MA-STRIPS formalism requires mixture of coordination and synthesis of local agents' plans. All agents' plans, as sequences of actions, can be implicitly described by an appropriate generative structure. Having all local plans of all participating agents described by such a structure and having a merged process of such structures, we can induce a global multi-agent plan by successive elimination of unfeasible combinations of local agents' plans. In this paper, we propose use of Nondeterministic Finite State Machines (NFSs) as the generative structure for the plans and use of well-known process of intersection of NFSs to prune the plan spaces towards globally feasible multi-agent plan. Since the numbers ofthe plans can be large we use iterative process of building of the NFSs using a state-of-the-art classical planner interleaved with the NFS intersecting process. To show efficiency of the approach, we have evaluated the algorithm on exten

Název v anglickém jazyce

Generating Multi-Agent Plans by Distributed Intersection of Finite State Machines

Popis výsledku anglicky

Deterministic multi-agent planning described by MA-STRIPS formalism requires mixture of coordination and synthesis of local agents' plans. All agents' plans, as sequences of actions, can be implicitly described by an appropriate generative structure. Having all local plans of all participating agents described by such a structure and having a merged process of such structures, we can induce a global multi-agent plan by successive elimination of unfeasible combinations of local agents' plans. In this paper, we propose use of Nondeterministic Finite State Machines (NFSs) as the generative structure for the plans and use of well-known process of intersection of NFSs to prune the plan spaces towards globally feasible multi-agent plan. Since the numbers ofthe plans can be large we use iterative process of building of the NFSs using a state-of-the-art classical planner interleaved with the NFS intersecting process. To show efficiency of the approach, we have evaluated the algorithm on exten

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GA13-22125S" target="_blank" >GA13-22125S: Deterministické doménově nezávislé multi-agentní plánování</a><br>

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2014

Kód důvěrnosti údajů

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

Název statě ve sborníku

ECAI 2014

ISBN

978-1-61499-418-3

ISSN

0922-6389

e-ISSN

—

Počet stran výsledku

2

Strana od-do

1111-1112

Název nakladatele

IOS Press

Místo vydání

Amsterdam

Místo konání akce

Prague

Datum konání akce

18. 8. 2014

Typ akce podle státní příslušnosti

EUR - Evropská akce

Kód UT WoS článku

000349444700239