A New Continuous-Time Algorithm for Calculating Algebraic Connectivity of Multi-Agent Networks

2014 ◽  
Vol 1 ◽  
pp. 45-48
Author(s):  
Tatsuya Fukami ◽  
Norikazu Takahashi
Keyword(s):  
Continuous Time ◽  
Time Algorithm ◽  
Algebraic Connectivity ◽  
Multi Agent ◽  
Agent Networks

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.

scholarly journals On Leader-Following Consensus in Multi-Agent Systems with Discrete Updates at Random Times

Entropy ◽  
2020 ◽  
Vol 22 (6) ◽  
pp. 650
Author(s):  
Ricardo Almeida ◽  
Ewa Girejko ◽  
Snezhana Hristova ◽  
Agnieszka Malinowska
Keyword(s):  
Continuous Time ◽  
Sufficient Conditions ◽  
Control Law ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Leader Following ◽  
Multi Agent ◽  
Agent Networks ◽  
Random Times ◽  
Theoretical Results

This paper studies the leader-following consensus problem in continuous-time multi-agent networks with communications/updates occurring only at random times. The time between two consecutive controller updates is exponentially distributed. Some sufficient conditions are derived to design the control law that ensures the leader-following consensus is asymptotically reached (in the sense of the expected value of a stochastic process). The numerical examples are worked out to demonstrate the effectiveness of our theoretical results.

Sign in / Sign up

Export Citation Format

Share Document