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 …

Multi-agent systems have become increasingly significant in various application areas such
as search-and-rescue, exploration, surveillance, and assembly. In this study, we focus on …

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 …

We study the online problem of evacuating k robots on m concurrent rays to a single
unknown exit. All k robots start on the same point s, not necessarily on the junction j of the m …

Consider two robots that start at the origin of the infinite line in search of an exit at an
unknown location on the line. The robots can only communicate if they arrive at the same …

We revisit the linear search problem where a robot, initially placed at the origin on an infinite
line, tries to locate a stationary target placed at an unknown position on the line. Unlike …

There are n≥ 3 unit speed mobile agents placed at the origin of the infinite line. In as little
time as possible, the agents must find and evacuate from an exit placed at an initially …

We introduce and study a new search-type problem with (n+ 1)-robots on a disk. The
searchers (robots) all start from the center of the disk, have unit speed, and can …