Abstract
The consensus protocol of cyber-physical power systems is proposed based on fractional-order multi-agent systems with communication constraints. It aims to enable each generator to reach a time-varying common rotor angle and rotor speed. Communication constraints including event-triggered sampling and partial information transmission are considered to render the consensus protocol more realistic. The Zeno behavior is excluded during the system sampling process. A sufficient condition is derived to solve the consensus problem. The effectiveness of the proposed consensus protocol is demonstrated by a numerical example.
Similar content being viewed by others
1 Introduction
The concept of cyber-physical power systems (CPPSs) is first proposed in [1] as a dedicated case of a cyber-physical system in a power system. It is composed of a large number of computing devices (servers, computers, and embedded computing devices), data acquisition devices (sensors, phasor measurement unit, and embedded data acquisition equipment), and physical devices (large-scale generator set, distributed power supply, and load). These devices are connected through communication and transmission networks. CPPSs combine the advantages of cyber-physical systems and power systems. However, it also experiences many technical and security challenges [2, 3]. Owing to the ability to collect and handle massive information compared with traditional power systems, studies on CPPSs such as traffic networks [4] and aviation electric power systems [5] have been performed. Among these, the stability of CPPSs has been emphasized, because an unstable power supply may lead to voltage collapse and breakdown of the entire power system [6, 7]. Most studies on stability in the existing literature are focused on the supply-demand balance and rotor angle stability. Specifically, the target of the supply-demand balance is to continuously match the production and consumption of electricity across networks [8]. The rotor angle stability [9] enables the CPPS to operate smoothly and efficiently by allowing each generator to reach a time-varying common rotor angle and speed, separately. Both of them can be regarded as a consensus perspective. Thus, many studies use the consensus theory to solve stability problems in CPPSs [10, 11].
A multi-agent system (MAS) model has been extensively studied as an effective method for the consensus problem [12, 13]. It is a cooperative system whereby agents can share their information to communicate with each other. The MAS has many significant real-world applications, such as sensor networks [14], unmanned air vehicles formations [15, 16], and microgrids [17]. Furthermore, many studies have applied the MAS to a CPPS [18,19,20,21]. In [18], a distributed multi-agent-based load shedding algorithm that can yield an efficient load shedding decision based on the discovered global information was proposed. In [20], an innovative approach was proposed to use real-time scheduling techniques for the automation of electric loads in CPPSs. In [21], a distributed control method to enhance power system rotor angle stability based on the second-order MAS consensus was proposed, where each generator can be regarded as an agent to communicate with each other. Nevertheless, most of the studies on CPPSs are based on integer-order MASs. In fact, real-world processes are generally (or most likely) fractional-order systems [22, 23]. Many physical systems exhibit fractional dynamical behavior owing to their special materials and chemical properties [24,25,26,27]. Thus, it is highly desirable to study CPPSs with fractional-order MASs.
Communication constraints that are crucial factors to the system performance cannot be ignored in practice. Among them, the partial information transmission is significant. That is to say, not all of the information can be transmitted to their neighbors perfectly [28,29,30]. Energy saving is another important topic. Considering the massive communicating and computing work in CPPSs, sampling would be an efficient method to reduce resources. Traditional periodic sampling techniques would typically waste much energy and consequently shorten the lifespan of the system to a certain degree [31]. To address this problem, event-triggered control has attracted significant attention from research into the consensus of MASs [32,33,34,35,36,37]. The Zeno behavior must be excluded in the event sampling process; otherwise, continuous communication will be required again [38]. However, among the existing literatures, the proofs absent of the Zeno behavior are not presented (or are naturally avoided), because events can only occur at sampling time instants that are a multiple of some given sampling period [34, 39]. Therefore, it is necessary to propose a more specific proof when the Zeno behavior is excluded.
Our current study is of practical significance because it can effectively reduce the gap between the physical and cyber worlds. However, few results have been found in the existing literature. Motivated by the discussions above, we herein consider the consensus of CPPSs based on fractional-order MASs with communication constraints. Our objective is to ensure that each generator achieves a time-varying common rotor angle and rotor speed. The contribution of this paper can be summarized in three aspects: 1) a fractional-order MAS modeling with communication constraints is established for the consensus of the CPPS; 2) based on communication constraints, a distributed event condition is introduced for energy conservation, and consensus criteria are obtained that can be applied to more practical systems; 3) a finite number of broadcasts and updates exist by each agent in any finite time period, thus ensuring that the Zeno behavior does not occur in the CPPS. The effectiveness of the proposed consensus criteria is illustrated with a numerical example.
2 Model description and preliminaries
In this section, some basic notions and properties of the algebraic graph theory are introduced.
Each agent can be abstracted as a node. Let \(\mathcal{G}=(\mathcal{V},\mathcal{E},G)\) be a weighted directed network of order N, with the set of nodes (vertices) \(\mathcal{V}=\{1,2,\ldots ,N\},\) the set of directed edges \(\mathcal{E}\subseteq \mathcal{V}\times \mathcal{V},\) and a weighted adjacency matrix \(\varvec{A}=(a_{ij})_{N\times N}\). A directed edge in graph \(\mathcal{G}\) is denoted by the ordered pairs of nodes \(\mathcal{E}_{ij}=(i,j),\) where i and j are called the terminal and initial nodes, respectively. If edge \((j,i)\in \mathcal{E},\) then node j is called a neighbor of node i, implying that node i can receive information from node j. Therefore, \(a_{ij}>0\); otherwise, \(a_{ij}=0.\) The neighborhood index set of node i is denoted by \(\mathcal{N}_{i}=\{j\in \mathcal{V}|(j,i)\in \mathcal{E}\},\) while we indicate with \(|\mathcal{N}_{i}|\) its cardinality (the number of neighbors of node i). \(||\cdot ||\) and \(||\cdot ||_{1}\) represent the Euclidean norm and one norm for a vector or a matrix, respectively. \(\varvec{I}_{n}\) and \(\varvec{O}_{n}\) express the identity matrix and zero matrix with dimension n, respectively. \(D_{+}^{\alpha }\) represents the fractional-order Dini(upper right) derivative. Matrix \(\varvec{A}>\bf{0}\) denotes that \(\varvec{A}\) is a positively defined matrix, and \(\text{diag}\{\cdots \}\) denotes a diagonal matrix.
2.1 Fractional calculus and preliminary lemmas
Definition 1
The fractional integral with non-integer order \(\alpha >0\) of function \({p}(\cdot )\) is defined as follows:
where \(\varGamma (\cdot )\) is the gamma function \(\varGamma (t)=\int _{0}^{\infty }t^{\alpha -1}e^{-t}\text{d}t.\)
Several definitions exist that refer to the fractional derivative of order \(\alpha >0\). Compared with other definitions, the Caputo derivative has a unique advantage; it only claims the initial conditions provided as the integer-order derivative of \({p}(\cdot )\) and the function itself. Therefore, our consideration is a fractional-order MAS with a Caputo derivative, whose definition is given below.
Definition 2
The Caputo derivative of fractional order \(\alpha >0\) of function \({p}(\cdot )\) is defined as follows:
where \(n-1< \alpha \le n \in {\bf{Z}}^{+}\).
For simplicity, \(D_{0,t}^{-\alpha },\,_{0}^{C}D_{t}^{\alpha }\) are rewritten as \(D^{-\alpha }\) and \(D^{\alpha }\), respectively. Some properties of these two operators are introduced.
Lemma 1
[40] If \({p}(t),g(t)\in C^{n}[0,+\infty )\) and \(n-1<\alpha ,\beta \le n\in {\bf{Z}}^{+},\) then:
where \(C^{n}(M,N)\) denotes the space consisting of n-order continuous differentiable functions from M into N.
Lemma 2
[25] Let \(\varvec{x}(t)=\left( x_{1}(t),x_{2}(t),\ldots ,x_{n}(t)\right) ^{\mathrm{T}}\in {\bf{R}}^{n}\) be a differential vector-value function. Then, for any time instant \(t\ge t_{0}\),
Therefore,
where \(\varvec{P}\in {\bf{R}}^{n\times n}\) is a symmetric positive definite matrix, \(\alpha \in (0,1).\)
2.2 Network model
In this section, we will discuss the stability of the rotor angle. The CPPS can be modeled by the formulas as follows [41].
where \(\delta _{i}\) is the rotor angle; \(\omega _{i}\) is the rotor speed; \(D_{i}\) is the damping coefficient; \(M_{i}\) is the inertia constant; \(P_{mi}\) is the mechanical power; \(P_{ei}\) is the electrical power; \(\varvec{E}_{i}^{\prime }\) is the internal bus voltage vector; \(\varvec{V}\) is the generator terminal voltage vector. \(\varvec{R}(\varvec{\delta} )\) and \(\varvec{T}{(\varvec{\delta} )}\) are matrices comprised of elements \(\varvec{R}_{i}(\delta _{i})\) and \(\varvec{T}_{i}(\delta _{i})\), respectively. \(\varvec{R}_{i}(\delta _{i}), \varvec{T}_{i}(\delta _{i}) \varvec{F}_{i}\), and \(\varvec{H}_{i}\) are descried in [41] in detail.
A classical coherency criterion states that a generator pair (i, j) is considered coherent if
which can be considered a consensus problem of a second-order multi-agent system. It appears that we can use a multi-agent system to study the rotor angle stability of the CPPS.
From (1) and (2), if the controller input is chosen in the following form:
where \(u_{i}^{\prime }\) is the new input to be determined, then the differential equations of the rotor angle and rotor speed in the CPPS is described as follows:
Thus, the design of \(u_{i}^{\prime }\) is important.
Next, we discuss the rotor angle stability of the CPPS with a multi-agent system model.
The fractional-order calculation is more general, because it is an expansion of the integer-order calculation. We consider the fractional-order multi-agent system as follows:
where \(\beta \in (0,1];\varvec{x}_{i}(t)\in {{\bf{R}}^{n}},\varvec{v}_{i}(t)\in {{\bf{R}}^{n}}\) are the position and speed information of the \(i^{\mathrm{th}}\) agent, respectively; \(\varvec{u}_{i}(t)\) is the control input.
To achieve a common position and speed for the MAS based on the fractional-order MAS (6), we consider the following control protocol:
where \(\varvec{A}=[a_{ij}]_{N\times N}\) is the weighted adjacency matrix, which represents the connection among agents. Considering the factors of the MAS and the influence of the external environment, the nonlinear term [42] is added to the control model of the system. \(\varvec{f}:{{\bf{R}}^{n}\times {\bf{R}}^{n}\times{\bf{R}}^{+}\rightarrow {\bf{R}}^{n}}\) is a continuously differentiable vector-valued nonlinear function. \(\varvec{H}_{ij}=\text{diag}\{h_{ij}^{1},h_{ij}^{2},\ldots ,h_{ij}^{n}\}\)\(h_{ij}^{k}=0\) or 1, for each \(k=1,2,\ldots ,n.\) It is called the channel matrix [28], owing to the imperfect signal transmission in a communications network.
Let \(\varvec{R}_{ij}=a_{ij}\varvec{H}_{ij}= \text{diag}\{r_{ij}^{1},r_{ij}^{2},\cdots ,r_{ij}^{n}\},\) for \(i,j=1,2,\ldots ,N\) and \(\varvec{R}_{ii}=-\sum_{j=1,j\ne i}^{N}\varvec{R}_{ij}.\)
The control input of the partial information transmission for the consensus of the MAS (7) can be rewritten in the following form:
for any \(i,j=1,2,\ldots ,N.\) For mathematical derivation, we define the channel Laplacian matrix as follows:
It is clear that the matrices \(\varvec{R}_{k}\) are decomposed from \(\varvec{R}_{ij}.\) Moreover, \(R_{k}(i,j)\) is the \(k^{\mathrm{th}}\) diagonal element of \(\varvec{R}_{ij}\) for any \(i,j=1,2,\ldots ,N.\) Obviously, \(\varvec{R}_{k}\) has the zero row-sum property. Herein, we always assume that \(\varvec{R}_{k}\) is irreducible. Suppose \(\varvec{\xi }_{k}=[\xi _{k1},\xi _{k2},\ldots ,\xi _{kN}]^{\mathrm{T}}\in {{\bf{R}}}^{N}\) satisfying \(\sum_{i=1}^{N}\xi _{ki}=1\) is the normalized left eigenvector of matrix \(\varvec{R}_{k}\) corresponding to the eigenvalue 0. From [43], \(\xi _{ki}>0\) holds for all \(i\in \{1,2,\ldots ,N\}\) and \(k\in \{1,2,\ldots ,n\}.\) Setting \(\varvec{\varPhi }_{i}=\text{diag} \{\xi _{1i},\xi _{2i},\ldots ,\xi _{ni}\},\) we can obtain \(\sum _{i=1}^{N}\varvec{\varPhi }_{i}\varvec{R}_{ij}={\bf{0}}.\)
Owing to the massive distributed components and the large number of data in the CPPS, energy saving appears particularly important. Compared with traditional period sampling, the event-trigger sampling strategy is more advantageous. Therefore, we adopt the event-trigger sampling method. The control input \(\varvec{u}_{i}(t)\) is converted into
\(\text{where}\, t_{k}^{i}\) is the sampling instant that is analytically determined by the following individual event condition:
where
are the position measurement errors and speed measurement errors.
The following assumption, definitions, and lemmas will be used to derive our primary results. Thus, they are given as below:
Assumption 1
Assume that two positive constants \(l_{1},l_{2},\) exist such that the vector-valued nonlinear function \(\varvec{f}(\cdot )\) satisfies
where \(\varvec{x}_{i},\varvec{y}_{i}\in {\bf{R}}^{n};\,t\ge 0.\)
Definition 3
The consensus in MAS (6) is said to be achieved, if for any initial states,
Definition 4
System (9) does not exhibit the Zeno behavior, if \(\inf \limits _{k}\{t_{k+1}^{i}-t_{k}^{i}\}>0,\) for all i. In other words, there is no system trajectory with an infinite number of events in a finite time.
Definition 5
[44] The two parameters form of the Mittag–Leffler function is defined as follows:
Lemma 3
[45] For two vectors \(\varvec{x}(t)\) and \(\varvec{y}(t)\)\(\in {{\bf{R}}^{Nn}}\),
we have the following properties:
Lemma 4
(Schur complement) The following linear matrix inequality
where \(\varvec{\mathcal{Q}}(x)=\varvec{\mathcal{Q}}{^{\mathrm{T}}}(x)\) and \(\varvec{\mathcal{R}}(x)=\varvec{\mathcal{R}}{^{\mathrm{T}}}(x)\) is equivalent to one of the following conditions.
Lemma 5
[46] The Mittag–Leffler function generalizes the simple exponential function (recovered for \(\beta =1\) ) and, if \(0<\beta <1,\) it interpolates the positive real axis to a stretched exponential and a power law according to
2.3 Primary results
In this section, we shall obtain the consensus condition of the fractional-order MAS with communication constraints.
Let
where \(\bar{\varvec{x}}(t)\) is the time-varying common position and \(\bar{\varvec{v}}(t)\) is the time-varying common speed for each agent; \(\tilde{\varvec{x}}(t),\tilde{\varvec{v}}(t)\) are the errors between the current state information and the common state information. Subsequently, the consensus problem can be translated into a stable issue.
Because
we can obtain
From \(\sum _{i=1}^{N}\varvec{\varPhi }_{i}=\varvec{I}_{n},\) we obtain
Subsequently, we can obtain the following error dynamical system
Based on the analysis above, we can obtain the condition that the agents cooperate to achieve the time-varying common position and speed in the MAS.
Theorem 1
Suppose that Assumption 1 holds and \(t_{0}^{i}=t_{0}=0,i=1,2,\ldots ,N\) under the event condition. \(\varvec{R}_{k}\) is irreducible. Therefore, the consensus in network (6) is achieved under the designed control input (9) if the scalar \(\alpha >0\) exists that satisfies the following LMIs:
where
Proof
Consider the following Lyapunov function candidate:
Let \(\varvec{y}_{i}^{\mathrm{T}}(t)=(\tilde{\varvec{x}}_{i}^{\mathrm{T}}(t),\tilde{\varvec{v}}_{i}^{\mathrm{T}}(t))^{\mathrm{T}},\) then
By Lemma 4, \(\begin{aligned} \begin{bmatrix} \alpha \varvec{I}_{n} &{} \varvec{\varPhi }_{i} \\ \varvec{\varPhi }_{i} &{} \varvec{\varPhi }_{i} \end{bmatrix} >{\bf{0}} \end{aligned}\) is equivalent to \(\varvec{\varPhi }_{i}>{\bf{0}}\) and \(\alpha \varvec{I}_{n}-\varvec{\varPhi }_{i}>{\bf{0}}\). Then, \(V(t)\ge 0.\)\(V(t)=0\) if and only if \(\varvec{y}(t)={\bf{0}}\). By calculating the time derivative of the V(t) along the trajectory of the error system (10), the following equation can be obtained:
Then, (12) can be rewritten as
where
where
According to the definition of \(\varvec{Q}_{k}\), we conclude that the columns of \(\varvec{Q}_{k}\) form a basis of the subspace \(\varvec{E}_{k}\), where \(\varvec{E}_{k}=\{\varvec{z}=[z_{1},z_{2},\ldots ,z_{N}]^{\mathrm{T}}\in {\bf{R}}^{N}:\sum _{i=1}^{N}\xi _{ki}z_{i}=0\}.\) Therefore, we obtain \(\tilde{\varvec{\delta v}_{k}},\tilde{\varvec{\delta x}_{k}}\in \varvec{E}_{k}.\) Hence, there exists \(\hat{\varvec{\delta v}_{k}},\hat{\varvec{\delta x}_{k}}\in {\bf{R}}^{N-1},\) such that \(\tilde{\varvec{\delta v}_{k}}=\varvec{Q}_{k}\hat{\varvec{\delta v}_{k}}\) and \(\tilde{\varvec{\delta x}_{k}}=\varvec{Q}_{k}\hat{\varvec{\delta x}_{k}}.\) Thus, (13) follows that
From the definitions of measurement errors, we found that \(\varvec{e}_{xi}(t)\) and \(\varvec{e}_{vi}(t)\) will be set to zeros at each event sampling instant \(t_{k}^{i}.\) The next sampling time instant \(t_{k+1}^{i}\) is the moment when the term \(||\varvec{e}_{xi}(t)||_{1}+||\varvec{e}_{vi}(t)||_{1}\) becomes the time-varying threshold
Then, for all \(t\ge 0,\)
where \(\bar{r}=\max _{1\le i\le N,j\in N_{i},1\le k\le n}{r_{ij}^{k}}, N_{M}=\max _{1\le i\le N}{|N_{i}|}.\) By adding i from 1 to N, we can obtain from (16) that
i.e.,
Thus, we can obtain from \(I_{3}\) that
where
From (14),(15),(17) and (18), we can obtain the following:
where
From the condition of the theorem, we know that \(\varvec{\varTheta }>{\bf0}\). Choosing \(0<\theta <\frac{\lambda _{\min }(\varvec{\varTheta} )}{\lambda _{\max }(\varvec{P})},\) we have
where \(h(t)=\eta e^{-2\gamma t};\, \varvec{P}= \begin{bmatrix} \alpha \varvec{I}_{n} &{} \varvec{\varPhi }_{i} \\ \varvec{\varPhi }_{i} &{} \varvec{\varPhi }_{i} \end{bmatrix}\). Therefore, there exists a non-negative function q(t) such that \(D^{\beta }V(t)+q(t)=-\theta V(t)+h(t).\) We can obtain its solution by the Laplace transform method [44]. Then,
where \(*\) stands for the convolution between two functions,
Because the non-negative function \(q(t)\ge 0,\)\(t^{\beta -1}\ge 0\) and \(E_{\beta ,\beta }(-\theta t^\beta )\ge 0,\) we have \(q(t)*t^{\beta -1}E_{\beta ,\beta }(-\theta t^{\beta })\ge 0.\) Let \(\tau =t,\tau _{0}=\theta ^{\beta },\) therefore, \(\tau /\tau _{0}\rightarrow \infty\) when \(\tau \rightarrow \infty .\) Then, \(E_{\beta }[-(\tau /\tau _{0})^{\beta }]\sim (\tau /\tau _{0})^{-\beta }/\varGamma (1-\beta )\) from Lemma 5. Thus, \(\lim \limits _{t\rightarrow \infty }E_{\beta }(-\theta t^\beta )V(0)=0.\) It is noteworthy that \(h(t)=\eta e^{-2\gamma t}.\) Therefore, we have
where
With variable substitution,
We then denote \(\varpi (t)=\tau ^{\beta -1}E_{\beta ,\beta }(-\theta \tau ^{\beta }).\) It is obvious that \(\lim \limits _{t\rightarrow \infty }\varpi (t)=0.\) Similar to the analysis in [47], one can obtain that, \(\lim \limits _{t\rightarrow \infty }\varrho (t)=0.\) Subsequently, \(\lim \limits _{t\rightarrow \infty }V(t)=0.\) Thus, the consensus in the fractional-order MAS (6) is achieved asymptotically, implying that the position and speed of every agent will approach a time-varying common state.
Next, we will show that the Zeno behavior would be excluded. Therefore, there exists a strictly positive number such that for each \(i, i=1,2,\ldots ,N,\) we have \(t_{k+1}^{i}-t_{k}^{i}>\tau\) for all \(k\in N.\) For \(t\in [t_{k}^{i},t_{k+1}^{i}),\) letting \(\varvec{u}_{i}(t_{k}^{i},t_{k'(t)}^{j})=\sum _{j=1,j\ne i}^{N}[\varvec{R}_{ij}(\varvec{x}_{j}(t_{k'}^{j})-\varvec{x}_{i}(t_{k}^{i}))+\varvec{R}_{ij}(\varvec{v}_{j}(t_{k'}^{j})-\varvec{v}_{i}(t_{k}^{i}))],\)
Let \(\chi (t_{k}^{i},t_{k'(t)}^{j})=l_{1}||\varvec{x}_{i}(t_{k}^{i})||_{1}+(1+l_{2})||\varvec{v}_{i}(t_{k}^{i})||_{1}+||\varvec{u}_{i}(t_{k}^{i},t_{k'(t)}^{j})||_{1},\) and integrating from \(t_{k}^{i}\) to t, we obtain \(t\in [t_{k}^{i}, t_{k+1}^{i}),\)
Using \(t=t_{k+1}^{i-}\), we have
It is noteworthy that the next sampling time instant \(t_{k+1}^{i}\) will yield the following equality:
Thus, we have
i.e.,
where \(\tau =t_{k+1}^{i}-t_{k}^{i}.\) Let
Then, we have
Because \(k_{1}+k_{2}>k_{3},\) a strictly positive \(\tau\) must exist that satisfies the equality \(k_{1}+k_{2}e^{-\gamma t}= k_{3}e^{lt},\) as illustrated in Fig. 1. The Zeno behavior is excluded for all agents during the sampling process, i.e., \(t_{k+1}^{i}-t_{k}^{i}>\tau\) for all \(k\in N\) and \(i=1,2,\ldots ,N.\) The proof is completed.
When the information among the agents can be perfectly transmitted through the communication system, meaning the channel matrix is equal to an identity matrix \(\varvec{I}_{n}\), from the definitions of \(\varvec{R}_{ij},\varvec{R}_{k},\varvec{\varPhi }_{i}\) in the former part, they can be redefined as \(\varvec{R}_{ij}=a_{ij}\varvec{I}_{n}, \varvec{R}_{k}=-\varvec{L}, \varvec{\varPhi }_{i}=\xi _{i}\varvec{I}_{n},\, \text{and}\, \varvec{\varXi }_{k}=\varvec{\varXi }=\text{diag}\{\xi _{1},\xi _{2},\ldots ,\xi _{N}\},\) respectively, where \(\varvec{L}\) is the Laplacian matrix of the network. Subsequently, the fractional-order MAS by the event-trigger sampling scheme would be
Corollary 1
Suppose Assumption 1holds and\(t_{0}^{i}=t_{0}=0\) under the event condition. \(\varvec{R}_{k}\) is irreducible. Therefore, the consensus in network (21) is achieved under the designed control input if there exists a scalar \(\alpha > 0\) satisfying the following LMIs:
where
3 Simulation example
In this section, a numerical example is presented to demonstrate the effectiveness of the primary results.
Consider a 5-generator 14-bus cyber-physical power system, as shown in Fig. 2. The related data are obtained from IEEE 5-generator 14-bus standard test system. Each of the generators is assigned with an agent such that it can obtain the others information through the communication of the agents, which is shown in Fig. 3. Here, the double arrow solid line indicates the cyber network, and the single arrow solid line represents the physical network. Based on this distributed multi-agent mechanism, the power cyber networks and physical networks are effectively integrated together. Supposing that each agent (generator) contains two levels of information, i.e., \(N=5, n=2.\) The connection of each agent can be represented by \(\varvec{A}=\begin{bmatrix} 0 &{} 5 &{} 0 &{} 0 &{} 4\\ 5 &{} 0 &{} 6 &{} 7 &{} 0\\ 0 &{} 5 &{} 0 &{} 2 &{} 0\\ 0 &{} 0 &{} 5 &{} 0 &{} 6\\ 7 &{} 4 &{} 0 &{} 5 &{} 0 \end{bmatrix}.\) The channel matrices are given as below:
According to the definition of the channel Laplacian matrices, we can obtain them as follows:
Let the nonlinear dynamics of the system be given by
Combing with Assumption 1, one can obtain \(l_{1}=0.0008,l_{2}=0.0032.\) Select \(\beta =0.8, \varphi _{1}=0.00009, \varphi _{2}=1.8, \gamma =0.1, \kappa =\sigma =500\) and \(N_{M}=3.\) Using MATLAB LMI Toolbox, we can obtain a feasible solution \(\alpha =1.8031\) that satisfy the LMIs of Theorem 1. The cyber-physical power systems of the rotor angle and rotor speed are given by Figs. 4 and 5, respectively; one can find that all of the rotor angles and rotor speeds approach the common time-varying value. Figure 6 shows the event-triggered sampling instants of all five agents of the system during the time period [0, 1.5].
4 Conclusion
Herein, the consensus of the CPPS based on the fractional-order MAS with communication constraints was investigated, and a sufficient consensus condition was derived. Owing to practical limitations, only partial information could be transmitted among agents. For the energy resource conservation, the event-trigger sampling strategy was considered and the Zeno behavior of the triggered time sequence was excluded. Thus, the proposed consensus protocol of the CPPS based on the fractional-order MAS model with communication constraints was more realistic and general. Therefore, the related consensus problem was challenging. Finally, a numerical example was presented to demonstrate the validity of the theoretical results.
References
Xie L, Ilic MD (2008) Module-based modeling of cyber-physical power systems. In: Proceedings of 28th international conference on distributed computing systems workshops, Beijing, China, 17–20 June 2008, 6 pp
Zhao J, Wen F, Xue Y et al (2010) Cyber physical power systems: architecture, implementation techniques and challenges. Autom Electr Power Syst 34(16):1–7
Zhao J, Wen F, Xue Y et al (2011) Modeling analysis and control research framework of cyber physical power systems. Autom Electr Power Syst 35(16):1–8
Fallah YP, Huang C, Sengupta R et al (2010) Design of cooperative vehicle safety systems based on tight coupling of communication, computing and physical vehicle dynamics. In: Proceedings of 1st ACM/IEEE international conference on cyber-physical systems, Stockholm, Sweden, 13–15 April 2010, 9 pp
Hu JB, Li F, Wu J et al (2013) Research on aviation electric power cyber physical systems. Adv Mater Res 846–847:126–133
Dobson I, Chiang HD (1989) Towards a theory of voltage collapse in electric power systems. Syst Control Lett 13(3):253–262
Wang HO, Abed E, Hamdan AM (1994) Bifurcations, chaos, and crises in voltage collapse of a model power system. IEEE Trans Circuits Syst I Fundam Theory Appl 41(4):294–302
Hermanns H, Wiechmann H (2009) Future design challenges for electric energy supply. In: Proceedings of IEEE conference on emerging technologies and factory automation, Mallorca, Spain, 22–25 September 2009, 8 pp
Vittal E, Keane A (2012) Rotor angle stability with high penetrations of wind generation. In: Proceedings of IEEE PES general meeting, San Diego, USA, 22–26 July 2012, 1 pp
Li Y, Yong T, Cao J et al (2015) A consensus control strategy for dynamic power system look-ahead scheduling. Neurocomputing 168:1085–1093
Cong L, Wang Y (2003) Co-ordinated control of generator excitation and statcom for rotor angle stability and voltage regulation enhancement of power systems. IEE Proc Gener Transm Distrib 149(6):659–666
Ren W (2008) On consensus algorithms for double-integrator dynamics. IEEE Trans Autom Control 53(6):1503–1509
Yu W, Chen G, Cao M (2010) Some necessary and sufficient conditions for second-order consensus in multi-agent dynamical systems. Automatica 46(6):1089–1095
Fuentes-Fernndez R, Guijarro M, Pajares G (2009) A multi-agent system architecture for sensor networks. Sensors 9(12):10244–10269
Stipanovic DM, Inalhan G, Teo R et al (2004) Decentralized overlapping control of a formation of unmanned aerial vehicles. Automatica 40(8):1285–1296
Wang W, Huang C, Cao J et al (2017) Event-triggered control for sampled-data cluster formation of multi-agent systems. Neurocomputing 267:25–35
Huang S, Chu Y, Li S et al (2008) Application of multi-agent system in a microgrid. Autom Electr Power Syst 32(24):80–84
Xu Y, Liu W, Gong J (2011) Stable multi-agent-based load shedding algorithm for power systems. IEEE Trans Power Syst 26(4):2006–2014
Facchinetti T, Vedova MLD (2011) Real-time modeling for direct load control in cyber-physical power systems. IEEE Trans Ind Inform 7(4):689–698
Wang Q, Tang Y, Li F et al (2016) Coordinated scheme of under-frequency load shedding with intelligent appliances in a cyber physical power system. Energies 9(8):1–14
Wu Y, Rong L, Tang Y (2014) A distributed control method for power system rotor angle stability based on second-order consensus. In: Proceedings of 4th annual international conference on cyber technology in automation, control, and intelligent systems, Hong Kong, China, 4–7 June 2014, 6 pp
El-Khazali R, Memom Z, Tawalbeh N (2010) Fractional-order power system stabilizer. In: Proceedings of 4th IFAC workshop on fractional differentiation and applications, Badajoz, Spain, 18-20 October 2010, 6 pp
Roohi M, Haghighi AR, Aghababa MP (2015) Stabilisation of unknown fractional-order chaotic systems: an adaptive switching control strategy with application to power systems. IET Gener Transm Distrib 9(14):1883–1893
Chen L, Chai Y, Wu R et al (2012) Cluster synchronization in fractional-order complex dynamical networks. Phys Lett A 376(35):2381–2388
Norelys A, Manuel A, Javier A (2014) Lyapunov functions for fractional order systems. Commun Nonlinear Sci Numer Simul 19(9):2951–2957
Tavazoei MS, Haeri M (2009) A note on the stability of fractional order systems. Math Comput Simul 79(5):1566–1576
Yin X, Yue D, Hu S (2013) Brief paper-consensus of fractional-order heterogeneous multi-agent systems. IET Control Theory Appl 7(2):314–322
Huang C, Ho D, Lu J (2015) Partial-information-based synchronization analysis for complex dynamical networks. J Frankl Inst 352(9):3458–3475
Huang C, Ho D, Lu J (2012) Partial-information-based distributed filtering in two-targets tracking sensor networks. IEEE Trans Circuits Syst I Regul Pap 59(4):820–832
Lu J, Ding C, Lou J et al (2015) Outer synchronization of partially coupled dynamical networks via pinning impulsive controllers. J Frankl Inst 352(11):5024–5041
Fan Y, Liu L, Feng G et al (2015) Self-triggered consensus for multi-agent systems with zeno-free triggers. IEEE Trans Autom Control 60(10):2779–2784
Zhang W, Tang Y, Liu Y et al (2017) Event-triggering containment control for a class of multi-agent networks with fixed and switching topologies. IEEE Trans Circuits Syst I Regul Pap 64(3):619–629
Li L, Ho D, Lu J (2017) Event-based network consensus with communication delays. Nonlinear Dyn 87(3):1847–1858
Fan Y, Yang Y, Zhang Y (2016) Sampling-based event-triggered consensus for multi-agent systems. Neurocomputing 191:141–147
Noorbakhsh SM, Ghaisari J (2016) Distributed event-triggered consensus strategy for multi-agent systems under limited resources. Int J Control 89(1):156–168
Dimarogonas D, Frazzoli E, Johansson K (2012) Distributed event-triggered control for multi-agent systems. IEEE Trans Autom Control 57(5):1291–1297
Li H, Liao X, Huang T et al (2015) Event-triggering sampling based leader following consensus in second-order multi-agent systems. IEEE Trans Autom Control 60(7):1998–2003
Yang D, Ren W, Liu X et al (2016) Decentralized event-triggered consensus for linear multi-agent systems under general directed graphs. Automatic 69:242–249
Zhou F, Huang Z, Liu W et al (2014) An event-triggered consensus control with sampled-data mechanism for multi-agent systems. Int Fed Autom Control 47(3):6959–6964
Lc P, Dw H (2007) Remarks on fractional derivatives. Appl Math Comput 187(2):777–784
Tuglie E, Iannone S, Torelli F (2008) A coherency-based method to increase dynamic security in power systems. Electr Power Syst Res 78(8):1425–1436
Lu J, Wang Z, Cao J et al (2012) Pinning impulsive stabilization of nonlinear dynamical networks with time-varying delay. Int J Bifurc Chaos 22(7):1250176
Lu W, Chen T (2006) New approach to synchronization analysis of linearly coupled ordinary differential systems. Phys D Nonlinear Phenom 213(2):214–230
Podlubny I (1997) The Laplace transform method for linear differential equations of the fractional order. https://arxiv.org/pdf/funct-an/9710005.pdf. Accessed 30 October 1997
Li H, Chen G, Dong Z et al (2016) Consensus analysis of multiagent systems with second-order nonlinear dynamics and general directed topology: an event-triggered scheme. Inf Sci 370–371:598–622
Raberto M, Scalas E, Mainardi F (2002) Waiting-times and returns in high-frequency financial data: an empirical study. Phys A Stat Mech Its Appl 314(1–4):749–755
Wang F, Yang Y (2017) Leader-following consensus of nonlinear fractional-order multi-agent systems via event-triggered control. Int J Syst Sci 48(3):571–577
Acknowledgements
This work was jointly supported by the Research Project Supported by the Shanxi Scholarship Council of China (No. 2015044), the Fundamental Research Project of Shanxi Province (No. 2015021085), the National Science Foundation of China (No. 61603268, No. 61272530 and No. 61573096).
Author information
Authors and Affiliations
Corresponding author
Additional information
CrossCheck date: 17 August 2018
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
HUANG, C., FENG, C. & CAO, J. Consensus of cyber-physical power systems based on multi-agent systems with communication constraints. J. Mod. Power Syst. Clean Energy 7, 1081–1093 (2019). https://doi.org/10.1007/s40565-018-0491-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40565-018-0491-4