Multiagent Plan Repair by Combined Prefix and Suffix Reuse

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00224340" target="_blank" >RIV/68407700:21230/15:00224340 - isvavai.cz</a>

Výsledek na webu

<a href="http://content.iospress.com/articles/multiagent-and-grid-systems/mgs00228" target="_blank" >http://content.iospress.com/articles/multiagent-and-grid-systems/mgs00228</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.3233/MGS-150228" target="_blank" >10.3233/MGS-150228</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Multiagent Plan Repair by Combined Prefix and Suffix Reuse

Popis výsledku v původním jazyce

Deterministic domain-independent multiagent planning is an approach to coordination of cooperative agents with joint goals. Provided that the agents act in an uncertain and dynamic environment, such plans can fail. The straightforward approach to recoverfrom such situations is to compute a new plan from scratch, that is to replan. Even though, in a worst case, plan repair or plan re-use does not yield an advantage over replanning from scratch, there is a sound evidence from practical use that approaches trying to repair the failed original plan can outperform replanning in selected problems. One of the possible plan repairing techniques is based on preservation of fragments of the older plans. This work theoretically analyses complexity of plan repairing approaches based on preservation of fragments of the original plan and experimentally studies three practical aspects affecting its efficiency in various multiagent settings. We focus both on the computational, as well as the communic

Název v anglickém jazyce

Multiagent Plan Repair by Combined Prefix and Suffix Reuse

Popis výsledku anglicky

Deterministic domain-independent multiagent planning is an approach to coordination of cooperative agents with joint goals. Provided that the agents act in an uncertain and dynamic environment, such plans can fail. The straightforward approach to recoverfrom such situations is to compute a new plan from scratch, that is to replan. Even though, in a worst case, plan repair or plan re-use does not yield an advantage over replanning from scratch, there is a sound evidence from practical use that approaches trying to repair the failed original plan can outperform replanning in selected problems. One of the possible plan repairing techniques is based on preservation of fragments of the older plans. This work theoretically analyses complexity of plan repairing approaches based on preservation of fragments of the original plan and experimentally studies three practical aspects affecting its efficiency in various multiagent settings. We focus both on the computational, as well as the communic

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

JC - Počítačový hardware a software

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

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2015

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 periodika

Multiagent and Grid Systems

ISSN

1574-1702

e-ISSN

—

Svazek periodika

11

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

25

Strana od-do

33-57

Kód UT WoS článku

000359189600003

EID výsledku v databázi Scopus

2-s2.0-84928537666