Encrypted distributed state estimation via affine averaging
원문 초록
Distributed state estimation arises in many applications such as position estimation in robot swarms, clock synchronization for processor networks, and data fusion. One characteristic is that agents only have access to noisy measurements of deviations between their own and neighboring states. Still, estimations of their actual state can be obtained in a fully distributed manner using algorithms such as affine averaging. However, running this algorithm, requires that the agents exchange their current state estimations, which can be a privacy issue (since they eventually reveal the actual states). To counteract this threat, we propose an encrypted version of the affine averaging algorithm in this paper. More precisely, we use homomorphic encryption to realize an encrypted implementation, where only one ``leader'' agent has access to its state estimation in plaintext. One main challenge (which often arises for recursive encrypted computations) is to prevent overflow w.r.t.~the bounded message space of the cryptosystem. We solve this problem by periodically resetting the agents' states with the help of the leader. We study the resulting system dynamics with respect to different reset strategies and support our findings with extensive 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
토론
이 논문과 연결된 포럼 글이 아직 없습니다.