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

Kód výsledku v 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>

Nalezeny alternativní kódy

RIV/68407700:21730/19:00335304

Výsledek na webu

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

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

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

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

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

Projekt

<a href="/cs/project/EF15_003%2F0000470" target="_blank" >EF15_003/0000470: Robotika pro Průmysl 4.0</a><br>

Návaznosti

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

Rok uplatnění

2019

Kód důvěrnosti údajů

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

Název statě ve sborníku

2019 IEEE Intelligent Transportation Systems Conference (ITSC)

ISBN

978-1-5386-7024-8

ISSN

—

e-ISSN

—

Počet stran výsledku

8

Strana od-do

4456-4463

Název nakladatele

IEEE Xplore

Místo vydání

—

Místo konání akce

Auckland

Datum konání akce

27. 10. 2019

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—