Domain-independent multi-agent plan repair

Result code in 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>

Result on the web

<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>

Result language

angličtina

Original language name

Domain-independent multi-agent plan repair

Original language description

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

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

JC - Computer hardware and software

OECD FORD branch

—

Project

<a href="/en/project/LD12044" target="_blank" >LD12044: Agent-based Computing for Autonomic Road Transport Support Systems</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year

2014

Confidentiality

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

Name of the periodical

Journal of Network and Computer Applications

ISSN

1084-8045

e-ISSN

—

Volume of the periodical

37

Issue of the periodical within the volume

—

Country of publishing house

GB - UNITED KINGDOM

Number of pages

13

Pages from-to

76-88

UT code for WoS article

000329267200009

EID of the result in the Scopus database

—