Proceedings ArticleDOI
Algorithms to select right driver nodes for multi-agent systems
Ram Niwash Mahia,Mahaveer Singh,Deepak Fulwani +2 more
- pp 1-6
TLDR
This paper studies a problem of selecting a right set of driver nodes of multiple input multi-agent system (MAS) subject to actuator saturation and discusses theory and algorithms to select a set ofDriver nodes.Abstract:
This paper studies a problem of selecting a right set of driver nodes of multiple input multi-agent system (MAS) subject to actuator saturation. A controllable multi-agent system can be driven from any initial state to any desired state using a set of driver nodes. For many systems, a set of driver nodes to control the multi-agent system is not unique. It is important to characterize this set of driver nodes and select the right set of driver nodes. The work discusses theory and algorithms to select a set of driver nodes. The selection of a particular set as a driver set is based on region of attraction associated with a particular set. The set is selected such that largest region of attraction can be obtained. A multiple-input multi-agent system which can be controllable using a set of driver nodes is considered. Nonuniqueness of the set of driver nodes poses a challenge to select a right set of driver nodes. The work addresses this issue. The presented algorithms are illustrated through examples.read more
Citations
More filters
Journal ArticleDOI
On the Bipartite Consensus for Generic Linear Multiagent Systems With Input Saturation
TL;DR: If each agent is asymptotically null controllable with bounded controls and the interaction topology described by a signed digraph is structurally balanced and contains a spanning tree, then the semi-global bipartite consensus can be achieved for the linear multiagent system by a linear feedback controller with the control gain being designed via the low gain feedback technique.
Journal ArticleDOI
Towards characterization of driver nodes in complex network with actuator saturation
TL;DR: The paper proposes a theory and an algorithm to characterize driver node (control node) of a complex network and considers actuator saturation a priori and also ensures a specified convergence rate.
Journal ArticleDOI
Identification of Optimal Set of Driver Nodes in Complex Networked Systems Using Region of Attraction
TL;DR: For any practical networked systems, driver node has limited actuating capacity, this paper consider this limitation a priori and presents mathematical formulation and two algorithms using the Region of Attraction (ROA) to identify an optimal set of driver nodes.
Proceedings ArticleDOI
Selection of driver nodes based on region of attraction for single-input complex networks
TL;DR: This paper presents a theory and algorithms to select an appropriate driver node based on region of attraction (ROA) of single-input complex networks considering limited capacity of driver node considering single- input unstable network with saturated actuator.
References
More filters
Book
Convex Optimization
Stephen Boyd,Lieven Vandenberghe +1 more
TL;DR: In this article, the focus is on recognizing convex optimization problems and then finding the most appropriate technique for solving them, and a comprehensive introduction to the subject is given. But the focus of this book is not on the optimization problem itself, but on the problem of finding the appropriate technique to solve it.
Journal ArticleDOI
Controllability of complex networks
Yang Liu,Jean-Jacques E. Slotine,Albert-László Barabási,Albert-László Barabási,Albert-László Barabási +4 more
TL;DR: In this article, the authors developed analytical tools to study the controllability of an arbitrary complex directed network, identifying the set of driver nodes with time-dependent control that can guide the system's entire dynamics.
Journal ArticleDOI
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
John E. Hopcroft,Richard M. Karp +1 more
TL;DR: This paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to $(m + n)\sqrt n $.
Journal Article
Structural controllability
TL;DR: In this paper, the authors defined the concepts of structural and structural controllability for a linear time-invariant control system (described by a pair (A,b )) and studied the physical justification of these concepts and examples.
Proceedings ArticleDOI
A n5/2 algorithm for maximum matchings in bipartite
John E. Hopcroft,Richard M. Karp +1 more
TL;DR: In this paper, a bipartite graph with n vertices and m edges was constructed in a number of computation steps proportional to (m+n) n, where n is the number of edges in the graph.
Related Papers (5)
Formation control for a cooperative multi-agent system using decentralized navigation functions
M.C. De Gennaro,Ali Jadbabaie +1 more