The problem of leaders location plays an important role in the controllability of undirected graphs.The concept of minimal perfect critical vertex set is introduced by drawing support from the eigenvector of Laplace matrix. Using the notion of minimal perfect critical vertex set, the problem of finding the minimum number of controllable leader vertices is transformed into the problem of finding all minimal perfect critical vertex sets. Some necessary and sufficient conditions for special minimal perfect critical vertex sets are provided, such as minimal perfect critical 2 vertex set, and minimal perfect critical vertex set of path or path related graphs. And further, the leaders location problem for path graphs is solved completely by the algorithm provided in this paper. An interesting result that there never exist a minimal perfect critical 3 vertex set is proved, too.
The optimization problem of the minimum set of leaders for the controllability of undirected graphs are addressed. It is difficult to find not only its optimal solution but also its approximate algorithm. We propose a new concept, namely minimal perfect critical set (MPCS), to obtain an optimal solution. Some properties are presented, and on the basis of these theorems, the problem of the minimum set of leaders of two typical self-similar bipartite networks, namely deterministic scale-free networks (DSFN) and Cayley trees, is solved completely.
Minimal controllability problem plays an important role in the field of network control. A New concept-Minimum Perfect Critical Set (MPCS)is proposed. Four different MPCSs were found for k-distant tree graphs. Based on this concept of MPCS, an algorithm for finding the minimal leader set is provided. Numerical experiments show that these theories enable the algorithm to find a minimal leader set with a probability of more than 0.98. Further, some other numerical characteristics of the minimal leader set of k-distant trees were found.
This paper deals with a multi-objective control problem for a class of nonlocal parabolic equations, where the non-locality is expressed through an integral kernel. We present the Stackelberg strategy that combines the concepts of controllability to trajectories with optimal control. The strategy involves two controls: a main control (the leader) and a secondary control (the follower). The leader solves a controllability to trajectories problem which consists to drive the state of the system to a prescribed target at a final time while the follower solves an optimal control problem which consi…
This paper deals with the hierarchical control of the anisotropic heat equation with dynamic boundary conditions and drift terms. We use the Stackelberg-Nash strategy with one leader and two followers. To each fixed leader, we find a Nash equilibrium corresponding to a bi-objective optimal control problem for the followers. Then, by some new Carleman estimates, we prove a null controllability result.
We study the strong structural controllability (SSC) of diffusively coupled networks, where the external control inputs are injected to only some nodes, namely the leaders. For such systems, one measure of controllability is the dimension of strong structurally controllable subspace, which is equal to the smallest possible rank of controllability matrix under admissible (positive) coupling weights. In this paper, we compare two tight lower bounds on the dimension of strong structurally controllable subspace: one based on the distances of followers to leaders, and the other based on the graph c…
In this paper, we present some controllability results for the heat equation in the framework of hierarchic control. We present a Stackelberg strategy combining the concept of controllability with robustness: the main control (the leader) is in charge of a null-controllability objective while a secondary control (the follower) solves a robust control problem, this is, we look for an optimal control in the presence of the worst disturbance. We improve previous results by considering that either the leader or follower control acts on a small part of the boundary. We also present a discussion abo…
In this article the robust Stackelberg controllability (RSC) problem is studied for a nonlinear fourth-order parabolic equation, namely, the Kuramoto-Sivashinsky equation. When three external sources are acting into the system, the RSC problem consists essentially in combining two subproblems: the first one is a saddle point problem among two sources. Such an sources are called the "follower control" and its associated "disturbance signal". This procedure corresponds to a robust control problem. The second one is a hierarchic control problem (Stackelberg strategy), which involves the third for…
This paper is concerned with the application of Stackelberg-Nash strategies to control fourth order linear and semi-linear parabolic equations. We assume that the system is acted through a hierarchy of distributed controls: one main control (the leader) that is responsible for an exact controllability property; and a couple of secondary controls (the followers) that minimize two prescribed cost functionals and provides a pair of Nash equilibria for the two prescribed cost functionals. In this paper, we first prove the existence of an associated Nash equilibrium pair corresponding to a hierarch…
This paper deals with structural controllability of leader-follower networks. The system matrix defining the network dynamics is a pattern matrix in which a priori given entries are equal to zero, while the remaining entries take nonzero values. The network is called strongly structurally controllable if for all choices of real values for the nonzero entries in the pattern matrix, the system is controllable in the classical sense. In this paper we introduce a more general notion of strong structural controllability which deals with the situation that given nonzero entries in the system's patte…
Nonlinear networked systems are of interest in several areas of research, such as multi-agent systems and social networks. In this paper, we examine the controllability of several classes of nonlinear networked dynamics on which the underlying graph admits negative weights. Such signed networks exhibit bipartite clustering when the underlying graph is structurally balanced. We show that structural balance is the key ingredient inducing uncontrollability when combined with a leader-node symmetry and a certain type of dynamical symmetry. We then examine the problem of extracting the bipartite st…
This paper presents graph theoretic conditions for the controllability and accessibility of bilinear systems over the special orthogonal group, the special linear group and the general linear group, respectively, in the presence of drift terms. Such bilinear systems naturally induce two interaction graphs: one graph from the drift, and another from the controlled dynamics. As a result, the system controllability or accessibility becomes a property of the two graphs in view of the classical Lie algebra rank condition. We establish a systemic way of transforming the Lie bracket operations in the…
In this paper, we consider a hierarchical control problem with model uncertainty. Specifically, we consider the following objectives that we would like to accomplish. The first one being of a controllability-type that consists of guaranteeing the terminal state to reach a target set starting from an initial condition, while the second one is keeping the state trajectory of the system close to a given reference trajectory over a finite time interval. We introduce the following framework. First, we partition the control subdomain into two disjoint open subdomains, with smooth boundaries, that ar…
In this paper, we study graphical conditions for structural controllability and accessibility of drifted bilinear systems over Lie groups. We consider a bilinear control system with drift and controlled terms that evolves over the special orthogonal group, the general linear group, and the special unitary group. Zero patterns are prescribed for the drift and controlled dynamics with respect to a set of base elements in the corresponding Lie algebra. The drift dynamics must respect a rigid zero-pattern in the sense that the drift takes values as a linear combination of base elements with strict…
This paper deals with controllability of dynamical networks. It is often unfeasible or unnecessary to fully control large-scale networks, which motivates the control of a prescribed subset of agents of the network. This specific form of output control is known under the name target control. We consider target control of a family of linear control systems associated with a network, and provide both a necessary and a sufficient topological condition under which the network is strongly targeted controllable. Furthermore, a leader selection algorithm is presented to compute leader sets achieving t…
In this paper we investigate a relaxed concept of controllability, known in the literature as herdability, namely the capability of a system to be driven towards the(interior of the) positive orthant. Specifically, we investigate herdability for linear time-invariant systems, both from an algebraic perspective and based on the graph representing the systems interactions. In addition, we focus on linear state-space models corresponding to matrix pairs (A;B) in which the matrix B is a selection matrix that determines the leaders in the network, and we show that the weights that followers give to…
Functional target controllability of networks: structural properties and efficient algorithms
Univ. Grenoble Alpes（格勒诺布尔阿尔卑斯大学）；CNRS（法国国家科学研究中心）；GIPSA-lab（GIPSA实验室）；DIAM, EWI, Delft University of Technology（代尔夫特理工大学电子、数学与计算机工程院计算系统研究所）；Inria（法国国家信息与自动化研究所）
This paper focuses on the problem of constructing time-varying feedback laws that asymptotically stabilize a given part of the state variables for nonlinear control-affine systems. It is assumed that the class of systems under consideration satisfies nonlinear controllability conditions with respect to the stabilizable variables. Under these assumptions, a time-periodic feedback control is constructed explicitly by using the inversion of the matrix composed of the control vector fields and their Lie brackets. The proposed control design scheme is applied to solving the leader-following problem…
This paper studies the global Nash equilibrium problem of leader-follower multi-agent dynamics, which yields consensus with a privacy information encrypted learning algorithm. With the secure hierarchical structure, the relationship between the secure consensus problem and global Nash equilibrium is discussed under potential packet loss attacks, and the necessary and sufficient condition for the existence of global Nash equilibrium is provided regarding the soft-constrained graphical game. To achieve the optimal policies, the convergence of decentralized learning algorithm is guaranteed with a…
In this paper, we consider a risk-averse decision problem for controlled-diffusion processes, with dynamic risk measures, in which there are two risk-averse decision makers (i.e., {\it leader} and {\it follower}) with different risk-averse related responsibilities and information. Moreover, we assume that there are two objectives that these decision makers are expected to achieve. That is, the first objective being of {\it stochastic controllability} type that describes an acceptable risk-exposure set vis-á-vis some uncertain future payoff, and while the {\it second one} is making sure the sol…
This paper studies the problem of, given the structure of a linear-time invariant system and a set of possible inputs, finding the smallest subset of input vectors that ensures system's structural controllability. We refer to this problem as the minimum constrained input selection (minCIS) problem, since the selection has to be performed on an initial given set of possible inputs. We prove that the minCIS problem is NP-hard, which addresses a recent open question of whether there exist polynomial algorithms (in the size of the system plant matrices) that solve the minCIS problem. To this end, …
