Effects of adding arcs on the consensus convergence rate of leader-follower multi-agent systems
From MaRDI portal
Publication:6106026
DOI10.1016/j.amc.2023.128086MaRDI QIDQ6106026
Shanshan Gao, Xinzhuang Chen, Sheng Gui Zhang, Xiaodi Song
Publication date: 27 June 2023
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Laplacian matrixalgebraic connectivityFiedler vectorstrongly connected directed graphconsensus convergence rateleader-follower MAS
Decentralized systems (93A14) System structure simplification (93B11) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory to circuits and networks (94C15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On consensus speed of multi-agent systems with double-integrator dynamics
- Interconnection topologies for multi-agent coordination under leader-follower framework
- Bounds for the Perron root of a nonnegative irreducible partitioned matrix
- Graph properties for splitting with grounded Laplacian matrices
- Effects of adding a reverse edge across a stem in a directed acyclic graph
- On algebraic connectivity of directed scale-free networks
- Distributed output feedback consensus tracking control of multiple nonholonomic mobile robots with only position information of leader
- Leader-follower consensus control for linear multi-agent systems by fully distributed edge-event-triggered adaptive strategies
- Leader-following consensus of nonlinear multi-agent systems with hybrid delays: distributed impulsive pinning strategy
- A universal error transformation strategy for distributed event-triggered formation tracking of pure-feedback nonlinear multiagent systems with communication and avoidance ranges
- Leader-follower non-fragile consensus of delayed fractional-order nonlinear multi-agent systems
- Optimizing algebraic connectivity by edge rewiring
- A graph-theoretic approach on optimizing informed-node selection in multi-agent tracking control
- Maximum algebraic connectivity augmentation is NP-hard
- Leader-following consensus of multi-agent systems via novel sampled-data event-triggered control
- Finite-/fixed-time bipartite consensus for first-order multi-agent systems via impulsive control
- Effect of Adding Edges to Consensus Networks With Directed Acyclic Graphs
- Bisection Algorithm of Increasing Algebraic Connectivity by Adding an Edge
- Consensus Tracking of Multi-Agent Systems With Lipschitz-Type Node Dynamics and Switching Topologies
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Maximizing Algebraic Connectivity in the Space of Graphs With a Fixed Number of Vertices and Edges
- A Necessary and Sufficient Condition of an Interfering Reverse Edge for a Directed Acyclic Graph
- The effect of reverse edges on convergence rate of directed weighted chain network
This page was built for publication: Effects of adding arcs on the consensus convergence rate of leader-follower multi-agent systems
