Proceedings Article10.23919/CCC52363.2021.9549591
Predefined-Time Distributed Optimization Problem Subject to Equality Constraint of Second-Order Multi-Agent Systems
Shiling Li,Xiaohong Nian,Zhenhua Deng,Zhao Chen,Chongxin Lei +4 more
- 26 Jul 2021
- pp 1692-1697
3
TL;DR: In this article, a distributed predefined-time control law based on time-base generator technique is proposed to guarantee the convergence of the proposed algorithm by the properties of Laplace matrix and orthogonal matrix.
read more
Abstract: In this paper, we consider the predefined-time distributed optimization problem of second-order multi-agent systems under undirected and connected communication networks, in which, the optimization problem subject to the equality constraint. In order to make all agents converge to the optimal solution at predefined-time, we propose a distributed predefined-time control law based on time-base generator technique. Then we guarantee the convergence of the proposed algorithm by the properties of Laplace matrix and orthogonal matrix. Finally, we provide example to illustrate the effectiveness of the proposed distributed algorithm by choosing arbitrary initial values of states and arbitrary convergence time.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Multi-Objective Distributed Optimization via A Predefined-Time Multi-Agent Approach
Yang Liu,Zicong Xia,Weihua Gui +2 more
TL;DR: In this article , a time-base generator is derived and applied to the optimization approaches for achieving predefined-time optimization, and the multi-objective optimization problem is reformulated as a distributed optimization problem and thus solved in a private and safe manner.
33
Prescribed-time distributed optimization problem with constraints.
Hailong Li,Miaomiao Zhang,Zhongjie Yin,Qi Zhao,Jianxiang Xi,Yuanshi Zheng +5 more
TL;DR: By designing the appropriate objective functions, it is proved the multi-agent system can converge to the optimal solution within any prescribed-time, and the convergence time is fully independent of the initial conditions and system parameters.
2
Predefined-Time Adaptive Fuzzy Inverse Optimal Control for Uncertain Nonlinear Systems
Xinyi Lu,Fang Wang +1 more
1
References
•Book
Algebraic Graph Theory
Chris Godsil,Gordon F. Royle +1 more
- 01 Jan 2009
TL;DR: The Laplacian of a Graph and Cuts and Flows are compared to the Rank Polynomial.
Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication
TL;DR: The exponential convergence of the proposed algorithm under strongly connected and weight-balanced digraph topologies when the local costs are strongly convex with globally Lipschitz gradients is established, and an upper bound on the stepsize is provided that guarantees exponential convergence over connected graphs for implementations with periodic communication.
693
Distributed Optimization Based on a Multiagent System in the Presence of Communication Delays
TL;DR: First, the relationship between optimal solutions and the equilibrium points of the multiagent system with time delay is revealed and sufficient conditions in form of linear matrix inequality are derived for ascertaining convergence to optimal solutions, in the cases of slow-varying delay and fast-variesing delay.
280
Distributed optimal coordination for multiple heterogeneous Euler–Lagrangian systems☆
TL;DR: This paper proposes two different distributed protocols for the heterogeneous continuous-time EL agents to achieve the optimization task and proves the global convergence to the optimal coordination of the EL systems in the case with parametric uncertainties, and the global exponential convergence in the cases without parametric uncertainty.
271
Distributed multi-agent optimization subject to nonidentical constraints and communication delays
Peng Lin,Wei Ren,Yongduan Song +2 more
TL;DR: The distributed optimization problem for multi-agent systems subject to nonidentical constraints and communication delays under local communication can be solved by introducing additional delays to the subgradient projection algorithm and the communication delays can be arbitrarily bounded.
252