Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/163542
Title: Exponential convergence of distributed optimization for heterogeneous linear multi-agent systems over unbalanced digraphs
Authors: Li, Li
Yu, Yang
Li, Xiuxian
Xie, Lihua
Keywords: Engineering::Electrical and electronic engineering
Issue Date: 2022
Source: Li, L., Yu, Y., Li, X. & Xie, L. (2022). Exponential convergence of distributed optimization for heterogeneous linear multi-agent systems over unbalanced digraphs. Automatica, 141, 110259-. https://dx.doi.org/10.1016/j.automatica.2022.110259
Project: AcRF TIER 1-2019-T1-001-088 (RG72/19)
Journal: Automatica
Abstract: In this work we study a distributed optimal output consensus problem for heterogeneous linear multi-agent systems over unbalanced directed networks where the agents aim to reach consensus with the purpose of minimizing the sum of private smooth costs. Based on output feedback, a distributed continuous time control law is proposed by using the proportional–integral (PI) control technique. Under the assumption that the global cost function satisfies the restricted secant inequality condition, the designed controller can achieve convergence exponentially in an unbalanced and strongly connected network. Furthermore, to remove the requirement of continuous communications, a sampling-based event-triggered algorithm with a lower bound of the communication interval is provided, which also converges exponentially. Two simulation examples are given to verify the proposed control algorithms.
URI: https://hdl.handle.net/10356/163542
ISSN: 0005-1098
DOI: 10.1016/j.automatica.2022.110259
Rights: © 2022 Elsevier Ltd. All rights reserved.
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:EEE Journal Articles

SCOPUSTM   
Citations 50

1
Updated on Feb 1, 2023

Web of ScienceTM
Citations 50

1
Updated on Jan 28, 2023

Page view(s)

17
Updated on Feb 4, 2023

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.