This paper discusses how the state-of-the-art techniques in cyber-physical systems facilitate
building smart warehouses to achieve the promising vision of industry 4.0. We focus on four …

We consider the well known distributed setting of computational mobile entities, called
robots, operating in the Euclidean plane in Look-Compute-Move (LCM) cycles. We …

Creating a swarm of mobile computing entities, frequently called robots, agents, or sensor
nodes, with self-organization ability is a contemporary challenge in distributed computing …

Abstract The Arbitrary Pattern Formation problem asks to design a distributed algorithm that
allows a set of autonomous mobile robots to form any specific but arbitrary geometric pattern …

Given a set R of robots, each one located at a different vertex of an infinite regular
tessellation graph, we aim to explore the Arbitrary Pattern Formation (APF) problem. Given a …

In this paper we present a procedure to automatically design and verify the local behavior of
robots with highly limited cognition. All robots are: anonymous, homogeneous, non …

Given any multiset F of points in the Euclidean plane and a set R of robots such that| R|=| F||
R|=| F|, the Arbitrary Pattern Formation (APF) problem asks for a distributed algorithm that …

Abstract We consider the Embedded Pattern Formation (epf) problem introduced in Fu**aga
et al.(SIAM J Comput 44 (3): 740–785, 2015). Given a set F of distinct points in the Euclidean …

Abstract The Arbitrary Pattern Formation problem asks for a distributed algorithm that moves
a set of autonomous mobile robots to form any arbitrary pattern given as input. The robots …

We consider the fundamental problem of arranging a set of n autonomous robots (points) on
a real plane according to an arbitrary given pattern. Each robot operates in a, largely …