Domain-independent multi-agent plan repair

Kód výsledku v IS VaVaI

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

Výsledek na webu

<a href="http://dx.doi.org/10.1016/j.jnca.2012.12.011" target="_blank" >http://dx.doi.org/10.1016/j.jnca.2012.12.011</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.jnca.2012.12.011" target="_blank" >10.1016/j.jnca.2012.12.011</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Domain-independent multi-agent plan repair

Popis výsledku v původním jazyce

Achieving joint objectives in distributed domain-independent planning problems by teams of cooperative agents requires significant coordination and communication efforts. For systems facing a plan failure in a dynamic environment, arguably, attempts to repair the failed plan in general, and especially in the worst-case scenarios, do not straightforwardly bring any benefit in terms of time complexity. However, in multi-agent settings, the communication complexity might be of a much higher importance, possibly a high communication overhead might be even prohibitive in certain domains. We hypothesize that in decentralized systems, where frequent coordination is required to achieve joint objectives, attempts to repair failed multi-agent plans should lead to lower communication overhead than replanning from scratch. Here, we formally introduce the multi-agent plan repair problem. Building upon the formal treatment, we present the core hypothesis underlying our work and subsequently describe

Název v anglickém jazyce

Domain-independent multi-agent plan repair

Popis výsledku anglicky

Achieving joint objectives in distributed domain-independent planning problems by teams of cooperative agents requires significant coordination and communication efforts. For systems facing a plan failure in a dynamic environment, arguably, attempts to repair the failed plan in general, and especially in the worst-case scenarios, do not straightforwardly bring any benefit in terms of time complexity. However, in multi-agent settings, the communication complexity might be of a much higher importance, possibly a high communication overhead might be even prohibitive in certain domains. We hypothesize that in decentralized systems, where frequent coordination is required to achieve joint objectives, attempts to repair failed multi-agent plans should lead to lower communication overhead than replanning from scratch. Here, we formally introduce the multi-agent plan repair problem. Building upon the formal treatment, we present the core hypothesis underlying our work and subsequently describe

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/LD12044" target="_blank" >LD12044: Agentní algoritmy pro autonomní podpůrné systémy v pozemní dopravě</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>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 periodika

Journal of Network and Computer Applications

ISSN

1084-8045

e-ISSN

—

Svazek periodika

37

Číslo periodika v rámci svazku

—

Stát vydavatele periodika

GB - Spojené království Velké Británie a Severního Irska

Počet stran výsledku

13

Strana od-do

76-88

Kód UT WoS článku

000329267200009

EID výsledku v databázi Scopus

—