Group search and evacuation are fundamental tasks performed by a set of co-operating,
autonomous mobile agents. The two tasks are similar in that they both aim to search a given …

The paper considers variants of the gathering problem of oblivious and asynchronous robots
moving in the plane. When n> 2 n> 2 robots are free to gather anywhere in the plane, the …

We consider the problem of evacuating two robots from a bounded area, through an
unknown exit located on the boundary. Initially, the robots are in the center of the area and …

Consider an equilateral triangle or square with sides of length 1. A number of robots starting
at the same location on the perimeter or in the interior of the triangle or square are required …

We consider the evacuation problem on a circle for three robots, at most one of which is
faulty. The three robots starting from the center of a unit circle search for an exit placed at an …

Abstract We consider (n, f)-search on a circle, a search problem of a hidden exit on a circle
of unit radius for n> 1 robots, f of which are faulty. All the robots start at the centre of the circle …

Two mobile robots are initially placed at the same point on an infinite line. Each robot may
move on the line in either direction not exceeding its maximal speed. The robots need to find …

We initiate the study of a new problem on searching and fetching in a distributed
environment concerning treasure-evacuation from a unit disk. A treasure and an exit are …

Distributed on a unit circle are k exits. Two autonomous mobile robots are placed on the
circle. Each robot has a maximum speed of 1 and the robots can communicate wirelessly …

The problem of evacuating two robots from the disk in the face-to-face model was first
introduced in 16, and extensively studied (along with many variations) ever since with …