Skip to main content

Min-Max Consensus Algorithm for Multi-agent Systems Subject to Privacy-Preserving Problem

  • Conference paper
  • First Online:
Neural Information Processing (ICONIP 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11307))

Included in the following conference series:

Abstract

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 analysis is developed, including the impossibility of finite time convergence and the sufficient condition of consensus. Moreover, the privacy-preserving analysis is provided to guarantee the reliability of our privacy-preserving scheme. Finally, a numerical simulation is performed to demonstrate the correctness of our results.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Zhang, H., Yue, D., Yin, X., Hu, S., xia, D.C.: Finite-time distributed eventtriggered consensus control for multi-agent systems. Inf. Sci. 339, 132–142 (2016)

    Article  Google Scholar 

  2. Wang, A., Dong, T., Liao, X.: On the general consensus protocol in multiagent networks with second-order dynamics and sampled data. Asian J. Control 18(5), 1914–1922 (2016)

    Article  MathSciNet  Google Scholar 

  3. Meng, X., Chen, T.: Optimal sampling and performance comparison of periodic and event based impulse control. IEEE Trans. Autom. Control 57(12), 3252–3259 (2012)

    Article  MathSciNet  Google Scholar 

  4. Cybenko, G.: Dynamic load balancing for distributed memory multiprocessors. J. Parallel Distrib. Comput. 7(2), 279–301 (1989)

    Article  Google Scholar 

  5. Sun, J., Yang, Q., Liu, X., Chen, J.: Event-triggered consensus for linear continuous-time multi-agent systems based on a predictor. Inf. Sci

    Google Scholar 

  6. Jadbabaie, A., Lin, J., Morse, A.S.: Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Trans. Autom. Control 48(6), 988–1001 (2003)

    Article  MathSciNet  Google Scholar 

  7. Liu, Q., Wang, J.: A second-order multi-agent network for bound-constrained distributed optimization. IEEE Trans. Autom. Control 60(12), 3310–3315 (2015)

    Article  MathSciNet  Google Scholar 

  8. Ren, W., Beard, R.W., Atkins, E.M.: A survey of consensus problems in multi-agent coordination. In: Proceedings of the American Control Conference 2005. IEEE, pp. 1859–1864 (2005)

    Google Scholar 

  9. Lu, A.Y., Yang, G.H.: Distributed consensus control for multi-agent systems under denial-of-service. Inf. Sci. 439, 95–107 (2018)

    Article  MathSciNet  Google Scholar 

  10. Olfati-Saber, R., Fax, J.A., Murray, R.M.: Consensus and cooperation in networked multi-agent systems. Proc. IEEE 95(1), 215–233 (2007)

    Article  Google Scholar 

  11. Liu, K., Yao, Y., Balakrishnan, V., Ma, H.: Adaptive h8 control of piecewiselinear systems with parametric uncertainties and external disturbances. Asian J. Control 15(4), 1238–1245 (2013)

    Article  MathSciNet  Google Scholar 

  12. Wang, D., Zhang, N., Wang, J., Wang, W.: A pd-like protocol with a time delay to average consensus control for multi-agent systems under an arbitrarily fast switching topology. IEEE Trans. Cybern. 47(4), 898–907 (2017)

    Google Scholar 

  13. Oliva, G., Setola, R., Hadjicostis, C.N.: Distributed finite-time averageconsensus with limited computational and storage capability. IEEE Trans. Control Netw. Syst. 4(2), 380–391 (2017)

    Article  MathSciNet  Google Scholar 

  14. Li, H., Chen, G., Huang, T., Dong, Z., Zhu, W., Gao, L.: Event-triggered distributed average consensus over directed digital networks with limited communication bandwidth. IEEE Trans. Cybern. 46(12), 3098–3110 (2016)

    Article  Google Scholar 

  15. Li, W., Wei, G., Han, F., Liu, Y.: Weighted average consensus-based unscented kalman filtering. IEEE Trans. Cybern. 46(2), 558–567 (2016)

    Article  Google Scholar 

  16. Zhang, Y., Li, S.: Perturbing consensus for complexity: a finite-time discrete biased min-consensus under time-delay and asynchronism. Automatica 85, 441–447 (2017)

    Article  MathSciNet  Google Scholar 

  17. Giannini, S., Petitti, A., Paola, D.D., Rizzo, A.: Asynchronous max-consensus protocol with time delays: convergence results and applications. IEEE Trans. Circuits. Syst. I: Regul. Pap. 63(2), 256–264 (2016)

    Article  MathSciNet  Google Scholar 

  18. DeGroot, M.H.: Reaching a consensus. J. Am. Stat. Assoc. 69(345), 118–121 (1974)

    Article  Google Scholar 

  19. Lin, J., Morse, A.S., Anderson, B.D.: The multi-agent rendezvous problem. part 2: the asynchronous case. SIAM J. Control Optim. 46(6), 2120–2147 (2007)

    Article  MathSciNet  Google Scholar 

  20. Ny, J.L., Pappas, G.J.: Differentially private filtering. IEEE Trans. Autom. Control 59(2), 341–354 (2014)

    Article  MathSciNet  Google Scholar 

  21. Huang, Z., Mitra, S., Dullerud, G.: Differentially private iterative synchronous consensus. In: Proceedings of the 2012 ACM Workshop on Privacy in the Electronic Society. ACM, pp. 81–90 (2012)

    Google Scholar 

  22. Manitara, N.E., Hadjicostis, C.N.: Privacy-preserving asymptotic average consensus. In: 2013 European Control Conference (ECC), pp. 760–765. IEEE (2013)

    Google Scholar 

  23. Mo, Y., Murray, R.M.: Privacy preserving average consensus. IEEE Trans. Autom. Control 62(2), 753–765 (2017)

    Article  MathSciNet  Google Scholar 

  24. Duan, X., He, J., Cheng, P., Mo, Y., Chen, J.: Privacy preserving maximum consensus. In: 2015 IEEE 54th Annual Conference on Decision and Control (CDC), pp. 4517–4522. IEEE (2015)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nankun Mu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wang, A., Mu, N., Liao, X. (2018). Min-Max Consensus Algorithm for Multi-agent Systems Subject to Privacy-Preserving Problem. In: Cheng, L., Leung, A., Ozawa, S. (eds) Neural Information Processing. ICONIP 2018. Lecture Notes in Computer Science(), vol 11307. Springer, Cham. https://doi.org/10.1007/978-3-030-04239-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-04239-4_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-04238-7

  • Online ISBN: 978-3-030-04239-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics