represents all potential future states in a scenario tree.
Taking into account that in a closed-loop approach fu-
ture inputs can be adapted when new measurements
are available, they compute control inputs that achieve
constraint satisfaction in all scenarios and minimize a
cost function weighted over all scenarios.
Robust MPC can be employed to design also dis-
tributed MPC schemes since in a distributed setting
as in eq. (4), to the eyes of subsystem i, the neigh-
boring couplings z
N
i
behave in an uncertain manner.
Since multi-stage MPC requires knowledge about the
range of possible values for each uncertain quantity,
(Lucia et al., 2015) introduce so-called contracts Z
i
,
that contain predicted reachable values of the cou-
pling variables z
i
and are exchanged among neigh-
bors. In (Braun et al., 2020), approximations of these
contracts are proposed that can efficiently be obtained
from local scenario trees and have been proven to
work well in practice.
To apply multi-stage (distributed) MPC for robust
control also against attacks, one has to provide suit-
able uncertainty sets A
i
with possible values for local
attacks a
i
. To this end, one can choose suitable sam-
ples for attack values as in (Braun et al., 2020), or in a
more general approach use available knowledge about
the attackers gained from attack identification. The
latter approach is introduced in (Braun et al., 2021a)
and summarized in Section 3.3.
3.2 Attack Identification based on
Sparse Optimization
Robust MPC schemes provide an important tool to
manage the impact of a potential attack. Neverthe-
less, when an attack occurs, it is crucial to detect and
identify it quickly to initiate appropriate countermea-
sures in order to eliminate the attacker or mitigate
its impact. To avoid the combinatorial nature that
is inherent to most identification methods relying on
unknown-input observers, one can solve a continuous
optimization problem to compute a suspected attack
from an unknown, possibly infinite dimensional and
unbounded set of potential attacks. Taking advantage
of the observation that typical attacks in practical ap-
plications target only few network components, the
optimization reveals a sparsest possible attack that ex-
plains the observed system output.
In (Braun et al., 2021b), this idea is implemented
in a global ADI method with rigorous success guaran-
tees for nonlinear networked systems. Since in a dis-
tributed setting, model information about the subsys-
tems’ dynamics is available only locally and should
remain private, a linear approximation of the dynam-
ics at the current iterate is used for identification. To
this end, each subsystem locally evaluates first-order
derivatives and makes them publicly available. Then,
a global linear optimization problem is solved to iden-
tify a sparse suspected attack.
In this paper, we propose a novel identification
problem for local attack identification, which is also
based on sparse optimization. Since no information
on local dynamics is published in this decentralized
approach, the linearization from above is no longer
necessary. Instead, each subsystem locally solves the
following nonlinear identification problem with mea-
surements
e
y
i
,
e
x
i
, and
e
z
N
i
of the output y
i
, the state x
i
,
and the neighboring couplings z
N
i
:
min
a
i
ka
i
k
1
,
s.t.
e
y
i
− g
i
◦ f
i
(
e
x
i
,u
i
+ a
i
,
e
z
N
i
)
2
≤ ε
i
,
(5)
where the ◦-operator denotes the function composi-
tion of g
i
and f
i
. A solution of problem eq. (5) locally
reveals a suspected attack, referred to as a
∗
i
, based on
which the local model in eq. (4) with functions g
i
, f
i
explains the observed output
e
y
i
up to an accuracy of
ε
i
. The choice of the tolerance ε
i
is not trivial, even
if perfect measurements were assumed, since the dis-
tributed model in eq. (4) only approximates the dy-
namic behavior of the global system. More specif-
ically, the coupling variables z
N
i
in the local mod-
els represent differential states of neighboring subsys-
tems, but their dynamic behavior is unknown to sub-
system i. In ongoing research, we investigate how dif-
ferent parametrization schemes of the coupling vari-
ables influence the resulting error between centralized
and distributed numerical integration. Based on this
error, a suitable value ε
i
can be chosen. In the numer-
ical experiments in this work, we use a fixed value,
which is given in Section 4.
3.3 Attack Mitigation using Adaptively
Robust MPC
In the previous sections, two important tools for dis-
tributed control systems under attack have been intro-
duced: For one thing, robust MPC can limit the im-
pact of a disturbance by ensuring satisfied constraints
in all scenarios, but requires information about the
uncertainty range. For another thing, attack identi-
fication provides suspicions about an attack, but is
not able to mitigate its effects. To combine the ad-
vantages of both, an adaptively robust MPC scheme
was proposed in (Braun et al., 2021a). It repeatedly
adjusts the uncertainty sets A
k
that involve possible
attacks a
k
at time k according to findings from attack
identification. The method is designed for attacks that
obey a probability distribution with unknown, time-
invariant expected value µ and standard deviation σ,
ICINCO 2022 - 19th International Conference on Informatics in Control, Automation and Robotics
62