Stream Project
Stream Project
Date- 20.11.2024
Acknowledgement
I would like to express my heartfelt
gratitude to Dr. Santwana
Mukhopadhyay Ma’am for her invaluable
guidance, timely feedback, and
unwavering support throughout the
course of this project. Her insights,
coupled with the research papers and
relevant materials she provided, have
been instrumental in shaping the
direction of this work. It is my privilege to
have her guidance as I continue this
journey toward completing the project.
INTRODUCTION
Multi-agent systems are systems that
consist of multiple interacting intelligent
agents that operate in a shared
environment to achieve collective goals.
They are advantageous over single agent
systems for the following reasons- (1)
lowering task costs; (2) implementing
parallel processing; (3) achieving stability
and reducing error; (4) being scalable;
and, (6) distributed decision making.
Achieving consensus in Multi-agent
systems is a topic of great interest.
NON LINEAR DYNAMICAL SYSTEMS
A mathematical model of a
system’s evolution across time is
called a dynamical system. It is Multiple equilibrium points
composed of a number of variables
that indicate the system’s current
state and a collection of rules, or Limit cycles and oscillations
equations, that control how these
variables change between states.
Non-linearity in dynamical systems Bifurcations
can arise from various sources,
such as non-linear terms in the
governing equations, non-linear Chaos and sensitivity to conditions
interactions between system
components, or external forcing
functions.
NON LINEAR DYNAMICAL SYSTEMS
The following set of coupled first-order differential equations can be used to
model a general non-linear system.
Directed
topology
Undirected
topology
CONCENSUS
Consensus refers to the process by Sampled-Data
which agents in a multi-agent Consensus
system reach an agreement on Quantized
certain shared quantities or states Consensus
through iterative information
Consensus in
exchange and updates. One of the
Random Networks
widely studied consensus
protocols is the linear consensus Scaled
protocol, where each agent Consensus
updates its state based on a linear Leader-Follower
combination of its own state and
Consensus
the states of its neighbors:
Finite-Time
Consensus
Bipartite
Consensus
FIXED TIME CONCENSUS
Fixed-time (FxT) consensus is the
concept of all agents reaching a
common value within a finite time
interval regardless of initial
conditions. The conditions of
every agent in a multi-agent
system that require them to reach
a common value by utilizing
communication with neighboring
agents within a finite amount of
time is known as the finite time
consensus problem.
LYAPUNOV’S DIRECT METHOD OF STABILITY
Lyapunov’s Direct Method is a powerful tool used in stability analysis of dynamical systems. As this method
provides stability information directly, without the need to solve the differential equations, we call it as the
”Lyapunov direct method”. The core of this approach revolves around the construction of a scalar function
denoted as W and its derivative W’. If certain properties are satisfied by W and its derivative W’ , then
several conclusions about the stability behaviour of the system can be drawn.
Consider the differential Equation:
(1)
. Assume that f(t, 0) = 0 for all t, then the following theorem holds true.:
(1)
LEADERLESS FIXED TIME CONSENSUS
(LLFXTC) OF MULTI AGENT SYSTEMS
Graph Theoritic Model
The communication between agents in a multi-agent system can be represented in the form of
a directed weighted graph G = (V, E, A), where V = {ν1, ν2, ν3...νN } denotes the set of
nodes in the graph, E ⊆ V × V is the set of edges representing the information of interaction
between agents, and A = [aij ] ∈ is the weighted adjacency matrix representing the edge
weights in the graph. . A directed edge ϵij ∈ E represents that there is a transmission of
information from the i th agent to the j th agent where the matrix entry aij represents the
weight of the edge eij .
Laplacian Matrix is defined as D-A, where D is the degree matrix. The second smallest
eigenvalue of the Laplacian matrix L, is denoted by (L) and is called the algebraic
connectivity.
Graph Theoritic Model (contd)
Following are some essential properties of the Laplacian of a graph.
Proof
MODEL DESCRIPTION
Consider a multi agent system consisting of N agents having the following general
nonlinear impulsive systems:
This is a function that describes
the continuous dynamics of the
system.It governs the behavior of
the system when there are no
impulsive changes.
(2)
This denotes the change in
This denotes the state of the state Z(t) at impulsive
the system at initial time times. The function G
depends on the state Z(t) and
the time t at these instances.
,
MODEL DESCRIPTION OF MAS
The origin of the system (2) is said to be globally Finite time stable (FTS) if it is
globally Lyapunov stable and there exists a function T: R n\0 → (0, ∞), such that
X(t, ) = 0 for all t ≥ T( , ). The function T is called the settling-time function.
The inequality ensures that even though impulses may not occur exactly at regular
intervals, their number within any given time period (t,T) is predictable within certain
limits.
[18] - References
W belongs to the class φ, which typically includes functions that are continuous,
positive definite, and locally Lipschitz
Conditions for Global Finite-Time Stability
It can be noted that the choice of the average impulsive interval τa > 0 and the positive
integer No have a strong influence on the stability dynamics, and these numbers might be
difficult to determine. So to overcome this constraint, the impulsive interval is bounded,
i.e., θ2 ≤ (tk+1 − tk) ≤ θ1, where θ1, θ2 are positive constants and measure T using θ1, θ2
Settling-Time Bound
An adaptation to the more practical scenario where impulses occur within bounded
intervals. The piecewise definition provides a more detailed and controlled description of
how the Lyapunov function W should behave to ensure finite-time stability under these new
conditions.
Using the new definition,
PROBLEM DESCRIPTION OF MAS
Later, in the next semester I would work upon extending these results for Leader
Follower Concensus. Leader-following MASs involve a group of agents where one
or more agents, known as leaders, influence the behavior of the rest of the agents,
known as followers, to achieve a common objective or goal.
REFERENCES
The references of the work can be found attached in the following