Distributed Coverage Control on Surfaces in 3D Space

  title={Distributed Coverage Control on Surfaces in 3D Space},
  author={Andreas Breitenmoser and Jean-Claude Metzger and Roland Y. Siegwart and Daniela Rus},
  journal={2010 IEEE/RSJ International Conference on Intelligent Robots and Systems},
This paper addresses the problem of deploying a group of networked robots on a non-planar surface embedded in 3D space. Two distributed coverage control algorithms are presented that both provide a solution to the problem by discrete coverage of a graph. The first method computes shortest paths and runs the Lloyd algorithm on the graph to obtain a centroidal Voronoi tessellation. The second method uses the Euclidean distance measure and locally exchanges mesh cells between approximated Voronoi… Expand
Adaptive Multi-Robot Coverage of Curved Surfaces
Two adaptive coverage algorithms for the deployment of multiple robots into discrete partitions over curved surfaces are presented, which compute a metric tensor field locally on the surface in order to shape the robots’ partitions in position, size, orientation and aspect ratio according to the present anisotropy. Expand
Geodesic topological voronoi tessellations in triangulated environments with multi-robot systems
A discrete approximation of the geodesic Voronoi cell using the multi-robot triangulation is presented, and it is shown that it can be computed efficiently in a distributed fashion and with theoretical guarantees compared to continuous version. Expand
Null space optimization for effective coverage of 3D surfaces using redundant manipulators
The approach described here explicitly considers the null space by treating different inverse kinematics solutions as individual nodes in a graph and model the problem as a generalized traveling salesman problem (GTSP). Expand
Distributed visibility-based coverage using a swarm of UAVs in known 3D-terrains
  • Michalis Thanou, A. Tzes
  • Computer Science
  • 2014 6th International Symposium on Communications, Control and Signal Processing (ISCCSP)
  • 2014
This paper addresses the area coverage problem of a 3D-space by a group of UAVs, equipped with omnidirectional cameras, relying on a3D-visible Voronoi-partitioning scheme, which converges monotonically to a local UAV topological-configuration in terms of the overall volume coverage. Expand
Structured triangulation in multi-robot systems: Coverage, patrolling, Voronoi partitions, and geodesic centers
We present a fundamental framework for organizing exploration, coverage, and surveillance by a swarm of robots with limited individual capabilities, based on triangulating an unknown environment withExpand
Multi-UAV Visual Coverage of Partially Known 3D Surfaces: Voronoi-based Initialization to Improve Local Optimizers
This paper proposes to exploit the partial initial knowledge on the environment to find suitable initial configurations from which the agents start the local optimization, and proposes a constrained centroidal Voronoi tessellation on a coarse approximation of the surface to cover. Expand
Multi-Robot 3D Coverage of Unknown Areas
The problem of deploying a team of flying robots to perform surveillance coverage mission over an unknownterrain of complex and non-convex morphology is presented. In such a mission, the robotsExpand
Multi-robot three-dimensional coverage of unknown areas
Rigorous mathematical arguments and extensive simulations establish that the proposed approach provides a scalable and efficient methodology that incorporates any particular physical constraints and limitations used to navigate the robots into an arrangement that (locally) optimizes surveillance coverage. Expand
Spatial load balancing in non-convex environments using sampling-based motion planners
This paper proposes an algorithm to approximately solve a spatial-load balancing problem for agents, subject to differential constraints, deployed in non-convex environments. A probabilistic roadmapExpand
Equitable persistent coverage of non-convex environments with graph-based planning
This article tackles the problem of persistently covering a complex non-convex environment with a team of robots by finding a partition of the environment where the amount of work for each robot, weighted by the importance of each point, is equal. Expand


Voronoi coverage of non-convex environments with a group of networked robots
This paper presents a solution to decentralized Voronoi coverage in non-convex polygonal environments with an algorithm that is guaranteed to converge to a local optimum and proves convergence and optimality. Expand
Distributed Coverage Control in Sensor Network Environments with Polygonal Obstacles
Abstract We consider the problem of distributed coverage control for mobile sensor networks operating in environments cluttered with polygonal obstacles which interfere with both the navigation andExpand
Discrete Partitioning and Coverage Control With Gossip Communication
A discrete coverage algorithm which converges to a centroidal Voronoi partition while requiring only pairwise “gossip” communication between the agents is presented. Expand
Optimal coverage for multiple hovering robots with downward facing cameras
This paper presents a distributed control strategy for deploying hovering robots with multiple downward facing cameras to collectively monitor an environment. Information per pixel is proposed as anExpand
Sensing and coverage for a network of heterogeneous robots
This work uses the location optimization framework in with three significant extensions, allowing for finite size robots which enables implementation on real robotic systems and extending the previous work allowing for deployment in non convex environments. Expand
Constrained Centroidal Voronoi Tessellations for Surfaces
Centroidal Voronoi tessellations are useful for subdividing a region in Euclidean space into Voronoi regions whose generators are also the centers of mass, with respect to a prescribed densityExpand
Centroidal Voronoi diagrams for isotropic surface remeshing
This paper proposes a new method for isotropic remeshing of triangulated surface meshes by distributing the desired number of samples by generalizing error diffusion and creating the mesh by lifting the corresponding constrained Delaunay triangulation from parameter space. Expand
The graph Voronoi diagram with applications
The Voronoi diagram is a famous structure of computational geometry. We show that there is a straightforward equivalent in graph theory which can be efficiently computed. In particular, we give twoExpand
A coverage algorithm for a class of non-convex regions
It is shown how a diffeomorphism can be constructed for convex regions with obstacles in its interior, so that the solution of the transformed problem yields the Solution of the original non-convex problem. Expand
Approximated Centroidal Voronoi Diagrams for Uniform Polygonal Mesh Coarsening
The clustering provides an efficient way to construct uniform tessellations, and therefore leads to uniform coarsening of polygonal meshes, when the output triangulation has many fewer elements than the input mesh. Expand