[go: up one dir, main page]

Skip to main content

Distributed Optimization for Time-Varying Multi-agent Networks Under Partial Information: A Game Theoretic Approach

  • Conference paper
  • First Online:
Proceedings of 2024 Chinese Intelligent Systems Conference (CISC 2024)

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 1285))

Included in the following conference series:

  • 346 Accesses

Abstract

In this paper, the distributed optimization problem of time-varying multi-agent networks is investigated by using game approaches. First, a game model is used to describe the distributed optimization problem. Then, the optimization objective can be achieved at the corresponding equilibrium of the game. This design method has the advantage of robustness to many uncertain factors; Even if the communication is delayed and asynchronous, the resulting equilibrium can solve the distributed optimization problem. Furthermore, a discrete-time distributed algorithm, called the utility-based distributed projection subgradient (UDPS) algorithm, which guarantees convergence, is devised to search the Nash equilibrium (NE) of the formulated game. Finally, numerical simulations prove the previous conclusions.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 249.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 299.99
Price excludes VAT (USA)
  • Durable hardcover 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

Similar content being viewed by others

References

  1. Molzahn, D.K., Dorfler, F., Sandberg, H., Low, S.H., Chakrabarti, S., Baldick, R., Lavaei, J.: A survey of distributed optimization and control algorithms for Electric Power Systems. IEEE Trans. Smart Grid 8(6), 2941–2962 (2017)

    Article  Google Scholar 

  2. Boyd, S.: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers (2010)

    Google Scholar 

  3. Lin, P., Ren, W., Song, Y.: Distributed multi-agent optimization subject to nonidentical constraints and communication delays. Automatica 65, 120–131 (2016)

    Article  MathSciNet  Google Scholar 

  4. Pu, S., Shi, W., Xu, J., Nedic, A.: Push-pull gradient methods for distributed optimization in networks. IEEE Trans. Autom. Control 66(1), 1–16 (2021)

    Article  MathSciNet  Google Scholar 

  5. Nedić, A., Ozdaglar, A.: Distributed optimization over time-varying directed graphs. IEEE Trans. Autom. Control 60(3), 601–615 (2015)

    Article  MathSciNet  Google Scholar 

  6. Yu, W., Liu, H., Zheng, W.X., Zhu, Y.: Distributed discrete-time convex optimization with nonidentical local constraints over time-varying unbalanced directed graphs. Automatica 134, 109899 (2021)

    Article  MathSciNet  Google Scholar 

  7. Abouheaf, M.I., Lewis, F.L., Vamvoudakis, K.G., Haesaert, S., Babuska, R.: Multi-agent discrete-time graphical games and Reinforcement Learning Solutions. Automatica 50(12), 3038–3053 (2014)

    Article  MathSciNet  Google Scholar 

  8. Li, N., Marden, J.R.: Designing games for distributed optimization. IEEE Conference on Decision and Control and European Control Conference (2011)

    Google Scholar 

  9. Gadjov, D., Pavel, L.: A passivity-based approach to Nash equilibrium seeking over networks. IEEE Trans. Autom. Control 64(3), 1077–1092 (2019)

    Article  MathSciNet  Google Scholar 

  10. Bianchi, M., Grammatico, S.: Fully distributed Nash equilibrium seeking over time-varying communication networks with linear convergence rate. IEEE Control Syst. Lett. 5(2), 499–504 (2021)

    Article  MathSciNet  Google Scholar 

  11. Zhang, J., Zhao, G., Qi, D.: Distributed optimization and state based ordinal potential games. In: Intelligent Computing for Sustainable Energy and Environment, pp. 113–121 (2013)

    Google Scholar 

  12. Young, H.: Peyton. Oxford University Press, Strategic Learning and Its Limits (2011)

    Google Scholar 

  13. 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 

  14. Bianchi, M., Grammatico, S.: A continuous-time distributed generalized Nash equilibrium seeking algorithm over networks for double-integrator agents. In: European Control Conference (ECC), pp. 1474–1479 (2020)

    Google Scholar 

Download references

Acknowledgements

This work was supported by the National Natural Science Foundation of China(Grant No. 62103203).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fuyong Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wang, C., Wang, F., Chen, Z. (2024). Distributed Optimization for Time-Varying Multi-agent Networks Under Partial Information: A Game Theoretic Approach. In: Jia, Y., Zhang, W., Fu, Y., Yang, H. (eds) Proceedings of 2024 Chinese Intelligent Systems Conference. CISC 2024. Lecture Notes in Electrical Engineering, vol 1285. Springer, Singapore. https://doi.org/10.1007/978-981-97-8658-9_56

Download citation

Publish with us

Policies and ethics