Min-Max Consensus Algorithm for Multi-agent Systems Subject to Privacy-Preserving Problem
This paper proposes a privacy-preserving min-max consensus algorithm for discrete-time multi-agent systems, where all agents not only can reach a common state asymptotically, but also can preserve the privacy of their states at each iteration. Based on the proposed algorithm, the detailed consensus...
Saved in:
Published in | Neural Information Processing Vol. 11307; pp. 132 - 142 |
---|---|
Main Authors | , , |
Format | Book Chapter |
Language | English |
Published |
Switzerland
Springer International Publishing AG
2018
Springer International Publishing |
Series | Lecture Notes in Computer Science |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!