The study of what can be computed by a team of autonomous mobile robots, originally
started in robotics and AI, has become increasingly popular in theoretical computer science …

Fault-Tolerant Mobile Robots | SpringerLink Skip to main content Advertisement SpringerLink
Account Menu Find a journal Publish with us Track your research Search Cart Book cover …

We study the impact that persistent memory has on the classical rendezvous problem of two
mobile computational entities, called robots, in the plane. It is well known that, without …

In this paper we study the power of using lights, ie visible external memory, for distributed
computation by autonomous robots moving in Look-Compute-Move (LCM) cycles. With …

We study the Rendezvous problem for 2 autonomous mobile robots in asynchronous
settings with persistent memory called light. It is well known that Rendezvous is impossible …

We study the impact that persistent memory has on the classical rendezvous problem of two
mobile computational entities, called robots, in the plane. It is well known that, without …

We consider a swarm of $ n $ robots in\mathbb {R}^ d. The robots are oblivious, disoriented
(no common coordinate system/compass), and have limited visibility (observe other robots …

We consider the problem of gathering n anonymous and oblivious mobile robots, which
requires that all robots meet in finite time at a nonpredefined point. While the gathering …

This paper addresses the Gathering problem which asks robots to gather at a single point
which is not fixed in advance, for a set of small, autonomous, mobile robots. The problem is …

Abstract Oblivious Mobile Robots have been studied both in continuous Euclidean spaces,
and discrete spaces (that is, graphs). However the obtained literature forms distinct sets of …