Distributed Fixed/Preassigned-Time Optimization Based on Piecewise Power-Law Design

The problem of fixed-time (FXT) and preassigned-time (PAT) optimization is concerned in this article based on multiagent systems (MASs) and power-law algorithms. Under the framework of strong convexity of the cost functions, two types of piecewise algorithms are proposed, which ensure that the FXT o...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on cybernetics 2023-07, Vol.53 (7), p.4320-4333
Hauptverfasser: Ma, Lanlan, Hu, Cheng, Yu, Juan, Wang, Leimin, Jiang, Haijun
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The problem of fixed-time (FXT) and preassigned-time (PAT) optimization is concerned in this article based on multiagent systems (MASs) and power-law algorithms. Under the framework of strong convexity of the cost functions, two types of piecewise algorithms are proposed, which ensure that the FXT optimization can be solved either by first achieving the FXT consensus or by first achieving local optimization. Correspondingly, the PAT optimization problem is also considered by designing several piecewise protocols, where the finished time of optimization can be arbitrary prescribed according to actual demands. Furthermore, these piecewise power-law algorithms on the weighted undirected graphs are generalized to the weighted digraphs. Finally, by providing two numerical examples, the presented algorithms are further verified.
ISSN:2168-2267
2168-2275
DOI:10.1109/TCYB.2022.3163623