Performance Analysis of Distributed Filtering under Mismatched Noise Covariances
This paper systematically investigates the performance of consensus-based distributed filtering under mismatched noise covariances. First, we introduce three performance evaluation indices for such filtering problems,namely the standard performance evaluation index, the nominal performance evaluation index, and the estimation error covariance. We derive difference expressions among these indices and establish one-step relations among them under various mismatched noise covariance scenarios. We particularly reveal the effect of the consensus fusion on these relations. Furthermore, the recursive relations are introduced by extending the results of the one-step relations. Subsequently, we demonstrate the convergence of these indices under the collective observability condition, and show this convergence condition of the nominal performance evaluation index can guarantee the convergence of the estimation error covariance. Additionally, we prove that the estimation error covariance of the consensus-based distributed filter under mismatched noise covariances can be bounded by the Frobenius norms of the noise covariance deviations and the trace of the nominal performance evaluation index. Finally, the effectiveness of the theoretical results is verified by numerical simulations.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Anti-jamming Method for SAR Using Joint Waveform Modulation and Azimuth Mismatched Filtering
High-fidelity deception jamming can seriously mislead Synthetic Aperture Radar (SAR) image interpretation and target detection, which is difficult to identify or eliminate through traditional anti-jamming methods. Based …
Distributed Adaptive Backstepping Control for Vehicular Platoons with Mismatched Disturbances Using Vector String Lyapunov Functions
In this paper, we consider the problem of platooning control with mismatched disturbances using the distributed adaptive backstepping method. The main challenges are: (1) maintaining the compositionality and the distribu…
Delightful Distributed Policy Gradient
Distributed reinforcement learning trains on data from stale, buggy, or mismatched actors, producing actions with high surprisal (negative log-probability) under the learner's policy. The core difficulty is not surprisin…
Reinforcement LearningConsensus optimization approach for distributed Kalman filtering: performance recovery of centralized filtering with proofs
This paper investigates the distributed Kalman filtering (DKF) from distributed optimization viewpoint. Motivated by the fact that Kalman filtering is a maximum a posteriori estimation (MAP) problem, which is a quadratic…
Distributed OptimizationOn Stability and Convergence of Distributed Filters
Recent years have bore witness to the proliferation of distributed filtering techniques, where a collection of agents communicating over an ad-hoc network aim to collaboratively estimate and track the state of a system. …