Consider a set of n>2 identical mobile computational entities in the plane, called robots,
operating in Look-Compute-Move cycles, without any means of direct communication. The …

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 …

Many employers find that graduates and sandwich students come to them poorly prepared
for the every day problems encountered at the workplace. Although many university students …

We consider the following fundamental Mutual Visibility problem: Given a set of n identical
autonomous point robots in arbitrary distinct positions in the Euclidean plane, find a …

We consider the problem of repositioning N autonomous robots on a plane so that each
robot is visible to all others (the Complete Visibility problem), a robot cannot see another …

Given a set of n mobile robots in the d-dimensional Euclidean space, the goal is to let them
converge to a single not predefined point. The challenge is that the robots are limited in their …

Moving and Computing Models: Robots | SpringerLink Skip to main content Advertisement
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …

This paper proposes a deterministic gathering algorithm for n≥ 5 autonomous,
homogeneous, asynchronous, oblivious unit disc robots (fat robots). The robots do not have …

In this paper we study the Near-Gathering problem for a finite set of dimensionless,
deterministic, asynchronous, anonymous, oblivious and autonomous mobile robots with …

In the present paper, we introduce two different algorithms for the two dimensional gathering
problem for synchronous, fat (disk-like) robots with no global navigation or communication …