DESIGN OF CONTROLLABLE LEADER–FOLLOWER NETWORKS VIA MEMETIC ALGORITHMS

Shaoping Xiao (), Baike She (), Siddhartha Mehta () and Zhen Kan
Additional contact information
Shaoping Xiao: Department of Mechanical Engineering, University of Iowa, Iowa Technology Institute (Formerly CCAD), Iowa City, IA 52242, USA
Baike She: Elmore Family School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN 47906, USA
Siddhartha Mehta: Department of Mechanical and Aerospace Engineering, University of Florida Research and Engineering Education Facility, Shalimar, FL 32579, USA
Zhen Kan: Department of Automation, University of Science and Technology of China, Hefei, Anhui 230026, P. R. China

Advances in Complex Systems (ACS), 2021, vol. 24, issue 02, 1-29

Abstract: In many engineered and natural networked systems, there has been great interest in leader selection and/or edge assignment during the optimal design of controllable networks. In this paper, we present our pioneering work in leader–follower network design via memetic algorithms, which focuses on minimizing the number of leaders or the amount of control energy while ensuring network controllability. We consider three problems in this paper: (1) selecting the minimum number of leaders in a pre-defined network with guaranteed network controllability; (2) selecting the leaders in a pre-defined network with the minimum control energy; and (3) assigning edges (interactions) between nodes to form a controllable leader–follower network with the minimum control energy. The proposed framework can be applied in designing signed, unsigned, directed, or undirected networks. It should be noted that this work is the first to apply memetic algorithms in the design of controllable networks. We chose memetic algorithms because they have been shown to be more efficient and more effective than the standard genetic algorithms in solving some optimization problems. Our simulation results provide an additional demonstration of their efficiency and effectiveness.

Keywords: Leader–follower networks; memetic algorithms; controllability; control energy (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0219525921500041
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:acsxxx:v:24:y:2021:i:02:n:s0219525921500041

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0219525921500041

Access Statistics for this article

Advances in Complex Systems (ACS) is currently edited by Frank Schweitzer

More articles in Advances in Complex Systems (ACS) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().