Singularity-Free Prescribed-Time Distributed Optimization for Nonlinear Multi-Agent Systems with Time-Varying Cost Functions

This paper proposes a singularity-free prescribed-time distributed optimization algorithm for nonlinear multi-agent systems with time-varying cost functions and dynamic communication topologies. The proposed algorithm avoids singularity, and it does not require the local cost functions to have identical Hessian matrices. First, a novel time-varying scaling function based on time-space deformation theory is designed to address the singularity issue in the proposed distributed optimization algorithm. Second, a distributed prescribed-time optimization estimator by introducing an intermediate driving variable to counteract the inconsistency disturbances is designed to track the average of the global gradients, global Hessian matrices, and the global partial derivatives of gradients, respectively. Furthermore, under this estimator, all local cost functions need not have identical Hessians. Third, refined theoretical analysis demonstrates that our algorithm converges to the globally optimal trajectory. Meanwhile it is also shown to avoid the singularity problem and achieve prescribed-time estimation. Finally, a UAV formation experiment verifies the effectiveness of our proposed algorithm, including its singularity-free property, prescribed-time convergence, and optimality.

Authors

Institutions

Publication Details

Journal
Journal of Machine Learning and Information Security
Published
2026-03-27
DOI
https://doi.org/10.53941/jmlis.2026.100006
Primary Topic
Distributed Control Multi-Agent Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Singularity-Free Prescribed-Time Distributed Optimization for Nonlinear Multi-Agent Systems with Time-Varying Cost Functions

Yihan Yang, Huan Wang, Aijuan Wang, Tao Dong et al.
Journal of Machine Learning and Information Security
Distributed Control Multi-Agent Systems
article

Singularity-Free Prescribed-Time Distributed Optimization for Nonlinear Multi-Agent Systems with Time-Varying Cost Functions

Yihan Yang, Huan Wang, Aijuan Wang, Tao Dong, Tiancheng Liu
article en

Abstract

This paper proposes a singularity-free prescribed-time distributed optimization algorithm for nonlinear multi-agent systems with time-varying cost functions and dynamic communication topologies. The proposed algorithm avoids singularity, and it does not require the local cost functions to have identical Hessian matrices. First, a novel time-varying scaling function based on time-space deformation theory is designed to address the singularity issue in the proposed distributed optimization algorithm. Second, a distributed prescribed-time optimization estimator by introducing an intermediate driving variable to counteract the inconsistency disturbances is designed to track the average of the global gradients, global Hessian matrices, and the global partial derivatives of gradients, respectively. Furthermore, under this estimator, all local cost functions need not have identical Hessians. Third, refined theoretical analysis demonstrates that our algorithm converges to the globally optimal trajectory. Meanwhile it is also shown to avoid the singularity problem and achieve prescribed-time estimation. Finally, a UAV formation experiment verifies the effectiveness of our proposed algorithm, including its singularity-free property, prescribed-time convergence, and optimality.

Journal of Machine Learning and Information SecurityVol. 2(1)
Southwest University (CN), Chongqing University of Technology (CN)
Openalex Percentile: Top 7%
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.