Pre-specified-Time coordination algorithm for convex optimization problems over weight-unbalanced networks

Zhixuan Su, Yongfang Liu, Chengxin Xian, Yu Zhao

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

This paper investigates a group of convex optimization problems for swarm systems with directed and weight-unbalanced topologies, such as the economic dispatch problems with equality constraints. By using the multi-step planning method, a new pre-specified-Time coordination algorithm is proposed to seek the optimal value of global objective function in a distributed manner. Here, the specified time represents the moment when convex optimization problem gets solution, which can be appointed in advance without additional fuzzy estimation. In addition, the convergence time of the proposed algorithm is calculated precisely with the aid of Kronecker matrix algebra and Lyapunov stability theory. Finally, some simulations are shown to demonstrate the usefulness and superiority of the new designed optimization algorithms.

Original languageEnglish
Title of host publicationProceedings - 2021 36th Youth Academic Annual Conference of Chinese Association of Automation, YAC 2021
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages156-161
Number of pages6
ISBN (Electronic)9781665437127
DOIs
StatePublished - 28 May 2021
Event36th Youth Academic Annual Conference of Chinese Association of Automation, YAC 2021 - Nanchang, China
Duration: 28 May 202130 May 2021

Publication series

NameProceedings - 2021 36th Youth Academic Annual Conference of Chinese Association of Automation, YAC 2021

Conference

Conference36th Youth Academic Annual Conference of Chinese Association of Automation, YAC 2021
Country/TerritoryChina
CityNanchang
Period28/05/2130/05/21

Keywords

  • convex optimization
  • economic dispatch problem
  • specified-Time control
  • weight-unbanlanced network

Fingerprint

Dive into the research topics of 'Pre-specified-Time coordination algorithm for convex optimization problems over weight-unbalanced networks'. Together they form a unique fingerprint.

Cite this