On Swarm Stability of Linear Time-Invariant Descriptor Compartmental Networks

  title={On Swarm Stability of Linear Time-Invariant Descriptor Compartmental Networks},
  author={Ning Cai and Muhammad Junaid Khan},
Swarm stability is studied for descriptor compartmental networks with linear time-invariant protocol. Compartmental network is a specific type of dynamical multi-agent system. Necessary and sufficient conditions for both consensus and marginal swarm stability are presented, which require a joint matching between the interactive dynamics of nearest neighbouring vertices and the Laplacian spectrum of the overall network topology. Three numerical instances are provided to verify the theoretical… 

Figures from this paper

Swarm stability of a class of singular dynamical multi-agent systems

Swarm stability problem is addressed for a class of singular multi-agent systems, which is a specific type of dynamical multi-agent system and can be called compartmental network. Necessary and

Swarm stability of a class of singular dynamical multi-agent systems

Swarm stability problem is addressed for a class of singular multi-agent systems, which is a specific type of dynamical multi-agent system and can be called compartmental network. Necessary and

On non-consensus motions of dynamical linear multiagent systems

A comprehensive classification of diverse types of non-consensus phases corresponding to different conditions is conducted, which is jointly depending on the self-dynamics of the agents, the interactive protocol and the graph topology.

Guaranteed-cost output consensus for distributed descriptor swarm systems with communication delays

The guaranteed-cost output consensus problem for time-delayed descriptor swarm systems is proposed, where it is required to realize the tradeoff design between control energy consumptions and output consensus regulation performances.

An anti-consensus problem of a class of dynamic multi-agent systems with sociological background

Simulations reveal that consensus of certain variable could be harmful to the overall stability and should be avoided, so the model conforms to the typical dynamic linear multi-agent systems model concerned extensively in systems science.

Suboptimal Output Consensus for Time‐Delayed Singular Multi‐Agent Systems

The current paper investigates guaranteed‐cost output consensus analysis and design problems for high‐order linear time‐invariant singular multi‐agent systems with constant time delays, which can

A New Cluster Analysis Based on Combinatorial Particle Swarm Optimization Algorithm

The combining algorithm is obviously superior to some common clustering algorithms since it has obvious advantage in optimization capacity, more efficient and more robust than previous research such as the classical K-means clustering algorithm.

Method of Network Security Situation Analysis

By using virtual machine technology, network attacks and network protection subsystem are virtually out on a server, the configuration management of the vast majority of current network operations and network attack protection can be realized.



Swarm Stability of Compartmental Networks with Linear Time-Invariant High-Order Dynamical Protocol

  • H. MaN. Cai
  • Computer Science, Mathematics
    2011 International Conference on Business Computing and Global Informatization
  • 2011
Necessary and sufficient condition of swarm stability is given, which requires that the products of nonzero elements from the spectrum of the Laplacian matrix of the network and the Spectrum of the dynamical protocol possess nonnegative real parts.

Brief paper swarm stability of high-order linear time-invariant swarm systems

In this study the swarm stability problem of high-order linear time-invariant swarm systems with directed graph topology is dealt with and necessary and sufficient conditions for both swarm stability and consensus are presented.

Swarm Stability Analysis of Nonlinear Dynamical Multi-Agent Systems via Relative Lyapunov Function

Conditions for swarm stability of nonlinear high-order multi-agent systems are analyzed based on the idea of space transformation. Swarm stability can be assured by sufficient connectivity of graph

Necessary and Sufficient Consensus Conditions of Descriptor Multi-agent Systems

  • Xinrong YangGuoping Liu
  • Mathematics, Computer Science
    IEEE Transactions on Circuits and Systems I: Regular Papers
  • 2012
For descriptor multi-agent systems with fixed topology and agents described by general descriptor linear time-invariant systems, necessary and sufficient conditions of consensusability with respect

Stability analysis of swarms

  • V. GaziK. Passino
  • Mathematics
    Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301)
  • 2002
It is shown that the individuals (autonomous agents or biological creatures) will form a cohesive swarm in a finite time and an explicit bound on the swarm size is obtained, which depends only on the parameters of the swarm model.

On uniform consensus of linear multi-agent systems with time-varying graph topologies

Consensus of linear time-varying multi-agent systems is dealt with. A necessary and sufficient condition for uniform consensus is proposed. According to this condition, the consensus of a multi-agent

Fractional-order linear time invariant swarm systems: asymptotic swarm stability and time response analysis

This paper deals with fractional-order linear time invariant swarm systems. Necessary and sufficient conditions for asymptotic swarm stability of these systems are presented. Also, based on a time

Stability of synchronized distributed control of discrete swarm structures

  • K. JinP. LiangG. Beni
  • Computer Science
    Proceedings of the 1994 IEEE International Conference on Robotics and Automation
  • 1994
The authors prove that both 1D and 2D swarm structures are stable with appropriate weights in the sum of adjacent errors if the vertical disturbances vary sufficiently more slowly than the response time of the servo systems of the agents.

Delay-dependent admissible consensualization for singular time-delayed swarm systems

Containment analysis and design for high-order linear time-invariant singular swarm systems with time delays

To eliminate impulse terms in singular swarm systems and ensure that the singular Swarm systems can achieve containment, time-delayed protocols are presented for leaders and followers respectively.