All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Multiagent Plan Repair by Combined Prefix and Suffix Reuse

The result's identifiers

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

  • Result on the web

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Multiagent Plan Repair by Combined Prefix and Suffix Reuse

  • Original language description

    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

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • 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

  • Name of the periodical

    Multiagent and Grid Systems

  • ISSN

    1574-1702

  • e-ISSN

  • Volume of the periodical

    11

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    25

  • Pages from-to

    33-57

  • UT code for WoS article

    000359189600003

  • EID of the result in the Scopus database

    2-s2.0-84928537666