Distributed Predefined-Time Optimal Control Algorithm for Nonconvex Optimization of MASs

This paper delves into a class of distributed nonconvex optimization control (DNOC) problems for multiagent systems (MASs), aiming to attain consensus among agents while minimizing the collective sum of local cost functions, referred to as the global cost function, through local information exchange. To accomplish this objective, it is introduced a novel distributed predefined-time optimal (DPTO) control algorithm. We prove that the proposed DPTO control algorithm guides the system states towards convergence to the global optimal solution within a user-defined time frame, provided that the global cost function satisfies the Polyak-Lojasiewicz condition, which is less stringent than the standard strong convexity condition. Finally, theoretical findings are substantiated through simulation studies.

Authors

Institutions

Publication Details

Published
2024-12-12
DOI
https://doi.org/10.1109/icarcv63323.2024.10821666
Primary Topic
Optimization and Variational Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Distributed Predefined-Time Optimal Control Algorithm for Nonconvex Optimization of MASs

Tao Yang, Guanghui Wen, Jing‐Zhe Xu, Dandan Hu et al.
Optimization and Variational Analysis
article

Distributed Predefined-Time Optimal Control Algorithm for Nonconvex Optimization of MASs

Tao Yang, Guanghui Wen, Jing‐Zhe Xu, Dandan Hu, Zhi‐Wei Liu, Xiaokang Liu
article en

Abstract

This paper delves into a class of distributed nonconvex optimization control (DNOC) problems for multiagent systems (MASs), aiming to attain consensus among agents while minimizing the collective sum of local cost functions, referred to as the global cost function, through local information exchange. To accomplish this objective, it is introduced a novel distributed predefined-time optimal (DPTO) control algorithm. We prove that the proposed DPTO control algorithm guides the system states towards convergence to the global optimal solution within a user-defined time frame, provided that the global cost function satisfies the Polyak-Lojasiewicz condition, which is less stringent than the standard strong convexity condition. Finally, theoretical findings are substantiated through simulation studies.

Minzu University of China (CN), State Key Laboratory of Synthetical Automation for Process Industries, Huazhong University of Science and Technology (CN), Southeast University (CN), Northeastern University (CN)
Openalex Percentile: Top 70%
Optimization and Variational Analysis
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.