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”

Recursive Reductions of Action Dependencies for Coordination-Based Multiagent Planning

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F18%3A00328145" target="_blank" >RIV/68407700:21230/18:00328145 - isvavai.cz</a>

  • Alternative codes found

    RIV/68407700:21730/18:00328145

  • Result on the web

    <a href="https://link.springer.com/chapter/10.1007%2F978-3-319-78301-7_4" target="_blank" >https://link.springer.com/chapter/10.1007%2F978-3-319-78301-7_4</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-78301-7_4" target="_blank" >10.1007/978-3-319-78301-7_4</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Recursive Reductions of Action Dependencies for Coordination-Based Multiagent Planning

  • Original language description

    Currently the most efficient distributed multiagent planning scheme for deterministic models is based on coordination of local agents’ plans. In such a scheme, behavior of other agents is modeled using projections of their actions stripped of all private information. The planning scheme does not require any additional information, however using such can be beneficial for planning efficiency. Dependencies among the projected public actions caused by sequences of local private actions represent one particular type of such information.

  • Czech name

  • Czech description

Classification

  • Type

    C - Chapter in a specialist book

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GJ15-20433Y" target="_blank" >GJ15-20433Y: Heuristic Search for Multiagent and Factored Planning</a><br>

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2018

  • 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

  • Book/collection name

    Transactions on Computational Collective Intelligence XXVIII

  • ISBN

    978-3-319-78300-0

  • Number of pages of the result

    27

  • Pages from-to

    66-92

  • Number of pages of the book

    300

  • Publisher name

    Springer VDI Verlag

  • Place of publication

    Düsseldorf

  • UT code for WoS chapter