Decentralized Cooperative Online Estimation With Random Observation Matrices, Communication Graphs and Time Delays
We analyze convergence of decentralized cooperative online estimation algorithms by a network of multiple nodes via information exchanging in an uncertain environment. Each node has a linear observation of an unknown parameter with randomly time-varying observation matrices. The underlying communication network is modeled by a sequence of random digraphs and is subjected to nonuniform random time-varying delays in channels. Each node runs an online estimation algorithm consisting of a consensus term taking a weighted sum of its own estimate and neighbours' delayed estimates, and an innovation term processing its own new measurement at each time step. By stochastic time-varying system, martingale convergence theories and the binomial expansion of random matrix products, we transform the convergence analysis of the algorithm into that of the mathematical expectation of random matrix products. Firstly, for the delay-free case, we show that the algorithm gains can be designed properly such that all nodes' estimates converge to the true parameter in mean square and almost surely if the observation matrices and communication graphs satisfy the stochastic spatiotemporal persistence of excitation condition. Secondly, for the case with time delays, we introduce delay matrices to model the random time-varying communication delays between nodes. It is shown that under the stochastic spatio-temporal persistence of excitation condition, for any given boundeddelays, proper algorithm gains can be designed to guarantee mean square convergence for the case with conditionally balanced digraphs.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
QR-MIX: Distributional Value Function Factorisation for Cooperative Multi-Agent Reinforcement Learning
In Cooperative Multi-Agent Reinforcement Learning (MARL) and under the setting of Centralized Training with Decentralized Execution (CTDE), agents observe and interact with their environment locally and independently. Wi…
Multi-agent Reinforcement Learningquantile regressionreinforcement-learningReinforcement Learning (RL)+3Decentralized Multitask Learning over Learned Task Graphs
This paper investigates decentralized multitask learning over networks when the underlying task relationships are unknown. While existing graph-regularized multitask frameworks typically assume a known structure, practic…
Decentralized Online Learning: Take Benefits from Others' Data without Sharing Your Own to Track Global Trend
Decentralized Online Learning (online learning in decentralized networks) attracts more and more attention, since it is believed that Decentralized Online Learning can help the data providers cooperatively better solve t…
ORION: Option-Regularized Deep Reinforcement Learning for Cooperative Multi-Agent Online Navigation
Existing methods for multi-agent navigation typically assume fully known environments, offering limited support for partially known scenarios with outdated or imperfect prior maps, such as warehouses or factory floors. T…
Reinforcement LearningDecentralized Online Learning for Random Inverse Problems Over Graphs
We propose a decentralized online learning algorithm for distributed random inverse problems over network graphs with online measurements, and unifies the distributed parameter estimation in Hilbert spaces and the least …
parameter estimation