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”

Asynchronous decentralized algorithm for space-time cooperative pathfinding

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F12%3A00200230" target="_blank" >RIV/68407700:21230/12:00200230 - isvavai.cz</a>

  • Result on the web

    <a href="https://dl.dropbox.com/u/17077973/stedy-www/workshops/ecai-12/STeDy-12-ECAI-Proceedings.pdf" target="_blank" >https://dl.dropbox.com/u/17077973/stedy-www/workshops/ecai-12/STeDy-12-ECAI-Proceedings.pdf</a>

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Asynchronous decentralized algorithm for space-time cooperative pathfinding

  • Original language description

    Cooperative pathfinding is a multi-agent path planning problem where a group of vehicles searches for a corresponding set of non-conflicting space-time trajectories. Many of the practi- cal methods for centralized solving of cooperative pathfinding prob-lems are based on the prioritized planning strategy. However, in some domains (e.g., multi-robot teams of unmanned aerial vehicles, au- tonomous underwater vehicles, or unmanned ground vehicles) a de- centralized approach may be more desirable than a centralized one due to communication limitations imposed by the domain and/or pri- vacy concerns. In this paper we present an asynchronous decentralized variant of prioritized planning ADPP and its interruptible version IADPP. The algorithm exploits the inherent parallelism of distributed systems and allows for a speed up of the computation process. Unlike the synchro- nized planning approaches, the algorithm allows an agent to react to updates about other agents' paths immediately and inv

  • Czech name

  • Czech description

Classification

  • Type

    O - Miscellaneous

  • CEP classification

    JD - Use of computers, robotics and its application

  • OECD FORD branch

Result continuities

  • 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

Others

  • Publication year

    2012

  • Confidentiality

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