Related papers: Coverage Optimization using Generalized Voronoi Pa…
$n$ independent random points drawn from a density $f$ in $R^d$ define a random Voronoi partition. We study the measure of a typical cell of the partition. We prove that the asymptotic distribution of the probability measure of the cell…
This paper introduces a new open-source software program called VoroTop, which uses Voronoi topology to analyze local structure in atomic systems. Strengths of this approach include its abilities to analyze high-temperature systems and to…
A hybrid map representation, which consists of a modified generalized Voronoi Diagram (GVD)-based topological map and a grid-based metric map, is proposed to facilitate a new frontier-driven exploration strategy. Exploration frontiers are…
Optimizing the cellular network's cell locations is one of the most fundamental problems of network design. The general objective is to provide the desired Quality-of-Service (QoS) with the minimum system cost. In order to meet a growing…
Given a network, the statistical ensemble of its graph-Voronoi diagrams with randomly chosen cell centers exhibits properties convertible into information on the network's large scale structures. We define a node-pair level measure called…
This paper addresses the fundamental problem of non-uniform area coverage in multi-agent systems, where different regions require varying levels of attention due to mission-dependent priorities. Existing uniform coverage strategies are…
This article presents a distributed algorithm for a group of robotic agents with omnidirectional vision to deploy into nonconvex polygonal environments with holes. Agents begin deployment from a common point, possess no prior knowledge of…
This article addresses how diverse collective behaviors arise from simple and realistic decisions made entirely at the level of each agent's personal space in the sense of the Voronoi diagram. We present a discrete time model in 2D in which…
The traditional approach to mobile phone positioning is based on the assumption that the geographical location of a cell tower recorded in a call details record (CDR) is a proxy for a device's location. A Voronoi tessellation is then…
This work presents a new network optimization framework for cellular networks using neighborhood-based optimization. Under this optimization framework resources are allocated within virtual cells encompassing several base-stations and the…
Poisson Voronoi diagrams are useful for modeling and describing various natural patterns and for generating random lattices. Although this particular space tessellation is intensively studied by mathematicians, in two- and three dimensional…
We consider the following variant of the Monge-Kantorovich transportation problem. Let S be a finite set of point sites in d dimensions. A bounded set C in d-dimensional space is to be distributed among the sites p in S such that (i) each p…
A multi-agent coverage problem is considered with energy-constrained agents. The objective of this paper is to compare the coverage performance between centralized and decentralized approaches. To this end, a near-optimal centralized…
A preconditioning strategy is proposed for the iterative solve of large numbers of linear systems with parameter-dependent matrix and right-hand side which arise during the computation of solution statistics of stochastic elliptic partial…
Decentralized optimization is widely used in large scale and privacy preserving machine learning and various distributed control and sensing systems. It is assumed that every agent in the network possesses a local objective function, and…
We present an algorithm for boundary approximation in locally-linked sensor networks that communicate with a remote monitoring station. Delaunay triangulations and Voronoi diagrams are used to generate a sensor communication network and…
This paper investigates a distributed goal assignment problem in leader-following formation control of second-order multi-agent systems. It is assumed that each agent can communicate with nearby agents within the communication range and the…
Given a set of sites in a simple polygon, a geodesic Voronoi diagram of the sites partitions the polygon into regions based on distances to sites under the geodesic metric. We present algorithms for computing the geodesic nearest-point,…
Network densification and heterogenisation through the deployment of small cellular access points (picocells and femtocells) are seen as key mechanisms in handling the exponential increase in cellular data traffic. Modelling such networks…
In this paper, we consider a set of agents, which may receive an observation of their state by a central observa- tion post via a shared wireless network. The aim of this work is to design a scheduling mechanism for the central observation…