2019
DOI: 10.31224/osf.io/f4eq6
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Decentralized Routing Algorithm with Physical Time Windows for Modular Conveyors

Abstract: We describe a decentralized routing algorithm with physical time windows for modular conveying systems. Existing routing algorithms for modular conveyors are already capable of bi-directional conveying while avoiding conflicts such as collisions, deadlocks, livelocks and starvation effects. In addition to avoiding conflicts, routing algorithms must also select routes that reduce the travel time. No existing algorithm for modular conveyors bases this decision on the expected physical lead time, even though phys… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
2
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 9 publications
(13 reference statements)
0
2
0
Order By: Relevance
“…We answer: eliminating the need for a central clock reduces the communication load on the system because the system can react flexibly to delayed or early transports without renegotiation of reservations. Unlike decentralized methods that rely on time windows with safety margins [15], execution with logical clocks introduces delays only in response to existing delays and then only as long as necessary. Liveness is guaranteed as long as the order of events is respected on each resource.…”
Section: Discussionmentioning
confidence: 99%
“…We answer: eliminating the need for a central clock reduces the communication load on the system because the system can react flexibly to delayed or early transports without renegotiation of reservations. Unlike decentralized methods that rely on time windows with safety margins [15], execution with logical clocks introduces delays only in response to existing delays and then only as long as necessary. Liveness is guaranteed as long as the order of events is respected on each resource.…”
Section: Discussionmentioning
confidence: 99%
“…Thus, preventing deadlocks or ensuring system liveliness in general under these conditions remains unresolved as well. Apart from [11], complexity aspects of the presented decentralized algorithms are not studied.…”
Section: A Conveyor Systems With Decentralized Controlmentioning
confidence: 99%
“…Similar to other decentralized structures, the sensor provides feedback to its own module and neighboring modules. Therefore, the control algorithm for DCS is challenging, because the algorithm needs to perform appropriate action merely based on the feedbacked logic states without having a complete and precise view on the whole conveyor system [3,21,22]. The DCS also does not have vision on the exact location of the carton.…”
Section: Existing Control Systemmentioning
confidence: 99%