Design of controllable leader-follower networks via memetic algorithms
From MaRDI portal
Publication:6497563
DOI10.1142/S0219525921500041MaRDI QIDQ6497563
Zhen Kan, Shaoping Xiao, Siddhartha S. Mehta, Baike She
Publication date: 6 May 2024
Published in: Advances in Complex Systems (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimum cost input/output design for large-scale linear structural systems
- Eigenvalue clustering, control energy, and logarithmic capacity
- Leaders in multi-agent controllability under consensus algorithm and tree topology
- Leader-follower swarm tracking for networked Lagrange systems
- A modified genetic algorithm for optimal control problems
- On the \(k\)-path partition of graphs.
- Optimizing the controllability of arbitrary networks with genetic algorithm
- On the convergence rates of genetic algorithms
- Characterizing controllable subspace and herdability of signed weighted networks via graph partition
- Laplacian dynamics on general graphs
- Introduction to Complex Networks: Structure and Dynamics
- Graph Controllability Classes for the Laplacian Leader-Follower Dynamics
- Comparison of Various Evolutionary and Memetic Algorithms
- Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective
- On the Reachability and Observability of Path and Cycle Graphs
- Controllability and Observability of Grid Graphs via Reduction and Symmetries
- Controllability Metrics, Limitations and Algorithms for Complex Networks
- Minimal Controllability Problems
- On Submodularity and Controllability in Complex Dynamical Networks
- A review of methods for input/output selection
This page was built for publication: Design of controllable leader-follower networks via memetic algorithms
