Warehouse Modeling Using Graphical User Interface
Loading...
Date
2016
Authors
ORCID
Advisor
Referee
Mark
Journal Title
Journal ISSN
Volume Title
Publisher
Vysoké učení technické v Brně, Fakulta elektrotechniky a komunikačních technologií
Abstract
This paper describes a new algorithm which enable efficient conversion of graphical representation of warehouse into graph theory representation and consequently accelerates estimation for route costs. The proposed algorithm computes route distances between any place in warehouses and does so significantly faster than traditional approaches. For this purpose an algorithm based on Breadth first search, image processing “skeletonization” and Dijkstra algorithm was proposed. Using the proposed algorithm it is possible to search routes in a warehouse effectively and fast using precomputed routing table. Searching time is approximately hundreds of microseconds using routing table and even it is independent on size of warehouse instead of using Dijkstra algorithm.
Description
Citation
Proceedings of the 22nd Conference STUDENT EEICT 2016. s. 273-275. ISBN 978-80-214-5350-0
http://www.feec.vutbr.cz/EEICT/
http://www.feec.vutbr.cz/EEICT/
Document type
Peer-reviewed
Document version
Published version
Date of access to the full text
Language of document
sk
Study field
Comittee
Date of acceptance
Defence
Result of defence
Document licence
© Vysoké učení technické v Brně, Fakulta elektrotechniky a komunikačních technologií