Context-Aware Route Planning for Automated Warehouses

Result code in IS VaVaI

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

Alternative codes found

RIV/68407700:21730/18:00326361

Result on the web

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

DOI - Digital Object Identifier

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

Result language

angličtina

Original language name

Context-Aware Route Planning for Automated Warehouses

Original language description

In order to ensure efficient flow of goods in an automated warehouse and to guarantee its continuous distribution to/from picking stations in an effective way, decisions about which goods will be delivered to which particular picking station by which robot and by which path and in which time have to be made based on the current state of the warehouse. This task involves solution of two subproblems: (1) task allocation in which an assignment of robots to goods they have to deliver at a particular time is found and (2) planning of collision-free trajectories for particular robots (given their actual and goal positions). The trajectory planning problem is addressed in this paper taking into account specifics of automated warehouses. First, assignments of all robots are not known in advance, they are instead presented to the algorithm gradually one by one. Moreover, we do not optimize a makespan, but a throughput - the sum of individual robot plan costs. We introduce a novel approach to this problem which is based on the context-aware route planning algorithm [1]. The performed experimental results show that the proposed approach has a lower fail rate and produces results of higher quality than the original algorithm. This is redeemed by higher computational complexity which is nevertheless low enough for real-time planning.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

20204 - Robotics and automatic control

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year

2018

Confidentiality

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

Article name in the collection

Proceedings of 2018 21st International Conference on Intelligent Transportation Systems (ITSC)

ISBN

978-1-7281-0323-5

ISSN

—

e-ISSN

2153-0017

Number of pages

6

Pages from-to

2955-2960

Publisher name

IEEE Intelligent Transportation Systems Society

Place of publication

—

Event location

Maui

Event date

Nov 4, 2018

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

000457881302145