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”

Push, Stop, and Replan: An Application of Pebble Motion on Graphs to Planning in Automated Warehouses

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F19%3A00335304" target="_blank" >RIV/68407700:21230/19:00335304 - isvavai.cz</a>

  • Alternative codes found

    RIV/68407700:21730/19:00335304

  • Result on the web

    <a href="https://ieeexplore.ieee.org/document/8916906" target="_blank" >https://ieeexplore.ieee.org/document/8916906</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/ITSC.2019.8916906" target="_blank" >10.1109/ITSC.2019.8916906</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Push, Stop, and Replan: An Application of Pebble Motion on Graphs to Planning in Automated Warehouses

  • Original language description

    The pebble-motion on graphs is a subcategory of multi-agent pathfinding problems dealing with moving multiple pebble-like objects from a node to a node in a graph with a constraint that only one pebble can occupy one node at a given time. Additionally, algorithms solving this problem assume that individual pebbles (robots) cannot move at the same time and their movement is discrete. These assumptions disqualify them from being directly used in practical applications, although they have otherwise nice theoretical properties. We present modifications of the Push and Rotate algorithm [1], which relax the presumptions mentioned above and demonstrate, through a set of experiments, that the modified algorithm is applicable for planning in automated warehouses.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • 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/EF15_003%2F0000470" target="_blank" >EF15_003/0000470: Robotics 4 Industry 4.0</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2019

  • 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

    2019 IEEE Intelligent Transportation Systems Conference (ITSC)

  • ISBN

    978-1-5386-7024-8

  • ISSN

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

    4456-4463

  • Publisher name

    IEEE Xplore

  • Place of publication

  • Event location

    Auckland

  • Event date

    Oct 27, 2019

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article