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 squares (LS) algorithm based on diffusion strategy is proposed such that the sensors can cooperatively estimate the unknown time-invariant parameter vector from continuous-time noisy signals. By using the martingal estimation theory and Ito formula, we provide upper bounds for the estimation error of the proposed distributed LS algorithm, and further obtain the convergence results under a cooperative excitation condition. Compared with the existing results, our results are established without using the boundedness or persistent excitation (PE) conditions of regression signals. We provide simulation examples to show that multiple sensors can cooperatively accomplish the estimation task even if any individual can not.
Code (0)
등록된 구현이 없습니다.
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Logarithmic regret for episodic continuous-time linear-quadratic reinforcement learning over a finite-time horizon
We study finite-time horizon continuous-time linear-quadratic reinforcement learning problems in an episodic setting, where both the state and control coefficients are unknown to the controller. We first propose a least-…
parameter estimationReinforcement Learning (RL)Scalable Distributed Least Squares Algorithm for Linear Algebraic Equations via Scheduling
In this work, we propose a novel discrete-time distributed algorithm for finding least squares solutions of linear algebraic equations with a scheduling protocol to further enhance its scalability. Each agent in the netw…
SchedulingDistributed Least Squares in Small Space via Sketching and Bias Reduction
Matrix sketching is a powerful tool for reducing the size of large data matrices. Yet there are fundamental limitations to this size reduction when we want to recover an accurate estimator for a task such as least square…
Distributed learning with regularized least squares
We study distributed learning with the least squares regularization scheme in a reproducing kernel Hilbert space (RKHS). By a divide-and-conquer approach, the algorithm partitions a data set into disjoint data subsets, a…
A Weighted Least-Squares Method for Non-Asymptotic Identification of Markov Parameters from Multiple Trajectories
Markov parameters play a key role in system identification. There exists many algorithms where these parameters are estimated using least-squares in a first, pre-processing, step, including subspace identification and mu…