Related papers: Higher order mobile coverage control with applicat…

We consider a network of agents that locate themselves in an environment through sensor measurements and aim to transmit a message signal to a base station via collaborative beamforming. The agents' sensor measurements result in…

This work shows the existence of optimal control laws for persistent monitoring of mobile targets in a one-dimensional mission space and derives explicit solutions. The underlying performance metric consists of minimizing the total…

Motivated by secure wireless networking, we consider the problem of placing fixed localizers that enable mobile communication devices to prove they belong to a secure region that is defined by the interior of a polygon. Each localizer views…

Most consumer-level low-cost unmanned aerial vehicles (UAVs) have limited battery power and long charging time. Due to these energy constraints, they cannot accomplish many practical tasks, such as monitoring a sport or political event for…

In this paper we consider the problem of high accuracy localization of mobile nodes in a multipath-rich environment where sub-meter accuracies are required. We employ a peer to peer framework where the vehicles/nodes can get pairwise…

In this paper we present a novel distributed coverage control framework for a network of mobile agents, in charge of covering a finite set of points of interest (PoI), such as people in danger, geographically dispersed equipment or…

Voronoi diagrams appear in many areas in science and technology and have numerous applications. They have been the subject of extensive investigation during the last decades. Roughly speaking, they are a certain decomposition of a given…

In this paper we consider the localization problem for a visual sensor network. Inspired by the alternate attitude and position distributed optimization framework discussed in [1], we propose an estimation scheme that exploits the unit dual…

We consider the problem of tracking multiple, unknown, and time-varying numbers of objects using a distributed network of heterogeneous sensors. In an effort to derive a formulation for practical settings, we consider limited and unknown…

This work addresses the collaborative multi-robot autonomous online exploration problem, particularly focusing on distributed exploration planning for dynamically balanced exploration area partition and task allocation among a team of…

Sweep coverage is to realize the periodic coverage of targets by planning the periodic sweeping paths of mobile sensors. It is difficult for sensors to reduce energy consumption by reducing the moving distances. Therefore, charging…

Wireless sensor networks hold a great potential in the deployment of several applications of a paramount importance in our daily life. Video sensors are able to improve a number of these applications where new approaches adapted to both…

In recent years, there have been efforts to collect human contact traces during social events (e.g., conferences) using Bluetooth devices (e.g., mobile phones, iMotes). The results of these studies have enabled the ability to do the…

A k-order coverage control problem is studied where a network of agents must deploy over a desired area. The objective is to deploy all the agents in a decentralized manner such that a certain coverage performance metric of the network is…

Higher penetration of renewable generation will increase the demand for adequate (and cost-effective) controllable resources on the grid that can mitigate and contain the contingencies locally before it can cause a network-wide collapse.…

We consider the problem of multi-robot sensor coverage, which deals with deploying a multi-robot team in an environment and optimizing the sensing quality of the overall environment. As real-world environments involve a variety of sensory…

It is always a challenging task for multi-agent systems to achieve efficient and robust coverage in uncertain environments. The absence of global positioning information on the uncertain environment introduces significant complexity to the…

Colander are location aware entities that collaborate to determine approximate location of mobile or static objects when beacons from an object are received by all colanders that are within its distance $R$. This model, referred to as…

Tracking multiple targets in dynamic environments using distributed sensor networks is a challenging problem for situational awareness in connected autonomous vehicles (CAVs). In such scenarios, the network of mobile sensors must coordinate…

In this paper, we address the stochastic reach-avoid problem for linear systems with additive stochastic uncertainty. We seek to compute the maximum probability that the states remain in a safe set over a finite time horizon and reach a…