Related papers: Coverage Optimization using Generalized Voronoi Pa…
Covering a bounded region with minimum number of homogeneous sensor nodes is a NP-complete problem \cite{Li09}. In this paper we have proposed an {\it id} based distributed algorithm for optimal coverage in an unbounded region. The proposed…
In this paper, we consider a class of workspace partitioning problems that arise in the context of area coverage and spatial load balancing for spatially distributed heterogeneous multi-agent networks. It is assumed that each agent has…
Coverage control algorithms have traditionally focused on static target densities, where agents are deployed to optimally cover a fixed spatial distribution. However, many applications involve time-varying densities, including environmental…
Poisson Voronoi tessellations have been used in modeling many types of systems across different sciences, from geography and astronomy to telecommunications. The existing literature on the statistical properties of Poisson Voronoi cells is…
In this paper, we investigate the optimization of Centroidal Voronoi Tessellations (CVT) under geometric constraints. For this purpose, we minimize a linear combination of the standard CVT energy functional with terms involving geometric…
Assuming a random uniform distribution of n sensor nodes over a virtual grid, this paper addresses the problem of finding the maximum number of connected set covers each ensuring 100% coverage of the query region. The connected sets remain…
We study a heterogeneous two-tier wireless sensor network in which N heterogeneous access points (APs) collect sensing data from densely distributed sensors and then forward the data to M heterogeneous fusion centers (FCs). This…
We present a comprehensive two-layer Voronoi coverage control approach for coordinating hybrid aerial-ground robot teams in hazardous material emergency response scenarios. Traditional Voronoi coverage control methods face three critical…
Voronoi diagrams are highly compact representations that are used in various Graphics applications. In this work, we show how to embed a differentiable version of it -- via a novel deep architecture -- into a generative deep network. By…
This paper presents a distributed gradient-based deployment strategy to maximize coverage in hybrid wireless sensor networks (WSNs) with probabilistic sensing. Leveraging Voronoi partitioning, the overall coverage is reformulated as a sum…
Optimized spatial partitioning algorithms are the corner stone of many successful experimental designs and statistical methods. Of these algorithms, the Centroidal Voronoi Tessellation (CVT) is the most widely utilized. CVT based methods…
Future applications in environmental monitoring, delivery of services and transportation of goods motivate the study of deployment and partitioning tasks for groups of autonomous mobile agents. These tasks are achieved by recent coverage…
This paper presents an algorithm for a team of mobile robots to simultaneously learn a spatial field over a domain and spatially distribute themselves to optimally cover it. Drawing from previous approaches that estimate the spatial field…
In this article, we propose a numerical method to solve semi-discrete optimal transport problems for gigantic pointsets (108 points and more). By pushing the limits by several orders of magnitude, it opens the path to new applications in…
The rapid deployment of wireless sensor network (WSN) poses the challenge of finding optimal locations for the network nodes, especially so in (i) unknown and (ii) obstacle-rich environments. This paper addresses this challenge with BISON…
Voronoi coverage control is a particular problem of importance in the area of multi-robot systems, which considers a network of multiple autonomous robots, tasked with optimally covering a large area. This is a common task for fleets of…
This paper presents a novel coverage control algorithm for multi-agent systems, where each agent has no prior knowledge of the specific region to be covered. The proposed method enables agents to autonomously detect the target area and…
In this work, we approach the problem of resource allocation in a team of agents through the framework of Centroidal Voronoi Tessellations. CVTs provide a natural way to embed a desired global trend in the team through probability…
In cellular networks, users are grouped into different cells and served by different access points (base stations) that provide wireless access to services and applications. In general, the service demand is very heterogeneous,…
This article represents the computational model for spacial addresation of the sensors in the dynamically changing real-time internet of things system. The model bases on the Voronoi diagrams as a basic data structure. Problem - the correct…