Distributed Prescribed-Time Optimization with Time-Varying Cost: Zero-Gradient-Sum Scheme

This paper proposes a zero-gradient-sum-based time-varying distributed prescribed-time optimization algorithm for single integrator dynamics. The algorithm introduces a prescribed-time sliding mode term aimed at attaining zero-gradient-sum, alongside a sliding-mode controller designed to ensure consensus among agents' states within a prescribed-time limit. Notably, the algorithm eliminates the need for initial condition constraints and local minimization. The criteria for achieving consensus and optimizing multi-agent systems are derived from optimization theory and Lyapunov stability theory. Finally, the superior convergence efficiency of the algorithm is verified through a power-sharing case study.

Authors

Institutions

Publication Details

Published
2024-12-12
DOI
https://doi.org/10.1109/icarcv63323.2024.10821593
Primary Topic
Advanced Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00

Funders

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

Distributed Prescribed-Time Optimization with Time-Varying Cost: Zero-Gradient-Sum Scheme

Xiaowen Wang, Shuai Liu, Yuan Liu, Ning Mao
Advanced Optimization Algorithms Research
article

Distributed Prescribed-Time Optimization with Time-Varying Cost: Zero-Gradient-Sum Scheme

Xiaowen Wang, Shuai Liu, Yuan Liu, Ning Mao
article en

Abstract

This paper proposes a zero-gradient-sum-based time-varying distributed prescribed-time optimization algorithm for single integrator dynamics. The algorithm introduces a prescribed-time sliding mode term aimed at attaining zero-gradient-sum, alongside a sliding-mode controller designed to ensure consensus among agents' states within a prescribed-time limit. Notably, the algorithm eliminates the need for initial condition constraints and local minimization. The criteria for achieving consensus and optimizing multi-agent systems are derived from optimization theory and Lyapunov stability theory. Finally, the superior convergence efficiency of the algorithm is verified through a power-sharing case study.

Shandong University (CN), China University of Petroleum, East China (CN)
National Natural Science Foundation of China, Natural Science Foundation of Shandong Province
Openalex Percentile: Top 61%
Advanced Optimization Algorithms Research
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.