We consider the problem of fault-tolerant parallel search on an infinite line by $ n $ robots.
Starting from the origin, the robots are required to find a target at an unknown location. The …

We consider linear search for an escaping target whose speed and initial position are
unknown to the searcher. A searcher (an autonomous mobile agent) is initially placed at the …

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 …

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 …

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 …

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 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 …

We consider\emph {weighted group search on a disk}, which is a search-type problem
involving 2 mobile agents with unit-speed. The two agents start collocated and their goal is …

We consider the problem of collaboratively delivering a package from a specified source
node s to a designated target node t in an undirected graph G=(V, E), using k mobile agents …