Proceedings Article10.1109/CDC.2016.7798797
Distributed estimation and control for robotic sensor networks
Charles Freundlich,Soomin Lee,Michael M. Zavlanos +2 more
- 01 Dec 2016
- pp 3518-3523
1
TL;DR: The network is addressed by means of a new distributed random approximate projections method that is robust to the state disagreement errors that will exist among the robots as the distributed filter fuses the collected measurements and is computationally light enough to handle large numbers of hidden states.
read more
Abstract: In this paper, we address the problem of controlling a network of mobile sensors to estimate a collection of hidden states to a user-specified accuracy. The mobile sensors simultaneously take measurements of the hidden states, fuse them in a distributed filter, and plan their next views in order to minimize expected uncertainty. This formulation leads to an optimization problem with as many coupled LMI constraints as the number of hidden states. The network solves this problem by means of a new distributed random approximate projections method that is robust to the state disagreement errors that will exist among the robots as the distributed filter fuses the collected measurements and is computationally light enough to handle large numbers of hidden states.
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
Non-Linear Estimation using the Weighted Average Consensus-Based Unscented Filtering for Various Vehicles Dynamics towards Autonomous Sensorless Design
TL;DR: In this paper , a distributed estimation to reach the untouched states, pursuing sensorless design, is approached, initiated by the construction of the modified pseudo measurement which, due to approximation, led to the weighted average consensus calculation within unscented filtering along with the bounded estimation errors.
1
References
•Book
Finite-Dimensional Variational Inequalities and Complementarity Problems
Francisco Facchinei,Jong-Shi Pang +1 more
- 16 Apr 2013
TL;DR: Newton Methods for Nonsmooth Equations as mentioned in this paper and global methods for nonsmooth equations were used to solve the Complementarity problem in the context of non-complementarity problems.
5K
•Book
Convex Analysis and Optimization
Dimitri P. Bertsekas,Angelia Nedic,Asuman Ozdaglar +2 more
- 01 Jan 2003
2.3K
Finite-Dimensional Variational Inequalities and Complementarity Problems
Francisco Facchinei,Jong-Shi Pang +1 more
- 01 Jan 2004
2.1K
Minimization of unsmooth functionals
TL;DR: In this paper, the authors consider the minimization of a convex, but necessarily differentiable, functional in convex set of Hilbert space, and show how the method may be modified if the minimum of the functional is unknown.
628
Graph-theoretic connectivity control of mobile robot networks
Michael M. Zavlanos,Magnus Egerstedt,George J. Pappas +2 more
- 12 Jul 2011
TL;DR: In this paper, a graph-theoretic definition of connectivity is provided, as well as an equivalent definition based on algebraic graph theory, which employs the adjacency and Laplacian matrices of the graph and their spectral properties.