Next Article in Journal
An Improved Machine Learning Model with Hybrid Technique in VANET for Robust Communication
Next Article in Special Issue
Tan-Type BLF-Based Attitude Tracking Control Design for Rigid Spacecraft with Arbitrary Disturbances
Previous Article in Journal
Research on a Risk Early Warning Mathematical Model Based on Data Mining in China’s Coal Mine Management
Previous Article in Special Issue
Trajectory Tracking Design for a Swarm of Autonomous Mobile Robots: A Nonlinear Adaptive Optimal Approach
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Robust Stabilization of Impulsive Boolean Control Networks with Function Perturbation

School of Mathematics and Statistics, Shandong Normal University, Jinan 250014, China
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(21), 4029; https://doi.org/10.3390/math10214029
Submission received: 16 September 2022 / Revised: 15 October 2022 / Accepted: 26 October 2022 / Published: 30 October 2022
(This article belongs to the Special Issue Control Problem of Nonlinear Systems with Applications)

Abstract

:
This paper studies the robust stabilization of impulsive Boolean control networks (IBCNs) with function perturbation. A Boolean control network (BCN) with a state-dependent impulsive sequence is converted to an equivalent BCN by the semi-tensor product method. Based on the equivalence of stabilization between the IBCN and the corresponding BCN, several criteria are proposed for the robust stabilization of IBCNs. Furthermore, when the IBCN is not robustly stabilizable after the function perturbation, an algorithm is presented to modify the control or the impulse-triggered set. Finally, an example is given to verify the obtained results.

1. Introduction

With the flourishing development of system biology, the investigation of gene regulatory networks has attracted considerable attention [1]. As a convenient and potential mathematical model, the Boolean network was proposed by Kauffman in 1969 [2], which is a qualitative description of gene regulatory networks. In a Boolean network, the gene expression is modelled as a Boolean variable, that is, 1 (active) or 0 (inactive). When the external binary inputs and outputs are considered, the Boolean network is naturally extended to the Boolean control network (BCN) [3]. Recently, the study of Boolean networks and BCNs has been promoted by an effective tool named the semi-tensor product of matrices [4]. A lot of interesting results have been derived, such as synchronization [5], observability [6,7], stabilization [8,9] and so on [10]. In addition, the semi-tensor product method is extensively used in game theory [11], fuzzy control [12], shift register [13] and so on.
Actually, for many biological networks, including Boolean networks and BCNs, it is common to experience abrupt changes at some instants in its evolutionary process. This is often caused by sudden changes in the interconnections of subsystems or the external environment. Therefore, characterizing this phenomenon mathematically is indispensable. One advisable method is to regard the changes as impulsive effects [14,15]. BCN with impulsive effects was introduced by Li and Sun [16]. The set controllability of IBCNs was investigated in [17]. Furthermore, Tong et al. [18] discussed the stabilization of impulsive Boolean networks with stochastic disturbances. Besides the time-triggered impulses, the impulses can also be triggered by the state. The stability of the state-triggered random impulsive Boolean networks was studied in [19]. For other results of IBCNs, see [20,21].
Another common phenomenon in the study of Boolean networks and BCNs is the gene mutation, which can be depicted by the function perturbation [22]. Recently, many outstanding results have been presented for Boolean networks with function perturbation [23,24,25]. Among these results, robust stability and stabilization are of particular importance. Wu et al. [26] studied the robust stability of switched Boolean networks with function perturbation. Ren et al. [27] addressed the robust stability in the distribution of Boolean networks under the multi-bits stochastic function perturbations.
As a fundamental issue, the stabilization of IBCNs has attracted a lot of attention. Hu et al. [28] investigated the stabilization problem for BCNs with stochastic impulses. Lin et al. [29] proposed a necessary and sufficient condition to determine the event-triggered set stabilization of IBCNs. A criterion for the stabilization of IBCNs in the hybrid domain was presented in [30]. The robust set stabilization of IBCNs was fixed in [31]. It can be seen that the study of robust stabilization of IBCNs is still lacking. When both impulse and mutation occur in the gene regulatory networks, it is meaningful to study the influence of function perturbation on the stabilization of IBCNs.
In the paper, we investigate the robust stabilization of IBCNs with function perturbation, where the impulsive sequence is dependent on the states and the function perturbation occurs at a non-impulsive instant. Furthermore, the function perturbation considered in the paper is one-bit, that is, only a truth value of a certain logical function in the update flips. Since the objective of this paper is to investigate the robustness of a given state feedback stabilizer before and after the function perturbation, we assume that the considered system is stabilizable to the fixed point before the function perturbation occurs. We propose criteria for the robust stabilization of the IBCN under a given impulse-triggered set. Furthermore, we present an algorithm to modify the control or the impulse-triggered set when the IBCN is not robustly stabilizable to a fixed point. The novelty of this paper is below:
(i)
Fewer results are available on the robust stabilization of IBCNs subject to function perturbation. When the impulse is not considered, the impact of function perturbation on the robust stabilization of BCNs was addressed in [25,26]. Compared with them, the introduction of an impulse not only affects the upper bound of convergence time but also leaves room for modification to achieve the robust stabilization of IBCNs.
(ii)
Compared with the studies for the stabilization of IBCNs [28,29], the introduction of function perturbation not only characterizes the gene mutation better but also predicts the impact of gene mutations on the stabilization.
(iii)
Furthermore, compared with [31] which presented a necessary and sufficient condition for the robust stabilization of IBCNs with the disturbance inputs, we can modify the control or the impulse-triggered set to achieve the robust stabilization of IBCNs in this paper.
The rest of this paper is organized as follows. Section 2 gives some preliminaries for the conversion from IBCNs to BCNs under a given impulse-triggered set and reviews the concept of function perturbation. Section 3 investigates the robust stabilization of IBCNs with function perturbation based on the equivalent BCN. Section 4 illustrates the obtained results with an example. The conclusion is presented in Section 5.

2. Preliminaries

The notations of this paper are listed below. D represents the set { 0 , 1 } . Denote the s-th column of identity matrix I n by C o l s ( I n ) = δ n s . Then Δ n : = { δ n s : s = 1 , , n } . Furthermore, the p × q logical matrix is denoted by F = δ p [ i 1 i q ] . The set of p × q logical matrices is represented by L p × q . Denote Φ n = d i a g { δ n 1 , , δ n n } , which satisfies z 2 = Φ n z , z Δ n . For any two matrices C R p × q and E R m × n , the semi-tensor product of C and E is defined as C E = C I η q E I η m , where η is the least common multiple of q and m.
Denote two different forms of the same object by “∼”. Then we identify 1 δ 2 1 and 0 δ 2 2 . Correspondingly, D Δ . Furthermore, we call δ 2 1 and δ 2 2 the vector form of logical variables 1 and 0, respectively.
Lemma 1
([4]). Denote a logical function by f : D n D . There exists a unique matrix F L 2 × 2 n satisfying
f ( a 1 , , a n ) = F i = 1 n a i .
Here, F is named the structure matrix of f.
Given an impulse-triggered set P D n . Consider the following IBCN with n states and m control inputs:
a i ( t + 1 ) = f i ( A ( t ) , U ( t ) ) , i = 1 , , n , t N \ Λ , a i ( t k ) = g i ( A ( t k 1 ) ) , i = 1 , , n , k Z + ,
where A ( t ) = ( a 1 ( t ) , , a n ( t ) ) D n and U ( t ) = ( u 1 ( t ) , , u m ( t ) ) D m are states and control inputs, respectively. f i : D n + m D and g i : D n D , i = 1 , , n are logical functions. Λ : = { t k 1 , k Z + } is determined by the sequence of impulsive instant { t k = t + 1 : A ( t ) P , k Z + } .
Definition 1.
Given an impulse-triggered set P D n . A e = ( a 1 e , , a n e ) D n \ P is said to be a fixed point of system (1), if for A ( t ) = A e , t N , there exists a control U ( t ) D m such that
A ( t + 1 ; A ( t ) , U ( t ) ) = A e .
Note that A e P . If A ( t ) = A e P , t N , then system (1) will update through the second equation in (1) after t . Thus, we do not discuss the case that the fixed point belongs to the given impulse-triggered set.
Definition 2.
Under the given impulse-triggered set P D n and the control sequence U = { U ( t ) , t N \ Λ } D m , system (1) is said to be stabilizable to A e D n \ P , if there exists a positive integer T such that
A ( t ; A 0 , U ) = A e
holds for any initial state A 0 D n and any integer t T .
The type of control used in this paper is the state feedback control, which is expressed as
u j ( t ) = κ j ( A ( t ) ) ,
where κ j : D n D , j = 1 , , m are logical functions.
Let a ( t ) = i = 1 n a i ( t ) Δ 2 n and u ( t ) = j = 1 m u j ( t ) Δ 2 m . With the help of Lemma 1, the algebraic state space representation of IBCN (1) is derived as
a ( t + 1 ) = F u ( t ) a ( t ) , t N \ Λ , a ( t k ) = G a ( t k 1 ) , k Z + ,
where F L 2 n × 2 m + n and G L 2 n × 2 n . Correspondingly, A e becomes a e = i = 1 n a i e . P Δ 2 n and the sequence of impulsive instant is changed to
{ t k = t + 1 : a ( t ) P , k Z + } .
In a similar manner, the algebraic form of the state feedback control (4) is obtained as
u ( t ) = K a ( t ) ,
where K L 2 m × 2 n .
In this paper, we discuss the one-bit function perturbation for system (1), occurring at a non-impulsive instant, that is, only a truth value of some function f i , i { 1 , , n } flips. Denote the function after the perturbation by f i j , j { 1 , , 2 n } , which represents that the j-th row in the truth table of f i flips [22]. Moreover, the multi-bits function perturbation for system (1) means that several truth values of f i flip [27]. The investigation of one-bit function perturbation is basic and can be used to investigate the multi-bits function perturbation for the system (1).
We aim to investigate the influence of one-bit function perturbation on the stabilization of the system (1) and explore the criteria for the robust stabilization of the system (1). If the system (1) is not robustly stabilizable, we want to modify K or P such that system (1) is stabilizable after the function perturbation.

3. Main Results

At first, we convert system (5) to a BCN under the given impulse-triggered set P Δ 2 n . Denote F = [ F 1 F 2 m ] , where F i L 2 n × 2 n , i { 1 , , 2 m } . Let F ˜ = [ F G ] = [ F 1 F 2 m G ] L 2 n × 2 n ( 2 m + 1 ) . We construct a new state feedback control expressed as
u ˜ ( t ) = K ˜ a ( t ) = δ 2 m + 1 [ k ˜ 1 k ˜ 2 n ] a ( t ) ,
where K ˜ L ( 2 m + 1 ) × 2 n .
Denote the state feedback gain matrix in (7) by K = δ 2 m [ k 1 k 2 n ] . If a ( t ) = δ 2 n i P , then k ˜ i = k i , i { 1 , , 2 n } . If a ( t ) = δ 2 n i P , then k ˜ i = 2 m + 1 . Thereby, system (5) is converted to the BCN below:
a ( t + 1 ) = F ˜ u ˜ ( t ) a ( t ) ,
where u ˜ ( t ) Δ 2 m + 1 relies on P and K.
The state feedback stabilization of BCNs was studied in [32]. Namely, system (9) is said to be stabilizable to a e Δ 2 n , if there exists a positive integer ς such that
a ( t ; a 0 , u ˜ ) = a e , t ς
holds for any initial state a 0 Δ 2 n under the given state feedback control u ˜ ( t ) = K ˜ a ( t ) , K ˜ L ( 2 m + 1 ) × 2 n . The equivalence between system (5) and system (9) is shown in the proposition below.
Proposition 1.
Given P Δ 2 n . System (5) is stabilizable to a e under the state feedback control (7), if and only if system (9) is stabilizable to a e under the state feedback control (8).
Next, we investigate the robust stabilization of the system (5) with function perturbation based on Proposition 1. Some necessary assumptions are given on the function perturbation below.
Assumption 1.
After the function perturbation, the s-th column of F k * L 2 n × 2 n is changed from δ 2 n α ( k * , s ) to some δ 2 n α ( k * , s ) Δ 2 n , where α ( k * , s ) α ( k * , s ) and k * is chosen from { 1 , , 2 m } .
Obviously, Assumption 1 guarantees that the one-bit function perturbation occurs at a non-impulsive instant. In this context, the function perturbation is always fixed by Assumption 1. Because the objective of this paper is to investigate the robustness of a given state feedback stabilizer for system (5) before and after the function perturbation, we give the assumption below.
Assumption 2.
Before the function perturbation occurs, system (5) is stabilizable to a e = δ 2 n α e Δ 2 n \ P under P Δ 2 n and the state feedback control (7).
Definition 3.
Given P Δ 2 n and the state feedback control u ( t ) = K a ( t ) , K L 2 m × 2 n , which make system (5) stabilizable to a e Δ 2 n \ P . System (5) is said to be robustly stabilizable to a e with respect to P and u, if it is still stabilizable to a e under P and u after the function perturbation.
Analogously, we define robust stabilization for system (9) as follows.
Definition 4.
Given a state feedback control u ˜ ( t ) = K ˜ a ( t ) , K ˜ L ( 2 m + 1 ) × 2 n , which makes system (9) stabilizable to a e Δ 2 n . System (9) is said to be robustly stabilizable to a e with respect to u ˜ , if it is still stabilizable to a e under u ˜ after the function perturbation.
Using (8) and (9), we obtain a closed-loop system:
a ( t + 1 ) = F ˜ u ˜ ( t ) a ( t ) = F ˜ K ˜ Φ 2 n a ( t ) .
For convenience, let G = F 2 m + 1 and then F ˜ = [ F 1 F 2 m F 2 m + 1 ] . The state transition matrix of a closed-loop system (11) is further expressed as
F ˜ K ˜ Φ 2 n = C o l 1 ( F k ˜ 1 ) C o l 2 n ( F k ˜ 2 n ) L 2 n × 2 n .
Suppose that F ˜ is changed to F ˜ = [ F 1 F 2 m F 2 m + 1 ] after the function perturbation. Denote L = F ˜ K ˜ Φ 2 n . Then L is correspondingly changed to
L = C o l 1 ( F k ˜ 1 ) C o l 2 n ( F k ˜ 2 n ) L 2 n × 2 n .
From Assumption 1, if k * = k ˜ s , then
C o l s F k ˜ s = δ 2 n α ( k * , s ) ,
and C o l j ( L ) = C o l j ( L ) , j = { 1 , , s 1 , s + 1 , , 2 n } . Otherwise, L = L . It is easy to see that under the control (8), the stabilization of system (9) is not affected by the function perturbation when k * k ˜ s . As shown in [25], system (9) is robustly stabilizable to a e under the given state feedback control u ˜ ( t ) = K ˜ a ( t ) , if k * k ˜ s .
Theorem 1.
Given an impulse-triggered set P Δ 2 n and a state feedback control (7) which make system (5) stabilizable to a e . System (5) is robustly stabilizable to a e with respect to P and control (7), if one of the following items holds: (i)  δ 2 n s P ; (ii)  δ 2 n s P and k * k s .
Proof of Theorem 1.
Under P and the state feedback control (7), we construct the corresponding system (9) with the control (8). System (9) is robustly stabilizable to a e when k * k ˜ s . Combined with the construction of control (8) and Assumption A1, k * k ˜ s for system (9) implies the following two cases for system (5):
(i)
δ 2 n s P .
(ii)
δ 2 n s P and k * k s .
Then according to Proposition 1, system (5) is robustly stabilizable to a e if one of the above two conditions holds.    □
Remark 1.
Compared with this [25], the upper bound of convergence time for the robust stabilization of IBCNs may be greater than 2 n . Therefore, the introduction of impulse brings a fundamental difference in the robust stabilization with respect to the function perturbation.
Now, we discuss the case that δ 2 n s P and k * = k s , i.e., k * = k ˜ s holds for system (9). In this case, we preferentially consider system (9). Denote the minimum positive integer ς satisfying (10) by τ . Construct the r-step reachable set with respect to a e below:
Ω 0 ( a e ) = { a e } , Ω r ( a e ) = { a : L r a = a e , L r 1 a a e } , r = 1 , , τ .
One can easily find that Ω r 1 Ω r 2 = , r 1 r 2 , where r 1 , r 2 { 0 , , τ } . Moreover, r = 0 τ Ω r ( a e ) = Δ 2 n . For convenience, the following assumption gives the sets to which δ 2 n α ( k * , s ) and δ 2 n α ( k * , s ) belong.
Assumption 3.
For system (9), δ 2 n α ( k * , s ) Ω l ( a e ) and δ 2 n α ( k * , s ) Ω l ( a e ) , where l { 1 , , τ } and l { 0 , , τ } .
Remark 2.
Assumption 3 implies δ 2 n s a e . In fact, if δ 2 n s = a e , then from Assumption 1, we have δ 2 n α ( k * , s ) δ 2 n α ( k * , s ) = a e . In this case, system (9) is not robustly stabilizable to a e with respect to control (8).
Similar to (14), we construct the r ˜ -step reachable set with respect to δ 2 n s below:
Ω 0 ( δ 2 n s ) = { δ 2 n s } , Ω r ˜ ( δ 2 n s ) = { a : L r ˜ a = δ 2 n s , L r ˜ 1 a δ 2 n s } , r ˜ = 1 , , τ l .
Let Ψ ( δ 2 n s ) = r ˜ = 0 τ l Ω r ˜ ( δ 2 n s ) . There is no intersection between Ω r ˜ 1 and Ω r ˜ 2 , r ˜ 1 r ˜ 2 , where r ˜ 1 , r ˜ 2 { 0 , , τ } .
As shown in [25], system (9) is robustly stabilizable to a e under the given state feedback control u ˜ ( t ) = K ˜ a ( t ) , if k * = k ˜ s and l l 1 . The case that k * = k ˜ s for system (9) is equivalent to that δ 2 n s P and k * = k s for system (5). Then we obtain the result as follows, which is a sufficient condition for the robust stabilization of system (5) subject to the function perturbation.
Theorem 2.
Given an impulse-triggered set P Δ 2 n and a state feedback control (7) which make system (5) is stabilizable to a e . System (5) is robustly stabilizable to a e with respect to P and control (7), if δ 2 n s P , k * = k s and l l 1 .
Note that for system (9), if k * = k ˜ s and l l 1 , the function perturbation shortens the convergence time from a ( 0 ) Ψ ( δ 2 n s ) to a e . The remaining issue is to verify the case k * = k ˜ s and l > l 1 , which may prolong the convergence time from a ( 0 ) Ψ ( δ 2 n s ) to a e .
If k * = k ˜ s and l > l 1 , it is shown in [25] that system (9) is robustly stabilizable to a e under the given state feedback control u ˜ ( t ) = K ˜ a ( t ) if and only if δ 2 n α ( k * , s ) Ψ ( δ 2 n s ) .
Theorem 3.
Given an impulse-triggered set P Δ 2 n and a state feedback control (7) which make system (5) is stabilizable to a e . If δ 2 n s P , k * = k s and l > l 1 , system (5) is robustly stabilizable to a e with respect to P and control (7), if and only if δ 2 n α ( k * , s ) Ψ ( δ 2 n s ) .
Proof of Theorem 3.
Under P and the state feedback control (7), we construct the corresponding system (9) with the control (8) and Ψ ( δ 2 n s ) . Because system (9) is robustly stabilizable to a e under the control (8) if and only if δ 2 n α ( k * , s ) Ψ ( δ 2 n s ) , when k * = k ˜ s and l > l 1 , the conclusion is immediately established based on Proposition 1.    □
When the condition mentioned in Theorem 3 does not hold, there exists a cycle (maybe a new fixed point) produced by the function perturbation. Without losing generality, we denote the cycle as
W θ = { δ 2 n α ( k * , s ) , ( L ) δ 2 n α ( k * , s ) , , ( L ) θ δ 2 n α ( k * , s ) = δ 2 n s } ,
where the length of W θ is θ + 1 and the integer 0 θ τ l . Furthermore, there exists a cycle W θ if and only if δ 2 n α ( k * , s ) Ω θ ( δ 2 n s ) . In this case, we consider modifying K or P to achieve the robust stabilization of system (5).
For system (9), from (16), if there exist an integer 0 μ θ and a state feedback control u ˜ = δ 2 m + 1 υ Δ 2 m + 1 , such that
F ˜ u ˜ δ 2 n μ Ψ ( δ 2 n s ) ,
where δ 2 n μ = ( L ) μ δ 2 n α ( k * , s ) , change K ˜ to K ˜ = δ 2 m + 1 [ k ˜ 1 k ˜ 2 n ] satisfying
k ˜ i = υ , if i = μ , k ˜ i , otherwise .
Next, we consider system (5) based on Proposition 1. If the value of υ mentioned in (18) is 2 m + 1 , let P = P { δ 2 n μ } . If υ 2 m + 1 , change K to K = δ 2 m [ k 1 k 2 n ] which satisfies
k i = υ , if i = μ , k i , otherwise .
Moreover, if υ 2 m + 1 and δ 2 n μ P , let P = P \ { δ 2 n μ } . However, we may not find an integer 0 μ θ and a state feedback control u ˜ Δ 2 m + 1 , such that (17) holds for system (9). Then from Theorem 1, let P = P { δ 2 n s } and K = K .
If system (5) is stabilizable to a e under P and K after the function perturbation, K or P is said to be modified. In what follows, we integrate the above procedures into an algorithm, which is shown in Algorithm 1. Through Algorithm 1, we can modify K or P. In addition, we analyze the complexity of the algorithm. The computational cost of calculating Ψ ( δ 2 n s ) is O ( ( τ l 1 ) 2 3 n ) . Since 0 θ τ l , the computational cost of calculating W θ is O ( ( τ l ) 2 2 n ) . The computational complexity of checking (17) is O ( ( τ l ) 2 3 n + 2 m ) . Then the computational complexity of Algorithm 1 is O ( ( τ l ) 2 3 n + 2 m ) .
Algorithm 1: Algorithm to modify K or P to achieve the robust stabilization of system (5)
  • Give an impulse-triggered set P Δ 2 n and a state feedback control (7) which make system (5) be stabilizable to a e . Suppose that δ 2 n s P , k * = k s , l > l 1 and δ 2 n α ( k * , s ) Ψ ( δ 2 n s ) .
(1)
Convert system (5) into system (9) equivalently. Then calculate Ψ ( δ 2 n s ) and W θ defined by (15) and (16), respectively;
(2)
For any integer μ { 0 , , θ } , if there exists a state feedback control u ˜ = δ 2 m + 1 υ Δ 2 m + 1 satisfying (17), let δ 2 n μ = ( L ) μ δ 2 n α ( k * , s ) . Otherwise, repeat this step until all μ { 0 , , θ }     are checked;
(3)
When υ = 2 m + 1 , let P = P δ 2 n μ . When υ 2 m + 1 , denote K = δ 2 m [ k 1 k 2 n ] where      k i = υ , if i = μ and k i = k i , if i μ . Then let K = K . Particularly, if δ 2 n μ P , let P = P \ δ 2 n μ ;
(4)
If K and P do not change, let P = P { δ 2 n s } ;
(5)
If K or P can be modified, output P and K = δ 2 m [ k 1 k 2 n ] . Otherwise, stop.
Remark 3.
Compared with [25], both K and P can be modified, which leaves more room to achieve the robust stabilization of system (5).

4. Illustrative Examples

Example 1.
Consider the IBCN, which is depicted as
a ( t + 1 ) = F u ( t ) a ( t ) , t N \ Λ , a ( t k ) = G a ( t k 1 ) , k Z + ,
where F = [ F 1 F 2 ] , F 1 = δ 8 [ 4 3 1 7 8 5 7 6 ] , F 2 = δ 8 [ 2 3 4 8 6 7 7 1 ] and G = δ 8 [ 5 4 8 3 2 1 5 6 ] . Furthermore, given an impulse-triggered set P = { δ 8 2 , δ 8 3 , δ 8 6 } and a state feedback control
u ( t ) = K a ( t ) = δ 2 [ 1 2 2 1 2 1 1 2 ] a ( t ) .
The sequence of impulsive instant is denoted by { t k = t + 1 : a ( t ) P , k Z + } . Let a e = δ 8 7 .
From Definition 1, a e is a fixed point of system (20). Let F ˜ = [ F G ] . In order to convert system (20) to system (9), we construct a state feedback control in the form of (8). Corresponding to (21), we have
u ˜ ( t ) = K ˜ a ( t ) = δ 3 [ 1 3 3 1 2 3 1 2 ] a ( t ) .
One can easily prove that system (9) is stabilizable to a e under the control (22). Then according to Proposition 1, system (20) is stabilizable to a e under the control (21).
Furthermore, for system (9), under the state feedback control (22), we obtain a closed-loop system as
a ( t + 1 ) = L a ( t ) ,
where L = F ˜ K ˜ Φ 8 = δ 8 [ 4 4 8 7 6 1 7 1 ] . After a simple calculation, we derive the following r-step reachable set with respect to a e = δ 8 7 , r = 0 , , 4 :
Ω 0 ( a e ) = { δ 8 7 } , Ω 1 ( a e ) = { δ 8 4 } , Ω 2 ( a e ) = { δ 8 1 , δ 8 2 } , Ω 3 ( a e ) = { δ 8 6 , δ 8 8 } , Ω 4 ( a e ) = { δ 8 3 , δ 8 5 } .
Then we consider the robust stabilization of system (20) subject to the following four kinds of function perturbation under the given set P and control (21):
(i)
Assume that the third column of F 2 is changed from δ 8 4 to δ 8 1 after the function perturbation. According to Theorem 1, because δ 8 3 P , system (20) is robustly stabilizable to a e = δ 8 7 with respect to P and control (21).
(ii)
Assume that the eighth column of F 1 is changed from δ 8 6 to δ 8 4 after the function perturbation. Correspondingly, s = 8 , k * = 1 , α ( 1 , 8 ) = 6 and α ( 1 , 8 ) = 4 . According to Theorem 1, since δ 8 8 P and k * k 8 = 2 , system (20) is robustly stabilizable to a e = δ 8 7 with respect to P and control (21).
(iii)
Assume that the eighth column of F 2 is changed from δ 8 1 to δ 8 4 after the function perturbation. Correspondingly, s = 8 , k * = k 8 = 2 , α ( 2 , 8 ) = 1 and α ( 2 , 8 ) = 4 . Then from (23), l = 2 and l = 1 , that is, l = l 1 . According to Theorem 2, system (20) is robustly stabilizable to a e = δ 8 7 with respect to P and control (21) (see Figure 1).
(iv)
Assume that the eighth column of F 2 is changed from δ 8 1 to δ 8 3 after the function perturbation. Correspondingly, s = 8 , k * = k 8 = 2 , α ( 2 , 8 ) = 1 and α ( 2 , 8 ) = 3 . Then l = 2 and l = 4 , that is, l > l 1 . Moreover, Ψ ( δ 8 8 ) = { δ 8 3 , δ 8 8 } . According to Theorem 3, system (20) is not robustly stabilizable to a e = δ 8 7 with respect to P and control (21) (see Figure 2).
For case (iv), we modify K to make system (20) stabilizable to a e after the function perturbation. Since the eighth column of F 2 is changed from δ 8 1 to δ 8 3 , we derive a cycle W 1 = { δ 8 3 , δ 8 8 } . Then one can find a control u ˜ = δ 3 1 such that
F ˜ u ˜ δ 8 8 = δ 8 6 Ψ ( δ 8 8 ) .
Thus, we change the state feedback control (21) to
u ( t ) = K a ( t ) = δ 2 [ 1 2 2 1 2 1 1 1 ] a ( t ) ,
under which system (20) is stabilizable to a e after the function perturbation (see Figure 3).
Example 2.
Consider the following reduced BCN model for the λ switch [33]:
a 1 ( t + 1 ) = ( ¬ a 2 ( t ) ) ( ¬ a 5 ( t ) ) , a 2 ( t + 1 ) = ( ¬ a 5 ( t ) ) ( a 2 ( t ) a 3 ( t ) ) , a 3 ( t + 1 ) = ( ¬ a 2 ( t ) ) u ( t ) ( a 1 ( t ) a 4 ( t ) ) , t N , a 4 ( t + 1 ) = ( ¬ a 2 ( t ) ) u ( t ) a 1 ( t ) , a 5 ( t + 1 ) = ( ¬ a 2 ( t ) ) ( ¬ a 3 ( t ) ) ,
where a 1 , a 2 , a 3 , a 4 , and a 5 represent the phage genes N, oI, cII, cIII, and cro, respectively. u represents the inputs. When the environmental conditions are favourable (not favourable), the value of u is 1 (0). Considering the impulsive phenomenon in the processes of gene expression of the bacterium, the impulsive Boolean network is described as [34]
a 1 ( t + 1 ) = ( a 1 ( t ) a 3 ( t ) ) a 5 ( t ) , a 2 ( t + 1 ) = ( ¬ a 1 ( t ) ) a 3 ( t ) , a 3 ( t + 1 ) = ¬ a 4 ( t ) , t = t k 1 , k Z + . a 4 ( t + 1 ) = ( a 1 ( t ) a 2 ( t ) ) a 3 ( t ) , a 5 ( t + 1 ) = a 1 ( t ) ( a 3 ( t ) a 4 ( t ) ) ,
Let a ( t ) = i = 1 5 a i ( t ) . Based on Lemma 1, we obtain the algebraic state space representation of this IBCN below:
a ( t + 1 ) = F u ( t ) a ( t ) , t N \ Λ , a ( t k ) = G a ( t k 1 ) , k Z + ,
where F = [ F 1 F 2 ] ,
F 1 = δ 32 [ 32 24 32 24 32 24 32 24 26 2 26 2 25 9 25 9 32 24 32 24 32 24 32 24 28 4 32 8 27 11 31 15 ] , F 2 = δ 32 [ 32 24 32 24 32 24 32 24 32 8 32 8 31 15 31 15 32 24 32 24 32 24 32 24 32 8 32 8 31 15 31 15 ] ,
and
G = δ 32 [ 5 21 1 17 13 29 10 26 5 21 1 17 15 31 12 28 6 22 2 18 24 8 19 3 6 22 2 18 24 8 19 3 ] .
Given an impulse-triggered set P = { δ 32 1 , δ 32 9 , δ 32 10 , δ 32 17 , δ 32 19 , δ 32 21 , δ 32 27 , δ 32 30 , δ 32 31 } , and a state feedback control
u ( t ) = K a ( t ) = δ 2 [ 1 1 1 2 2 1 1 2 1 1 1 2 2 2 1 2 1 1 1 2 2 1 2 1 1 2 1 1 1 1 2 2 ] a ( t ) .
The sequence of impulsive instant is denoted by { t k = t + 1 : a ( t ) P , k Z + } . Let a e = δ 32 24 .
From Definition 1, a e is a fixed point of system (27). Let F ˜ = [ F G ] . We construct a state feedback control in the form of (8). Corresponding to (28), we have
u ˜ ( t ) = K ˜ a ( t ) = δ 3 [ 3 1 1 2 2 1 1 2 3 3 1 2 2 2 1 2 3 1 3 2 3 1 2 1 1 2 3 1 1 3 3 2 ] a ( t ) .
According to Proposition 1, system (27) is stabilizable to a e under the control (28).
Furthermore, for system (9), under the state feedback control (29), we obtain a closed-loop system as
a ( t + 1 ) = L a ( t ) ,
where
L = F ˜ K ˜ Φ 32 = δ 32 [ 5 24 32 24 32 24 32 24 5 21 26 8 31 15 25 15 6 24 2 24 24 24 32 24 28 8 2 8 27 8 19 15 ] .
After a simple calculation, we derive the following r-step reachable sets with respect to a e , r = 0 , , 7 :
Ω 0 ( a e ) = { δ 32 24 } , Ω 1 ( a e ) = { δ 32 2 , δ 32 4 , δ 32 6 , δ 32 8 , δ 32 18 , δ 32 20 , δ 32 21 , δ 32 22 } , Ω 2 ( a e ) = { δ 32 10 , δ 32 12 , δ 32 17 , δ 32 19 , δ 32 26 , δ 32 27 , δ 32 28 , δ 32 30 } , Ω 3 ( a e ) = { δ 32 11 , δ 32 25 , δ 32 29 , δ 32 31 } , Ω 4 ( a e ) = { δ 32 13 , δ 32 15 } , Ω 5 ( a e ) = { δ 32 14 , δ 32 16 , δ 32 32 } , Ω 6 ( a e ) = { δ 32 3 , δ 32 5 , δ 32 7 , δ 32 23 } , Ω 7 ( a e ) = { δ 32 1 , δ 32 9 } .
Then we consider the robust stabilization of system (27) subject to the following two kinds of function perturbation under the given set P and control (28):
(i)
Assume that the first column of F 1 is changed from δ 32 32 to δ 32 2 after the function perturbation. According to Theorem 1, because δ 32 1 P , system (27) is robustly stabilizable to a e = δ 32 24 with respect to P and control (28).
(ii)
Assume that the twenty third column of F 2 is changed from δ 32 32 to δ 32 2 after the function perturbation. Correspondingly, s = 23 , k * = k 23 = 2 , α ( 2 , 23 ) = 32 and α ( 2 , 23 ) = 2 . Then from (30), l = 5 and l = 1 , that is, l < l 1 . According to Theorem 2, system (27) is robustly stabilizable to a e = δ 32 24 with respect to P and control (28).

5. Conclusions

Considering the living phenomena, when both impulse and mutation occur in the gene regulatory networks, it is significant to study the impact of function perturbation on the stabilization of IBCNs. In this paper, we have investigated the robust stabilization of IBCNs with function perturbation. We have given some necessary convertions, under which we have presented several criteria for the robust stabilization of IBCNs. When the considered IBCN is not robustly stabilizable after the function perturbation, we have proposed an algorithm to modify the control or the impulse-triggered set, which leaves more room to achieve the robust stabilization of IBCNs.
Compared with [25,26,28,29,31], our results can not only predict the impact of gene mutations on the stabilization but also modify the control or the impulse-triggered set to achieve the robust stabilization.
Our results are applicable to IBCNs with a small number of nodes. With the help of MATLAB toolbox (Please refer to “STP Toolbox” in “http://lsc.amss.ac.cn/~dcheng/”), these matrix-based conditions of checking the robust stabilization of IBCNs and modifying the control or the impulse-triggered set are easily operated. Future work may devote to reducing the computational complexity. Moreover, we will further discuss the robust stabilization of IBCNs with function perturbation occurring at an impulsive instant in the future work.

Author Contributions

Investigation, writing-original draft preparation, Q.S.; methodology, writing-review and editing, supervision, project administration, H.L. All authors have read and agreed to the published version of the manuscript.

Funding

The work was supported by the National Natural Science Foundation of China under grant 62073202, and the Young Experts of Taishan Scholar Project under grant tsqn201909076.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Carancini, G.; Carletti, M.; Spaletta, G. Modeling and simulation of a miRNA regulatory network of the PTEN gene. Mathematics 2021, 9, 1803. [Google Scholar] [CrossRef]
  2. Kauffman, S. Metabolic stability and epigenesis in randomly constructed genetic nets. J. Theor. Biol. 1969, 22, 437–467. [Google Scholar] [CrossRef]
  3. Akutsu, T.; Hayashida, M.; Ching, W.; Ng, M. Control of Boolean networks: Hardness results and algorithms for tree structured networks. J. Theor. Biol. 2007, 244, 670–679. [Google Scholar] [CrossRef]
  4. Cheng, D.; Qi, H.; Li, Z. Analysis and Control of Boolean Networks: A Semi-Tensor Product Approach; Springer: London, UK, 2011. [Google Scholar]
  5. Liu, Y.; Tong, L.; Lou, J.; Lu, J.; Cao, J. Sampled-data control for the synchronization of Boolean control networks. IEEE Trans. Cybern. 2019, 49, 726–732. [Google Scholar] [CrossRef]
  6. Liu, Y.; Wang, L.; Yang, Y.; Wu, Z. Minimal observability of Boolean control networks. Syst. Control. Lett. 2022, 163, 105204. [Google Scholar] [CrossRef]
  7. Li, Y.; Zhu, J. Observability decomposition of Boolean control networks. IEEE Trans. Autom. Control 2022. [Google Scholar] [CrossRef]
  8. Liu, W.; Fu, S.; Zhao, J. Set stability and set stabilization of Boolean control networks avoiding undesirable set. Mathematics 2021, 9, 2864. [Google Scholar] [CrossRef]
  9. Sun, L.; Lu, J.; Ching, W. Switching-based stabilization of aperiodic sampled-data Boolean control networks with all subsystems unstable. Front. Inf. Technol. Electron. Eng. 2020, 21, 260–267. [Google Scholar] [CrossRef]
  10. Kong, X.; Sun, Q.; Li, H. Survey on mathematical models and methods of complex logical dynamical systems. Mathematics 2022, 10, 3722. [Google Scholar] [CrossRef]
  11. Tang, Y.; Li, L.; Lu, J. Modeling and optimization for networked evolutionary games with player exit mechanism: Semi-tensor product of matrices method. Physica A 2022, 590, 126710. [Google Scholar] [CrossRef]
  12. Wang, S.; Li, H. Resolution of fuzzy relational inequalities with Boolean semi-tensor product composition. Mathematics 2021, 9, 937. [Google Scholar] [CrossRef]
  13. Gao, Z.; Feng, J. Research status of nonlinear feedback shift register based on semi-tensor product. Mathematics 2022, 10, 3538. [Google Scholar] [CrossRef]
  14. Pang, L.; Hu, C.; Yu, J.; Jiang, H. Fixed-time synchronization for fuzzy-based impulsive complex networks. Mathematics 2022, 10, 1533. [Google Scholar] [CrossRef]
  15. Hu, W. Stability of impulsive stochastic delay systems with Markovian switched delay effects. Mathematics 2022, 10, 1110. [Google Scholar] [CrossRef]
  16. Li, F.; Sun, J. Observability analysis of Boolean control networks with impulsive effects. IET Control Theory Appl. 2011, 5, 1609–1616. [Google Scholar] [CrossRef]
  17. Li, Y.; Li, J.; Feng, J. Set controllability of Boolean control networks with impulsive effects. Neurocomputing 2020, 418, 263–269. [Google Scholar] [CrossRef]
  18. Tong, L.; Liang, J. Stabilization of impulsive BNs with stochastic disturbances: An aperiodic/periodic scheme. IEEE Trans. Circuits Syst. II Express Briefs 2022, 69, 124–128. [Google Scholar] [CrossRef]
  19. Shen, Y.; Guo, Y.; Gui, W. Stability of Boolean networks with state-dependent random impulses. Front. Inf. Technol. Electron. Eng. 2021, 22, 222–231. [Google Scholar] [CrossRef]
  20. Li, Y.; Li, J.; Feng, J. Output tracking of Boolean control networks with impulsive effects. IEEE Access 2020, 8, 157793–157799. [Google Scholar] [CrossRef]
  21. Yang, J.; Lu, J.; Lou, J.; Liu, Y. Synchronization of drive-response Boolean control networks with impulsive disturbances. Appl. Math. Comput. 2020, 364, 124679. [Google Scholar] [CrossRef]
  22. Xiao, Y.; Dougherty, E. The impact of function perturbations in Boolean networks. Bioinformatics 2007, 23, 1265–1273. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  23. Li, X.; Li, H.; Li, Y.; Yang, X. Function perturbation impact on stability in distribution of probabilistic Boolean networks. Math. Comput. Simul. 2020, 177, 1–12. [Google Scholar] [CrossRef]
  24. Yang, X.; Li, H. Function perturbation impact on asymptotical stability of probabilistic Boolean networks: Changing to finite-time stability. J. Franklin Inst. 2020, 357, 10810–10827. [Google Scholar] [CrossRef]
  25. Li, X.; Li, H.; Zhao, G. Function perturbation impact on feedback stabilization of Boolean control networks. IEEE Trans. Neural Netw. Learn. Syst. 2019, 30, 2548–2554. [Google Scholar] [CrossRef]
  26. Wu, J.; Liu, Y.; Ruan, Q.; Lou, J. Robust stability of switched Boolean networks with function perturbation. Nonlinear Anal. Hybrid Syst. 2022, 46, 101216. [Google Scholar] [CrossRef]
  27. Ren, Y.; Ding, X.; Zhong, J.; Lu, J. Robust stability in distribution of Boolean networks under multi-bits stochastic function perturbations. Nonlinear Anal. Hybrid Syst. 2021, 42, 101095. [Google Scholar] [CrossRef]
  28. Hu, X.; Huang, C.; Lu, J.; Cao, J. Stabilization of Boolean control networks with stochastic impulses. J. Franklin Inst. 2019, 356, 7164–7182. [Google Scholar] [CrossRef]
  29. Lin, L.; Cao, J.; Lu, G.; Abdel-Aty, M. Set stabilization of Boolean control networks with impulsive effects: An event-triggered approach. IEEE Trans. Circuits Syst. II Express Briefs 2020, 67, 1244–1248. [Google Scholar] [CrossRef]
  30. Lin, L.; Cao, J.; Zhu, S.; Rutkowski, L.; Lu, G. Sampled-data set stabilization of impulsive Boolean networks based on a hybrid index model. IEEE Trans. Control Netw. Syst. 2020, 7, 1859–1869. [Google Scholar] [CrossRef]
  31. Xu, X.; Liu, Y.; Li, H.; Alsaadi, F. Robust set stabilization of Boolean control networks with impulsive effects. Nonlinear Anal.-Model. Control 2018, 23, 553–567. [Google Scholar]
  32. Li, R.; Yang, M.; Chu, T. State feedback stabilization for Boolean control networks. IEEE Trans. Autom. Control 2013, 58, 1853–1857. [Google Scholar] [CrossRef]
  33. Laschov, D.; Margaliot, M. Minimum-time control of Boolean networks. SIAM J. Control Optim. 2013, 51, 2869–2892. [Google Scholar]
  34. Chen, H.; Wu, B.; Lu, J. A minimum-time control for Boolean control networks with impulsive disturbances. Appl. Math. Comput. 2016, 273, 477–483. [Google Scholar]
Figure 1. The state transfer graph of system (20) under P and the control (21) with s = 8 , k * = 2 and α ( 2 , 8 ) = 4 .
Figure 1. The state transfer graph of system (20) under P and the control (21) with s = 8 , k * = 2 and α ( 2 , 8 ) = 4 .
Mathematics 10 04029 g001
Figure 2. The state transfer graph of system (20) under P and the control (21) with s = 8 , k * = 2 and α ( 2 , 8 ) = 3 .
Figure 2. The state transfer graph of system (20) under P and the control (21) with s = 8 , k * = 2 and α ( 2 , 8 ) = 3 .
Mathematics 10 04029 g002
Figure 3. The state transfer graph of system (20) under P and the control (24) with s = 8 , k * = 2 and α ( 2 , 8 ) = 3 .
Figure 3. The state transfer graph of system (20) under P and the control (24) with s = 8 , k * = 2 and α ( 2 , 8 ) = 3 .
Mathematics 10 04029 g003
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Sun, Q.; Li, H. Robust Stabilization of Impulsive Boolean Control Networks with Function Perturbation. Mathematics 2022, 10, 4029. https://doi.org/10.3390/math10214029

AMA Style

Sun Q, Li H. Robust Stabilization of Impulsive Boolean Control Networks with Function Perturbation. Mathematics. 2022; 10(21):4029. https://doi.org/10.3390/math10214029

Chicago/Turabian Style

Sun, Qilong, and Haitao Li. 2022. "Robust Stabilization of Impulsive Boolean Control Networks with Function Perturbation" Mathematics 10, no. 21: 4029. https://doi.org/10.3390/math10214029

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop