Darouach et al. (1996); Koenig et al. (2002); Zhang et al.
(2020) investigated the unknown input observer design
for descriptor systems. The unknown input functional
observers were designed in Sundaram et al. (2008);
Trinh et al. (2008); Sakhraoui et al. (2020). Unknown
input observers for the switched systems [Bejarano et al.
(2011); Zhang et al. (2020)] and h∞unknown input
observers [Gao et al. (2016)] have also been well studied.
One common feature of the aforementioned unknown
input observers is that the system state is estimated
asymptotically. In practical applications such as the
fault detection, it is desired to realize finite-time estima-
tion of the state. Among all the categories of finite-time
convergence, the strictest one is to reach convergence
exactly at the preset time instant, which is named as
appointed-time or specified-time convergence [Zhao
et al. (2019)]. The appointed-time observer for linear
systems without the unknown input was proposed in
Engel et al. (2002), where a pairwise observer structure
was designed, consisting of two Luenberger observers
and achieving the appointed-time state estimation based
on time-delayed observer information. By introducing a
time-varying coordinate transformation matrix, a novel
observer for linear systems was designed in Pin et al.
(2020), which successfully realized the appointed-time
state estimation with an arbitrarily small predeter-
mined time. Based on the pairwise observer structure,
the appointed-time observers for nonlinear systems were
presented in Kreisselmeier et al. (2003); Menold et al.
(2003), and the appointed-time functional observers for
linear systems were studied in Raff et al. (2005). Li et al.
(2015) further considered the appointed-time state es-
timation of nonlinear systems with measurement noise.
The appointed-time observer for discrete-time systems
was presented in Ao et al. (2018), where the applica-
tions on the attack detection were also investigated.
Following the observer design structure of Engel et al.
(2002), the appointed-time unknown input observer for
linear system (1) with F= 0 was proposed in Raff et al.
(2006). Distributed appointed-time unknown input ob-
servers were further investigated in Lv et al. (2020a),
based on which fully distributed attack-free consensus
protocols were proposed for multi-agent systems.
Notice that the above-mentioned appointed-time ob-
servers based on the pairwise observer structure are ei-
ther of full order 2n, or of reduced order 2(n−rank(E)).
From the point of view of realization, it is favourable to
design minimal-order appointed-time observers, which
is expected to be of order 2(n−rank(C)) when F= 0. In
this paper, we intend to answer whether such minimal-
order appointed-time observer exists and how to design
the observers.
For the linear system without the unknown input, we
first give a thorough analysis of the pairwise observer
design structure presented in Engel et al. (2002) to re-
veal how it works on realizing state estimation at the
appointed time. That is, to build a system of 6nlinear
equations in 6nunknowns, and construct the observer
expression based on the unique solution of the system
of linear equations. Following such design methodology,
the pairwise minimal-order observers with different poles
are proposed, and a system of (6n−4m) equations in
(6n−4m) unknowns is constructed by adding the 2m
equations of measured output at time instant tas well as
the delayed time instant t−τ. It is demonstrated that the
coefficient matrix is invertible, which gives a unique so-
lution to the system of linear equations. The appointed-
time observer is then designed by taking the portion of
the unique solution. To release the computation burden
caused by calculating the inverse of the high-dimensional
coefficient matrix, another form of the minimal-order
appointed-time observer is formulated, whose structure
is coincident with that of the full-order appointed-time
observer in Engel et al. (2002).
For the linear system with the unknown input, we first
reconstruct the model to decouple the effect of the un-
known input, and exhibit both full-order and reduced-
order appointed-time unknown input observers based
on different reconstructed models. The gap between the
reduced-order and expected minimal-order appointed-
time unknown input observers is revealed, which moti-
vates us to further decrease the observer order. Follow-
ing the observer design structure of the minimal-order
appointed-time observer for linear systems without the
unknown input, the minimal-order appointed-time un-
known input observer is obtained by designing the ob-
server to estimate the state of the reconstructed model at
the appointed time. The special case that the unknown
input does not act on the measured output, i.e., F= 0, is
also discussed. The proposed minimal-order appointed-
time unknown input observer is then applied into the
consensus problem of linear multi-agent systems, where
distributed minimal-order appointed-time unknown in-
put observer is put forward to estimate the consensus
error by viewing the relative input among neighboring
agents as the unknown input, and the distributed adap-
tive attack-free consensus protocol is presented based on
the consensus error estimation. The proposed protocol
possesses the feature of avoiding information transmis-
sion via communication channel, which takes the advan-
tages of reducing the communication cost and being free
from network attacks.
The rest of this paper is organized as follows. Section
2 presents the design structures of the minimal-order
appointed-time observer for linear system (1) without
unknown input w. Section 3 further studies the minimal-
order appointed-time unknown input observers. Section
4 applies the appointed-time unknown input observer
into the design of fully distributed adaptive attack-free
consensus protocols for linear multi-agent systems, and
gives a simulation example to illustrate the effectiveness
of the proposed methods. Section 5 concludes this paper.
2