A power reformulation continuous-time algorithm for nonconvex distributed constrained optimization over multi-agent systems

2021 ◽  
Author(s):  
Na Liu ◽  
Shijie Zhao ◽  
Sitian Qin
Keyword(s):  
Constrained Optimization ◽  
Continuous Time ◽  
Time Algorithm ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Multi Agent

scholarly journals A projection-based continuous-time algorithm for distributed optimization over multi-agent systems

2021 ◽  
Author(s):  
Xingnan Wen ◽  
Sitian Qin
Keyword(s):  
Continuous Time ◽  
Optimization Problem ◽  
Distributed Optimization ◽  
Optimal Solution ◽  
Fixed Time ◽  
Time Algorithm ◽  
State Variables ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Multi Agent

AbstractMulti-agent systems are widely studied due to its ability of solving complex tasks in many fields, especially in deep reinforcement learning. Recently, distributed optimization problem over multi-agent systems has drawn much attention because of its extensive applications. This paper presents a projection-based continuous-time algorithm for solving convex distributed optimization problem with equality and inequality constraints over multi-agent systems. The distinguishing feature of such problem lies in the fact that each agent with private local cost function and constraints can only communicate with its neighbors. All agents aim to cooperatively optimize a sum of local cost functions. By the aid of penalty method, the states of the proposed algorithm will enter equality constraint set in fixed time and ultimately converge to an optimal solution to the objective problem. In contrast to some existed approaches, the continuous-time algorithm has fewer state variables and the testification of the consensus is also involved in the proof of convergence. Ultimately, two simulations are given to show the viability of the algorithm.

Consensus Problem of Singular Multi-Agent Systems with Continuous-Time and Fixed Topology

2013 ◽  
Vol 278-280 ◽  
pp. 1687-1691
Author(s):  
Tong Qiang Jiang ◽  
Jia Wei He ◽  
Yan Ping Gao
Keyword(s):  
Continuous Time ◽  
Spanning Tree ◽  
Undirected Graph ◽  
Necessary Condition ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Multi Agent ◽  
Fixed Topology ◽  
The Stability ◽  
Sufficient And Necessary Condition

The consensus problems of two situations for singular multi-agent systems with fixed topology are discussed: directed graph without spanning tree and the disconnected undirected graph. A sufficient and necessary condition is obtained by applying the stability theory and the system is reachable asymptotically. But for normal systems, this can’t occur in upper two situations. Finally a simulation example is provided to verify the effectiveness of our theoretical result.

Sign in / Sign up

Export Citation Format

Share Document