# A Switched Approach to Robust Stabilization of Multiple Coupled Networked Control Systems

Authors: Mei Yu; Nan Ding; Wen Tan; Junyan Yu
Journal: Abstract and Applied Analysis
 (2014)

---

## Abstract

This paper proposes a switched approach to robust stabilization of a collection of coupled networked controlled systems (NCSs) with node devices acting over a limited communication channel. We suppose that the state information of every subsystem is split into different packets and only one packet of the subsystem can be transmitted at a time. Multiple NCSs with norm-bounded parameter uncertainties and multiple transmissions are modeled as a periodic switched system in this paper. State feedback controllers can be constructed in terms of linear matrix inequalities. A numerical example is given to show that a collection of uncertain NCSs with the problem of limited communication can be effectively stabilized via the designed controller.


---

## Body

## 1. Introduction

Networked control systems (NCSs) are feedback control systems with network communication channels used for the communications between spatially distributed system components like sensors, actuators, and controllers. In recent years, the studies of NCSs have received increasing attention in control theory [1–4]. The use of the communication channels can reduce the costs of cables and power, simplify the installation and maintenance of the whole system, and increase the reliability. The insertion of communication network in the feedback control loop complicates the analysis and design of an NCS because many ideal assumptions made in the traditional control theory cannot be applied to NCSs directly. The traditional control theory requires that all the feedback information be obtained by the controller. Meanwhile one major problem must be solved, the limited bandwidth of the communication network. Sometimes, data packets containing full plant measurements may not be permitted to be transmitted because of limited bandwidth and this may deteriorate the system performance and destabilize the system. Examples include fleets of unmanned autonomous vehicles, wide area power system, remote planetary exploration with multiple coordinated robots, and the control of microactuator arrays. In such systems, simultaneous communication with all subsystems may not be possible because of physical or performance constraints. So how to control the NCSs via a limited communication channel is a big problem. Potential application can be found in [5–7].The problem of stabilization with finite communication bandwidth has received much attention; see, for example, [2, 8–11]. In NCSs, communication capacity depends on the topology of the network. In many cases, the communication among the devices of the network is through one communication channel as shown in Figure 1, where P
i is the plant and C
i is the corresponding controller (i
=
1
,
…
,
N). The problem of stabilization with finite communication bandwidth was introduced by [12, 13]. The switched system approach was introduced to study NCSs with multiple-packet transmission in [14, 15] and further pursued by [16, 17]. The merit of the switched approach is that the controllers can make full use of the previous information to stabilize NCSs when the current state measurements are available from the network. By switched approach, the stabilization of NCSs with multiple-packet transmissions over token-passing bus networks was considered in Yu et al. [14, 15], where sufficient conditions for stabilization and design of controllers have been obtained through modeling NCSs as periodically switched systems. Further results for single NCS were presented in Yu et al. [18–21]. Zhang and Hristu-Varsakelis [22] also studied stabilization problem of NCSs by modeling these systems as switched systems. Reference [23] studied the stability for a class of systems with time varying delay subject to controller failure, where the delay system with failed controller was modelled as a class of switched delay systems. Unfortunately, all the above literatures focused on studying NCSs without uncertainty.Figure 1
A shared network.Uncertainty is ubiquitous in control systems and it inevitably exists in system model due to the complexity of the system itself, exogenous disturbance, measurement errors, and so on. Qiu et al. [24] dealt with mode and parameter-dependent robust mixed H
2
/
H
∞ filtering design for a class of discrete-time switched polytopic linear systems. Furthermore, the problem of delay-dependent robust energy-to-peak filtering design for a class of discrete-time switched linear systems with a time-varying state delay and polytopic uncertainties was revisited in [25]. Recently, [26] studied exponential H
∞ filtering for discrete-time switched state-delay systems under asynchronous switching. Reference [27] considered the problem of robust stabilization of linear uncertain discrete-time systems via limited capacity communication channels. In [28], a class of networked control systems was investigated where the plant had time-varying norm-bounded parameter uncertainties. In [29], sufficient conditions were given to ensure the stability of uncertain NCSs using switched approach. Reference [30] studied the stability of NCSs that were subject to time-varying transmission intervals, time-varying transmission delays, and communication constraints. Reference [31] addressed the problem of stabilizing uncertain nonlinear plants over a shared limited bandwidth packet-switching network. However, all the above literatures consider performance or stabilization of single NCS, which was not coupled with any other system.Yu et al. [32] investigated stabilization of a collection of linear systems with limited information. Reference [16] further modeled multiple NCSs as a periodic switched system, with only one subsystem able to access the network to transmit all of its present state information at a time. But they did not deal with the problem of multiple packet transmission. Ding et al. [33] studied multiple networked control systems with multiple transmissions, but they did not consider uncertainties and they did not consider the two-side channel transmission. In [34, 35], Dai et al. developed a scheduling strategy for a collection of discrete-time NCSs subjected to communication constraints, which were modelled as a switched delay system. The systems they considered were not coupled.To the best of our knowledge, there is no result on the robust stabilization of a collection of coupled NCSs with multiple transmissions. Motivated by the references above, this paper will model multiple coupled NCSs with norm-bounded parameter uncertainties as switched system and then we can apply the theory of the switched system to NCSs [36, 37]. We consider the case that all the nodes act over a limited bandwidth communication channel, state information of every subsystem is split into different packets and only one packet can be transmitted at a time. Applying the toking bus protocol, the nodes are arranged logically into a ring and transmit their packets in a predetermined order. For multiple-packet transmitted NCSs with one-side channel and with both S/C and C/A network channel, we model such multiple coupled uncertain NCSs as a periodic switched system. We consider the setup with a clock-driven sensor, and both the controller and the actuator are event driven. The controller is installed to use the old state measurement if there is no new data updating. Then robust stability of the NCSs with periodic transmission is considered. State feedback controllers can be constructed in terms of linear matrix inequalities (LMIs).The remainder of this paper is structured as follows. Section2 models multiple NCSs with multipacket transmission and norm-bounded parameter uncertainties. Section 3 develops stabilization and stability results for state feedback case. Section 4 presents a numerical simulation to illustrate the efficiency and feasibility of our proposed approach. Section 5 concludes this paper.Notation. We use standard notations throughout this paper. Denote by A
T the transpose of a matrix A. A
>
0
(
A
<
0
) means that A is positive definite (negative definite). I is the identifying matrix of appropriate dimension. R
n and R
n
m denote, respectively, the n dimensional Euclidean space and the set of all n
m real matrices. In symmetric block matrices, the symbol * is used as an ellipsis for terms induced by symmetry. In token bus, the computers are connected so that the signal travels around the network from one computer to another in a logical ring. A single electronic token moves around the ring from one computer to the next. If a computer does not have information to transmit, it simply passes the token on to the next workstation.


## 2. System Modelling

We consider a finite collection of linear systems that are coupled together through their dynamics and feedback. We consider the case that the state information is transmitted over a limited bandwidth communication channel. State information of every subsystem is split into different packets and only one packet can be transmitted at a time. We first consider multiple-packet transmission NCSs with only S/C channel, illustrated in Figure2. The n coupled NCSs with norm-bounded parameter uncertainties are described by
(1)
x
i
(
k
+
1
)
=
∑
j
=
1
n
‍
(
A
i
j
+
Δ
A
i
j
)
x
j
(
k
)
+
∑
j
=
1
n
‍
(
B
i
j
+
Δ
B
i
j
)
u
j
(
k
)
,
u
i
(
k
)
=
∑
j
=
1
n
‍
F
i
j
x
¯
j
,
i
,
j
=
1,2
,
…
,
n
,
k
=
1,2
,
…
,
where x
i
(
k
)
∈
R
n and u
i
(
k
)
∈
R
p are the plant state and the plant input, respectively. x
¯
i
(
k
) is the content of the register. F
i
j is the feedback gain to be designed. A
i
j,  B
i
j are known real constant matrices with appropriate dimensions. Δ
A
i
j,  Δ
B
i
j characterize the uncertainties in the system and satisfy the following assumption:
(2)
[
Δ
A
i
j
Δ
B
i
j
]
=
E
i
j
Γ
j
(
k
)
[
G
j
H
j
]
,
where E
i
j, G
j, and H
j are known real constant matrices of appropriate dimensions, and Γ
j
(
k
) are unknown matrix functions with Lebesgue-measurable elements which satisfies
(3)
Γ
j
(
k
)
T
Γ
j
(
k
)
≤
I
,
∀
k
.Figure 2
The structure of an NCS with S/C channel.DefineA
¯
i
j
=
A
i
j
+
Δ
A
i
j, B
¯
i
j
=
B
i
j
+
Δ
B
i
j; then the networked control systems with norm-bounded parameter uncertainties are described as
(4)
x
i
(
k
+
1
)
=
∑
j
=
1
n
‍
A
¯
i
j
x
j
(
k
)
+
∑
j
=
1
n
B
¯
i
j
u
j
(
k
)
,
u
j
(
k
)
=
∑
j
=
1
n
‍
F
i
j
x
¯
j
,
i
,
j
=
1,2
,
…
,
N
,
k
=
1,2
,
…
.Suppose the state is split intod packets
(5)
x
i
(
k
)
=
[
X
i
1
T
(
k
)
,
…
,
X
i
d
T
(
k
)
]
T
,
where X
i
t
(
k
)
=
[
x
i
r
t
-
1
+
1
(
k
)
⋯
x
i
r
t
(
k
)
]
T and 1
≤
t
≤
d
0
=
r
0
<
r
1
<
⋯
<
r
d
=
n. The controller is installed to use the old state measurement if there is no new data updating. That is,
(6)
x
¯
i
(
k
)
=
[
X
¯
i
1
T
(
k
)
,
…
,
X
¯
i
d
T
(
k
)
]
T
,
where
(7)
X
¯
i
t
(
k
)
=
{
X
i
t
(
k
)
if
the
packet
containing
X
i
t
(
k
)
is
transmitted
;
X
¯
i
t
(
k
-
1
)
otherwise
.


### 2.1. An Example of Two Subsystems

For simplicity, we first consider an example of two subsystems and the plant states of each subsystem are split into two packets. Consider(8)
x
1
(
k
+
1
)
=
A
¯
11
x
1
(
k
)
+
A
¯
12
x
2
(
k
)
+
B
¯
11
u
1
(
k
)
+
B
¯
12
u
2
(
k
)
,
x
2
(
k
+
1
)
=
A
¯
21
x
1
(
k
)
+
A
¯
22
x
2
(
k
)
+
B
¯
21
u
1
(
k
)
+
B
¯
22
u
2
(
k
)
,
where x
1
(
k
)
=
[
X
11
T
(
k
)
,
X
12
T
(
k
)
]
T
,
x
2
(
k
)
=
[
X
21
T
(
k
)
,
X
22
T
(
k
)
]
T.In the standard token-passing bus protocol, the token is repeatedly transmitted in a fixed order in the network, that is,[
1
,
1
,
2
,
2
] in turn. Here, we regard different packets as different nodes for the network protocol, and this means the packets would be transmitted in a periodic manner via the network channel. With the given four-step communication cycle, the system equations will evolve according to
(9)
x
1
(
k
+
1
)
=
A
¯
11
x
1
(
k
)
+
A
¯
12
x
2
(
k
)
x
1
(
k
+
1
)
=
+
B
¯
11
F
11
[
X
11
T
(
k
)
,
X
¯
12
T
(
k
-
1
)
]
T
x
1
(
k
+
1
)
=
+
B
¯
12
F
12
[
X
¯
21
T
(
k
-
1
)
,
X
¯
22
T
(
k
-
1
)
]
T
,
x
1
(
k
+
2
)
=
A
¯
11
x
1
(
k
+
1
)
+
A
¯
12
x
2
(
k
+
1
)
x
1
(
k
+
2
)
=
+
B
¯
11
F
11
[
X
11
T
(
k
)
,
X
12
T
(
k
+
1
)
]
T
x
1
(
k
+
2
)
=
+
B
¯
12
F
12
[
X
¯
21
T
(
k
-
1
)
,
X
¯
22
T
(
k
-
1
)
]
T
,
x
1
(
k
+
3
)
=
A
¯
11
x
1
(
k
+
2
)
+
A
¯
12
x
2
(
k
+
2
)
x
1
(
k
+
3
)
=
+
B
¯
11
F
11
[
X
11
T
(
k
)
,
X
12
T
(
k
+
1
)
]
T
x
1
(
k
+
3
)
=
+
B
¯
12
F
12
[
X
21
T
(
k
+
2
)
,
X
¯
22
T
(
k
-
1
)
]
T
,
x
1
(
k
+
4
)
=
A
¯
11
x
1
(
k
+
3
)
+
A
¯
12
x
2
(
k
+
3
)
x
1
(
k
+
3
)
=
+
B
¯
11
F
11
[
X
11
T
(
k
)
,
X
12
T
(
k
+
1
)
]
T
x
1
(
k
+
3
)
=
+
B
¯
12
F
12
[
X
21
T
(
k
+
2
)
,
X
22
T
(
k
+
3
)
]
T
,
x
1
(
k
+
5
)
=
A
¯
11
x
1
(
k
+
4
)
+
A
¯
12
x
2
(
k
+
4
)
x
1
(
k
+
3
)
=
+
B
¯
11
F
11
[
X
11
T
(
k
+
4
)
,
X
12
T
(
k
+
1
)
]
T
x
1
(
k
+
3
)
=
+
B
¯
12
F
12
[
X
21
T
(
k
+
2
)
,
X
22
T
(
k
+
3
)
]
T
,
x
2
(
k
+
1
)
⋮
x
2
(
k
+
1
)
=
A
¯
21
x
1
(
k
)
+
A
¯
22
x
2
(
k
)
x
2
(
k
+
1
)
=
+
B
¯
21
F
21
[
X
11
T
(
k
)
,
X
¯
12
T
(
k
-
1
)
]
T
x
2
(
k
+
1
)
=
+
B
¯
22
F
22
[
X
¯
21
T
(
k
-
1
)
,
X
¯
22
T
(
k
-
1
)
]
T
,
x
2
(
k
+
2
)
=
A
¯
21
x
1
(
k
+
1
)
+
A
¯
22
x
2
(
k
+
1
)
x
2
(
k
+
1
)
=
+
B
¯
21
F
21
[
X
11
T
(
k
)
,
X
12
T
(
k
+
1
)
]
T
x
2
(
k
+
1
)
=
+
B
¯
22
F
22
[
X
¯
21
T
(
k
-
1
)
,
X
¯
22
T
(
k
-
1
)
]
T
,
x
2
(
k
+
3
)
=
A
¯
21
x
1
(
k
+
2
)
+
A
¯
22
x
2
(
k
+
2
)
x
2
(
k
+
1
)
=
+
B
¯
21
F
21
[
X
11
T
(
k
)
,
X
12
T
(
k
+
1
)
]
T
x
2
(
k
+
1
)
=
+
B
¯
22
F
22
[
X
21
T
(
k
+
2
)
,
X
¯
22
T
(
k
-
1
)
]
T
,
x
2
(
k
+
4
)
=
A
¯
21
x
1
(
k
+
3
)
+
A
¯
22
x
2
(
k
+
3
)
x
2
(
k
+
1
)
=
+
B
¯
21
F
21
[
X
11
T
(
k
)
,
X
12
T
(
k
+
1
)
]
T
x
2
(
k
+
1
)
=
+
B
¯
22
F
22
[
X
21
T
(
k
+
2
)
,
X
22
T
(
k
+
3
)
]
T
,
x
2
(
k
+
5
)
=
A
¯
21
x
1
(
k
+
4
)
+
A
¯
22
x
2
(
k
+
4
)
x
2
(
k
+
1
)
=
+
B
¯
21
F
21
[
X
11
T
(
k
+
4
)
,
X
12
T
(
k
+
1
)
]
T
x
2
(
k
+
1
)
=
+
B
¯
22
F
22
[
X
21
T
(
k
+
2
)
,
X
22
T
(
k
+
3
)
]
T
.
In this case, the two subsystems x
1 and x
2 are coupled and their dynamics have a periodicity of four steps. Similar to [10], define the buffered states as
(10)
x
^
1
(
k
)
=
[
x
1
(
k
-
3
)
x
1
(
k
-
2
)
x
1
(
k
-
1
)
x
1
(
k
)
]
,
x
^
2
(
k
)
=
[
x
2
(
k
-
3
)
x
2
(
k
-
2
)
x
2
(
k
-
1
)
x
2
(
k
)
]
,
x
~
=
[
x
^
1
x
^
2
]
.
Then the corresponding drift dynamics are
(11)
x
^
1
(
k
+
1
)
=
[
0
I
0
0
0
0
I
0
0
0
0
I
B
¯
11
F
11
D
10
0
0
A
¯
11
+
B
¯
11
F
11
D
11
]
x
^
1
(
k
)
x
^
1
(
k
+
1
)
=
+
[
0
0
0
0
0
0
0
0
0
0
0
0
0
B
¯
12
F
12
D
21
B
¯
12
F
12
D
20
A
¯
12
]
x
^
2
(
k
)
,
x
^
2
(
k
+
1
)
=
[
0
I
0
0
0
0
I
0
0
0
0
I
B
¯
21
F
21
D
10
0
0
A
¯
21
+
B
¯
21
F
21
D
11
]
x
^
1
(
k
)
x
^
1
(
k
+
1
)
=
+
[
0
0
0
0
0
0
0
0
0
0
0
0
0
B
¯
22
F
22
D
21
B
¯
22
F
22
D
20
A
¯
22
]
x
^
2
(
k
)
,
where
(12)
D
11
=
[
I
0
0
0
]
,
D
10
=
[
0
I
0
0
]
,
D
21
=
[
0
0
I
0
]
,
D
20
=
[
0
0
0
I
]
.The combined drift dynamics at each of the four steps of the communication sequence are(13)
x
~
(
k
+
1
)
=
M
q
x
~
(
k
)
,
where(14)
M
1
=
[
0
I
0
0
0
0
0
I
0
0
0
0
0
I
0
B
¯
11
F
11
D
10
0
0
A
¯
11
+
B
¯
11
F
11
D
11
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
B
¯
21
F
21
D
10
0
0
A
¯
21
+
B
¯
21
F
21
D
11
0
0
0
0
0
0
0
0
0
0
B
¯
12
F
12
D
21
B
¯
12
F
12
D
20
A
¯
12
I
0
0
0
I
0
0
0
I
B
¯
22
F
22
D
21
B
¯
22
F
22
D
20
A
¯
22
]
,
M
2
=
[
0
I
0
0
0
0
0
I
0
0
0
0
0
I
0
0
0
B
¯
11
F
11
D
11
A
¯
11
+
B
¯
11
F
11
D
10
B
¯
12
F
12
D
21
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
B
¯
21
F
21
D
10
A
¯
21
+
B
¯
21
F
21
D
11
B
¯
22
F
22
D
21
0
0
0
0
0
0
0
0
0
B
¯
12
F
12
D
20
0
A
¯
12
I
0
0
0
I
0
0
0
I
B
¯
22
F
22
D
20
0
A
¯
22
]
,
M
3
=
[
0
I
0
0
0
0
0
I
0
0
0
0
0
I
0
0
B
¯
11
F
11
D
11
B
¯
11
F
11
D
10
A
¯
11
B
¯
12
F
12
D
20
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
B
¯
21
F
21
D
11
B
¯
21
F
21
D
10
A
¯
21
B
¯
22
F
22
D
20
0
0
0
0
0
0
0
0
0
0
0
A
¯
12
+
B
¯
12
F
12
D
21
I
0
0
0
I
0
0
0
I
0
0
A
¯
22
+
B
¯
22
F
22
D
21
]
,
M
4
=
[
0
I
0
0
0
0
0
0
I
0
0
0
0
0
0
I
0
0
B
¯
11
F
11
D
11
B
¯
11
F
11
D
10
0
A
¯
11
0
0
0
0
0
0
0
I
0
0
0
0
0
0
0
0
0
0
0
0
B
¯
21
F
21
D
11
B
¯
21
F
21
D
10
0
A
¯
21
0
0
0
0
0
0
0
0
B
¯
12
F
12
D
21
A
¯
12
+
B
¯
12
F
12
D
20
0
0
I
0
0
I
B
¯
22
F
22
D
21
A
¯
22
+
B
¯
22
F
22
D
20
]
.Remark 1.
For data packets transmitted in both C/A and S/C channels periodically, similar model can be obtained.As shown in Figure3, x
¯
(
k
) is the received state information by the controller over S/C channel, u
(
k
), which will be sent to the system over C/A channel, is the output of the controller, and u
¯
(
k
) is the real system input. We assume that plant output and controller output are divided into d
(
d
≥
1
) packets to be transmitted. The plant input is presented as (5) and the controller output is described as
(15)
u
i
(
k
)
=
[
U
¯
i
1
T
(
k
)
,
…
,
U
¯
i
d
T
(
k
)
]
T
,
where
(16)
U
i
t
(
k
)
=
[
u
i
r
t
-
1
+
1
(
k
)
⋯
u
i
r
t
(
k
)
]
T
,
where   1
≤
t
≤
d
,
0
=
r
0
<
r
1
<
⋯
<
r
d
=
n.Figure 3
The structure of an NCS with both S/C and C/A channel.Consequently, denote(17)
u
i
(
k
)
=
[
U
i
1
T
(
k
)
,
…
,
U
i
d
T
(
k
)
]
T
,
where
(18)
U
i
t
(
k
)
=
{
U
i
t
(
k
)
,
if
the
packet
containing
U
i
t
(
k
)
is
transmitted
;
U
¯
i
t
(
k
-
1
)
,
otherwise
.
Then
(19)
u
i
(
k
)
=
∑
j
=
1
n
‍
F
i
j
[
X
¯
i
1
T
(
k
)
⋯
X
¯
i
d
T
(
k
)
]
T
,
where x
¯
i
(
k
) is defined in (6).In the case that both C/A and S/C channels are standard token-passing bus networks, the packets in the two channels would be transmitted synchronously in a periodic manner. We still study the following two subsystems and there is only one packet that can be transmitted every time:(20)
x
1
(
k
+
1
)
=
A
11
x
1
(
k
)
+
A
12
x
2
(
k
)
+
B
11
u
¯
1
(
k
)
+
B
12
u
¯
2
(
k
)
,
x
2
(
k
+
1
)
=
A
21
x
1
(
k
)
+
A
22
x
2
(
k
)
+
B
21
u
¯
1
(
k
)
+
B
22
u
¯
2
(
k
)
,
where
(21)
x
1
(
k
)
=
[
X
11
T
(
k
)
,
X
12
T
(
k
)
]
T
,
x
2
(
k
)
=
[
X
21
T
(
k
)
,
X
22
T
(
k
)
]
T
,
u
1
(
k
)
=
[
U
11
T
(
k
)
,
U
12
T
(
k
)
]
T
,
u
2
(
k
)
=
[
U
21
T
(
k
)
,
U
22
T
(
k
)
]
T
.
Suppose the packets are transmitted over the communication channel with a periodic communication sequence [
1
,
1
,
2
,
2
] in turn, the system equations will evolve according to
(22)
x
1
(
k
+
1
)
=
A
11
x
1
(
k
)
+
A
12
x
2
(
k
)
x
1
(
k
+
1
)
=
+
B
11
[
U
11
T
(
k
)
,
U
¯
12
T
(
k
-
1
)
]
T
x
1
(
k
+
1
)
=
+
B
12
[
U
¯
21
T
(
k
-
1
)
,
U
¯
22
T
(
k
-
1
)
]
T
x
1
(
k
+
1
)
=
A
11
x
1
(
k
)
+
A
12
x
2
(
k
)
x
1
(
k
+
1
)
=
+
B
11
[
F
11
X
11
T
(
k
)
,
F
11
X
¯
12
T
(
k
-
1
)
]
T
x
1
(
k
+
1
)
=
+
B
12
[
F
12
X
¯
21
T
(
k
-
1
)
,
F
12
X
¯
22
T
(
k
-
1
)
]
T
,
x
1
(
k
+
2
)
=
A
11
x
1
(
k
+
1
)
+
A
12
x
2
(
k
+
1
)
x
1
(
k
+
1
)
=
+
B
11
[
U
11
T
(
k
)
,
U
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
12
[
U
¯
21
T
(
k
-
1
)
,
U
¯
22
T
(
k
-
1
)
]
T
x
1
(
k
+
1
)
=
A
11
x
1
(
k
+
1
)
+
A
12
x
2
(
k
+
1
)
x
1
(
k
+
1
)
=
+
B
11
[
F
11
X
11
T
(
k
)
,
F
11
X
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
12
[
F
12
X
¯
21
T
(
k
-
1
)
,
F
12
X
¯
22
T
(
k
-
1
)
]
T
,
x
1
(
k
+
3
)
=
A
11
x
1
(
k
+
2
)
+
A
12
x
2
(
k
+
2
)
x
1
(
k
+
1
)
=
+
B
11
[
U
11
T
(
k
)
,
U
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
12
[
U
21
T
(
k
+
2
)
,
U
¯
22
T
(
k
-
1
)
]
T
x
1
(
k
+
1
)
=
A
11
x
1
(
k
+
2
)
+
A
12
x
2
(
k
+
2
)
x
1
(
k
+
1
)
=
+
B
11
[
F
11
X
11
T
(
k
)
,
F
11
X
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
12
[
F
12
X
21
T
(
k
+
2
)
,
F
12
X
¯
22
T
(
k
-
1
)
]
T
,
x
1
(
k
+
4
)
=
A
11
x
1
(
k
+
3
)
+
A
12
x
2
(
k
+
3
)
x
1
(
k
+
1
)
=
+
B
11
[
U
11
T
(
k
)
,
U
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
12
[
U
21
T
(
k
+
2
)
,
U
22
T
(
k
+
3
)
]
T
x
1
(
k
+
1
)
=
A
11
x
1
(
k
+
3
)
+
A
12
x
2
(
k
+
3
)
x
1
(
k
+
1
)
=
+
B
11
[
F
11
X
11
T
(
k
)
,
F
11
X
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
12
[
F
12
X
21
T
(
k
+
2
)
,
F
12
X
22
T
(
k
+
3
)
]
T
,
x
1
(
k
+
5
)
=
A
11
x
1
(
k
+
4
)
+
A
12
x
2
(
k
+
4
)
x
1
(
k
+
1
)
=
+
B
11
[
U
11
T
(
k
+
4
)
,
U
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
12
[
U
21
T
(
k
+
2
)
,
U
22
T
(
k
+
3
)
]
T
x
1
(
k
+
1
)
=
A
11
x
1
(
k
+
4
)
+
A
12
x
2
(
k
+
4
)
x
1
(
k
+
1
)
=
+
B
11
[
F
11
X
11
T
(
k
+
4
)
,
F
11
X
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
12
[
F
12
X
21
T
(
k
+
2
)
,
F
12
X
22
T
(
k
+
3
)
]
T
,
x
1
(
k
+
1
)
⋮
x
2
(
k
+
1
)
=
A
21
x
1
(
k
+
1
)
+
A
22
x
2
(
k
+
1
)
x
1
(
k
+
1
)
=
+
B
21
[
U
11
T
(
k
)
,
U
¯
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
22
[
U
¯
21
T
(
k
-
1
)
,
U
¯
22
T
(
k
-
1
)
]
T
,
x
1
(
k
+
1
)
=
A
21
x
1
(
k
)
+
A
22
x
2
(
k
)
x
1
(
k
+
1
)
=
+
B
21
[
F
21
X
11
T
(
k
)
,
F
21
X
¯
12
T
(
k
-
1
)
]
T
x
1
(
k
+
1
)
=
+
B
22
[
F
22
X
¯
21
T
(
k
-
1
)
,
F
22
X
¯
22
T
(
k
-
1
)
]
T
,
x
2
(
k
+
2
)
=
A
21
x
1
(
k
+
1
)
+
A
22
x
2
(
k
+
1
)
x
1
(
k
+
1
)
=
+
B
21
[
U
11
T
(
k
)
,
U
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
22
[
U
¯
21
T
(
k
-
1
)
,
U
¯
22
T
(
k
-
1
)
]
T
x
1
(
k
+
1
)
=
A
21
x
1
(
k
+
1
)
+
A
22
x
2
(
k
+
1
)
x
1
(
k
+
1
)
=
+
B
21
[
F
21
X
11
T
(
k
)
,
F
21
X
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
22
[
F
22
X
¯
21
T
(
k
-
1
)
,
F
22
X
¯
22
T
(
k
-
1
)
]
T
,
x
2
(
k
+
3
)
=
A
21
x
1
(
k
+
2
)
+
A
22
x
2
(
k
+
2
)
x
1
(
k
+
1
)
=
+
B
21
[
U
11
T
(
k
)
,
U
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
22
[
U
21
T
(
k
+
2
)
,
U
¯
22
T
(
k
-
1
)
]
T
x
1
(
k
+
1
)
=
A
21
x
1
(
k
+
2
)
+
A
22
x
2
(
k
+
2
)
x
1
(
k
+
1
)
=
+
B
21
[
F
21
X
11
T
(
k
)
,
F
21
X
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
22
[
F
22
X
21
T
(
k
+
2
)
,
F
22
X
¯
22
T
(
k
-
1
)
]
T
,
x
2
(
k
+
4
)
=
A
21
x
1
(
k
+
3
)
+
A
22
x
2
(
k
+
3
)
x
1
(
k
+
1
)
=
+
B
21
[
U
11
T
(
k
)
,
U
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
22
[
U
21
T
(
k
+
2
)
,
U
22
T
(
k
+
3
)
]
T
x
1
(
k
+
1
)
=
A
21
x
1
(
k
+
3
)
+
A
22
x
2
(
k
+
3
)
x
1
(
k
+
1
)
=
+
B
21
[
F
21
X
11
T
(
k
)
,
F
21
X
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
22
[
F
22
X
21
T
(
k
+
2
)
,
F
22
X
22
T
(
k
+
3
)
]
T
,
x
2
(
k
+
5
)
=
A
21
x
1
(
k
+
4
)
+
A
22
x
2
(
k
+
4
)
x
1
(
k
+
1
)
=
+
B
21
[
U
11
T
(
k
+
4
)
,
U
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
22
[
U
21
T
(
k
+
2
)
,
U
22
T
(
k
+
3
)
]
T
x
1
(
k
+
1
)
=
A
21
x
1
(
k
+
4
)
+
A
22
x
2
(
k
+
4
)
x
1
(
k
+
1
)
=
+
B
21
[
F
21
X
11
T
(
k
+
4
)
,
F
21
X
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
22
[
F
22
X
21
T
(
k
+
2
)
,
F
22
X
22
T
(
k
+
3
)
]
T
.Using the definition of the buffered states (10), we still obtain the evolution equation (13).


### 2.2. The General Case

Similarly, if the states of each subsystem are split intod packets and the packets are transmitted in a periodic pattern, we can obtain the general case.Supposex
~
=
[
x
^
1
T
⋯
x
^
n
T
]
T
,
x
^
i contains past state values for each step in the communication sequence and x
^
i
=
[
x
i
T
(
k
-
p
+
1
)
⋯
x
i
T
(
k
)
]
Tand p is the length of communication sequence. To describe the general case, we define an integer matrix, T, that contains an update sequence for each subsystem’s packet. The matrix T will have n rows (one for each subsystem) and p columns. The (
i
,
j
)
th entry of T will denote the number of steps from the j
th step of the communication sequence to the next communication with the i
th subsystem. Define A
~
i
j
=
J
p
⊗
I
+
∑
j
=
1
n
‍
(
E
n
,
n
⊗
A
i
j
), Δ
A
~
i
j
=
∑
j
=
1
n
‍
E
n
,
n
⊗
Δ
A
i
j, where J
p is the p
×
p Jordan matrix composed of all zeros except for ones on the superdiagonal; E
i
,
j is a matrix of zeros with a one in the (
i
,
j
)
th position. Define
(23)
D
j
q
=
[
0
⋱
0
I
(
r
j
-
r
j
-
1
)
q
0
⋱
0
]
,
F
~
i
j
q
=
E
n
,
T
j
q
⊗
B
i
j
F
i
j
D
j
q, and Δ
F
~
i
j
q
=
E
n
,
T
j
q
⊗
Δ
B
i
j
F
i
j
D
j
q, which is related to the feedback gains for subsystem i at the q
th step in the communication sequence. Now, at each sequence step, q
=
1
,
…
,
p, we can write the evolution of all subsystems as
(24)
x
~
(
k
+
1
)
=
M
q
x
~
(
k
)
,
k
∈
{
n
p
+
q
}
,
where
(25)
M
q
=
[
A
~
11
⋯
A
~
1
n
⋮
⋱
⋮
A
~
n
1
⋯
A
~
n
n
]
+
[
Δ
A
~
11
⋯
Δ
A
~
1
n
⋮
⋱
⋮
Δ
A
~
n
1
⋯
Δ
A
~
n
n
]
+
[
F
~
11
q
⋯
F
~
1
n
q
⋮
⋱
⋮
F
~
n
1
q
⋯
F
~
n
n
q
]
+
[
Δ
F
~
11
q
⋯
Δ
F
~
1
n
q
⋮
⋱
⋮
Δ
F
~
n
1
q
⋯
Δ
F
~
n
n
q
]
.Remark 2.
This paper models uncertain coupled NCSs with multiple packet transmission as switched system. The transmission pattern of the NCSs is closely related to the switching law of the switched system. This switched model not only enables us to design the controller for the NCSs, but also makes it more convenient to deal with the uncertain part.


## 2.1. An Example of Two Subsystems

For simplicity, we first consider an example of two subsystems and the plant states of each subsystem are split into two packets. Consider(8)
x
1
(
k
+
1
)
=
A
¯
11
x
1
(
k
)
+
A
¯
12
x
2
(
k
)
+
B
¯
11
u
1
(
k
)
+
B
¯
12
u
2
(
k
)
,
x
2
(
k
+
1
)
=
A
¯
21
x
1
(
k
)
+
A
¯
22
x
2
(
k
)
+
B
¯
21
u
1
(
k
)
+
B
¯
22
u
2
(
k
)
,
where x
1
(
k
)
=
[
X
11
T
(
k
)
,
X
12
T
(
k
)
]
T
,
x
2
(
k
)
=
[
X
21
T
(
k
)
,
X
22
T
(
k
)
]
T.In the standard token-passing bus protocol, the token is repeatedly transmitted in a fixed order in the network, that is,[
1
,
1
,
2
,
2
] in turn. Here, we regard different packets as different nodes for the network protocol, and this means the packets would be transmitted in a periodic manner via the network channel. With the given four-step communication cycle, the system equations will evolve according to
(9)
x
1
(
k
+
1
)
=
A
¯
11
x
1
(
k
)
+
A
¯
12
x
2
(
k
)
x
1
(
k
+
1
)
=
+
B
¯
11
F
11
[
X
11
T
(
k
)
,
X
¯
12
T
(
k
-
1
)
]
T
x
1
(
k
+
1
)
=
+
B
¯
12
F
12
[
X
¯
21
T
(
k
-
1
)
,
X
¯
22
T
(
k
-
1
)
]
T
,
x
1
(
k
+
2
)
=
A
¯
11
x
1
(
k
+
1
)
+
A
¯
12
x
2
(
k
+
1
)
x
1
(
k
+
2
)
=
+
B
¯
11
F
11
[
X
11
T
(
k
)
,
X
12
T
(
k
+
1
)
]
T
x
1
(
k
+
2
)
=
+
B
¯
12
F
12
[
X
¯
21
T
(
k
-
1
)
,
X
¯
22
T
(
k
-
1
)
]
T
,
x
1
(
k
+
3
)
=
A
¯
11
x
1
(
k
+
2
)
+
A
¯
12
x
2
(
k
+
2
)
x
1
(
k
+
3
)
=
+
B
¯
11
F
11
[
X
11
T
(
k
)
,
X
12
T
(
k
+
1
)
]
T
x
1
(
k
+
3
)
=
+
B
¯
12
F
12
[
X
21
T
(
k
+
2
)
,
X
¯
22
T
(
k
-
1
)
]
T
,
x
1
(
k
+
4
)
=
A
¯
11
x
1
(
k
+
3
)
+
A
¯
12
x
2
(
k
+
3
)
x
1
(
k
+
3
)
=
+
B
¯
11
F
11
[
X
11
T
(
k
)
,
X
12
T
(
k
+
1
)
]
T
x
1
(
k
+
3
)
=
+
B
¯
12
F
12
[
X
21
T
(
k
+
2
)
,
X
22
T
(
k
+
3
)
]
T
,
x
1
(
k
+
5
)
=
A
¯
11
x
1
(
k
+
4
)
+
A
¯
12
x
2
(
k
+
4
)
x
1
(
k
+
3
)
=
+
B
¯
11
F
11
[
X
11
T
(
k
+
4
)
,
X
12
T
(
k
+
1
)
]
T
x
1
(
k
+
3
)
=
+
B
¯
12
F
12
[
X
21
T
(
k
+
2
)
,
X
22
T
(
k
+
3
)
]
T
,
x
2
(
k
+
1
)
⋮
x
2
(
k
+
1
)
=
A
¯
21
x
1
(
k
)
+
A
¯
22
x
2
(
k
)
x
2
(
k
+
1
)
=
+
B
¯
21
F
21
[
X
11
T
(
k
)
,
X
¯
12
T
(
k
-
1
)
]
T
x
2
(
k
+
1
)
=
+
B
¯
22
F
22
[
X
¯
21
T
(
k
-
1
)
,
X
¯
22
T
(
k
-
1
)
]
T
,
x
2
(
k
+
2
)
=
A
¯
21
x
1
(
k
+
1
)
+
A
¯
22
x
2
(
k
+
1
)
x
2
(
k
+
1
)
=
+
B
¯
21
F
21
[
X
11
T
(
k
)
,
X
12
T
(
k
+
1
)
]
T
x
2
(
k
+
1
)
=
+
B
¯
22
F
22
[
X
¯
21
T
(
k
-
1
)
,
X
¯
22
T
(
k
-
1
)
]
T
,
x
2
(
k
+
3
)
=
A
¯
21
x
1
(
k
+
2
)
+
A
¯
22
x
2
(
k
+
2
)
x
2
(
k
+
1
)
=
+
B
¯
21
F
21
[
X
11
T
(
k
)
,
X
12
T
(
k
+
1
)
]
T
x
2
(
k
+
1
)
=
+
B
¯
22
F
22
[
X
21
T
(
k
+
2
)
,
X
¯
22
T
(
k
-
1
)
]
T
,
x
2
(
k
+
4
)
=
A
¯
21
x
1
(
k
+
3
)
+
A
¯
22
x
2
(
k
+
3
)
x
2
(
k
+
1
)
=
+
B
¯
21
F
21
[
X
11
T
(
k
)
,
X
12
T
(
k
+
1
)
]
T
x
2
(
k
+
1
)
=
+
B
¯
22
F
22
[
X
21
T
(
k
+
2
)
,
X
22
T
(
k
+
3
)
]
T
,
x
2
(
k
+
5
)
=
A
¯
21
x
1
(
k
+
4
)
+
A
¯
22
x
2
(
k
+
4
)
x
2
(
k
+
1
)
=
+
B
¯
21
F
21
[
X
11
T
(
k
+
4
)
,
X
12
T
(
k
+
1
)
]
T
x
2
(
k
+
1
)
=
+
B
¯
22
F
22
[
X
21
T
(
k
+
2
)
,
X
22
T
(
k
+
3
)
]
T
.
In this case, the two subsystems x
1 and x
2 are coupled and their dynamics have a periodicity of four steps. Similar to [10], define the buffered states as
(10)
x
^
1
(
k
)
=
[
x
1
(
k
-
3
)
x
1
(
k
-
2
)
x
1
(
k
-
1
)
x
1
(
k
)
]
,
x
^
2
(
k
)
=
[
x
2
(
k
-
3
)
x
2
(
k
-
2
)
x
2
(
k
-
1
)
x
2
(
k
)
]
,
x
~
=
[
x
^
1
x
^
2
]
.
Then the corresponding drift dynamics are
(11)
x
^
1
(
k
+
1
)
=
[
0
I
0
0
0
0
I
0
0
0
0
I
B
¯
11
F
11
D
10
0
0
A
¯
11
+
B
¯
11
F
11
D
11
]
x
^
1
(
k
)
x
^
1
(
k
+
1
)
=
+
[
0
0
0
0
0
0
0
0
0
0
0
0
0
B
¯
12
F
12
D
21
B
¯
12
F
12
D
20
A
¯
12
]
x
^
2
(
k
)
,
x
^
2
(
k
+
1
)
=
[
0
I
0
0
0
0
I
0
0
0
0
I
B
¯
21
F
21
D
10
0
0
A
¯
21
+
B
¯
21
F
21
D
11
]
x
^
1
(
k
)
x
^
1
(
k
+
1
)
=
+
[
0
0
0
0
0
0
0
0
0
0
0
0
0
B
¯
22
F
22
D
21
B
¯
22
F
22
D
20
A
¯
22
]
x
^
2
(
k
)
,
where
(12)
D
11
=
[
I
0
0
0
]
,
D
10
=
[
0
I
0
0
]
,
D
21
=
[
0
0
I
0
]
,
D
20
=
[
0
0
0
I
]
.The combined drift dynamics at each of the four steps of the communication sequence are(13)
x
~
(
k
+
1
)
=
M
q
x
~
(
k
)
,
where(14)
M
1
=
[
0
I
0
0
0
0
0
I
0
0
0
0
0
I
0
B
¯
11
F
11
D
10
0
0
A
¯
11
+
B
¯
11
F
11
D
11
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
B
¯
21
F
21
D
10
0
0
A
¯
21
+
B
¯
21
F
21
D
11
0
0
0
0
0
0
0
0
0
0
B
¯
12
F
12
D
21
B
¯
12
F
12
D
20
A
¯
12
I
0
0
0
I
0
0
0
I
B
¯
22
F
22
D
21
B
¯
22
F
22
D
20
A
¯
22
]
,
M
2
=
[
0
I
0
0
0
0
0
I
0
0
0
0
0
I
0
0
0
B
¯
11
F
11
D
11
A
¯
11
+
B
¯
11
F
11
D
10
B
¯
12
F
12
D
21
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
B
¯
21
F
21
D
10
A
¯
21
+
B
¯
21
F
21
D
11
B
¯
22
F
22
D
21
0
0
0
0
0
0
0
0
0
B
¯
12
F
12
D
20
0
A
¯
12
I
0
0
0
I
0
0
0
I
B
¯
22
F
22
D
20
0
A
¯
22
]
,
M
3
=
[
0
I
0
0
0
0
0
I
0
0
0
0
0
I
0
0
B
¯
11
F
11
D
11
B
¯
11
F
11
D
10
A
¯
11
B
¯
12
F
12
D
20
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
B
¯
21
F
21
D
11
B
¯
21
F
21
D
10
A
¯
21
B
¯
22
F
22
D
20
0
0
0
0
0
0
0
0
0
0
0
A
¯
12
+
B
¯
12
F
12
D
21
I
0
0
0
I
0
0
0
I
0
0
A
¯
22
+
B
¯
22
F
22
D
21
]
,
M
4
=
[
0
I
0
0
0
0
0
0
I
0
0
0
0
0
0
I
0
0
B
¯
11
F
11
D
11
B
¯
11
F
11
D
10
0
A
¯
11
0
0
0
0
0
0
0
I
0
0
0
0
0
0
0
0
0
0
0
0
B
¯
21
F
21
D
11
B
¯
21
F
21
D
10
0
A
¯
21
0
0
0
0
0
0
0
0
B
¯
12
F
12
D
21
A
¯
12
+
B
¯
12
F
12
D
20
0
0
I
0
0
I
B
¯
22
F
22
D
21
A
¯
22
+
B
¯
22
F
22
D
20
]
.Remark 1.
For data packets transmitted in both C/A and S/C channels periodically, similar model can be obtained.As shown in Figure3, x
¯
(
k
) is the received state information by the controller over S/C channel, u
(
k
), which will be sent to the system over C/A channel, is the output of the controller, and u
¯
(
k
) is the real system input. We assume that plant output and controller output are divided into d
(
d
≥
1
) packets to be transmitted. The plant input is presented as (5) and the controller output is described as
(15)
u
i
(
k
)
=
[
U
¯
i
1
T
(
k
)
,
…
,
U
¯
i
d
T
(
k
)
]
T
,
where
(16)
U
i
t
(
k
)
=
[
u
i
r
t
-
1
+
1
(
k
)
⋯
u
i
r
t
(
k
)
]
T
,
where   1
≤
t
≤
d
,
0
=
r
0
<
r
1
<
⋯
<
r
d
=
n.Figure 3
The structure of an NCS with both S/C and C/A channel.Consequently, denote(17)
u
i
(
k
)
=
[
U
i
1
T
(
k
)
,
…
,
U
i
d
T
(
k
)
]
T
,
where
(18)
U
i
t
(
k
)
=
{
U
i
t
(
k
)
,
if
the
packet
containing
U
i
t
(
k
)
is
transmitted
;
U
¯
i
t
(
k
-
1
)
,
otherwise
.
Then
(19)
u
i
(
k
)
=
∑
j
=
1
n
‍
F
i
j
[
X
¯
i
1
T
(
k
)
⋯
X
¯
i
d
T
(
k
)
]
T
,
where x
¯
i
(
k
) is defined in (6).In the case that both C/A and S/C channels are standard token-passing bus networks, the packets in the two channels would be transmitted synchronously in a periodic manner. We still study the following two subsystems and there is only one packet that can be transmitted every time:(20)
x
1
(
k
+
1
)
=
A
11
x
1
(
k
)
+
A
12
x
2
(
k
)
+
B
11
u
¯
1
(
k
)
+
B
12
u
¯
2
(
k
)
,
x
2
(
k
+
1
)
=
A
21
x
1
(
k
)
+
A
22
x
2
(
k
)
+
B
21
u
¯
1
(
k
)
+
B
22
u
¯
2
(
k
)
,
where
(21)
x
1
(
k
)
=
[
X
11
T
(
k
)
,
X
12
T
(
k
)
]
T
,
x
2
(
k
)
=
[
X
21
T
(
k
)
,
X
22
T
(
k
)
]
T
,
u
1
(
k
)
=
[
U
11
T
(
k
)
,
U
12
T
(
k
)
]
T
,
u
2
(
k
)
=
[
U
21
T
(
k
)
,
U
22
T
(
k
)
]
T
.
Suppose the packets are transmitted over the communication channel with a periodic communication sequence [
1
,
1
,
2
,
2
] in turn, the system equations will evolve according to
(22)
x
1
(
k
+
1
)
=
A
11
x
1
(
k
)
+
A
12
x
2
(
k
)
x
1
(
k
+
1
)
=
+
B
11
[
U
11
T
(
k
)
,
U
¯
12
T
(
k
-
1
)
]
T
x
1
(
k
+
1
)
=
+
B
12
[
U
¯
21
T
(
k
-
1
)
,
U
¯
22
T
(
k
-
1
)
]
T
x
1
(
k
+
1
)
=
A
11
x
1
(
k
)
+
A
12
x
2
(
k
)
x
1
(
k
+
1
)
=
+
B
11
[
F
11
X
11
T
(
k
)
,
F
11
X
¯
12
T
(
k
-
1
)
]
T
x
1
(
k
+
1
)
=
+
B
12
[
F
12
X
¯
21
T
(
k
-
1
)
,
F
12
X
¯
22
T
(
k
-
1
)
]
T
,
x
1
(
k
+
2
)
=
A
11
x
1
(
k
+
1
)
+
A
12
x
2
(
k
+
1
)
x
1
(
k
+
1
)
=
+
B
11
[
U
11
T
(
k
)
,
U
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
12
[
U
¯
21
T
(
k
-
1
)
,
U
¯
22
T
(
k
-
1
)
]
T
x
1
(
k
+
1
)
=
A
11
x
1
(
k
+
1
)
+
A
12
x
2
(
k
+
1
)
x
1
(
k
+
1
)
=
+
B
11
[
F
11
X
11
T
(
k
)
,
F
11
X
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
12
[
F
12
X
¯
21
T
(
k
-
1
)
,
F
12
X
¯
22
T
(
k
-
1
)
]
T
,
x
1
(
k
+
3
)
=
A
11
x
1
(
k
+
2
)
+
A
12
x
2
(
k
+
2
)
x
1
(
k
+
1
)
=
+
B
11
[
U
11
T
(
k
)
,
U
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
12
[
U
21
T
(
k
+
2
)
,
U
¯
22
T
(
k
-
1
)
]
T
x
1
(
k
+
1
)
=
A
11
x
1
(
k
+
2
)
+
A
12
x
2
(
k
+
2
)
x
1
(
k
+
1
)
=
+
B
11
[
F
11
X
11
T
(
k
)
,
F
11
X
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
12
[
F
12
X
21
T
(
k
+
2
)
,
F
12
X
¯
22
T
(
k
-
1
)
]
T
,
x
1
(
k
+
4
)
=
A
11
x
1
(
k
+
3
)
+
A
12
x
2
(
k
+
3
)
x
1
(
k
+
1
)
=
+
B
11
[
U
11
T
(
k
)
,
U
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
12
[
U
21
T
(
k
+
2
)
,
U
22
T
(
k
+
3
)
]
T
x
1
(
k
+
1
)
=
A
11
x
1
(
k
+
3
)
+
A
12
x
2
(
k
+
3
)
x
1
(
k
+
1
)
=
+
B
11
[
F
11
X
11
T
(
k
)
,
F
11
X
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
12
[
F
12
X
21
T
(
k
+
2
)
,
F
12
X
22
T
(
k
+
3
)
]
T
,
x
1
(
k
+
5
)
=
A
11
x
1
(
k
+
4
)
+
A
12
x
2
(
k
+
4
)
x
1
(
k
+
1
)
=
+
B
11
[
U
11
T
(
k
+
4
)
,
U
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
12
[
U
21
T
(
k
+
2
)
,
U
22
T
(
k
+
3
)
]
T
x
1
(
k
+
1
)
=
A
11
x
1
(
k
+
4
)
+
A
12
x
2
(
k
+
4
)
x
1
(
k
+
1
)
=
+
B
11
[
F
11
X
11
T
(
k
+
4
)
,
F
11
X
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
12
[
F
12
X
21
T
(
k
+
2
)
,
F
12
X
22
T
(
k
+
3
)
]
T
,
x
1
(
k
+
1
)
⋮
x
2
(
k
+
1
)
=
A
21
x
1
(
k
+
1
)
+
A
22
x
2
(
k
+
1
)
x
1
(
k
+
1
)
=
+
B
21
[
U
11
T
(
k
)
,
U
¯
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
22
[
U
¯
21
T
(
k
-
1
)
,
U
¯
22
T
(
k
-
1
)
]
T
,
x
1
(
k
+
1
)
=
A
21
x
1
(
k
)
+
A
22
x
2
(
k
)
x
1
(
k
+
1
)
=
+
B
21
[
F
21
X
11
T
(
k
)
,
F
21
X
¯
12
T
(
k
-
1
)
]
T
x
1
(
k
+
1
)
=
+
B
22
[
F
22
X
¯
21
T
(
k
-
1
)
,
F
22
X
¯
22
T
(
k
-
1
)
]
T
,
x
2
(
k
+
2
)
=
A
21
x
1
(
k
+
1
)
+
A
22
x
2
(
k
+
1
)
x
1
(
k
+
1
)
=
+
B
21
[
U
11
T
(
k
)
,
U
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
22
[
U
¯
21
T
(
k
-
1
)
,
U
¯
22
T
(
k
-
1
)
]
T
x
1
(
k
+
1
)
=
A
21
x
1
(
k
+
1
)
+
A
22
x
2
(
k
+
1
)
x
1
(
k
+
1
)
=
+
B
21
[
F
21
X
11
T
(
k
)
,
F
21
X
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
22
[
F
22
X
¯
21
T
(
k
-
1
)
,
F
22
X
¯
22
T
(
k
-
1
)
]
T
,
x
2
(
k
+
3
)
=
A
21
x
1
(
k
+
2
)
+
A
22
x
2
(
k
+
2
)
x
1
(
k
+
1
)
=
+
B
21
[
U
11
T
(
k
)
,
U
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
22
[
U
21
T
(
k
+
2
)
,
U
¯
22
T
(
k
-
1
)
]
T
x
1
(
k
+
1
)
=
A
21
x
1
(
k
+
2
)
+
A
22
x
2
(
k
+
2
)
x
1
(
k
+
1
)
=
+
B
21
[
F
21
X
11
T
(
k
)
,
F
21
X
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
22
[
F
22
X
21
T
(
k
+
2
)
,
F
22
X
¯
22
T
(
k
-
1
)
]
T
,
x
2
(
k
+
4
)
=
A
21
x
1
(
k
+
3
)
+
A
22
x
2
(
k
+
3
)
x
1
(
k
+
1
)
=
+
B
21
[
U
11
T
(
k
)
,
U
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
22
[
U
21
T
(
k
+
2
)
,
U
22
T
(
k
+
3
)
]
T
x
1
(
k
+
1
)
=
A
21
x
1
(
k
+
3
)
+
A
22
x
2
(
k
+
3
)
x
1
(
k
+
1
)
=
+
B
21
[
F
21
X
11
T
(
k
)
,
F
21
X
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
22
[
F
22
X
21
T
(
k
+
2
)
,
F
22
X
22
T
(
k
+
3
)
]
T
,
x
2
(
k
+
5
)
=
A
21
x
1
(
k
+
4
)
+
A
22
x
2
(
k
+
4
)
x
1
(
k
+
1
)
=
+
B
21
[
U
11
T
(
k
+
4
)
,
U
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
22
[
U
21
T
(
k
+
2
)
,
U
22
T
(
k
+
3
)
]
T
x
1
(
k
+
1
)
=
A
21
x
1
(
k
+
4
)
+
A
22
x
2
(
k
+
4
)
x
1
(
k
+
1
)
=
+
B
21
[
F
21
X
11
T
(
k
+
4
)
,
F
21
X
12
T
(
k
+
1
)
]
T
x
1
(
k
+
1
)
=
+
B
22
[
F
22
X
21
T
(
k
+
2
)
,
F
22
X
22
T
(
k
+
3
)
]
T
.Using the definition of the buffered states (10), we still obtain the evolution equation (13).


## 2.2. The General Case

Similarly, if the states of each subsystem are split intod packets and the packets are transmitted in a periodic pattern, we can obtain the general case.Supposex
~
=
[
x
^
1
T
⋯
x
^
n
T
]
T
,
x
^
i contains past state values for each step in the communication sequence and x
^
i
=
[
x
i
T
(
k
-
p
+
1
)
⋯
x
i
T
(
k
)
]
Tand p is the length of communication sequence. To describe the general case, we define an integer matrix, T, that contains an update sequence for each subsystem’s packet. The matrix T will have n rows (one for each subsystem) and p columns. The (
i
,
j
)
th entry of T will denote the number of steps from the j
th step of the communication sequence to the next communication with the i
th subsystem. Define A
~
i
j
=
J
p
⊗
I
+
∑
j
=
1
n
‍
(
E
n
,
n
⊗
A
i
j
), Δ
A
~
i
j
=
∑
j
=
1
n
‍
E
n
,
n
⊗
Δ
A
i
j, where J
p is the p
×
p Jordan matrix composed of all zeros except for ones on the superdiagonal; E
i
,
j is a matrix of zeros with a one in the (
i
,
j
)
th position. Define
(23)
D
j
q
=
[
0
⋱
0
I
(
r
j
-
r
j
-
1
)
q
0
⋱
0
]
,
F
~
i
j
q
=
E
n
,
T
j
q
⊗
B
i
j
F
i
j
D
j
q, and Δ
F
~
i
j
q
=
E
n
,
T
j
q
⊗
Δ
B
i
j
F
i
j
D
j
q, which is related to the feedback gains for subsystem i at the q
th step in the communication sequence. Now, at each sequence step, q
=
1
,
…
,
p, we can write the evolution of all subsystems as
(24)
x
~
(
k
+
1
)
=
M
q
x
~
(
k
)
,
k
∈
{
n
p
+
q
}
,
where
(25)
M
q
=
[
A
~
11
⋯
A
~
1
n
⋮
⋱
⋮
A
~
n
1
⋯
A
~
n
n
]
+
[
Δ
A
~
11
⋯
Δ
A
~
1
n
⋮
⋱
⋮
Δ
A
~
n
1
⋯
Δ
A
~
n
n
]
+
[
F
~
11
q
⋯
F
~
1
n
q
⋮
⋱
⋮
F
~
n
1
q
⋯
F
~
n
n
q
]
+
[
Δ
F
~
11
q
⋯
Δ
F
~
1
n
q
⋮
⋱
⋮
Δ
F
~
n
1
q
⋯
Δ
F
~
n
n
q
]
.Remark 2.
This paper models uncertain coupled NCSs with multiple packet transmission as switched system. The transmission pattern of the NCSs is closely related to the switching law of the switched system. This switched model not only enables us to design the controller for the NCSs, but also makes it more convenient to deal with the uncertain part.


## 3. Stability Analysis and Stabilization Result

We consider the case that in which all nodes transmitted in a toking-bus. With the toking bus protocol applied, the nodes are arranged logically into a ring and transmit their packets in a predetermined order. It can be seen that system (24) is a switched linear system switching among the following subsystems:
(26)
{
M
1
,
…
,
M
p
}
in a periodic manner. Clearly, the original system (1) is stable if the switched system (24) is stable.The following result gives a sufficient condition on the stability of the NCS (1) with packets in different network channels transmitted in a periodic manner.Lemma 3 (see [19]).
Let the states of multiple NCSs (1) be split into multiple data packets and suppose the transmission of these data packets is in a periodic manner. Then NCS (1) is uniformly asymptotically stable if all the eigenvalues of  Ψ are contained within the unit circle; that is, |
λ
i
(
Ψ
)
|
<
1 for i
=
1
,
2
,
…
,
n, where Ψ
=
∏
i
=
1
i
=
p
‍
M
i.The following lemma will play a key rule to design the feedback gain for NCS (1).Lemma 4 (see [38]).
Let the matricesU, W, and Φ
=
Φ
* be given. Then the following statements are equivalent.(i)
There exists a matrixV satisfying
(27)
U
V
W
+
(
U
V
W
)
*
+
Φ
<
0
.
(ii)
The following two conditions hold:(28)
N
u
Φ
N
u
*
<
0
o
r
U
U
*
>
0
,
N
w
*
Φ
N
w
<
0
o
r
W
*
W
>
0
,
where N
u and N
w
* are, respectively, orthogonal complements of N and W
*; that is,
(29)
N
u
U
=
0
,
N
w
*
W
*
=
0
.The following lemma will be used to deal with the uncertain part of the NCSs.Lemma 5 (see [17]).
M, N, and Λ are real matrices with proper dimensions which satisfy Λ
T
Λ
≤
I; then for any positive scalar ϵ, we can get the following inequality:
(30)
M
Λ
N
+
N
T
Λ
T
M
T
≤
ɛ
M
M
T
+
ɛ
-
1
N
T
N
.We give the stabilization result in the following.Theorem 6.
If there exist a positive definite matrixP, matrices K
i
j, Y
i
j, and positive scalars ϵ, ɛ
i satisfying
(31)
P
B
i
j
=
B
i
j
K
i
j
,and the following LMI(32)
[
Ω
M
̿
N
̿
T
M
1
̿
N
1
̿
T
⋯
M
n
̿
N
n
̿
T
M
̿
T
-
Ω
0
0
0
0
⋯
0
0
N
̿
0
-
Ω
0
0
0
⋯
0
0
M
1
̿
T
0
0
-
Ω
1
0
⋯
0
0
N
1
̿
0
0
0
-
Ω
1
⋯
0
0
⋮
⋮
⋮
⋮
⋮
⋱
⋮
⋮
M
n
̿
T
0
0
0
0
⋯
-
Ω
n
0
N
n
̿
0
0
0
0
⋯
0
-
Ω
n
]
<
0
,
where
(33)
Ω
=
[
-
P
¯
⋀
p
T
0
⋯
0
0
⋀
p
-
2
P
¯
⋀
p
-
1
T
⋯
0
0
0
⋀
p
-
1
-
2
P
¯
⋯
0
0
⋮
⋮
⋮
⋱
⋮
⋮
0
0
0
⋯
-
2
P
¯
⋀
1
T
0
0
0
⋯
⋀
1
-
P
¯
]
,
P
¯
=
[
P
0
⋱
0
P
]
,
⋀
q
=
[
P
A
~
11
⋯
P
A
~
1
n
⋮
⋱
⋮
P
A
~
n
1
⋯
P
A
~
n
n
]
+
[
E
n
T
1
t
q
⊗
B
11
Y
11
D
1
t
q
⋯
E
n
T
n
t
q
⊗
B
1
n
Y
1
n
D
n
t
q
⋮
⋱
⋮
E
n
T
1
t
q
⊗
B
n
1
Y
n
1
D
1
t
q
⋯
E
n
T
n
t
q
⊗
B
n
n
Y
n
n
D
n
t
q
]
,
M
̿
=
[
0
0
⋯
0
0
M
⋯
0
⋮
⋮
⋱
⋮
0
0
⋯
M
]
,
M
=
[
P
E
n
,
n
⊗
E
¯
11
⋯
P
E
n
,
n
⊗
E
¯
1
n
⋮
⋱
⋮
P
E
n
,
n
⊗
E
¯
n
1
⋯
P
E
n
,
n
⊗
E
¯
n
n
]
,
N
̿
=
[
0
0
0
⋯
0
0
ϵ
N
0
0
⋯
0
0
0
ϵ
N
0
⋯
0
0
⋮
⋮
⋮
⋱
⋮
⋮
0
0
0
⋯
0
0
0
0
0
⋯
ϵ
N
0
]
,
N
=
[
E
n
,
n
⊗
G
¯
1
⋯
0
⋮
⋱
⋮
0
⋯
E
n
,
n
⊗
G
¯
n
]
,
M
i
̿
=
[
0
0
0
⋯
0
0
0
ɛ
i
M
i
p
0
⋯
0
0
0
0
ɛ
i
M
i
(
p
-
1
)
⋯
0
0
⋮
⋮
⋮
⋱
⋮
⋮
0
0
0
⋯
ɛ
i
M
i
2
0
0
0
0
⋯
0
ɛ
i
M
i
1
]
,
M
i
q
=
[
0
⋯
0
⋮
⋮
E
n
T
1
t
q
⊗
E
¯
i
1
⋯
E
n
T
n
t
q
⊗
E
¯
i
n
⋮
⋮
0
⋯
0
]
,
N
i
̿
=
[
0
0
0
⋯
0
0
N
i
p
0
0
⋯
0
0
0
N
i
(
p
-
1
)
0
⋯
0
0
⋮
⋮
⋮
⋱
⋮
⋮
0
0
0
⋯
0
0
0
0
0
⋯
N
i
1
0
]
,
N
i
q
=
[
E
T
1
t
q
T
1
t
q
⊗
H
¯
1
Y
i
1
D
1
t
q
⋯
0
⋮
⋱
⋮
0
⋯
E
T
n
t
q
T
n
t
q
⊗
H
¯
n
Y
i
n
D
n
t
q
]
,
E
¯
i
j
=
[
E
i
j
0
]
,
G
¯
j
=
[
G
j
0
]
,
H
¯
j
=
[
H
j
0
]
,
Ω
0
=
diag
⁡
{
ϵ
I
⋯
ϵ
I
}
,
Ω
j
=
diag
⁡
{
ϵ
i
I
⋯
ϵ
i
I
}
,
where   q
=
1
,
…
,
p,  j
=
1,2
,
…
,
n, and i
=
1,2
,
…
,
n, then multiple NCSs (1) can be robustly stabilized with the state feedback gain
(34)
F
i
j
=
K
i
j
-
1
Y
i
j
.Proof.
From Theorem6, the stabilization problem is to compute the feedback gain F
i
j such that Ψ is Schur-stable. In the Lyapunov framework, the Schur-stability of matrix Ψ can be guaranteed by the existence of a symmetric positive definite matrix P
¯ such that the following inequality holds:
(35)
-
P
¯
+
Ψ
T
P
¯
Ψ
<
0
.
Condition (35) can be written as
(36)
[
I
M
p
T
]
[
-
P
¯
0
0
Π
p
-
1
T
P
¯
Π
p
-
1
]
[
I
M
p
]
<
0
,
where
(37)
Π
p
-
1
=
M
1
M
2
⋯
M
p
-
1
.
We define N
u
=
[
I
M
p
T
], V
=
P
¯, and W
=
[
0
I
]. Using Lemma 4, (36) is equivalent to the existence of symmetric positive definite matrix P
¯ such that the following inequality holds:
(38)
[
-
P
¯
0
0
Π
p
-
1
T
P
¯
Π
p
-
1
]
+
[
M
p
T
-
I
]
P
¯
[
0
I
]
+
[
0
I
]
P
¯
[
M
p
-
I
]
<
0
.
Rearranging it, we obtain(39)
[
-
P
¯
M
p
T
P
¯
P
¯
M
p
-
2
P
¯
+
Π
p
-
1
T
P
¯
Π
p
-
1
]
<
0
,
which can be written as
(40)
[
I
0
0
0
I
M
p
-
1
T
]
[
-
P
¯
M
p
T
P
¯
0
P
¯
M
p
-
2
P
¯
0
0
0
Π
p
-
2
T
P
¯
Π
p
-
2
]
×
[
I
0
0
I
0
M
p
-
1
]
<
0
,
where
(41)
Π
p
-
2
=
M
1
M
2
⋯
M
p
-
2
.
Repeating this procedure, we can show that (36) can be guaranteed by the following inequality:
(42)
[
-
P
¯
M
p
T
P
¯
0
⋯
0
0
P
¯
M
p
-
2
P
¯
M
p
-
1
T
P
¯
⋯
0
0
0
P
¯
M
p
-
1
-
2
P
¯
⋯
0
0
⋮
⋮
⋮
⋱
⋮
⋮
0
0
0
⋯
-
2
P
¯
M
1
T
P
¯
0
0
0
⋯
P
¯
M
1
-
P
¯
]
<
0
.
LetY
i
j
=
K
i
j
F
i
j. Using the definition of M
q
(
i
=
1
,
…
,
p
), together with (31), we know (42) is equivalent to
(43)
[
-
P
¯
⋀
p
T
+
Δ
⋀
p
T
0
⋯
0
0
⋀
p
+
Δ
⋀
p
-
2
P
¯
⋀
p
-
1
T
+
Δ
⋀
p
-
1
T
⋯
0
0
0
⋀
p
-
1
+
Δ
⋀
p
-
1
-
2
P
¯
⋯
0
0
⋮
⋮
⋮
⋱
⋮
⋮
0
0
0
⋯
-
2
P
¯
⋀
1
T
+
Δ
⋀
1
T
0
0
0
⋯
⋀
1
+
Δ
⋀
1
-
P
¯
]
<
0
,
which can be written as(44)
[
-
P
¯
⋀
p
T
0
⋯
0
0
⋀
p
-
2
P
¯
⋀
p
-
1
T
⋯
0
0
0
⋀
p
-
1
-
2
P
¯
⋯
0
0
⋮
⋮
⋮
⋱
⋮
⋮
0
0
0
⋯
-
2
P
¯
⋀
1
T
0
0
0
⋯
⋀
1
-
P
¯
]
+
[
0
Δ
⋀
p
T
0
⋯
0
0
Δ
⋀
p
0
Δ
⋀
p
-
1
T
⋯
0
0
0
Δ
⋀
p
-
1
0
⋯
0
0
⋮
⋮
⋮
⋱
⋮
⋮
0
0
0
⋯
0
Δ
⋀
1
T
0
0
0
⋯
Δ
⋀
1
0
]
<
0
,
where(45)
Δ
⋀
q
=
[
P
E
n
,
n
⊗
E
¯
11
⋯
P
E
n
,
n
⊗
E
¯
1
n
⋮
⋱
⋮
P
E
n
,
n
⊗
E
¯
n
1
⋯
P
E
n
,
n
⊗
E
¯
n
n
]
[
E
n
,
n
⊗
Γ
¯
1
⋯
0
⋮
⋱
⋮
0
⋯
E
n
,
n
⊗
Γ
¯
n
]
[
E
n
,
n
⊗
G
¯
1
⋯
0
⋮
⋱
⋮
0
⋯
E
n
,
n
⊗
G
¯
n
]
+
∑
i
=
1
n
‍
[
0
E
n
T
1
t
q
⊗
E
¯
i
1
⋯
E
n
T
n
t
q
⊗
E
¯
i
n
0
]
[
E
T
1
t
q
T
1
t
q
⊗
Γ
¯
1
⋯
0
⋮
⋱
⋮
0
⋯
E
T
n
t
q
T
n
t
q
⊗
Γ
¯
n
]
×
[
E
T
1
t
q
T
1
t
q
⊗
H
¯
1
Y
i
1
D
1
t
q
⋯
0
⋮
⋱
⋮
0
⋯
E
T
n
t
q
T
n
t
q
⊗
H
¯
n
Y
i
n
D
n
t
q
]
.
DefineM
̿
=
M
¯
,
N
̿
=
ϵ
N
¯
,
M
i
̿
=
ɛ
i
M
¯
i
,
N
i
̿
=
N
¯
i
,
q
=
1
,
…
,
p. Then LMIs (44) can be rewritten as
(46)
Ω
+
M
¯
Γ
̿
1
(
k
)
N
¯
+
N
¯
T
Γ
̿
1
(
k
)
T
M
¯
T
+
∑
i
=
1
n
‍
M
i
¯
Γ
̿
i
(
k
)
N
i
¯
+
N
i
¯
T
Γ
̿
i
(
k
)
T
M
i
¯
T
<
0
,
where(47)
Γ
̿
1
(
k
)
=
diag
⁡
{
Γ
′
,
Γ
′
,
…
,
Γ
′
}
,
Γ
′
=
[
E
n
,
n
⊗
Γ
¯
1
⋯
0
⋮
⋱
⋮
0
⋯
E
n
,
n
⊗
Γ
¯
n
]
,
Γ
¯
j
=
diag
⁡
{
Γ
(
k
)
,
Γ
(
k
)
,
…
,
Γ
(
k
)
}
,
Γ
̿
2
(
k
)
=
diag
⁡
{
0
,
Γ
p
′
(
k
)
,
Γ
p
-
1
′
(
k
)
,
…
,
Γ
1
′
(
k
)
}
,
Γ
q
′
=
[
E
T
1
t
q
T
1
t
q
⊗
Γ
¯
1
⋯
0
⋮
⋱
⋮
0
⋯
E
T
n
t
q
T
n
t
q
⊗
Γ
¯
n
]
.
It can be deduced from Lemma4 that LMI (46) is satisfied if there exist positive scalars ɛ
,
ɛ
i satisfying
(48)
Ω
+
ɛ
M
¯
M
¯
T
+
ɛ
-
1
N
¯
T
N
¯
+
∑
i
=
1
n
‍
ɛ
i
M
i
¯
M
i
¯
T
+
∑
i
=
1
n
‍
ɛ
i
-
1
N
i
¯
T
N
i
¯
<
0
.
By Lemma3, it is known inequality (48) is equivalent to inequality (32), and NCS (1) can be robustly stabilized with the state feedback gain
(49)
F
i
j
=
K
i
j
-
1
Y
i
j
.Remark 7.
It is noted that special structured matricesD
j
q have been introduced into the closed-loop system to deal with multiple packet transmission and this makes the feedback controller design difficult. To solve this problem, equation constraints have been introduced in Theorem 6 and this brings the conservatism.


## 4. A Simulation Example

In this section, a numerical example is given to demonstrate the effectiveness of our method. We consider the case in which the state of the system is split into two parts and the plant has time-varying norm-bounded parameter uncertainties. The coupled system is given by(50)
x
1
(
k
+
1
)
=
(
A
11
+
E
11
Γ
1
(
k
)
G
1
)
x
1
(
t
)
x
1
(
k
+
1
)
=
+
(
A
12
+
E
12
Γ
2
(
k
)
G
2
)
x
2
(
t
)
x
1
(
k
+
1
)
=
+
(
B
11
+
E
11
Γ
1
(
t
)
H
1
)
u
1
(
t
)
x
1
(
k
+
1
)
=
+
(
B
12
+
E
12
Γ
2
(
t
)
H
2
)
u
2
(
t
)
,
x
2
(
k
+
1
)
=
(
A
21
+
E
21
Γ
1
(
k
)
G
1
)
x
1
(
t
)
x
1
(
k
+
1
)
=
+
(
A
22
+
E
22
Γ
2
(
k
)
G
2
)
x
2
(
t
)
x
1
(
k
+
1
)
=
+
(
B
21
+
E
21
Γ
1
(
t
)
H
1
)
u
1
(
t
)
x
2
(
k
+
1
)
=
+
(
B
22
+
E
22
Γ
2
(
t
)
H
2
)
u
2
(
t
)
,
where
(51)
A
11
=
[
0.3
0
0.4
0.4
]
,
A
12
=
[
0.2
0.01
0
0.2
]
,
A
21
=
[
0.05
0
0.3
0.3
]
,
A
22
=
[
0
0.05
0.3
0.3
]
,
B
11
=
[
0.3
0.6
]
,
B
12
=
[
0.2
0.5
]
,
B
21
=
[
0.3
1
]
,
B
22
=
[
0.08
0.02
]
,
E
11
=
[
0.01
-
0.001
]
,
E
12
=
[
0.02
-
0.002
]
,
E
21
=
[
0.002
-
0.002
]
,
E
22
=
[
0.001
-
0.001
]
,
G
1
=
[
0.001
0.001
]
,
G
2
=
[
0.002
0.002
]
,
H
1
=
0.001
,
H
2
=
0.002
,
Γ
1
(
k
)
=
sin
⁡
(
20
k
)
,
Γ
2
(
k
)
=
sin
⁡
(
50
k
)
.We will show that the NCSs can be stabilized with only a quarter of the state information transmitted, even including time-varying norm-bounded parameter uncertainties. Suppose the controller pays equal attention to each of the two subsystems and the communication sequence is[
1
,
1
,
2
,
2
]. By solving the LMI in Theorem 6 with LMI toolbox [39], we have
(52)
P
=
[
18.0282
-
0.2108
-
0.2108
2.1266
]
,
ϵ
=
15.6610
,
ɛ
1
=
15.6556
,
ɛ
2
=
15.6592
,
F
11
=
[
-
0.1137
0
]
,
F
12
=
[
0
-
0.2026
]
,
F
21
=
[
-
0.027
0
]
,
F
22
=
[
0
-
0.5755
]
.With the initial conditionx
1
(
1
)
=
[
1
-
1
]
T, x
1
(
2
)
=
[
0.75
-
0.75
]
T, x
1
(
3
)
=
[
0.5
-
0.5
]
T, x
1
(
4
)
=
[
0.125
-
0.125
]
T, x
2
(
1
)
=
[
1
-
1
]
T, x
2
(
2
)
=
[
0.6
-
0.6
]
T, x
2
(
3
)
=
[
0.4
-
0.4
]
T, x
2
(
4
)
=
[
0.1
-
0.1
]
T, the state trajectories of two coupled second-order NCSs with multiple packet transmission are shown in Figures 4 and 5. From which we can see that multiple uncertain NCSs (50) with only a quarter of state information transmitted every step can be effectively stabilized with the designed feedback controller. This is a remarkable result, which shows the efficiency of our proposed method. This example illustrates that the switched approach proposed in this paper leads to useful results, because it only requires plant state measurements to be transmitted sparsely. This reduces network traffic without sacrificing stability.Figure 4
The state trajectories of subsystem 1.Figure 5
The state trajectories of subsystem 2.


## 5. Conclusion

In this paper, we dealt with robust stabilization of multiple coupled uncertain NCSs with multipacket transmitted over a shared channel. For NCSs acted over a toking-bus, multiple NCSs with multipacket were modeled as a periodically switched system, whose stability guaranteed that of the original system. Sufficient conditions on stability and stabilization of the NCSs with norm-bounded parameter uncertainties were derived. The results obtained here suggest that data packet can be transmitted sparsely to save network bandwidth while preserving the stability of the NCS. This is of practical interest in the application of NCSs.Future work focuses on studying the case where the communication sequence is stochastic, on one step time delay, and on the real life application.



---

*Source: 623697-2014-06-11.xml*