Pinning Stabilization of Stochastic Networks With Finite States via Controlling Minimal Nodes
Abstract:
In this article, pinning control has been applied to stabilize a kind of stochastic network with finite states called probabilistic logical networks (PLNs). First, the solvability of pinning controllers, including the selection of pinning nodes and the corresponding control design, is addressed to guarantee the stabilization of PLNs. Then, based on the complete matrices set, one necessary and sufficient condition is obtained for PLNs to be stabilized by exact p nodes. In addition, an algorithm is presented for obtaining the minimal number of pinning nodes and how exact they are. As an application, our algorithm is used to calculate the minimal number of pinning nodes for the stabilization of logical networks (LNs). Examples are given to illustrate the process of choosing pinning nodes and show the efficiency of the obtained results.
Related Concept Videos
Multimachine Stability
In analyzing the system, the nodal equations represent the relationship between bus voltages, machine voltages, and machine currents. The nodal equation is given by:
Stability of structures
Stability
The stability of an LTI system is determined by the roots of its characteristic equation, known as poles. A system is stable if it produces a bounded...
Microtubule Instability
Stability of Equilibrium Configuration
A stable equilibrium occurs when a system tends to return to its original position when given a small displacement, and the potential energy is at its minimum. An example of a stable equilibrium is when a cantilever beam is fixed at one end and a weight is attached to the other end. If the weight...
Pole and System Stability
Simple poles are unique roots of the denominator polynomial. Each simple pole corresponds to a distinct solution to the system's characteristic equation, typically resulting in exponential decay terms in the system's...


