-
Chapter and Conference Paper
Linear Search for an Esca** Target with Unknown Speed
We consider linear search for an esca** target whose speed and initial position are unknown to the searcher. A searcher (an autonomous mobile agent) is initially placed at the origin of the real line and can...
-
Chapter and Conference Paper
Delivery to Safety with Two Cooperating Robots
Two cooperating, autonomous mobile robots with arbitrary nonzero max speeds are placed at arbitrary initial positions in the plane. A remotely detonated bomb is discovered at some source location and must be m...
-
Chapter and Conference Paper
The Pony Express Communication Problem
We introduce a new problem which we call the Pony Express problem. n robots with differing speeds are situated over some domain. A message is placed at some commonly known point. Robots can acquire the message ei...
-
Chapter and Conference Paper
Graph Exploration by Energy-Sharing Mobile Agents
We consider the problem of collective exploration of a known n-node edge-weighted graph by k mobile agents that have limited energy but are capable of energy transfers. The agents are initially placed at an arbit...
-
Chapter and Conference Paper
Message Delivery in the Plane by Robots with Different Speeds
We study a fundamental cooperative message-delivery problem on the plane. Assume n robots which can move in any direction, are placed arbitrarily on the plane. Robots each have their own maximum speed and can com...
-
Chapter and Conference Paper
The Bike Sharing Problem
Assume that \(m \ge 1\) m ≥
-
Article
Weak Coverage of a Rectangular Barrier
Assume n wireless mobile sensors are initially dispersed in an ad hoc manner in a rectangular region. Each sensor can monitor a circular area of specific diameter around its position, called the sensor diameter. ...
-
Article
Search on a line with faulty robots
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 parallel along the line with ...
-
Chapter and Conference Paper
Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless Model
-
Chapter and Conference Paper
Satisfying Neighbor Preferences on a Circle
We study the problem of satisfying seating preferences on a circle. We assume we are given a collection of n agents to be arranged on a circle. Each agent is colored either blue or red, and there are exactly b bl...
-
Chapter and Conference Paper
Gathering in the Plane of Location-Aware Robots in the Presence of Spies
A set of mobile robots (represented as points) is distributed in the Cartesian plane. The collection contains an unknown subset of byzantine robots which are indistinguishable from the reliable ones. The relia...
-
Chapter and Conference Paper
Priority Evacuation from a Disk Using Mobile Robots
We introduce and study a new search-type problem with ( \(n+1\) )-robots on a disk. The searchers (robots) al...
-
Article
When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots
A team of k mobile robots is deployed on a weighted graph whose edge weights represent distances. The robots move perpetually along the domain, represented by all points belonging to the graph edges, without exce...
-
Chapter and Conference Paper
Linear Search with Terrain-Dependent Speeds
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 previous studies, in w...
-
Chapter and Conference Paper
Evacuation from a Disc in the Presence of a Faulty Robot
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 unknown location on t...
-
Chapter and Conference Paper
Weak Coverage of a Rectangular Barrier
Assume n wireless mobile sensors are initially dispersed in an ad hoc manner in a rectangular region. They are required to move to final locations so that they can detect any intruder crossing the region in a dir...
-
Chapter and Conference Paper
Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults
A set of mobile robots is placed at points of an infinite line. The robots are equipped with GPS devices and they may communicate their positions on the line to a central authority. The collection contains an ...
-
Chapter and Conference Paper
Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs
We consider the rendezvous problem for two robots on an arbitrary connected graph with n vertices and all its edges of length one. Two robots are initially located on two different vertices of the graph and can t...
-
Article
Distributed algorithms for barrier coverage using relocatable sensors
We study the barrier coverage problem using relocatable sensor nodes. We assume each sensor can sense an intruder or event inside its sensing range. Sensors are initially located at arbitrary positions on the ...
-
Chapter and Conference Paper
Reconstructing Cactus Graphs from Shortest Path Information
Imagine a disaster in which all edges of a network go down simultaneously. Imagine further that the routing tables of the nodes were not destroyed but are still available. Can one “reconstruct” the network fro...
