Consider k mobile robots inside a circular disk of unit radius. The robots are required to
evacuate the disk through an unknown exit point situated on its boundary. We assume all …

We consider the problem of searching on a line using n mobile robots, of which at most f are
faulty, and the remaining are reliable. The robots start at the same location and move in …

The ability to navigate is a hallmark of living systems, from single cells to higher animals.
Searching for targets, such as food or mates in particular, is one of the fundamental …

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 …

Consider a two-person zero-sum search game between a hider and a searcher. The hider
hides among n discrete locations, and the searcher successively visits individual locations …

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 …

Consider a two-person zero-sum search game between a hider and a searcher. The hider
hides among n discrete locations, and the searcher successively visits individual locations …

Abstract We study the Reliable Broadcast problem in incomplete networks against a
Byzantine adversary. We examine the problem under the locally bounded adversary model …

We present a Defense/Attack resource allocation model, where the Defender has some
number of 'locks' to protect n vulnerable boxes (sites), and the Attacker is trying to destroy …

We study the problem of searching for a hidden target in an environment that is modeled by
an edge-weighted graph. A sequence of edges is chosen starting from a given root vertex …