Related papers: On observability and optimal gain design for distr…
This paper deals with a distributed implementation of minimax adaptive control algorithm for networked dynamical systems modeled by a finite set of linear models. To hedge against the uncertainty arising out of finite number of possible…
In this paper, we propose a distributed algorithm for the minimum dominating set problem. For some especial networks, we prove theoretically that the achieved answer by our proposed algorithm is a constant approximation factor of the exact…
In this paper, the optimal consensus problem for general nonlinear multi-agent systems is studied, where both leaderless and leader-follower cases are considered in a unified framework. The key idea is to convert consensus problems into…
We study the problem of distributed state estimation in a network of sensing units that can exchange their measurements but the rate of communication between the units is constrained. The units collect noisy, possibly only partial…
This paper presents adaptive link selection algorithms for distributed estimation and considers their application to wireless sensor networks and smart grids. In particular, exhaustive search--based least--mean--squares(LMS)/recursive least…
Motivated by various distributed control applications, we consider a linear system with Gaussian noise observed by multiple sensors which transmit measurements over a dynamic lossy network. We characterize the stationary optimal sensor…
This paper proposes a novel distributed interval observer design for linear time-invariant (LTI) discrete-time systems subject to bounded disturbances. In the proposed observer algorithm, each agent in a networked group exchanges…
This paper focuses on learning efficient sensor allocations that ensure observability of unknown high-dimensional linear systems using only a small number of sensors. Existing methods either require an impractically large number of sensors…
In this work, it is presented the development of a novel distributed algorithm performing robotic coverage, clustering and dispatch around an event in static-obstacle structured environments without relying on metric information.…
This paper investigates the problem of linear spatial collaboration for distributed estimation in wireless sensor networks. In this context, the sensors share their local noisy (and potentially spatially correlated) observations with each…
The paper considers the problem of cooperative estimation for a linear uncertain plant observed by a network of communicating sensors. We take a novel approach by treating the filtering problem from the view point of local sensors while the…
This brief addresses the distributed consensus problem of nonlinear multi-agent systems under a general directed communication topology. Each agent is governed by higher-order dynamics with mismatched uncertainties, multiple completely…
We consider the problem of controlling the group behavior of a large number of dynamic systems that are constantly interacting with each other. These systems are assumed to have identical dynamics (e.g., birds flock, robot swarm) and their…
The paper addresses the problem of distributed filtering with guaranteed convergence properties using minimum-energy filtering and $H_\infty$ filtering methodologies. A linear state space plant model is considered observed by a network of…
The robustness of distributed optimization is an emerging field of study, motivated by various applications of distributed optimization including distributed machine learning, distributed sensing, and swarm robotics. With the rapid…
Distributed algorithms for both discrete-time and continuous-time linearly solvable optimal control (LSOC) problems of networked multi-agent systems (MASs) are investigated in this paper. A distributed framework is proposed to partition the…
The guaranteed-performance consensualization for high-order linear and nonlinear multiagent systems with switching topologies is respectively realized in a completely distributed manner in the sense that consensus design criteria are…
Generalized from the concept of consensus, this paper considers a group of edge agreements, i.e. constraints defined for neighboring agents, in which each pair of neighboring agents is required to satisfy one edge agreement constraint. Edge…
Besides the complexity in time or in number of messages, a common approach for analyzing distributed algorithms is to look at the assumptions they make on the underlying network. We investigate this question from the perspective of network…
This paper considers the problem of simultaneous sensor fault detection, isolation, and networked estimation of linear full-rank dynamical systems. The proposed networked estimation is a variant of single time-scale protocol and is based on…