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

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

In this paper, we describe a conveyor matrix consisting of small-scale, multi-directional transport modules that are considerably smaller than the transported packets. If a large number of these modules are combined into a matrix, the emerging network solves transport tasks through cooperation...

In this paper, we propose to employ the framework of graph-transformational swarms for the modeling of dynamic logistic networks with decentralized processing and control. The members of a graph-transformational swarm act and interact in a common environment graph with massive parallelism of...

In this paper, we propose to employ the framework of graph-transformational swarms for the modeling of dynamic logistic networks with decentralized processing and control. The members of a graph-transformational swarm act and interact in a common environment graph with massive parallelism of...

In this paper, we describe a conveyor matrix consisting of small-scale, multi-directional transport modules that are considerably smaller than the transported packets. If a large number of these modules are combined into a matrix, the emerging network solves transport tasks through cooperation...