Prescribed‐Time Distributed Optimization With Set Constraints Based on Time‐Domain Transformation

ABSTRACT This paper delves into the prescribed‐time distributed optimization problem for multi‐agent systems (MASs), considering set constraints. First, we transform the challenging optimization problem from the prescribed‐time ‐domain into the asymptotic time ‐domain through a time‐domain transformation (TDT) technique. This strategic shift substantially mitigates the analytical complexities inherent in the original formulation. Second, we develop a novel class of TDT‐based optimization algorithms, utilizing gradient projection and Lagrange multipliers. This algorithm is tailored to efficiently tackle the distributed optimization problem while adhering to the set constraints. To further alleviate the computational and communication overheads, we introduce a corresponding TDT‐based event‐triggered optimization algorithm. Moreover, a rigorous analysis of both the optimal solution to the optimization problem and the system's stability is given by using optimization theory and Lyapunov stability theory. This comprehensive analysis provides valuable insights into the behavior and performance of our proposed approach. Finally, two numerical simulation results are presented to demonstrate the feasibility as well as effectiveness of the offered distributed control arrangement.

Authors

Institutions

Publication Details

Journal
International Journal of Robust and Nonlinear Control
Published
2024-11-19
DOI
https://doi.org/10.1002/rnc.7730
Primary Topic
Distributed Control Multi-Agent Systems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Prescribed‐Time Distributed Optimization With Set Constraints Based on Time‐Domain Transformation

Haijun Jiang, Zhiyong Yu, Chunxia Zhu
International Journal of Robust and Nonlinear Control
Distributed Control Multi-Agent Systems
article

Prescribed‐Time Distributed Optimization With Set Constraints Based on Time‐Domain Transformation

Haijun Jiang, Zhiyong Yu, Chunxia Zhu
article en

Abstract

ABSTRACT This paper delves into the prescribed‐time distributed optimization problem for multi‐agent systems (MASs), considering set constraints. First, we transform the challenging optimization problem from the prescribed‐time ‐domain into the asymptotic time ‐domain through a time‐domain transformation (TDT) technique. This strategic shift substantially mitigates the analytical complexities inherent in the original formulation. Second, we develop a novel class of TDT‐based optimization algorithms, utilizing gradient projection and Lagrange multipliers. This algorithm is tailored to efficiently tackle the distributed optimization problem while adhering to the set constraints. To further alleviate the computational and communication overheads, we introduce a corresponding TDT‐based event‐triggered optimization algorithm. Moreover, a rigorous analysis of both the optimal solution to the optimization problem and the system's stability is given by using optimization theory and Lyapunov stability theory. This comprehensive analysis provides valuable insights into the behavior and performance of our proposed approach. Finally, two numerical simulation results are presented to demonstrate the feasibility as well as effectiveness of the offered distributed control arrangement.

International Journal of Robust and Nonlinear Control
Yili Normal University (CN), Xinjiang University (CN)
Natural Science Foundation of Xinjiang Province, National Natural Science Foundation of China
Openalex Percentile: Top 76%
Distributed Control Multi-Agent Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.