The past two decades have seen the rapid growth and development of the field of distributed
computing by mobile entities, whose concern is the study of the computational and …

This book presents the most important fault-tolerant distributed programming abstractions
and their associated distributed algorithms, in particular in terms of reliable communication …

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 …

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 investigate pattern formation, ie, self-organization, by a swarm of mobile robots, which is
closely related with the agreement problem in distributed computing. Consider a system of …

Abstract We consider the Mutual Visibility problem for anonymous dimensionless robots with
obstructed visibility moving in a plane: starting from distinct locations, the robots must reach …

Given a graph G=(V (G), E (G)) and a set P⊆ V (G), the following concepts have been
recently introduced:(i) two elements of P are mutually visible if there is a shortest path …

We revisit the problem of gathering autonomous robots in the plane. In particular, we
consider non-transparent unit-disc robots (ie, fat) in an asynchronous setting with vision as …

If $ G $ is a graph and $ X\subseteq V (G) $, then $ X $ is a total mutual-visibility set if every
pair of vertices $ x $ and $ y $ of $ G $ admits a shortest $ x, y $-path $ P $ with $ V (P)\cap …

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 …