Large pervasive systems, deployed in dynamic environments, require flexible control
mechanisms to meet the demands of chaotic state changes while accomplishing system …

This paper considers a multi-target coverage problem where a robot team aims to efficiently
cover multi-targets while maintaining connectivity in a distributed manner. A novel …

Mobile robots hold great promise in reducing the need for humans to perform jobs such as
vacuuming, seeding, harvesting, painting, search and rescue, and inspection. In practice …

Although cleaning robots have been increasingly popular in home environments, their
coverage rate and performance has not been very impressive to their users, thus often …

This paper considers the scenario where multiple robots collaboratively cover a region in
which the exact distribution of workload is unknown prior to the operation. The workload …

This paper discusses the problem of building efficient coverage paths for a team of robots.
An efficient multirobot coverage algorithm should result in a coverage path for every robot …

Existing solutions to carrier-based sensor placement by a single robot in a bounded
unknown Region of Interest (ROI) do not guarantee full area coverage or termination. We …

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 …

Searching for objects and observing parts of a known environment efficiently is a
fundamental problem in many real‐world robotic applications, eg, household robots …

We introduce an algorithm to cover an unknown space with a homogeneous team of circular
mobile robots. Our approach is based on a single robot coverage algorithm, a …