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”

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

The result's identifiers

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

  • Result on the web

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

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language description

    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

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • 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

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2014

  • 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

  • Article name in the collection

    ECAI 2014

  • ISBN

    978-1-61499-418-3

  • ISSN

    0922-6389

  • e-ISSN

  • Number of pages

    2

  • Pages from-to

    1111-1112

  • Publisher name

    IOS Press

  • Place of publication

    Amsterdam

  • Event location

    Prague

  • Event date

    Aug 18, 2014

  • Type of event by nationality

    EUR - Evropská akce

  • UT code for WoS article

    000349444700239