Control of autonomous vehicles for applications such as surveillance, search, and
exploration has been a topic of great interest over the past two decades. In particular, there …

We address the problem of repeated coverage of a target area, of any polygonal shape, by a
team of robots having a limited visual range. Three distributed Cluster-based algorithms …

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 …

In the pinwheel scheduling problem, each task i is associated with a positive integer ai
called its period, and we want to (perpetually) schedule one task per day so that each task i …

Periodic monitoring is sufficient for sweep coverage with a small number of mobile sensor
nodes, whereas a continuous monitoring with static sensor nodes is required for the …

A garden G is populated by n ≥ 1 bamboos b_1, b_2,..., b_n with the respective daily growth
rates h_1 ≥ h_2 ≥\dots ≥ h_n. It is assumed that the initial heights of bamboos are zero …

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 …

Suppose we want to patrol a fence (line segment) using kk mobile agents with given speeds
v _1 v 1,..., v _k vk so that every point on the fence is visited by an agent at least once in …

A set of mobile robots is deployed on a simple curve of finite length, composed of a finite set
of vital segments separated by neutral segments. The robots have to patrol the vital …

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 …