.png){kind=icon}
.png){kind=icon}
Return
A Continuous-Time Algorithm for Distributed Optimization With Nonuniform Time-Delay Under Switching and Unbalanced Digraphs
.png){kind=icon}
PRE
AI
DOI：10.1109/TSIPN.2024.3485549.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper studies the distributed optimization of continuous-time multi-agent systems with time-delay under switching digraphs. An auxiliary system which only requires the information of the number of adjacent agents is first constructed, then a class of new distributed optimization algorithms are proposed. As an application, we extend above algorithms to address distributed economic dispatch issues for smart grids. It is theoretically shown that the new illustrated distributed control strategies can asymptotically realize optimal consensus for multi-agent systems and optimal economic dispatch for smart grids, where the communication time-delay can be nonuniform, and the switching digraphs are uniformly jointly strongly connected. Finally, two simulation examples are provided to validate theoretical results.
Keywords:
Optimization
Switches
Smart grids
Delays
Vectors
Costs
Communication channels
Laplace equations
Information processing
Optimization methods
Distributed optimization
multi-agent systems
nonuniform time-delay
switching digraphs
Journal
IF:
4.9
Papers:
726
Citations:
1.9K