On the Distributed Estimation from Relative Measurements: a Graph-Based Convergence Analysis
원문 초록
For a multi-agent system state estimation resting upon noisy measurements constitutes a problem related to several application scenarios. Adopting the standard least-squares approach, in this work we derive both the (centralized) analytic solution to this issue and two distributed iterative schemes, which allow to establish a connection between the convergence behavior of consensus algorithm toward the optimal estimate and the theory of the stochastic matrices that describe the network system dynamics. This study on the one hand highlights the role of the topological links that define the neighborhood of agent nodes, while on the other allows to optimize the convergence rate by easy parameter tuning. The theoretical findings are validated considering different network topologies by means of numerical simulations.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
From Models To Experiments: Shallow Recurrent Decoder Networks on the DYNASTY Experimental Facility
Recursive KalmanNet: Deep Learning-Augmented Kalman Filtering for State Estimation with Consistent Uncertainty Quantification
Benchmarking Spatiotemporal Reasoning in LLMs and Reasoning Models: Capabilities and Challenges
UMotion: Uncertainty-driven Human Motion Estimation from Inertial and Ultra-wideband Units
Contrastive Cross-Course Knowledge Tracing via Concept Graph Guided Knowledge Transfer
Secure Safety Filter Design for Sampled-data Nonlinear Systems under Sensor Spoofing Attacks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.