yields the equivalent delay-free system in z(t) given
by
˙z(t) = Az(t) + e
−Ad
Bu(t) (2)
The control law for the latter is simply a state-
feedback law u(t) = Kz(t) where K is chosen to sta-
bilise (A,e
−Ad
B). The control law for the original sys-
tem is then found by substituting the definition of z(t)
to get
u(t) = Kx(t) + K
Z
t
t−d
e
A(t−d−τ)
Bu(τ)dτ (3)
To cope with uncertainty in the plant parameters,
including the time delay, two paradigms are available.
The first paradigm is to make the controller robust to
the uncertainty. In delay-independent truncated pre-
dictor feedback (Wei and Lin, 2018), a state-feedback
controller is used with gains selected by a Lyapunov
equation based method which does not require knowl-
edge of the delay. However, this work assumes plant
parameters are known, and for unstable plants the
amount of delay that the method can handle is limited
(Wei and Lin, 2017). A more generally applicable but
mathematically involved alternative is to employ the
framework of robust control theory (Zhong, 2006).
The other paradigm to consider is adaptive con-
trol. Early work on adaptive controllers for time
delay systems only addressed uncertainty in the pa-
rameters but not the time delay (Ortega and Lozano,
1988)(Niculescu and Annaswamy, 2003). The reason
is that adaptive laws rely on the plant representation
being linear in the uncertain parameters, whereas the
time delay appears inside the argument of the con-
trol input. Krstic (Krstic, 2009) overcomes this by
expressing the plant dynamics in terms of the en-
tire input history over the delay interval (given by
the function u(x,t) where x parameterises a point on
the interval), and modelling the delay as a transport
PDE. Thus, the time delay can be estimated along
with other plant parameters, and used to compute a
predictor-based control law (Bresch-Pietri and Krstic,
2009). However, the resulting adaptive laws for both
time delay and parameter estimation are complicated.
Most time-delay controllers have been formulated
in a continuous-time setting, but they will almost cer-
tainly be implemented on a digital computer. Dis-
cretisation of continuous-time control laws, espe-
cially those for time-delay compensation, is fraught
with numerical pitfalls (Mirkin, 2004)(Zhong, 2004).
It may be more straightforward to design controllers
in discrete-time, for example the discrete-time APC
(Abidi et al., 2017) (Abidi and Xu, 2015). This is
a model-reference adaptive controller that achieves
reference trajectory tracking on a plant with an un-
known, constant, upper-bounded time delay. How-
ever, the model-tracking error does not vanish asymp-
totically, and its bound is dependent on the mismatch
between the delay upper-bound assumed by the con-
troller and the true delay. The adaptive law also con-
tains parameters that may be difficult to tune in prac-
tice.
This paper proposes a discrete-time adaptive regu-
lator for a scalar, linear time-invariant system with an
unknown, constant input time delay that has a known
upper-bound, without explicitly estimating the time
delay. Using an approach similar to Artstein’s model
reduction, a state substitution is devised that allows
the plant dynamics to be expressed in a delay-free
form, which facilitates derivation of a control law. In
order to apply the model reduction technique to the
case of unknown time delay, the plant dynamics and
the state substitutes are expressed in a manner that is
‘agnostic’ to the specific value of the time delay. This
also makes it possible to estimate the plant parameters
using recursive least squares, even without knowledge
of the time delay. A stability analysis shows that
the proposed regulator drives the plant state to zero
asymptotically.
2 PROBLEM DEFINITION
Consider the scalar system in continuous-time with
input delay given as
˙x(t) = ax(t) + bu(t − τ) (4)
where the state is x ∈ R, the input is u ∈ R, the system
parameters a,b ∈ R are uncertain parameters, and the
constant time delay τ ∈ R is uncertain but has a known
upper-bound, τ
p
, such that τ ≤ τ
p
.
Sampling this system at uniform time intervals T
(where in general the time delay τ may not be an in-
teger multiple of T ) gives a discrete-time system de-
scribed by
x
k+1
= φx
k
+ γ
1
u
k−d
+ γ
2
u
k−d−1
(5)
where φ, γ
1
,γ
2
∈ R are uncertain parameters, and d ∈
[0, p] ⊂ Z
+
is the uncertain constant delay known
to be at most p time-steps long. It is not neces-
sary to ensure that the sampled system has stable ze-
ros, i.e., if the system is written in the form u
k−d
=
1
γ
1
(−γ
2
u
k−d−1
+ x
k+1
− φx
k
) then the ratio
γ
2
γ
1
need
not be inside the unit-circle.
Assumption 1: The upper-bound on the delay in time-
steps, p, satisfies pT ≤ τ
p
≤ (p + 1)T .
Assumption 2: There exists a φ
min
> 0 such that φ ≥
φ
min
.
Assumption 3: There exists a γ
min
> 0 such that γ
1
+
γ
2
≥ γ
min
.
ICINCO 2019 - 16th International Conference on Informatics in Control, Automation and Robotics
700