PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
March 28, 2026Journal of Machine Learning and Information Security0 citationsOpen Access

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

TDTao DongHWHuan WangYYYihan Yang

Key Points

  • The study aims to develop a distributed optimization algorithm for nonlinear multi-agent systems while addressing singularity issues.
  • Developed a time-varying scaling function to prevent singularity.
  • Introduced an intermediate driving variable to manage inconsistent disturbances.
  • Designed an estimator to track global gradients, Hessians, and partial derivatives of gradients.
  • The proposed algorithm converges to the globally optimal trajectory.
  • Successfully avoids singularity problems during optimization.
  • Demonstrated prescribed-time convergence and optimality in a UAV formation experiment.

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.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Dong et al. (2026) studied this question.

synapsesocial.com/papers/69c771198bbfbc51511e0f78https://doi.org/10.53941/jmlis.2026.100006
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Distributed Adaptive Time-Varying Optimization with Global Asymptotic Convergence2024
  2. 2Time‐varying distributed optimization algorithms with nonuniform gradient gain2026
  3. 3Velocity-Free Distributed Optimization Algorithms for Second-Order Multiagent Systems2024 · 7 citations
  4. 4Distributed finite-time optimization algorithms of higher-order multiagent systems with uncertain nonlinearities2024 · 1 citations
  5. 5Distributed Cooperative Optimization Control for Nonlinear Multi‐Agent Systems With Event‐Triggered Communication2026