A Practical Method to Cover Evenly a Dynamic Region With a Swarm

  title={A Practical Method to Cover Evenly a Dynamic Region With a Swarm},
  author={Enrique Teruel and Rosario Aragues and Gonzalo L{\'o}pez-Nicol{\'a}s},
  journal={IEEE Robotics and Automation Letters},
Many applications require exploring or monitoring a region. This can be achieved by a sensor network, a large team of robots which can cover only a very small fraction each. When the region is convex, small, and static, it suffices to deploy the robots as a Centroidal Voronoi Tessellation (CVT). Instead, we consider that the area to cover is wide, not necessarily convex, and complex. Then, a smaller simple region is maneuvered and deformed to rake the full area. A few waypoints describing the… 

Figures from this paper


Control of a Group of Mobile Robots Based on Formation Abstraction and Decentralized Locational Optimization
It is shown that the objective function, taking into account the distance between robots, does not decrease for fixed and nonconvex polygonal formation shapes if the zero-order hold control is applied for a sufficiently short sampling period.
Dynamic region following formation control for a swarm of robots
In this control strategy, a swarm of robots shall move together as a group inside a dynamic region that can rotate or scale to enable the robots to adjust the formation.
A New Voronoi-Based Blanket Coverage Control Method for Moving Sensor Networks
This brief addresses the blanket coverage problem, in which it is desired to cover a long region by moving the blanket within the boundaries representing the main region. To this purpose, a group of
Abstraction and control for Groups of robots
This paper focuses on planar fully actuated robots and proposes an abstraction based on the definition of a map from the configuration space Q of the robots to a lower dimensional manifold A, whose dimension is independent of the number of robots.
A passivity-based decentralized strategy for generalized connectivity maintenance
This paper presents a novel decentralized strategy able to enforce connectivity maintenance for a group of robots in a flexible way, by granting large freedom to the group internal configuration so as to allow establishment/deletion of interaction links at anytime as long as global connectivity is preserved.
Swarm assignment and trajectory optimization using variable-swarm, distributed auction assignment and sequential convex programming
The implementation of the distributed auction algorithm and sequential convex programming using model predictive control produces the swarm assignment and trajectory optimization (SATO) algorithm that transfers a swarm of robots or vehicles to a desired shape in a distributed fashion.