A Framework on Fully Distributed State Estimation and Cooperative Stabilization of LTI Plants
How to realize high-level autonomy of individuals is one of key technical issues to promote swarm intelligence of multi-agent (node) systems with collective tasks, while the fully distributed design is a potential way to achieve this goal. This paper works on the fully distributed state estimation and cooperative stabilization problem of linear time-invariant (LTI) plants with multiple nodes communicating over general directed graphs, and is aimed to provide a fully distributed framework for each node to perform cooperative stabilization tasks. First, by incorporating a novel adaptive law, a consensus-based estimator is designed for each node to obtain the plant state based on its local measurement and local interaction with neighbors, without using any global information of the communication topology. Subsequently, a local controller is developed for each node to stabilize the plant collaboratively with performance guaranteed under mild conditions. Specifically, the proposed method only requires that the communication graph be strongly connected, and the plant be collectively controllable and observable. Further, the proposed method can be applied to pure fully distributed state estimation scenarios and modified for noise-bounded LTI plants. Finally, two numerical examples are provided to show the effectiveness of the theoretical results.
Code (0)
등록된 구현이 없습니다.
Tasks
State EstimationSimilar Papers 제목 키워드 기반
Distributed Least Squares Algorithm for Continuous-time Stochastic Systems Under Cooperative Excitation Condition
In this paper, we study the distributed adaptive estimation problem of continuous-time stochastic dynamic systems over sensor networks where each agent can only communicate with its local neighbors. A distributed least s…
On Distributed Cooperative Decision-Making in Multiarmed Bandits
We study the explore-exploit tradeoff in distributed cooperative decision-making using the context of the multiarmed bandit (MAB) problem. For the distributed cooperative MAB problem, we design the cooperative UCB algori…
Decision MakingCooperative Multi-agent Bandits: Distributed Algorithms with Optimal Individual Regret and Constant Communication Costs
Recently, there has been extensive study of cooperative multi-agent multi-armed bandits where a set of distributed agents cooperatively play the same multi-armed bandit game. The goal is to develop bandit algorithms with…
Multi-Armed BanditsDistributed Conditional Generative Adversarial Networks (GANs) for Data-Driven Millimeter Wave Communications in UAV Networks
In this paper, a novel framework is proposed to perform data-driven air-to-ground (A2G) channel estimation for millimeter wave (mmWave) communications in an unmanned aerial vehicle (UAV) wireless network. First, an effec…
Generative Adversarial NetworkTowards Value-Constrained Credit Assignment in Fully Delegated AI Cooperatives
We propose a framework for reward allocation in fully delegated AI cooperatives where humans are represented by agents that contribute data and participate in model updates under heterogeneous value constraints. The key …
Personalized Federated Learning