TY - JOUR
T1 - Fixed-time consensus for multi-agent systems with objective optimization on directed detail-balanced networks
AU - Yu, Zhiyong
AU - Sun, Jian
AU - Yu, Shuzhen
AU - Jiang, Haijun
N1 - Publisher Copyright:
© 2022
PY - 2022/8
Y1 - 2022/8
N2 - This paper investigates the distributed control of multi-agent systems (MASs) with objective optimization on directed detail-balanced networks, in which the global optimization function is expressed as a convex combination of local objectives of agents. First, a directed and detail-balanced network depending on the weights of an optimization function is constructed, and a distributed consensus protocol with gradients of local objectives is proposed over the designed network. Using Lyapunov stability theory and a projection technique, we prove that the proposed protocol not only makes all agents achieve consensus in a fixed-time interval but can also solve the global optimization problem asymptotically. Moreover, the optimization problem with box constraints is studied, and a δ-exact penalty method is employed to eliminate the constraints. Similarly, a distributed fixed-time consensus protocol with gradient measurement is developed, and we prove that the optimal solution can be reached asymptotically. Finally, two examples are presented to show the efficacy of the theoretical results.
AB - This paper investigates the distributed control of multi-agent systems (MASs) with objective optimization on directed detail-balanced networks, in which the global optimization function is expressed as a convex combination of local objectives of agents. First, a directed and detail-balanced network depending on the weights of an optimization function is constructed, and a distributed consensus protocol with gradients of local objectives is proposed over the designed network. Using Lyapunov stability theory and a projection technique, we prove that the proposed protocol not only makes all agents achieve consensus in a fixed-time interval but can also solve the global optimization problem asymptotically. Moreover, the optimization problem with box constraints is studied, and a δ-exact penalty method is employed to eliminate the constraints. Similarly, a distributed fixed-time consensus protocol with gradient measurement is developed, and we prove that the optimal solution can be reached asymptotically. Finally, two examples are presented to show the efficacy of the theoretical results.
KW - Detail-balanced networks
KW - Fixed-time consensus
KW - Multi-agent systems
KW - Objective optimization
UR - http://www.scopus.com/inward/record.url?scp=85133345024&partnerID=8YFLogxK
U2 - 10.1016/j.ins.2022.06.077
DO - 10.1016/j.ins.2022.06.077
M3 - Article
AN - SCOPUS:85133345024
SN - 0020-0255
VL - 607
SP - 1583
EP - 1599
JO - Information Sciences
JF - Information Sciences
ER -