Information-driven distributed coverage algorithms for mobile sensor networks
Azwirman Gusrialdi,Risvan Dirza,Sandra Hirche +2 more
- 11 Apr 2011
- pp 242-247
TL;DR: A new algorithm on the coverage problem for mobile sensor networks which guarantees all sensors to participate in the coverage task is proposed, a combination of the standard gradient-based coverage algorithm and leader-following algorithm and is designed to maximize the joint detection probabilities of the events in the region of interest.
read more
Abstract: When mobile sensors are initially deployed, some sensors may be located far away from the region of interest and due to the sensor's limited sensing of range, some sensors may not be able to participate in the coverage task This paper proposes a new algorithm on the coverage problem for mobile sensor networks which guarantees all sensors to participate in the coverage task The algorithm is a combination of the standard gradient-based coverage algorithm and leader-following algorithm and is designed to maximize the joint detection probabilities of the events in the region of interest First, leader sensors are selected based on the information which each sensor has gathered The rest of the sensors will follow the leaders until they have sufficient information on the region of interest and then switch to the standard coverage algorithm The proposed algorithm can be performed in a distributed manner Moreover, the proposed algorithm could also improve the convergence speed of the coverage task The results are validated through numerical simulations
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Posted Content
Coverage control for mobile sensing networks
TL;DR: This paper proposes gradient descent algorithms for a class of utility functions which encode optimal coverage and sensing policies which are adaptive, distributed, asynchronous, and verifiably correct.
2.2K
Performance evaluation of novel distributed coverage techniques for swarms of flying robots
Valeria Loscri,Enrico Natalizio,Nathalie Mitton +2 more
- 06 Apr 2014
TL;DR: This paper modifications the classical PSO approach to propose a totally distributed algorithm, which only requires the flying robots to receive local information from the neighbors to update their velocity and trajectory (PSO-S), combined with a distributed version of the Virtual Forces Algorithm.
Performance-guaranteed distributed coverage control for robotic visual sensor network with limited energy storage
Risvan Dirza,Azwirman Gusrialdi +1 more
- 01 Nov 2011
TL;DR: This paper proposes a new algorithm that guarantees the participation of all sensors in the network while at the same time maintains the energy utilization as optimum as possible and combines the standard coverage algorithm with the leader-following algorithm where the standard Coverage algorithm is further modified in order to take into account the energy consumption of the sensors.
4
Adaptive event sensing in networks of autonomous mobile agents
TL;DR: A new distributed algorithm for agent control based on the notion of an execution mode, which essentially lets each agent roam the target region either at random or following its local view of a density-dependent gradient, is introduced.
An Evaluation Model of Coverage Degree for Multi-agent System
Mingliang Zhang,Zhiping Zhou +1 more
TL;DR: This article establishes an evaluation mode of coverage degree for the field by using a combination of distance and time elapse to construct this model and shows which deployment topology is more efficient.
References
Coverage control for mobile sensing networks
Jorge E. Cortes,Sonia Martinez,Timur Karatas,Francesco Bullo +3 more
- 07 Aug 2002
TL;DR: In this paper, the authors describe decentralized control laws for the coordination of multiple vehicles performing spatially distributed tasks, which are based on a gradient descent scheme applied to a class of decentralized utility functions that encode optimal coverage and sensing policies.
•Posted Content
Coverage control for mobile sensing networks
TL;DR: This paper proposes gradient descent algorithms for a class of utility functions which encode optimal coverage and sensing policies which are adaptive, distributed, asynchronous, and verifiably correct.
2.2K
Mobile Sensor Network Deployment using Potential Fields: A Distributed, Scalable Solution to the Area Coverage Problem
Andrew Howard,Maja J. Matarić,Gaurav S. Sukhatme +2 more
- 01 Jan 2002
TL;DR: This paper presents a potential-field-based approach to deployment of a mobile sensor network, where the fields are constructed such that each node is repelled by both obstacles and by other nodes, thereby forcing the network to spread itself throughout the environment.
1.4K
Motion Coordination with Distributed Information
TL;DR: This article presents and surveys some recently developed theoretical tools for modeling, analysis, and design of motion coordination algorithms in both continuous and discrete time and pays special attention to the distributed character of coordination algorithms.
606
Spatially-distributed coverage optimization and control with limited-range interactions
TL;DR: This paper analyzes a class of aggregate objective functions and proposes coverage algorithms in continuous and discrete time that have convergence guarantees and are spatially distributed with respect to appropriate proximity graphs.