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

Zhixuan Su; Yongfang Liu; Chengxin Xian; Yu Zhao

doi:10.1109/YAC53711.2021.9486469

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

Zhixuan Su
, Yongfang Liu
, Chengxin Xian
, Yu Zhao

School of Automation

Northwestern Polytechnical University Xian

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Proceedings - 2021 36th Youth Academic Annual Conference of Chinese Association of Automation, YAC 2021
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	156-161
Number of pages	6
ISBN (Electronic)	9781665437127
DOIs	https://doi.org/10.1109/YAC53711.2021.9486469
State	Published - 28 May 2021
Event	36th Youth Academic Annual Conference of Chinese Association of Automation, YAC 2021 - Nanchang, China Duration: 28 May 2021 → 30 May 2021

Publication series

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

Conference

Conference	36th Youth Academic Annual Conference of Chinese Association of Automation, YAC 2021
Country/Territory	China
City	Nanchang
Period	28/05/21 → 30/05/21

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 10 Reduced Inequalities

Keywords

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

Access to Document

10.1109/YAC53711.2021.9486469

Cite this

Su, Z., Liu, Y., Xian, C., & Zhao, Y. (2021). Pre-specified-Time coordination algorithm for convex optimization problems over weight-unbalanced networks. In Proceedings - 2021 36th Youth Academic Annual Conference of Chinese Association of Automation, YAC 2021 (pp. 156-161). Article 9486469 (Proceedings - 2021 36th Youth Academic Annual Conference of Chinese Association of Automation, YAC 2021). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/YAC53711.2021.9486469

Su, Zhixuan ; Liu, Yongfang ; Xian, Chengxin et al. / Pre-specified-Time coordination algorithm for convex optimization problems over weight-unbalanced networks. Proceedings - 2021 36th Youth Academic Annual Conference of Chinese Association of Automation, YAC 2021. Institute of Electrical and Electronics Engineers Inc., 2021. pp. 156-161 (Proceedings - 2021 36th Youth Academic Annual Conference of Chinese Association of Automation, YAC 2021).

@inproceedings{e4072729279e40598e76ee711a87079a,

title = "Pre-specified-Time coordination algorithm for convex optimization problems over weight-unbalanced networks",

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.",

keywords = "convex optimization, economic dispatch problem, specified-Time control, weight-unbanlanced network",

author = "Zhixuan Su and Yongfang Liu and Chengxin Xian and Yu Zhao",

note = "Publisher Copyright: {\textcopyright} 2021 IEEE.; 36th Youth Academic Annual Conference of Chinese Association of Automation, YAC 2021 ; Conference date: 28-05-2021 Through 30-05-2021",

year = "2021",

month = may,

day = "28",

doi = "10.1109/YAC53711.2021.9486469",

language = "英语",

series = "Proceedings - 2021 36th Youth Academic Annual Conference of Chinese Association of Automation, YAC 2021",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "156--161",

booktitle = "Proceedings - 2021 36th Youth Academic Annual Conference of Chinese Association of Automation, YAC 2021",

}

Su, Z, Liu, Y, Xian, C & Zhao, Y 2021, Pre-specified-Time coordination algorithm for convex optimization problems over weight-unbalanced networks. in Proceedings - 2021 36th Youth Academic Annual Conference of Chinese Association of Automation, YAC 2021., 9486469, Proceedings - 2021 36th Youth Academic Annual Conference of Chinese Association of Automation, YAC 2021, Institute of Electrical and Electronics Engineers Inc., pp. 156-161, 36th Youth Academic Annual Conference of Chinese Association of Automation, YAC 2021, Nanchang, China, 28/05/21. https://doi.org/10.1109/YAC53711.2021.9486469

Pre-specified-Time coordination algorithm for convex optimization problems over weight-unbalanced networks. / Su, Zhixuan; Liu, Yongfang; Xian, Chengxin et al.
Proceedings - 2021 36th Youth Academic Annual Conference of Chinese Association of Automation, YAC 2021. Institute of Electrical and Electronics Engineers Inc., 2021. p. 156-161 9486469 (Proceedings - 2021 36th Youth Academic Annual Conference of Chinese Association of Automation, YAC 2021).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Su, Zhixuan

AU - Liu, Yongfang

AU - Xian, Chengxin

AU - Zhao, Yu

PY - 2021/5/28

Y1 - 2021/5/28

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

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

KW - convex optimization

KW - economic dispatch problem

KW - specified-Time control

KW - weight-unbanlanced network

UR - https://www.scopus.com/pages/publications/85112049417

U2 - 10.1109/YAC53711.2021.9486469

DO - 10.1109/YAC53711.2021.9486469

M3 - 会议稿件

AN - SCOPUS:85112049417

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

SP - 156

EP - 161

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

PB - Institute of Electrical and Electronics Engineers Inc.

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

Y2 - 28 May 2021 through 30 May 2021

ER -

Su Z, Liu Y, Xian C, Zhao Y. Pre-specified-Time coordination algorithm for convex optimization problems over weight-unbalanced networks. In Proceedings - 2021 36th Youth Academic Annual Conference of Chinese Association of Automation, YAC 2021. Institute of Electrical and Electronics Engineers Inc. 2021. p. 156-161. 9486469. (Proceedings - 2021 36th Youth Academic Annual Conference of Chinese Association of Automation, YAC 2021). doi: 10.1109/YAC53711.2021.9486469

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

Abstract

Publication series

Conference

UN SDGs

Keywords

Access to Document

Other files and links

Fingerprint

Cite this