Privacy-Preserving Dynamic Average Consensus via State Decomposition: Case Study on Multi-Robot Formation Control
Dynamic average consensus is a decentralized control/estimation framework where a group of agents cooperatively track the average of local time-varying reference signals. In this paper, we develop a novel state decomposition-based privacy preservation scheme to protect the privacy of agents when sharing information with neighboring agents. Specifically, we first show that an external eavesdropper can successfully wiretap the reference signals of all agents in a conventional dynamic average consensus algorithm. To protect privacy against the eavesdropper, a state decomposition scheme is developed where the original state of each agent is decomposed into two sub-states: one succeeds the role of the original state in inter-node interactions, while the other sub-state only communicates with the first one and is invisible to other neighboring agents. Rigorous analyses are performed to show that 1) the proposed privacy scheme preserves the convergence of the average consensus; and 2) the privacy of the agents is protected such that an eavesdropper cannot discover the private reference signals with any guaranteed accuracy. The developed privacy-preserving dynamic average consensus framework is then applied to the formation control of multiple non-holonomic mobile robots, in which the efficacy of the scheme is demonstrated. Numerical simulation is provided to illustrate the effectiveness of the proposed approach.
Code (0)
등록된 구현이 없습니다.
Tasks
Privacy PreservingSimilar Papers 제목 키워드 기반
Vector-valued Privacy-Preserving Average Consensus
Achieving average consensus without disclosing sensitive information can be a critical concern for multi-agent coordination. This paper examines privacy-preserving average consensus (PPAC) for vector-valued multi-agent n…
Privacy PreservingPrivacy-Preserving Push-sum Average Consensus via State Decomposition
Average consensus is extensively used in distributed networks for computation and control, where all the agents constantly communicate with each other and update their states in order to reach an agreement. Under a gener…
Privacy PreservingFinite Time Privacy Preserving Quantized Average Consensus with Transmission Stopping
Due to their flexibility, battery powered or energy-harvesting wireless networks are employed in diverse applications. Securing data transmissions between wireless devises is of critical importance in order to avoid priv…
Privacy PreservingFaithful and Privacy-Preserving Implementation of Average Consensus
We propose a protocol based on mechanism design theory and encrypted control to solve average consensus problems among rational and strategic agents while preserving their privacy. The proposed protocol provides a mechan…
Privacy PreservingPrivacy-Preserving Distributed Average Consensus in Finite Time using Random Gossip
In this paper, we develop and analyze a gossip-based average consensus algorithm that enables all of the components of a distributed system, each with some initial value, to reach (approximate) average consensus on their…
Privacy Preserving