Linear programming-based stabilization and synchronization of positive complex networks with dynamic link subsystems

TL;DR

This paper presents a new method using linear programming to stabilize and synchronize complex networks with dynamic links.

Contribution

A novel coupling term and stabilization framework for positive complex networks using linear programming.

Findings

A new coupling term ensures stability and synchronization of positive complex networks.

A simulation example confirms the effectiveness of the proposed approaches.

Linear programming and copositive Lyapunov functions enable tractable design and analysis.

Abstract

This paper investigates the stabilization and synchronization of positive complex networks with dynamic links. A class of positive complex networks is constructed by introducing dynamic link between nodes. A controller and the corresponding coupling term with respect to links are designed to achieve the positivity and stability of complex networks and link systems, respectively. Then, a synchronization controller and the corresponding coupling term with respect to links and node states are proposed, respectively. The main contributions are as follows: (i) A novel coupling term is constructed to achieve stability and synchronization of positive complex networks, (ii) A stabilization and synchronization framework is constructed by designing two classes of controllers and coupling terms, and (iii) A tractable design, analysis, and computation method is introduced by virtue of linear programming and copositive Lyapunov function. Finally, a simulation example is provided to verify the effectiveness and feasibility of the proposed approaches.

Figures

The ith energy storage and transmission unit.

The network topology.

The ith node network circuit framework.

The trajectories of the states of NSs with the controller (4).

The trajectories of the states of LSs with the coupling term (21).

The state trajectories of NSs.

The state trajectories of LSs.

The trajectories of the error e(t) with the controller (35).

Equations

Full text

Introduction

Complex networks (CNs) have become the focus in the field of control theory and engineering due to their high interconnection, nonlinearity, and time-varying nature. It covers a wide range of complex systems from power systems to ecological and transportation networks [1]. In practice, there is a complex class of systems whose dynamic behavior maintains non-negativity under non-negative initial conditions. Such systems are defined as positive systems [2]. In the past few decades, positive system theory has received extensive attention due to its applicability in various fields such as economics, communications, and biology, etc. [3–5]. Due to the unique advantages of positive systems, the combination of CNs and positive systems forms positive complex networks (PCNs). This allows for good characterization and optimization of real-world systems with complex characteristics and non-negative constraints. In transportation networks, CNs formed by traffic flow can be modeled using PCNs because the traffic flow keeps non-negative. Since the power output and input are non-negative, PCNs can also be used for modeling power systems. Therefore, PCNs have potential applications in accurately capturing and analyzing real-world systems with positive dynamics and interactions.

The current research on PCNs remains in an early stage. Multiple challenges arise when combining positive systems with complex networks. First, there are essential differences in research approaches between positive and non-positive systems. The design and analysis of positive systems often require specific strategies such as co-positive Lyapunov function (CLF) and linear programming (LP) [6–8]. In addition, traditional complex networks do not consider positive constraints and the positivity of PCNs increases the complexity of the design. At present, there is a lack of a unified and efficient design framework to integrate positive system theory with complex networks. Therefore, a comprehensive framework needs to be constructed to smooth the study of PCNs. This includes not only the development of new theories and methods, but also the exploration of synchronization strategies that can effectively deal with positive constraints.

Synchronization of complex networks has attracted much attention and various synchronization frameworks have been established such as pinning synchronization [9], exponential synchronization [10], local synchronization [11], etc. [12, 13]. To effectively address the modeling and control of complex nonlinear systems, T-S fuzzy systems have emerged as a significant tool. T-S fuzzy systems characterize the behavior of the systems using a set of “IF-THEN” fuzzy rules, each corresponding to a linear subsystem [14]. This approach breaks down complex nonlinear issues into multiple local linear problems, thus the modeling and control processes are simplified. Therefore, the combination of synchronization framework and fuzzy systems can more effectively analyze and solve synchronization problems in CNs. This approach simplifies the modeling and control process by decomposing a nonlinear problem into multiple local linear problems. The cluster synchronization of fuzzy CNs with semi-Markovian switching characteristics was studied using the inequality analysis technique [15]. A fuzzy memory pinning impulsive control was proposed to solve the pinning synchronization problem of stochastic fuzzy time-delayed CNs [16]. The bipartite synchronization of signed networks with time-varying delays was solved based on fuzzy systems [17]. These studies demonstrate the wide applications and effectiveness of fuzzy systems in the synchronization problems of CNs.

In fact, the topology of the network changes in CNs due to random changes such as node failures, environmental disturbances, and machine failures. These changes can be characterized by the topological state described by the Markovian chain. Markovian jump models can effectively capture system mutations caused by random environmental disturbances and node interconnection changes. Therefore, Markovian jump systems (MJSs) are widely used to model these uncertainties and mutations in practical engineering applications. Positive MJSs (PMJSs) refer to a type of MJSs with positive characteristics [18]. So far, a large number of research results have been accumulated in the field of PMJSs. A nonlinear CLF was used to design a non-fragile saturation control of nonlinear PMJSs [19]. The event-triggered state feedback and dynamic output feedback control for PMJSs have been proposed [20]. The double sensitive fault detection filter for PMJSs is explored [21]. In the field of Markovian jump complex networks (MJCNs), synchronization is a core problem. A number of relevant research results have been reported [22–25]. Several criteria for stochastic synchronization of MJCNs were derived by constructing time-dependent Lyapunov-Krasovskii functions and applying inequality techniques [22]. Based on Lyapunov’s stability theory, a sample data controller was proposed to ensure the robust synchronization of CNs [23]. A passive synchronization criterion was established for MJCNs by combining integral inequality, free weighting matrix, and convex combination methods [24]. The finite-time synchronization problem of MJCNs was studied based on dissipative theory and a new delay-dependent finite-time stability dissipation rule was derived in the form of linear matrix inequality (LMI) [25]. The above research mainly focuses on the synchronization of MJCNs and the stochastic synthesis of PMJSs. Despite these remarkable advances, the synchronization of fuzzy positive MJCNs (PMJCNs) remains challenging.

In most results of CNs, the links between nodes are set as a fixed connection manner. Although many remarkable achievements have been made in the analysis and synthesis of nodal dynamics [26–28], the change of links should not be ignored in CNs, especially during the transmission of data, information, and material. This involves energy distribution in power systems, cargo transportation in logistics networks, and signal transmission in biological networks. By precisely controlling the state of each link, the overall performance of the network can be significantly improved [29–31]. Some important progress has been made in the study of the dynamics of positive link systems. The consensus of links in node networks was discussed [32–34], where the links of the networks were described by positive systems. The non-negative link consensus of network systems was analyzed using state feedback protocols [35]. Although the dynamic characteristics of nodes and links have been considered for CNs [36, 37], the dynamic coupling mechanism of links has not been discussed for PCNs. This paper attempts to fill this gap in the field. In addition, real systems are often affected by unpredictable internal and external factors and perturbations can affect the stability and synchronization of the system. Therefore, it is necessary to consider the perturbation in PCNs.

Inspired by the above results, this paper studies the stabilization and synchronization problems of PCNs coupled by node subsystems (NSs) and link subsystems (LSs). The main contributions of this paper are as follows: (i) A model of fuzzy PMJCNs composed of NSs and LSs coupling is proposed, (ii) A novel coupling term is designed in LSs to achieve stability and synchronization of the NSs, (iii) The L1-gain controller is designed to achieve the stochastic stability and synchronization of fuzzy PMJCNs with L1-gain performance, and (iv) A simple design and analysis approach is presented using LP and CLF. The paper is structured as follows: Some preliminaries are provided in the section of Problem formulation, the section of Main results presents the stabilization and synchronization of PCNs, an example is given in the section of Illustrative example, and the main conclusions of this paper are summarized in the section of Conclusions.

Notation The symbols $[eqn]$ and $[eqn]$ denote the set of n-dimensional real vectors and the set of n × n real matrices, respectively. $[eqn]$ represents the set of positive integers. The Kronecker product of two matrices A and B is represented as A ⊗ B. The identity matrix in $[eqn]$ is denoted by In. For a matrix A, the notation $[eqn]$ signifies its transpose and aij represents the entry at the ith row and jth column. Additionally, $[eqn]$ $[eqn]$ means that all elements aij are non-negative. A matrix is considered as Metzler if the off-diagonal elements are non-negative. Define $[eqn]$ , and the n-dimensional vector with a single entry of one at the $[eqn]$ th position is denoted by $[eqn]$ . The summation $[eqn]$ is denoted as: $[eqn]$ . 1-norm of a vector x is defined by $[eqn]$ . Given a function $[eqn]$ , its L1 norm is defined as: $[eqn]$ . Denote by the L1 space $[eqn]$ .

Problem formulation

Consider fuzzy PMJCNs with the controlled node i described as:

Rule b: IF $[eqn]$ is $[eqn]$ , $[eqn]$ is $[eqn]$ , $[eqn]$ and $[eqn]$ is $[eqn]$ , THEN

$$[eqn]$$

where $[eqn]$ , $[eqn]$ , $[eqn]$ denote state, output and control input of node i, respectively; $[eqn]$ is the time-varying weighted value of the link from node j to node i; $[eqn]$ represents the disturbance that satisfies $[eqn]$ and $[eqn]$ is given; $[eqn]$ denotes a vector-valued nonlinear function and $[eqn]$ is a coupled function; $[eqn]$ represents the jumping inner coupling configuration matrices of the system which is a positive diagonal matrix; $[eqn]$ is the coupling strength, $[eqn]$ is a Metzler matrix, $[eqn]$ , $[eqn]$ , $[eqn]$ , and $[eqn]$ ; $[eqn]$ are the premise variables; $[eqn]$ , $[eqn]$ ,..., $[eqn]$ are fuzzy sets; b is the number of IF-THEN rules and $[eqn]$ denotes the bth rule; rt indicates a continuous-time Markovian process and it represents the system mode taking numbers from a limited set $[eqn]$ , $[eqn]$ . Moreover, the transition probabilities are given by

$$[eqn]$$

where $[eqn]$ , $[eqn]$ , and $[eqn]$ ; $[eqn]$ is the transition rate of the mode jump from mode p to mode q when time goes from t to t  +  $[eqn]$ and satisfies $[eqn]$ . By the fuzzy inference method, the defuzzified fuzzy system (1) is rewritten as:

$$[eqn]$$

where $[eqn]$ is the membership function and $[eqn]$ , $[eqn]$ .

Assumption 1 The nonlinear functions f(xi(t)) and $[eqn]$ have a slope restriction:

$$[eqn]$$

where xik(t) represents the kth element of xi(t) for $[eqn]$ , $[eqn]$ , $[eqn]$ , fk(0) = 0, and hik(0) = 0.

Remark 1 Assumption 1 sets the slope constraint for the nonlinear part of the system. Such an assumption has also been applied to nonlinear problems [38–40]. Multiplying all terms of the slope inequality by (xik(t) − $[eqn]$ and choosing sk(t) = 0, the slope restriction condition is transformed into a sector inequality. The sector condition ensures that the response of the nonlinearity is kept in the first and third quadrants under given parameter conditions [41–43]. Therefore, the slope restriction is more stringent than the sector condition. Moreover, Assumption 1 can smooth the positivity of the systems.

Assumption 2 For the inner coupling function $[eqn]$ , it holds that $[eqn]$ for all $[eqn]$ and $[eqn]$ .

Remark 2 Generally, a norm bounded condition is usually used for CNs [44]. This assumption reflects the practical limitation in describing finite energy. The condition $[eqn]$ is also frequently encountered in network control issues. Thus, each element of the inner coupling function $[eqn]$ is bounded by 0 and $[eqn]$ for PCNs.

Next, some preliminaries on positive systems are introduced.

Definition 1 [2] A system is positive if for any non-negative initial conditions, inputs, and disturbances, all states and outputs are non-negative.

Definition 2 [45] The system (1) is stochastically L1 stable for the initial state $[eqn]$ and mode $[eqn]$ if the following conditions are satisfied:

(i) When $[eqn]$ , the system is stochastically stable, that is,

$$[eqn]$$

(ii) There exists a positive constant $[eqn]$ such that

$$[eqn]$$

holds for zero initial state and $[eqn]$ .

Lemma 1 [2] A matrix A is Metzler if and only if there exists a constant $[eqn]$ such that A  +  $[eqn]$ .

Lemma 2 [2] The system

$$[eqn]$$ $$[eqn]$$

is positive if and only if A is Metzler, $[eqn]$ , $[eqn]$ , and $[eqn]$ .

Main results

This section consists of two sections. First, the positivity and stochastic L1 stability of NSs and LSs are addressed by designing two different coupling terms and the corresponding controllers. Then, the synchronization of fuzzy PMJCNs is presented.

Stabilization

Assume that the stability of LSs is only affected by the topology between links and is not related to NSs. It means that the coupling term design of LSs is independent of the node state. For sake of simplicity, set rt = p. Based on the fuzzy rule, the controller ui(t) is designed as:

Rule n: IF $[eqn]$ is $[eqn]$ , $[eqn]$ is $[eqn]$ , $[eqn]$ and $[eqn]$ is $[eqn]$ , THEN

$$[eqn]$$

where Knp is the control gain matrix to be determined. Then, the defuzzified controller is rewritten as:

$$[eqn]$$

Define $[eqn]$ , $[eqn]$ $[eqn]$ , $[eqn]$ , and $[eqn]$ $[eqn]$ . By (1) and (4), and the properties of Kronecker product, the following closed-loop system is obtained:

$$[eqn]$$

The model of LSs can be expressed as:

Rule b: IF $[eqn]$ is $[eqn]$ , $[eqn]$ is $[eqn]$ , $[eqn]$ and $[eqn]$ is $[eqn]$ , THEN

$$[eqn]$$

where $[eqn]$ is the state vector of incoming links of node i, $[eqn]$ is given matrix, and $[eqn]$ is the coupling term. Using the properties of the Kronecker product, the system (6) is defuzzified into:

$$[eqn]$$

where $[eqn]$ , $[eqn]$ , and the coupling term $[eqn]$ is designed using fuzzy model:

Rule r: IF $[eqn]$ is $[eqn]$ , $[eqn]$ is $[eqn]$ , $[eqn]$ and $[eqn]$ is $[eqn]$ , THEN

$$[eqn]$$

where Krp is the control gain matrix to be determined for LSs. Then, the defuzzified coupling term is rewritten as:

$$[eqn]$$

Theorem 1 If there exist constants $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ vectors $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ vectors $[eqn]$ , $[eqn]$ , $[eqn]$ such that

$$[eqn]$$ $$[eqn]$$ $$[eqn]$$ $$[eqn]$$ $$[eqn]$$ $$[eqn]$$ $$[eqn]$$

hold for each $[eqn]$ , then the systems (5) and (7) are positive and stochastically L1 stable under the reliable controller (4) with

$$[eqn]$$

and the coupling term (8) with

$$[eqn]$$

Proof: First, the positivity of the system (7) is considered. From the coupling term (8), the system (7) can be rewritten as:

$$[eqn]$$

From (9b), (9c), and (11), we have $[eqn]$ . Thus, $[eqn]$ is Metzler by Lemma 1 and the system (7) is positive by Lemma 2. Then, the positivity of the system (5) is achieved. Using Assumption 1, it is easy to have

$$[eqn]$$

where

$$[eqn]$$

$[eqn]$ and $[eqn]$ . From (9a) and (10), it derives that $[eqn]$ . By Lemma 1, $[eqn]$ is Metzler, that is, $[eqn]$ is Metzler for $[eqn]$ . Noting the condition $[eqn]$ , it yields that $[eqn]$ for $[eqn]$ . Then, $[eqn]$ is Metzler. Since $[eqn]$ , then $[eqn]$ . Thus, we have $[eqn]$ for $[eqn]$ . Then, it is easy to give that $[eqn]$ for any initial state $[eqn]$ using recursive derivation. Therefore, the system (5) is positive by Definition 1.

Consider the following candidate CLF:

$$[eqn]$$

Then, the weak infinitesimal operator of $[eqn]$ is

$$[eqn]$$

From Assumptions 1 and 2, we have

$$[eqn]$$ $$[eqn]$$

where $[eqn]$ .

Then, it deduces that

$$[eqn]$$

By (9d), (10), and (11), it gives that

$$[eqn]$$

Consider the case $[eqn]$ . Combining (9e) and (9f) yields that

$$[eqn]$$

where $[eqn]$ and $[eqn]$ is the ith row jth column element of Cbp. Applying Dynkin’s formula to (15) gives

$$[eqn]$$

Due to $[eqn]$ , we can obtain

$$[eqn]$$ $$[eqn]$$

Therefore, the systems (5) and (7) are stochastically stable by Definition 2.

Next, consider the case $[eqn]$ . Under the zero initial condition, we have $[eqn]$ . Then,

$$[eqn]$$

By (9e) and (9f), it gives that

$$[eqn]$$ $$[eqn]$$

Then,

$$[eqn]$$

Together with (9g) gives $[eqn]$ . By Definition 2, the systems (5) and (7) are stochastically L1 stable. $[eqn]$

Remark 3 The analysis and synthesis of nodal dynamics were addressed in [26–28]. It is assumed that the coefficient of the coupling term is fixed. Indeed, the coefficient may change owing to the change of node dynamics, environmental change, and other unexpected factors. Consequently, the change will affect the stability of NSs. It is interesting to design a dynamical coupling term and explore how the links affect the behavior of the node. In Theorem 1, a controller and a coupling term are designed such that the node and the link dynamic are simultaneously positive and stable.

Remark 4 How to define the positivity of a system is key to investigate positive systems. Up to now, there is no unified framework on the positivity definition of various systems. Although there have been many results on CNs [12–16], few results are devoted to PCNs. Existing results on positive systems cannot be applied for PCNs [18–21]. Theorem 1 presents a design approach to the positivity of PCNs by designing a controller (4) and a coupling term (8). It should be noted that the coupling design of LSs is only related to the state of the link. A further consideration is that the coupling design is related to the state of the node.

In Theorem 1, the coupling design of LSs is independent of the node state. Theorem 2 will discuss the stochastic stability of fuzzy PMJCNs by designing a more general coupling term, that is, the coupling term is dependent of the node state.

Based on the fuzzy model, the LSs are expressed as follows:

Rule b: IF $[eqn]$ is $[eqn]$ , $[eqn]$ is $[eqn]$ , $[eqn]$ and $[eqn]$ is $[eqn]$ , THEN

$$[eqn]$$

where $[eqn]$ and $[eqn]$ is the coupling term for the state of the nodes. Define $[eqn]$ and $[eqn]$ . Using the properties of the Kronecker product, the system (19) is defuzzified into:

$$[eqn]$$

Then, the coupling term of LSs in relation to the state of the node is designed as:

$$[eqn]$$

where $[eqn]$ with $[eqn]$ is a given matrix.

Theorem 2 If there exist constants $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ vectors $[eqn]$ , $[eqn]$ , $[eqn]$ , and $[eqn]$ vectors $[eqn]$ , $[eqn]$ such that

$$[eqn]$$ $$[eqn]$$ $$[eqn]$$ $$[eqn]$$ $$[eqn]$$ $$[eqn]$$

hold for each $[eqn]$ , then the systems (5) and (20) are positive and stochastically L1 stable under the reliable controller (4) with (10) and the coupling term (21).

Proof: Give the initial state $[eqn]$ . From the coupling term (21), the system (20) can be rewritten at time t0 as:

$$[eqn]$$

From Assumption 2, it follows that $[eqn]$ . Then, the system (23) becomes:

$$[eqn]$$

From (22a) and Lemma 1, it is easy to have that $[eqn]$ is Metzler. Thus, it follows that $[eqn]$ given $[eqn]$ . Then, it can be readily shown that $[eqn]$ for any initial state $[eqn]$ through recursive derivation. Therefore, the system (20) is positive by Lemma 2.

Choose the stochastic CLF: $[eqn]$ , where $[eqn]$ , $[eqn]$ , and $[eqn]$ . Then, the weak infinitesimal operator of $[eqn]$ is given as:

$$[eqn]$$

Since $[eqn]$ , it yields that

$$[eqn]$$

From Assumption 1, we have that $[eqn]$ Then,

$$[eqn]$$

By (22c) and (10), it gives

$$[eqn]$$

Since $[eqn]$ , then $[eqn]$ . Therefore,

$$[eqn]$$

Consider the case $[eqn]$ . Combining (22d) and (22e) yields that

$$[eqn]$$ $$[eqn]$$

Then,

$$[eqn]$$

Applying Dynkin’s formula to (28) gives

$$[eqn]$$

Due to $[eqn]$ , it is clear that

$$[eqn]$$ $$[eqn]$$

Therefore, the systems (5) and (20) are stochastically stable by Definition 2.

Next, consider the case $[eqn]$ . Under the zero initial condition, we have $[eqn]$ . Then,

$$[eqn]$$

Using (22d) and (22e) follows that

$$[eqn]$$ $$[eqn]$$

Then,

$$[eqn]$$

By (22f), $[eqn]$ . Thus, $[eqn]$ . By Definition 2, the systems (5) and (20) are stochastically L1 stable. $[eqn]$

Remark 5 When analyzing the dynamic behavior of fuzzy PMJCNs, it is crucial to consider the dynamic characteristics of both NSs and LSs. This increases the complexity of the stability analysis. In Theorem 2, the coupling relationship is embodied in the correlation term involving the link state in NSs and the coupling term involving the node state in LSs. However, the coupling term design proposed in Theorem 1 is mainly concerned with the stability of LSs and the coupling term is independent of the node state. This design form allows us to handle link dynamics independently without considering the impact of the node state. This coupling item design is suitable for those cases that the link dynamics has a significant impact on the overall system performance, but the correlation with the node state is not strong. In contrast, the coupling term design in Theorem 2 is more general because it takes into account the effect of node states on the coupling term.

Remark 6 In this paper, the positivity of the system is taken for any initial time. Since the state equation of NSs contains the state variable of LSs, it is not feasible to prove that the state of the system is non-negative at any time directly by checking the coefficient matrix of the systems. Therefore, an indirect but rigorous method is adopted in this paper. First, it is proved that from any initial time, the coefficient matrix of the differential equation of LSs satisfies the positive system condition. Thus, the non-negativity of the state at the next time is guaranteed. We can then argue recursively that for all non-negative link initial conditions, the state of LSs will remain non-negative. Finally, it is derived that the state of NSs will also remain non-negative for any non-negative initial conditions. This method not only ensures the rigorism of the demonstration process, but also provides an effective analytical framework for verifying the positivity of complex coupled systems.

Synchronization

This section will discuss the synchronization of fuzzy PMJCNs consisting of NSs and LSs.

Let s(t) denote the state of an isolated node given by:

Rule b: IF $[eqn]$ is $[eqn]$ , $[eqn]$ is $[eqn]$ , $[eqn]$ and $[eqn]$ is $[eqn]$ , THEN

$$[eqn]$$

where $[eqn]$ , $[eqn]$ , $[eqn]$ denote state, output and control input of the isolated node, respectively; $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ are given matrices of appropriate dimensions, and it is assumed that $[eqn]$ is a Metzler matrix, $[eqn]$ , $[eqn]$ , $[eqn]$ . By the fuzzy inference method, the defuzzified fuzzy system (31) becomes

$$[eqn]$$

Based on the fuzzy model, the controller is designed as:

Rule n: IF $[eqn]$ is $[eqn]$ , $[eqn]$ is $[eqn]$ , $[eqn]$ and $[eqn]$ is $[eqn]$ , THEN

$$[eqn]$$

where $[eqn]$ is the control gain matrix for each $[eqn]$ . Then,

$$[eqn]$$

Define the synchronization error between the ith node and the isolated node: $[eqn]$ . Then,

$$[eqn]$$

where $[eqn]$ , $[eqn]$ and $[eqn]$ is the controlled output of the error systems. Based on the fuzzy model, the controller is designed as:

Rule n: IF $[eqn]$ is $[eqn]$ , $[eqn]$ is $[eqn]$ , $[eqn]$ and $[eqn]$ is $[eqn]$ , THEN

$$[eqn]$$

where Knp is the controller gain matrix. Then,

$$[eqn]$$

Define $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ $[eqn]$ . By substituting (35) into (34) and using the properties of the Kronecker product, the closed-loop system is:

$$[eqn]$$

Next, the synchronization problem of sytem (5) is transformed into the stability problem of system (36) by following theorem.

Theorem 3 If there exist constants $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ vectors $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ , and $[eqn]$ vectors $[eqn]$ , $[eqn]$ such that the conditions (10), (22c), (22e), (22f), and

$$[eqn]$$ $$[eqn]$$ $$[eqn]$$ $$[eqn]$$ $$[eqn]$$ $$[eqn]$$

hold for each $[eqn]$ , then the system (5) is positive and reaches the synchronization with L1-gain performance under the coupling term (21) and controllers (33) and (35) with

$$[eqn]$$

Proof: First, the positivity of the system (32) is proved. Give the initial state $[eqn]$ . Noting Assumption 1, it follows that $[eqn]$ by multiplying both sides of the inequality $[eqn]$ by $[eqn]$ − $[eqn]$ and choosing $[eqn]$ . Then, $[eqn]$ . From (37a) and (38), it derives that $[eqn]$ . By Lemma 1, $[eqn]$ is Metzler. Thus, it holds that $[eqn]$ for $[eqn]$ . Then, $[eqn]$ for any initial state $[eqn]$ by recursive derivation.

Next, the positivity of the error system (36) is considered. Substituting the formula (35) into (34) yields that

$$[eqn]$$

Give the initial state $[eqn]$ . Using Assumption 1, we can obtain $[eqn]$ and $[eqn]$ . Consequently, it follows that $[eqn]$ and $[eqn]$ . Thus,

$$[eqn]$$

Let $[eqn]$ , $[eqn]$ , and $[eqn]$ . Then, $[eqn]$ $[eqn]$ E(t0)  +  $[eqn]$ , where

$$[eqn]$$

$[eqn]$ , $[eqn]$ , and $[eqn]$ . From (10) and (37c), it derives that $[eqn]$ . By Lemma 1, $[eqn]$ is Metzler, that is, $[eqn]$ is Metzler for $[eqn]$ . Noting the condition $[eqn]$ , we have that $[eqn]$ for $[eqn]$ . Then, $[eqn]$ is a Metzler matrix. From (37b) and (38), it holds that $[eqn]$ . By Lemma 1, $[eqn]$ is a Metzler matrix. Owing to $[eqn]$ and $[eqn]$ , we obtain $[eqn]$ and $[eqn]$ . Thus, $[eqn]$ for $[eqn]$ . Then, $[eqn]$ for any initial state $[eqn]$ by recursive derivation. Therefore, the system (36) is positive by Lemma 2.

Choose the stochastic CLF as: $[eqn]$ , where $[eqn]$ , $[eqn]$ , and $[eqn]$ . Then, the weak infinitesimal operator of $[eqn]$ is:

$$[eqn]$$

Since $[eqn]$ , it yields that

$$[eqn]$$

From Assumption 1, we have $[eqn]$ and $[eqn]$ Then,

$$[eqn]$$

From (10), (22c), (37d), and (38), it deduces that

$$[eqn]$$

Consider the case $[eqn]$ . Combining (22e), (37e) and (37f) yields that

$$[eqn]$$ $$[eqn]$$ $$[eqn]$$

Then,

$$[eqn]$$

where $[eqn]$ and $[eqn]$ is the ith row jth column element of $[eqn]$ . Applying Dynkin’s formula to (42) yields that

$$[eqn]$$

Due to $[eqn]$ , we can obtain

$$[eqn]$$ $$[eqn]$$ $$[eqn]$$

Therefore, the system (36) is stochastically stable by Definition 2.

Next, consider the case $[eqn]$ . Under the zero initial condition, we have $[eqn]$ . Then,

$$[eqn]$$

By (22e), (37b), and (37f), it gives

$$[eqn]$$ $$[eqn]$$ $$[eqn]$$

Then,

$$[eqn]$$

Using (22f) gives $[eqn]$ . Since $[eqn]$ , then $[eqn]$ . Thus, the system (36) is stochastically L1-gain stable by Definition 2, that is, the system (5) reaches synchronization with L1-gain performance under the controller (35).

Theorem 3 proposes a synchronization framework for fuzzy PMJCNs by using the isolated node (32). In the following corollary, it is stated that the state synchronization of NSs is achieved when the coefficient matrix of the new isolated node system (46) is identical to that in NSs. Let s(t) denote the state of the isolated node given by:

Rule b: IF $[eqn]$ is $[eqn]$ , $[eqn]$ is $[eqn]$ , $[eqn]$ and $[eqn]$ is $[eqn]$ , THEN

$$[eqn]$$

By the fuzzy inference method, the defuzzified fuzzy system (45) becomes

$$[eqn]$$

Define the synchronization error between ith node and the isolated node: $[eqn]$ − $[eqn]$ . Then,

$$[eqn]$$

where $[eqn]$ . Using the properties of the Kronecker product, the closed-loop system is:

$$[eqn]$$

Corollary 1 If there exist constants $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ and $[eqn]$ vectors $[eqn]$ , $[eqn]$ , $[eqn]$ , and $[eqn]$ vectors $[eqn]$ , $[eqn]$ such that the conditions (10), (22b), (22c), (22d), (22e), and (22f) hold for each $[eqn]$ , then the system (5) reaches the synchronization with L1-gain performance.

Proof: The proof process is similar to Theorem 3 and thus it is omitted.

Remark 7 The synchronization problem of MJCNs was investigated in [22–25]. Compared with existing synchronization results, the proposed approach considers the dynamics and coupling mechanism between NSs and LSs. In order to achieve the synchronization of NSs, the design of the coupling term needs to take into account the dynamic characteristics of two classes of subsystems. In addition, the final values of the states are finite non-zero values and they are independent of initial conditions.

Remark 8 This paper focuses on the synchronization issue of PCNs, where the connectivity and the network topology evolve dynamically over time. This characteristic is reflected through the proposed LSs model. The synchronization design of traditional CNs typically employs static topological graphs to represent fixed interconnections among nodes and concentrates on the synchronization of nodal dynamic behaviors. This paper needs to consider both node dynamics and link dynamics. Therefore, the corresponding synchronization problem is more challenging. Furthermore, a core feature of positive complex networks is that the state variables remain non-negative under all non-negative initial conditions. Such a positivity constraint is generally not considered in traditional CNs.

Illustrative example

In the field of electric energy, an integrated power supply network for generation, storage, transmission and distribution is designed to meet the growing challenge of clean energy. The network consists of several nodes, such as power stations and substations, and transmission lines connecting these nodes. Fig. 1 is an energy storage and transmission unit. Fig. 2 gives the network topology through the layout of nodes and links. The isolated nodes represent an independent power generation facility, while the other nodes are connected to each other by transmission lines, forming a complex network. Fig. 3 shows a network switching electric circuit system with fuzzy Markovian parameters, where the current source E simulates the power output of the generating unit, the capacitors C1 and C2 represent the energy storage elements, and u1 and u2 are the voltages of capacitors with value C1 and C2, respectively. Together with resistors $[eqn]$ and inductors L, they form the circuit framework of the ith node network. The configuration of these components ensures the positive value of all state variables in the circuit.

The ith energy storage and transmission unit.

The network topology.

The ith node network circuit framework.

According to the Kirvchhoff law, the following equations are obtained:

$$[eqn]$$ $$[eqn]$$ $$[eqn]$$

where $[eqn]$ , and $[eqn]$ . Let $[eqn]$ , $[eqn]$ , $[eqn]$ , and the external input as $[eqn]$ . The dynamic of ith node is described as:

$$[eqn]$$

where

$$[eqn]$$ $$[eqn]$$

Take xi1(t) as the premise variable, then the normalized membership functions are $[eqn]$ , $[eqn]$ . The T-S fuzzy model is applied to model the overall network system as follows:

Rule 1: IF $[eqn]$ , THEN

$$[eqn]$$

Rule 2: IF $[eqn]$ , THEN

$$[eqn]$$

where

$$[eqn]$$ $$[eqn]$$

with $[eqn]$  +  $[eqn]$  +  $[eqn]$ , and $[eqn]$ , $[eqn]$ , $[eqn]$ , where $[eqn]$ , $[eqn]$ , and $[eqn]$ are suitable dimension matrices. Choose R0 = 1, R1 = 3, R2 = 1, R31 = 4, R32 = 5, C1 = 0.6, C2 = 0.6, L1 = 1, L2 = 2, $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ . Similarly, the LSs are modeled as $[eqn]$ , where

$$[eqn]$$ $$[eqn]$$ $$[eqn]$$ $$[eqn]$$

$[eqn]$  +  $[eqn]$ and $[eqn]$ , $[eqn]$ $[eqn]$ . The coupling strength is: $[eqn]$ . The transition rate matrix is: $[eqn]$ . The inner coupling matrix is chosen as $[eqn]$ , $[eqn]$ , $[eqn]$ , $[eqn]$ . The initial values are: $[eqn]$ and $[eqn]$ . Give $[eqn]$ , $[eqn]$ and $[eqn]$ . By Theorem 2, we obtain the control protocol gain matrices:

$$[eqn]$$ $$[eqn]$$

Figs 4 and 5 provide the simulations of the state trajectories xi(t) and Li(t),i = 1,2,3,4,5,6, respectively. It can be seen from Figs 4 and 5 that the state trajectories of nodes and links are non-negative respectively and converge asymptotically to zero. The smoothness of convergence indicates that the controller has good performance in terms of stability and response time.

The trajectories of the states of NSs with the controller (4).

The trajectories of the states of LSs with the coupling term (21).

Furthermore, the initial conditions for the isolated node and error are chosen as: $[eqn]$ and $[eqn]$ . By Corollary 1, we obtain the control protocol gain matrices:

$$[eqn]$$ $$[eqn]$$

Fig. 6 gives the simulations of the state trajectories xi(t) and $[eqn]$ , Fig. 7 is the states of LSs, and Fig. 8 shows the tracking error of the six following nodes with respect to the leader s(t) under the action of the controller (35). It can be observed from Fig. 8 that the tracking error of each node gradually approaches zero, which indicates that the synchronization controller has achieved the synchronization performance.

The state trajectories of NSs.

The state trajectories of LSs.

The trajectories of the error e(t) with the controller (35).

Conclusions

This paper constructs a novel fuzzy PMJCNs model, which describes the dynamic behavior of the network through the mutual coupling of NSs and LSs. An innovative coupling mechanism is designed. This mechanism aims to achieve the stability and synchronization performance of the PMJCNs by introducing coupling terms and related controllers. In addition, a LP method is proposed to solve all conditions. Future research will focus on further optimizing the coupling mechanism to improve the stability and synchronization performance of the PMJCNs.