Next Article in Journal
Body-Fitted Mesh Method for Solving Topology Optimization Problems in Fluid Dynamics
Previous Article in Journal
Influence of Social Contacts on Endemic Dynamics in the Extended SEIS Model
Previous Article in Special Issue
Global Fuzzy Adaptive Consensus for Uncertain Nonlinear Multi-Agent Systems with Unknown Control Directions
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Full- and Reduced-Order Interval Observers for Linear Systems in Continuous and Discrete Time

by
Fernando López-Caamal
1,*,
Jesús David Avilés
2,*,
Guillermo Becerra-Nunez
3,4,
Rigoberto Martínez
2 and
Claudia Márquez
2
1
Departamento de Ingeniería Química, Universidad de Guanajuato, Noria Alta s/n, Guanajuato 36050, Mexico
2
Facultad de Ciencias de la Ingeniería, Administrativas y Sociales, Universidad Autónoma de Baja California, Blvd. Universidad No. 1, Tecate 21460, Mexico
3
Departamento de Ingeniería, Universidad Autónoma del Estado de Quintana Roo, Blvd. Bahia s/n, Chetumal 77019, Mexico
4
Investigador por México, Secretaría de Ciencia, Humanidades, Tecnología e Innovación, Av. Insurgentes Sur 1582, Ciudad de México 03940, Mexico
*
Authors to whom correspondence should be addressed.
Symmetry 2026, 18(6), 882; https://doi.org/10.3390/sym18060882
Submission received: 17 March 2026 / Revised: 5 May 2026 / Accepted: 11 May 2026 / Published: 22 May 2026
(This article belongs to the Special Issue Symmetry and Asymmetry in Control Science)

Abstract

This paper proposes a methodology for designing full-order and reduced-order interval observers for Linear Time-Invariant (LTI) systems, in both continuous and discrete-time settings, in the presence of uncertainties, disturbances, and measurement noise. The class of systems considered requires that the number of independent measured outputs be greater than or equal to the number of unmeasured states. The proposed approach enables the constructive assignment of the state matrix of the estimation error dynamics over the admissible Metzler–Hurwitz class compatible with the observer structure through an appropriate selection of the observer gains, ensuring both stability and cooperativity conditions without requiring the solution of Linear Matrix Inequalities. This flexibility facilitates the design of full and reduced-order interval observers for both continuous and discrete-time cases, generating upper and lower estimates that enclose the true state trajectory. Numerical examples are presented to illustrate the effectiveness of the proposed interval observer design methodology.

1. Introduction

In recent years, interval observers have attracted significant attention from the systems and control community due to their inherent robustness to parameter variations and external disturbances, commonly found in physical systems [1,2,3,4,5]. An interval observer consists of two state observers that preserve the partial ordering between the true state trajectory and the upper and lower estimates (bounds). If initialised appropriately, these observers define a dynamic interval that contains the true state trajectory [5,6]. The use of monotone dynamical systems, particularly cooperative systems [7,8], has enabled the development of interval observers for various applications. One of the earliest implementations was for a bioreactor system with significant unmodelled dynamics [9], later experimentally validated in [10]. The earlier works regarding interval observers obtained lower and upper estimates of the actual state, without ensuring the stability property of the observation error. Thus, the estimates could diverge from the actual values as in the Bundle Observers [11,12], which rely on evaluating multiple estimators in parallel, selecting the best estimation at each time step. The design of interval observers for a class of Linear Time-Invariant (LTI) systems with uncertainties is characterised by having a state matrix of the observation error that is both Hurwitz and Metzler [9,13,14]; in addition, such requirements may be relaxed, given that cooperativity is a coordinate-dependent property [15]. In [16], an  interval observer was presented for the linearisation of some nonlinear systems by designing an observer gain and a transformation matrix by means of the solution of a Sylvester equation. Thus, this methodology has been extended to design interval observers for time-varying linear systems, when considering a time-varying state transformation [17]. A dissipativity-based design methodology for nonlinear systems with cooperative properties was proposed in [5], where four observer gains are determined via Linear Matrix Inequalities (LMIs).
Moreover, interval observer designs have also been extended to discrete-time and sampled systems, where the cooperative property remains after applying discretisation methods [18]. For instance, the work in [19] introduced a design for time-varying discrete-time systems using a state transformation that ensures both stability and cooperativity properties. Subsequent developments have addressed the design of interval observer designs for non-negative and uncertain discrete-time systems in [16,20]. In [21], an interval observer design methodology was presented for discrete-time linear systems subject to bounded disturbances and measurement noise, based on an augmented observer framework and H performance criteria, with synthesis conditions expressed as LMIs that guarantee robust state interval estimation. Additionally, a systematic design methodology for a class of discrete-time nonlinear systems subject to disturbances and uncertainties, whose estimation error dynamics exhibit dissipativity and cooperativity properties, was developed in [22]. In [23], the design of interval observers was proposed for linear discrete-time systems subject to external disturbances and measurement noise, relying on a reduced-order model constructed in an identification canonical form. In addition, ref. [24] proposed a hybrid observer scheme, referred to as the Set-Theoretic Interval Observer, for discrete-time LTI systems subject to bounded disturbances, which integrates interval and zonotopic set-based estimation by transforming the original system into a canonical form and partitioning it into subsystems treated, respectively, by positive systems theory and set-theoretic methods. In [25], a unified design procedure for interval observers in linear systems was presented, replacing conventional structure-dependent transformations with a single offline LTI-based change of coordinates via a Sylvester equation, and generalising the approach to time-varying systems using a Kravaris–Kazantzis–Luenberger framework that ensures finite-time invertibility and interval bound estimation. In [26], an optimisation method for designing interval observers was provided for discrete-time LTI systems affected by unknown but bounded disturbances, enabling tight state estimation bounds by solving a convex optimisation problem subject to LMI constraints. Furthermore, ref. [27] proposes a distributed interval observer-based coordination controller for discrete-time multi-agent systems subject to unknown initial states and bounded external disturbances, ensuring bounded consensus and cooperative behaviour through Lyapunov and cooperativity theories without requiring stringent assumptions on uncertainties.
Motivated by recent advances in robust state estimation based on upper and lower bounds that enclose the true state trajectory, this paper proposes a design methodology for full-order and reduced-order interval observers for linear systems in both continuous-time and discrete-time cases. The main contributions of this paper are summarised as follows:
  • A unified design methodology for full-order and reduced-order interval observers for a class of linear systems with n states and n 1 linearly independent measurements in both continuous-time and discrete-time settings, under the influence of parametric uncertainties, disturbances, and sensor noise.
  • A constructive interval observer design methodology that allows the assignment of the estimation error dynamics over the admissible Metzler–Hurwitz (Metzler–Schur for the discrete-time setting) class compatible with the observer structure through appropriate selection of the observer gains. This flexibility guarantees the cooperativity and stability properties of the interval estimation error dynamics, which are essential for preserving the partial ordering between the true state trajectory and the interval estimates.
  • Unlike many existing interval observer designs that rely on Linear Matrix Inequality (LMI) conditions, the proposed methodology provides a constructive design that does not require solving LMIs, reducing the computational complexity of the observer designs and enabling scalable implementations for high-order systems.
  • Several numerical simulations in both continuous-time and discrete-time settings illustrate the effectiveness and performance of the proposed interval observer design methodology, providing reliable interval bounds for the state trajectories in the presence of disturbances and measurement noise.
The key results are organised as follows:
  • Continuous-time observer, Section 3
    • Full order: The interval observer is in Equations (11) and (12). The stability result is in Theorem 1.
    • Reduced order: The interval observer is in Equations (15) and (16). The stability result is in Theorem 2.
  • Discrete-time observer, Section 4
    • Full order: The interval observer is in Equations (19) and (20). The stability result is in Theorem 3.
    • Reduced order: The interval observer is in Equations (23) and (24). The stability result is in Theorem 4.
For the sake of readability, the proofs of the main results are presented in the Appendix A.
Notations. Throughout this paper, we adopt the following notation. The symbol ⪰ represents a component-wise partial ordering between two vectors x , z R n ; that is, x z if and only if x i z i for all i = 1 , , n . This partial ordering naturally extends to matrices: A B if and only if a i j b i j , for  all i , j . A vector x is considered non-negative if each of its components satisfies x i 0 i , and this is denoted by x 0 . Similarly, a matrix A is non-negative when all its entries are non-negative, i.e.,  a i j 0 for all i , j , which we denote as A 0 . It is important to distinguish this element-wise ordering symbol ⪰ from the notation used for positive (semi-) definiteness. A symmetric matrix P is said to be positive semi-definite (respectively, positive definite) if all its eigenvalues are non-negative (respectively, positive). This is denoted as P = P > 0 or P = P 0 , respectively. The symbols λ min ( P ) and λ max ( P ) denote the smallest and largest eigenvalues of P , respectively. Meanwhile, F is a Metzler matrix if all its off-diagonal elements are non-negative, i.e.,  m i j 0 , i j . In turn, | X | denotes the element-wise absolute value of matrix X , and  1 n R n is a vector with 1 in all its components. · stands for the Euclidean norm for vectors and the induced norm for matrices. Finally, Z R m × n is the left pseudoinverse of matrix Z R n × m , i.e.,  Z Z = I m , provided that Z has full column rank, rank ( Z ) = m .

2. Background

This section reviews concepts of stability [28,29] and cooperativity [5,7,20,30], which are fundamental to the design of interval observers for both continuous-time and discrete-time systems. Stability properties are used to guarantee the convergence of the observer, whereas cooperativity is essential to preserve the partial ordering between the actual state and its interval estimates. Furthermore, key theoretical results related to these concepts are briefly recalled to support the proposed methodology.

2.1. Continuous-Time Case

In the following, we recall the main concepts for the continuous-time setting.

2.1.1. Continuous Cooperative Systems

Cooperative systems are a particular class of monotone dynamical systems [7,8] with respect to the positive orthant, characterised by their order-preserving property with respect to state and output trajectories. Next, we recall the definition and characterisation of cooperative systems in the continuous-time case.
Definition 1
([5,7]). Consider the linear continuous-time system
Σ L : d d t x ( t ) = Ax ( t ) + Bu ( t ) , x 0 = x 0 , y ( t ) = Cx ( t ) ,
where the state vector x ( t ) : R + R n , the control input vector is u ( t ) : R + R m , and the output vector is y ( t ) : R + R p . The continuous-time system Σ L is cooperative if, for any initial conditions and inputs fulfilling x 0 1 x 0 2 , and u 1 t u 2 t t t 0 , the state and output trajectories preserve the partial ordering for all future times. That is, x t , t 0 , x 0 1 , u 1 t x t , t 0 , x 0 2 , u 2 t and y t , t 0 , x 0 1 , u 1 t y t , t 0 , x 0 2 , u 2 t hold.
Cooperative linear systems can be characterised in terms of a Metzler matrix and non-negative conditions.
Proposition 1
([5,7]). Given the matrices A , B , and  C of appropriate dimensions, Σ L is cooperative if and only if all the following conditions are satisfied:
( a ) . A is Metzler if ( a i j 0 , i j ) , ( b ) . B 0 , ( c ) . C 0 .

2.1.2. Stability Properties

The stability properties of continuous-time linear systems are recalled through the following definitions and propositions.
Definition 2
([31]). The linear system Σ L is globally asymptotically stable if, for every x 0 R n , the state trajectory x ( t ) satisfies lim t x ( t ) = 0 . Moreover, Σ L is globally exponentially stable if there exist constants c 1 > 0 and c 2 > 0 , such that x ( t ) c 1 e c 2 t x 0 , t 0 .
Proposition 2
([31]). The linear system Σ L is globally asymptotically stable if and only if Re ( λ i ( A ) ) < 0 , i = 1 , , n , where λ i are the eigenvalues of A . In this case, the matrix A is denoted as Hurwitz.
For linear systems, global asymptotic stability and global exponential stability are equivalent. Now, we consider system Σ P with external additive perturbations, i.e.,
Σ P : d d t x ( t ) = Ax ( t ) + Bu ( t ) + v ( t ) , x ( 0 ) = x 0 y ( t ) = Cx ( t ) ,
where v t is a bounded exogenous input signal. The trajectories of the system will not converge to the origin x = 0 . However, when the input signal v ( t ) is bounded, the trajectories will converge to a ball centred at the origin, whose radius depends on the bound of v , and remains there for all future times. This behaviour is characterised by the notion of the Input-to-State-Stability.
Definition 3
([31]). System Σ P is said to be Input-to-state stable (ISS) with respect to v t if there exists a class KL function β, a class K function γ such that for any initial state x ( t 0 ) , and any bounded input v ( t ) , the solution x ( t ) exists for all future times t t 0 and satisfies
x t β ( x ( t 0 ) , t t 0 ) + γ sup t 0 τ t v ( τ ) .
Proposition 3
([31]). Let V ( x ) be a continuously differentiable function such that, for all x R n and v R n ,
α 1 x V ( x ) α 2 x V ˙ ( x ) W 3 ( x ) , x ς ( v ) > 0
where α 1 , α 2 are class K functions, ς is a class K function, and W 3 ( x ) is a continuous positive definite function on R n . Then, System (2) is input-to-state stable w.r.t. v ( t ) with γ = α 1 1 α 2 ς .
Proposition 4.
The system Σ P is ISS with respect to v ( t ) if and only if the matrix A is Hurwitz.
Proof. 
Without loss of generality, we set u = 0 to show the ISS property with respect to the perturbation v ( t ) . Let the quadratic Lyapunov function candidate V ( x ) = x P x , where P = P > 0 satisfies the so-called Lyapunov equation A P + PA = Q , for some Q = Q > 0 . Since P > 0 , the function V ( x ) satisfies the Rayleigh inequality
λ min ( P ) x 2 V ( x ) λ max ( P ) x 2 .
Then, the time derivative along system trajectories is given by
V ˙ = x ( t ) ( A P + P A ) x ( t ) + 2 x ( t ) P v ( t ) = x ( t ) Q x ( t ) + 2 x ( t ) P v ( t ) ,
which is bounded by
V ˙ ( x ) λ min ( Q ) x ( t ) 2 + 2 λ max ( P ) x ( t ) v ( t ) 1 θ λ min ( Q ) x ( t ) 2 θ λ min ( Q ) x ( t ) 2 + 2 λ max P x ( t ) v ( t ) , θ 0 , 1 1 θ λ min ( Q ) x ( t ) 2 , whenever x ( t ) > 2 θ λ max ( P ) λ min ( Q ) v ( t ) .
for some θ 0 , 1 . Therefore, the conditions of the ISS Lyapunov Theorem 4.19 in [31] are satisfied with α 1 ( r ) = λ min ( P ) r 2 , α 2 ( r ) = λ max ( P ) r 2 , and ς ( r ) = 2 θ λ max ( P ) λ min ( Q ) r . Consequently, the ISS gain is given by γ ( r ) = λ max ( P ) λ min ( P ) · 2 λ max ( P ) θ λ min ( Q ) r . This concludes that the system Σ P is ISS with respect to v ( t ) . Finally, x ( t ) satisfies the ultimate bound as
lim sup t x ( t ) λ max ( P ) λ min ( P ) · 2 λ max ( P ) θ λ min ( Q ) v ( t ) .
   □

2.2. Discrete-Time Case

In analogy with the continuous-time case, we recall the main concepts for linear discrete-time systems.

2.2.1. Discrete Cooperative Systems

Definition 4
([32]). Consider the discrete-time linear system of the form
Γ L : x [ k + 1 ] = A d x [ k ] + B d u [ k ] , x [ k 0 ] = x k 0 , y [ k ] = C d x [ k ] ,
where ( x [ k ] , y [ k ] , u [ k ] ) R n × R p × R m are the state, the output, and the input vectors, respectively. The discrete-time system Γ L is said to be cooperative if, for any pair of initial conditions and inputs satisfying the partial ordering x k 0 1 x k 0 2 , u 1 [ k ] u 2 [ k ] , k 0 , then the state and output trajectories fulfil
x k , x k 0 1 , u 1 [ k ] x k , x k 0 2 , u 2 [ k ] and y k , x k 0 1 , u 1 [ k ] y k , x k 0 2 , u 2 [ k ] , k 0 .
Proposition 5
([20,30]). Γ L is a linear cooperative discrete-time system if and only if
( i ) . A d 0 , ( ii ) . B d 0 , ( iii ) . C d 0 .

2.2.2. Stability Conditions for Discrete-Time Case

Definition 5
([33]). The linear discrete-time system Γ L in (3) is asymptotically stable if, for  u = 0 , the state trajectory x [ k ] satisfies lim k x [ k ] = 0 for every nonzero initial condition x k 0 R n .
Proposition 6
([33]). The linear discrete-time system Γ L is asymptotically stable if and only if ϱ ( A d ) < 1 , where ϱ ( A d ) = max i | λ i ( A d ) | denotes the spectral radius of A d . Under this condition, A d is called a Schur-stable matrix.
We can next present a general scheme that includes external additive inputs in the system Γ L . To this end, let us consider the following system
Γ P : x [ k + 1 ] = A d x [ k ] + B d u [ k ] + v [ k ] , x ( k 0 ) = x k 0 , y [ k ] = C d x [ k ] ,
where v [ k ] R n stands for a bounded exogenous input. To characterise robustness with respect to bounded exogenous inputs, we use the notion of Input-to-State Stability for the discrete case, which extends classical Lyapunov stability to systems with inputs.
Definition 6
([34]). System Γ P is Input-to-state stable (ISS) with respect to v [ k ] if there exists a KL -function β d and a K -function γ d such that, for every initial condition x k 0 R n and every locally essentially bounded input v [ k ] : N R n , the following inequality holds:
| | x [ k ] | | β d ( | | x k 0 | | , k ) + γ d sup k N | | v [ k ] | | ,
where γ d is known as ISS gain for Γ P .
Proposition 7
([34]). The system Γ P is ISS if and only if there exists a positive definite function V, called an ISS–Lyapunov function, such that the following conditions hold:
1. 
There exist K functions α 1 and α 2 such that
α 1 ( ζ ) V ( ζ ) α 2 ( ζ ) ,
2. 
There exist a K function α 3 and a K function ς such that
V f ( ζ , μ ) V ( ζ ) α 3 ( ζ ) + ς ( μ ) ,
for all ζ R n and all μ R m . Moreover, the latter condition is equivalent to the existence of a K function α 4 ( · ) and a K function χ ( · ) such that
ζ χ ( μ ) V f ( ζ , μ ) V ( ζ ) α 4 ( ζ ) .
Proposition 8.
The linear discrete-time system Γ P is input-to-state stable with respect to the exogenous input v [ k ] if and only if A d is a Schur-stable matrix.
The proof follows quadratic Lyapunov arguments and is omitted for brevity.

2.3. Interval Observers

An interval observer consists of two observers that generate upper and lower bounds (estimates) of the state trajectory whenever the initial conditions and inputs are bounded and partially ordered.
Definition 7
([5,22]). Consider the continuous-time perturbed system Σ P in (2). Assume that
(i) 
The control input u ( t ) and disturbance inputs v ( t ) are bounded by known functions u ± ( t ) and v ± ( t ) , such that
u + ( t ) u ( t ) u ( t ) , t > t 0 ,
v + ( t ) v ( t ) v ( t ) , t > t 0 ,
(ii) 
The initial condition x 0 R n satisfies
x 0 + x 0 x 0 .
where x 0 ± are the upper and lower bounds of x 0 . Thus, the dynamical systems
d d t ξ + ( t ) = G + t , ξ + ( t ) , u + ( t ) , v + ( t ) , ξ + ( t 0 ) = ξ 0 + , x ^ + ( t ) = E + t , ξ + ( t ) , u + ( t ) , v + ( t ) ,
d d t ξ ( t ) = G t , ξ ( t ) , u ( t ) , v ( t ) , ξ ( t 0 ) = ξ 0 , x ^ ( t ) = E t , ξ ( t ) , u ( t ) , v ( t ) ,
where ξ + : R + R n and ξ : R + R n represent the observer states, and the initialisation satisfies ξ 0 + = g + ( t 0 , x 0 + ) and ξ 0 = g ( t 0 , x 0 ) . The systems (8)–(9) constitute an interval observer for (2) if
  • for any admissible inputs satisfying (5)–(6),
    lim sup t x ^ + ( t ) x ^ ( t ) β ,
    for some constant β 0 , and
  • for any vectors x 0 , x 0 , x 0 + R n satisfying (7), and admissible inputs fulfilling (5)–(6), the solutions of (2), (8), (9) satisfy
    x ^ + ( t ) x ( t ) x ^ ( t ) , t t 0 .
Remark 1.
If u + ( t ) = u ( t ) and v + ( t ) = v ( t ) for all t t 0 , then β = 0 ; that is, the upper and lower estimates asymptotically coincide. Moreover, an interval observer can be constructed by combining two observers: an upper and a lower, each preserving the partial ordering of initial conditions and exogenous inputs. This is the approach adopted in this work. Likewise, a discrete-time counterpart can be formulated analogously for the discrete-time linear system in Γ L by replacing the differential equations in (8) and (9) with their difference-equation expressions.

3. Continuous-Time Interval Observers

In this section, we propose full-order and reduced-order interval observers for a class of continuous-time linear systems affected by bounded inputs, bounded disturbances, and additive measurement noise. The observer designs rely on two key properties: (i) cooperativity to preserve partial ordering between the interval estimates and state trajectory, and (ii) practical stability (ISS) to guarantee boundedness of the estimation error.
We consider the continuous-time plant
d d t x 1 ( t ) = A 1 x 1 ( t ) + A 3 x 2 ( t )
d d t x 2 ( t ) = A 2 x 1 ( t ) + A 4 x 2 ( t ) + B u ( t ) + D v ( t ) ,
y ( t ) = x 1 ( t ) + ρ ( t ) ,
where x 1 ( t ) R n 1 and x 2 ( t ) R n 2 denote the measured and unmeasured state components, respectively; u ( t ) R m is the control input; v ( t ) R q is an unknown disturbance; and  y ( t ) R n 1 is the measured output. The additive measurement noise satisfies ρ L n 1 . All matrices have compatible dimensions. We assume that the system (10) is observable. Furthermore, we introduce the following structural assumptions.
Assumption 1.
The dimension of the measured component x 1 ( t ) is greater or equal to that of the unmeasured component x 2 ( t ) , i.e.,  n 1 n 2 .
Furthermore, let A 3 be a full column rank.
Assumption 2.
The known matrices B and D are non-negative. Moreover, the inputs u ( t ) and v ( t ) are bounded by intervals—that is,
B 0 , D 0 , u + ( t ) u ( t ) u ( t ) , v + ( t ) v ( t ) v ( t ) , t 0 .
where u ± ( t ) and v ± ( t ) are known bounds of the signals u ( t ) and v ( t ) , respectively.
Assumption 3.
The measurement noise ρ ( t ) is continuously differentiable and satisfies
ρ ( t ) r 1 , ρ ˙ ( t ) r 2 , t 0 ,
for some constants r 1 > 0 and r 2 > 0 .
Assumption 3 restricts the class of admissible noise signals, since it requires differentiability. In practice, nonsmooth noise can be preprocessed via smoothing, total-variation regularisation, or filtering [35,36,37,38] to obtain a continuous signal with bounded derivative. Importantly, one does not require knowledge to ρ ( t ) or ρ ˙ ( t ) , but only to known bounds r 1 and r 2 . In the following, we consider that the measurement output has been appropriately treated, in order to deal with a continuous noise signal, with smaller bounds r 1 and r 2 .

3.1. Full-Order Interval Observer for the Continuous-Time System

We now introduce two observers that provide upper and lower estimates of the state of (10) through an appropriate choice of gains. Consider the observers,
Σ O + : d d t w 1 + w 2 + = F 1 w 1 + w 2 + + F 2 y ( t ) + 0 B u + ( t ) + 0 D v + ( t ) + η , x ^ 1 + x ^ 2 + = w 1 + w 2 + + L 3 L 4 A 3 y ( t ) ,
Σ O : d d t w 1 w 2 = F 1 w 1 w 2 + F 2 y ( t ) + 0 B u ( t ) + 0 D v ( t ) η , x ^ 1 x ^ 2 = w 1 w 2 + L 3 L 4 A 3 y ( t ) ,
where w i ± , i = 1 , 2 , are the observer states, and x ^ i ± , i = 1 , 2 , are the state bounds (interval estimates). Moreover, the matrices F 1 and F 2 are given as follows:
F 1 : = L 1 A 3 L 3 L 2 A 4 L 4 ,
F 2 : = A 1 L 3 A 3 A 1 + ( A 3 L 3 ) L 4 A 3 + L 1 ( I n 1 L 3 A 3 ) A 2 L 4 A 3 A 1 + ( A 4 L 4 ) L 4 A 3 + L 2 ( I n 1 L 3 A 3 ) ,
and L 1 R n 1 × n 1 , L 2 R n 2 × n 1 , L 3 R n 1 × n 2 , and L 4 R n 2 × n 2 are the observer gains. In addition, η R n 1 + n 2 is a vector chosen to upper-bound the worst-case contribution of bounded measurement noise:
η : = | A 1 | + | L 3 A 3 A 1 | | A 2 | + | L 4 A 3 A 1 | 1 n 1 r 1 + ( I n 1 + | L 3 A 3 | | L 4 A 3 | )   1 n 1 r 2 .
A particular case of this interval observer ( Σ O + , Σ O ) was presented in [39], where the states x 1 and x 2 have the same dimension, n 1 = n 2 , A 1 = 0 , A 3 = I , and ρ ( t ) , ρ ˙ ( t ) = 0 . The following theorem provides conditions for the systems (11) and (12) to constitute an interval observer for Plant (10).
Theorem 1.
Consider Assumptions 1–3. Furthermore, let L i , i = 1 , , 4 , be chosen such that the matrix F 1 in (13a) is Hurwitz and Metzler. Then, the observers ( Σ O + , Σ O ) constitute an interval observer for (10).
The structure of the proposed full-order interval observer is illustrated in Figure 1. This block diagram provides a graphical representation of the signal flow, including the system dynamics, the measurement noise, and the observer structure. In particular, it highlights the role of the observer gains L 1 , L 2 , L 3 , and L 4 in shaping the estimation error dynamics, as well as the incorporation of the term η . This representation complements the mathematical formulation and facilitates the interpretation of the design procedure.
To calculate the interval observer gains, we establish the following Algorithm 1.
Algorithm 1 Given that the matrices A 3 and A 4 satisfy Assumption 1, the estimation error matrix F 1 in (13a) can be constructively assigned as follows
(1)
Select a desired matrix F p R ( n 1 + n 2 ) × ( n 1 + n 2 ) such that F p is Metzler and Hurwitz.
(2)
Partition F p as
F p = F 11 F 12 F 21 F 22 ,
with compatible dimensions.
(3)
Compute the observer gains L 1 , L 2 , L 3 , L 4 as follows:
L 1 = F 11 , L 3 = A 3 F 12 , L 2 = F 21 , L 4 = A 4 F 22 .
(4)
Construct the matrix F 1 using (13a), which satisfies F 1 = F p .
Remark 2.
A possible choice to render F 1 in (13a) Hurwitz and Metzler is
L 1 = 1 I n 1 , 1 > 0 , L 2 = 0 n 2 × n 1 , L 3 = A 3 , L 4 = A 4 + 4 I n 2 , 4 > 0 .
Please note that with this choice F 1 = diag ( 1 I n 1 , 4 I n 2 ) , which has repeated eigenvalues 1 and 4 and non-negative off diagonal terms.

3.2. Reduced-Order Interval Observer for the Continuous-Time System

We now present a reduced-order interval observer that estimates only the unmeasured state x 2 ( t ) . We consider the observers of the following form:
Σ RO + : d d t w 2 + ( t ) = G 1 w 2 + ( t ) + G 2 y ( t ) + B u + ( t ) + D v + ( t ) + η . x ^ 2 + ( t ) = w 2 + t + L 4 A 3 y t .
Σ RO : d d t w 2 ( t ) = G 1 w 2 ( t ) + G 2 y ( t ) + B u ( t ) + D v ( t ) η . x ^ 2 ( t ) = w 2 t + L 4 A 3 y t .
where w 2 ± ( t ) are internal observer states, and x ^ 2 ± ( t ) denote the interval estimates of x 2 ( t ) . The matrices are defined as G 1 : = A 4 L 4 , G 2 : = A 2 L 4 A 3 A 1 + A 4 L 4 L 4 A 3 , and η : = | A 2 | + | L 4 A 3 A 1 | 1 n 1 r 1 + | L 4 A 3 | 1 n 1 r 2 . The following theorem establishes that the pair Σ RO + , Σ RO form an interval observer for x 2 ( t ) .
Theorem 2.
Consider the hypotheses of Theorem 1. By choosing L 4 such that the matrix A 4 L 4 is Metzler and Hurwitz, then the observers ( Σ RO + , Σ RO ) form an interval observer for x 2 ( t ) .
Remark 3.
The Metzler property of the matrix A 4 L 4 ensures cooperativity of the observer error dynamics, which guarantees preservation of the partial order. The Hurwitz property guarantees practical stability, ensuring boundedness of the interval estimation error. By setting L 4 = A 4 + k 4 I , k 4 > 0 , the observation error becomes cooperative and stable.
The design of the reduced-order interval observer is depicted in Figure 2. The diagram illustrates the transformation used to eliminate the dependence on the unmeasured state and emphasises the role of the gain L 4 in ensuring the desired properties of the estimation error dynamics. Additionally, it shows how the bounding term η is incorporated into the observer structure. This visual representation provides a clearer understanding of the reduced-order design and its implementation.
To complete the design of both the full-order and reduced-order interval observers, we introduce a constructive algorithm (Algorithm 2) that provides a systematic procedure for computing the observer gains such that the estimation error dynamics fulfil cooperativity and Input-to-State Stability properties.
Algorithm 2 Algorithm for computing the gains for the continuous-time interval observer for Plant (10)
Ensure: Assumptions 1, 2, and 3 in §3 are satisfied
    if Full order observer in Equations (11) and (12) then
          Choose: L 1 , L 2 , L 3 , and  L 4 such that F 1 in (13a) is Hurwitz and Metzler
          Compute: F 2 and η in Equations (13b) and (14), respectively
    else if Reduced order observer in Equations (15) and (16) then
          Choose: L 4 such that G 1 = A 4 L 4 is Hurwitz and Metzler
          Compute: G 2 : = A 2 L 4 A 3 A 1 + A 4 L 4 L 4 A 3
          Compute: η : = | A 2 | + | L 4 A 3 A 1 | 1 n 1 r 1 + | L 4 A 3 | 1 n 1 r 2
    end if

4. Discrete-Time Interval Observers

In this section, we address the discrete-time counterparts of the full-order and reduced-order interval observer designs.
We consider the discrete-time plant, in a form analogous to (10),
x 1 [ k + 1 ] = A 1 d x 1 [ k ] + A 3 d x 2 [ k ]
x 2 [ k + 1 ] = A 2 d x 1 [ k ] + A 4 d x 2 [ k ] + B d u [ k ] + D d v [ k ] ,
y [ k ] = x 1 [ k ] + ρ [ k ] ,
where ( x 1 [ k ] , x 2 [ k ] , y [ k ] , u [ k ] , v [ k ] ) R n 1 × R n 2 × R n 1 × R m × R q denote the measured state component (output up to measurement noise), the unmeasured state component, the measured output, the control input, and the unknown perturbation input, respectively. We assume that componentwise lower and upper bounds for the initial conditions, inputs, and perturbations are available as in (5), (6), and (7). Moreover, the measurement noise ρ
ρ [ k ] r 1 , k N .

4.1. Full-Order Interval Observer for the Discrete-Time System

We introduce the transformed observer coordinates w i ± [ k ] , i = 1 , 2 , defined below, to avoid the explicit dependence on y [ k + 1 ] in the reconstruction of x 2 [ k ] . We propose the following discrete-time full-order interval observer, given by the expressions
Σ DO + : w 1 + [ k + 1 ] w 2 + [ k + 1 ] = F 1 d w 1 + [ k ] w 2 + [ k ] + F 2 d y [ k ] + 0 B d u + [ k ] + 0 D d v + [ k ] + η d x ^ 1 + [ k ] x ^ 2 + [ k ] = w 1 + [ k ] w 2 + [ k ] + L 3 d L 4 d A 3 d y [ k ] ,
Σ DO : w 1 [ k + 1 ] w 2 [ k + 1 ] = F 1 d w 1 [ k ] w 2 [ k ] + F 2 d y [ k ] + 0 B d u [ k ] + 0 D d v [ k ] η d x ^ 1 [ k ] x ^ 2 [ k ] = w 1 [ k ] w 2 [ k ] + L 3 d L 4 d A 3 d y [ k ] ,
where w i ± [ k ] , i = 1 , 2 represent the observer states and x ^ i ± [ k ] , i = 1 , 2 are the upper and lower estimates. The matrices F 1 d and F 2 d are defined as
F 1 d : = L 1 d A 3 d L 3 d L 2 d A 4 d L 4 d ,
F 2 d : = A 1 d L 3 d A 3 d A 1 d + ( A 3 d L 3 d ) L 4 d A 3 d + L 1 d ( I n 1 L 3 d A 3 d ) A 2 d L 4 d A 3 d A 1 d + ( A 4 d L 4 d ) L 4 d A 3 d + L 2 d ( I n 1 L 3 d A 3 d ) ,
where L 1 d R n 1 × n 1 , L 2 d R n 2 × n 1 , L 3 d R n 1 × n 2 , L 4 d R n 2 × n 2 are the observer gains. We assume that A 3 d admits a left inverse A 3 d R n 2 × n 1 satisfying A 3 d A 3 d = I n 2 . The vector η d R n 1 + n 2 is selected to upper-bound the worst-case contribution of bounded measurement noise in the transformed dynamics, and is defined as
η d : = I n 1 + | A 1 d | + | L 3 d A 3 d A 1 d | + | L 3 d A 3 d | | A 2 d | + | L 4 d A 3 d A 1 d | + | L 4 d A 3 d | r 1 1 n .
Theorem 3.
Consider Assumptions 1 and 2, and let ρ [ k ] satisfy (18). Additionally, let the gains be chosen such that F 1 d 0 and ϱ ( F 1 d ) < 1 . Then, the observer pair (19) and (20) constitutes an interval observer for discrete-time system (17), such that
x ^ + [ k ] x [ k ] x ^ [ k ] , k N .
Remark 4.
The choice L 1 d = 1 d I n 1 , 1 d 1 , 0 , L 2 d = 0 n 2 × n 1 , L 3 d = A 3 d , L 4 d = A 4 + 4 d I n 2 , 4 d 1 , 0 renders F 1 d in (21a) both non-negative and Schur-stable.
Please note that with this choice F 1 d = diag ( 1 I n 1 , 4 I n 2 ) .

4.2. Reduced-Order Interval Observer or the Discrete-Time System

As in the continuous-time case, a reduced-order interval observer can be constructed in order to estimate only the unmeasured state x 2 [ k ] . To this end, consider
Σ DRO + : w 2 + [ k + 1 ] = G 1 d w 2 + [ k ] + G 2 d y [ k ] + B d u + [ k ] + D d v + [ k ] + η d . x ^ 2 + [ k ] = w 2 + [ k ] + L 4 d A 3 d y [ k ] .
Σ DRO : w 2 [ k + 1 ] = G 1 d w 2 [ k ] + G 2 d y [ k ] + B d u [ k ] + D d v [ k ] η d . x ^ 2 [ k ] = w 2 [ k ] + L 4 d A 3 d y [ k ] ,
where w 2 ± [ k ] are the internal observer states, and x ^ 2 ± [ k ] denote the interval estimates of x 2 [ k ] , with the matrices G 1 d : = A 4 d L 4 d , G 2 d : = A 2 d L 4 d A 3 d A 1 d + A 4 d L 4 d L 4 d A 3 d , and
η d : = | A 2 d | + | L 4 d A 3 d A 1 d | + | L 4 d A 3 d | 1 n 1 r 1 .
The following theorem states the design conditions of the reduced-order interval observers Σ DRO + , Σ DRO for the discrete-time plant (17).
A preliminary version of this result was presented in [40], where no measurement noise was considered, n 1 = n 2 , and  A 1 = 0 and A 3 = I .
Theorem 4.
Consider the hypothesis of Theorem 3. Let L 4 d be chosen such that the matrix G 1 d is non-negative and Schur-stable. Then, the observers (23) and (24) are an interval observer for x 2 [ k ] in (17).
Now, Algorithm 3 shows a design procedure for the discrete-time observers. The key difference w.r.t. the continuous-time one is that the desired matrices F 1 d and G 1 d are Schur-stable and non-negative. To define matrices with those properties, one may choose diagonal matrices (as in Remarks 4) or triangular matrices, ensuring that the diagonal entries, i.e., the eigenvalues of the matrices, are smaller than one. To set a more general matrix F 1 d , one may use Algorithm 1, considering that the target matrix is non-negative and Schur-stable.
Algorithm 3 Algorithm for computing the gains for the discrete-time interval observer for Plant (17)
Ensure: Assumptions 1 and 2 in Section 3, along with a bound for the measurement noise ρ [ k ] in Equation (18) are satisfied
    if Full order observer in Equations (19) and (20) then
        Choose: L 1 d , L 2 d , L 3 d , and  L 4 d such that F 1 d in (21a) is Schur-stable and non-negative
        Compute: F 2 d and η d in Equaitons (21b) and (22), respectively
    else if Reduced order observer in Equations (23) and (24) then
        Choose: L 4 d such that G 1 d = A 4 d L 4 d is Schur-stable and non-negative
        Compute: G 2 d : = A 2 d L 4 d A 3 d A 1 d + A 4 d L 4 d L 4 d A 3 d
        Compute: η d : = | A 2 d | + | L 4 d A 3 d A 1 d | + | L 4 d A 3 d | 1 n 1 r 1
    end if

5. Numerical Examples

In this section, we present three examples related to the design of interval observers for linear systems. The first example considers the design for the continuous-time interval observer, while the second includes the design for the discrete-time case. In both cases, we design a full and a reduced observer. At a later stage, we consider an interval observer for a mechanical system in continuous and discrete-time.

5.1. Continuos-Time Observer

Let us consider the following plant, which is in the form of Equation (10).
d d t x 1 ( t ) = 1.3623 1.7593 1.0423 1.3239 x 1 ( t ) + 0.2548 0.6678 0.2240 0.8444 x 2 ( t )
d d t x 2 ( t ) = 0.2891 0.6951 0.6718 0.0680 x 1 ( t ) + 4.6555 4.3247 4.2195 4.9933 x 2 ( t ) + 0.6022 0.3868 u ( t ) + 0.9160 0.0012 v ( t ) ,
y ( t ) = x 1 ( t ) .
Note that the number of measured states, n 1 , is equal to that of the unmeasured ones, n 2 . Thus, Assumption 1 is fulfilled. In addition, the input, perturbation, and output matrices above are non-negative. The control input and the perturbation are time-varying signals but bounded within intervals, 5 > u ( t ) > 0 ,   6 > v ( t ) > 0 .
Figure 3 shows the applied inputs to the system in (26). In the scalar case, the control input u ( t ) satisfies the inequality u + ( t ) u ( t ) u ( t ) , t 0 , where u + ( t ) = 5 and u ( t ) = 0 represent the upper and lower bounds of u ( t ) , respectively. Similarly, the perturbation v ( t ) is bounded according to v + ( t ) v ( t ) v ( t ) , with v + ( t ) = 6 and v ( t ) = 0 .
In this example, two simulation scenarios will be considered to illustrate the behaviour of the proposed interval observer designs for the system (26) in the presence of bounded perturbations v ( t ) and measurement noise ρ ( t ) :
i.
A full-order interval observer is designed to provide upper and lower estimates for all the system states, x ( t ) = [ x 1 ( t ) x 2 ( t ) ] , relying on the outputs of the first subsystem.
ii.
A reduced-order interval observer is developed, whose dimension is lower than that of the plant, to generate the interval estimates only of the unmeasured states x 2 ( t ) from available measurements.

5.1.1. Full-Order Interval Observer Design

In this scenario, we design the full-order interval observer, by ensuring that the conditions of Theorem 1 are fulfilled.
By taking into account Remark 2, let the interval observer’s gains be
L 1 = 5 I 2 = 5 0 0 5 , L 2 = 0 2 x 2 , L 3 = A 3 = 0.2548 0.6678 0.2240 0.8444 , L 4 = 10.3445 4.3247 4.2195 10.0067
thus , F 1 = diag { 5 , 5 , 15 , 15 } , F 2 = 1 × 10 3 0 0 0 0 2.1469 1.9332 1.2943 1.2761 .
The initial conditions for the full-order interval observer were chosen as x ^ 1 + ( 0 ) = [ 1 1 ] , x ^ 2 + ( 0 ) = [ 1 1 ] , x ^ 1 ( 0 ) = [ 0 0 ] , and x ^ 2 ( 0 ) = [ 0 0 ] , while the initial states of the plant were x 1 ( t ) = [ 0.5 0 ] and x 2 ( t ) = [ 0 0.1 ] , such that the interval inequality x ^ + ( 0 ) x ( 0 ) x ^ ( 0 ) , is satisfied, with x ( 0 ) = [ x 1 ( 0 ) x 2 ( 0 ) ] and x ^ i ( 0 ) = [ x ^ 1 i ( 0 ) x ^ 2 i ( 0 ) ] , with i = + , .
Figure 4 illustrates the dynamic behaviour of the full-order interval observer ( Σ O + , Σ O ) applied to the system (26), where the upper and lower estimations fulfill the partial ordering and practical convergence properties with respect to the trajectories of the state, satisfying the expression x ^ + ( t ) x ( t ) x ^ ( t ) , t 0 , from the partial ordering assumed for the initial conditions and input signals. Moreover, the estimation errors are depicted in Figure 5 under above conditions e + ( t ) = x ^ + ( t ) x ( t ) and e ( t ) = x ( t ) x ^ ( t ) . Note that the estimation errors e 2 j ( t ) , with j = 1 , 2 , are expected to preserve the partial ordering and converge asymptotically to an ultimate bound in the presence of the control input and the perturbation.
In this scenario, the trajectories of the interval estimation errors, under levels of measurement noise and external perturbations, are depicted in Figure 6. The measurement noise used were ρ ( t ) = 3 × 10 3 sin ( 5 t ) sin ( 20 t ) , and the upper bounds for the noise and its derivative were set as r 1 = 3 × 10 3 and r 2 = 60 × 10 3 , respectively. Using these simulation conditions, it is easy to verify that the inequality x ^ + ( t ) x ( t ) x ^ ( t ) , t 0 , is satisfied, which demonstrates the robustness and monotonicity (cooperativity) properties of the proposed interval observer based on the design of Theorem 1.

5.1.2. Reduced-Order Interval Observer Design

Analogously, in this scenario, we design the reduced-order interval observer for Plant (26), now ensuring the conditions of Theorem 2. Thus, we choose the design matrices as
L 4 = A 4 + 15 I = 10.3445 4.3247 4.2195 10.0067 , G 1 = 15 0 0 15 , G 2 = 1 × 10 3 2.1469 1.9332 1.2943 1.2761 .
The initial conditions for the reduced-order interval observer were selected as x ^ 2 + ( 0 ) = [ 1 1 ] and x ^ 2 ( 0 ) = [ 0 0 ] , while the initial state of the plant was x 2 ( t ) = [ 0.5 0.5 ] , such that the interval inequality x ^ 2 + ( 0 ) x 2 ( 0 ) x ^ 2 ( 0 ) , is fulfilled.
Under the same simulation conditions for the inputs presented in Figure 3, Figure 7 and Figure 8 show the responses of the interval estimated states and estimation errors for this scenario. Furthermore, Figure 9 presents the estimation error with measurement noise, considering the same levels as in the full-order interval observer case. It is clear to see that the reduced-order interval observer preserves the partial ordering and practical convergence properties with respect to the trajectories of state x 2 , which guarantees the interval relation x ^ 2 + ( t ) x 2 ( t ) x ^ 2 ( t ) , t 0 .

5.2. Discrete-Time Observers

In this subsection, we present a numerical example to illustrate the performance of the proposed interval observers in the discrete-time setting, following the scenarios previously presented in the continuous-time case.
We consider the following discrete-time plant, with a sampling step of τ = 0.3 ,
x 1 [ k + 1 ] = 0.1272 0.5483 0.0464 0.4240 x 1 [ k ] + 0.0988 0.0258 0.0170 0.0397 x 2 [ k ]
x 2 [ k + 1 ] = 0.0558 0.0166 0.0313 0.0622 x 1 [ k ] + 0.0444 0.2414 0.4105 0.5897 x 2 [ k ] + 0.4022 0.6207 u [ k ] + 0.1544 0.3813 v [ k ] ,
y [ k ] = x 1 [ k ] .
Similarly to the continuous case, we assume that the upper and lower bounds are available for the initial conditions, inputs, and perturbations.

5.2.1. Discrete-Time Full-Order Interval Observer

In this part, a discrete-time full-order interval observer is designed according to Theorem 3.
By considering Remark 4, the observer gains are chosen as
L 1 d = 0.2 0 0 0.2 , L 2 d = 0 2 x 2 , L 3 d = A 3 d = 0.0988 0.0258 0.0170 0.0397 , L 4 d = A 4 d 0.2 I 2 = 0.1556 0.2414 0.4105 0.3897 .
With this choice, the matrices of the observer dynamics are
F 1 d = 0.2 0 0 0 0 0.2 0 0 0 0 0.2 0 0 0 0 0.2 , F 2 d = 0 0 0 0 0.5309 0.1560 0.1392 3.2539 ,
which endows the state matrix of the observation error, F 1 , with repeated eigenvalues in 0.2.
The initial conditions for the full-order (discrete time) interval observer were chosen as x ^ 1 + ( 0 ) = [ 5 5 ] , x ^ 2 + ( 0 ) = [ 5 5 ] , x ^ 1 ( 0 ) = [ 0 0 ] , and x ^ 2 ( 0 ) = [ 0 0 ] , while the initial states of the plant were x 1 ( t ) = [ 1.2 3.5 ] and x 2 ( t ) = [ 0.9 2.5 ] , such that the interval inequality x ^ + ( 0 ) x ( 0 ) x ^ ( 0 ) , is satisfied, with x ( 0 ) = [ x 1 ( 0 ) x 2 ( 0 ) ] and x ^ i ( 0 ) = [ x ^ 1 i ( 0 ) x ^ 2 i ( 0 ) ] , with i = + , .
By considering the sampled version of the inputs in Figure 3, the evolution of the true states together with their interval estimates is shown in Figure 10. The estimation error is presented in Figure 11, while the estimation error in the presence of measurement noise is shown in Figure 12. These results verify that the true state trajectory remains bounded between the upper and lower estimates for all k N .

5.2.2. Discrete-Time Reduced-Order Interval Observer

To conclude this numerical example, we consider the discrete-time reduced-order interval observer derived in Theorem 4. The observers proposed in (23) and (24) are implemented with the matrix gain L 4 d = A 4 d 0.1 I , which leads to the following matrices of the observers
L 4 d = 0.0556 0.2414 0.4105 0.4897 , G 1 = 0.1 0 0 0.1 , G 2 = 0.2319 1.3416 0.5347 4.7072 .
The interval estimates are shown in Figure 13, while the estimation errors are presented in Figure 14. Finally, the estimation error in the presence of measurement noise is illustrated in Figure 15. These results verify that the reduced-order interval observer preserves the interval-bounding property for the unmeasured state, x ^ 2 + [ k ] x 2 [ k ] x ^ 2 [ k ] ,   k N .

5.3. Mechanical System

This example illustrates the effectiveness of the proposed full-order interval observer for a mechanical benchmark system composed of two masses connected by a spring and a damper [41] in the presence of bounded inputs and disturbances. Unlike numerical examples, this benchmark highlights the applicability of the proposed interval observer to a physically motivated dynamical system.
The continuous-time linear system is represented by the equations
d d t z 1 z 2 z 3 z 4 = 0 0 1 0 0 0 0 1 k m 1 k m 1 c m 1 c m 1 k m 2 k m 2 c m 2 c m 2 z 1 z 2 z 3 z 4 + 0 0 1 m 1 0 ( u ( t ) + v ( t ) ) y = z 1 z 2 ,
where z 1 and z 2 denote the positions of the masses, while z 3 and z 4 represent their velocities. Introducing the partition x 1 = ( z 1 z 2 ) and x 2 = ( z 3 z 4 ) , the system (28) can be rewritten in the form presented in (10), with the matrices
A 1 = 0 2 × 2 , A 2 = k m 1 k m 1 k m 2 k m 2 , A 3 = I 2 , A 4 = c m 1 c m 1 k m 2 k m 2 ,
where the parameters values are given as m 1 = 3 , m 2 = 10 , k = 5 , and c = 1 . The control input u ( t ) and disturbance v ( t ) are assumed to be bounded as 5 > u ( t ) > 0 , 6 > v ( t ) > 0 . Moreover, the initial conditions for the interval observer are x ^ 1 + ( 0 ) = [ 10 10 ] , x ^ 2 + ( 0 ) = [ 10 10 ] , x ^ 1 ( 0 ) = [ 0 0 ] , and x ^ 2 ( 0 ) = [ 0 0 ] , while the initial state of the plant is chosen as x 1 ( t ) = [ 5 5 ] and x 2 ( t ) = [ 5 5 ] . Thus, these initial states satisfy the interval inequality x ^ + ( 0 ) x ( 0 ) x ^ ( 0 ) .
For this example, we apply the continuous-time full-order interval observer design proposed in Theorem 1 to the plant (28). The selected gains for the interval observer in (11) and (12) are
L 1 = 2 I 2 = 2 0 0 2 , L 2 = 1 0 0 1 , L 3 = 0 2 × 2 , L 4 = A 4 + 2 I 2 = 1.6667 0.3333 0.5 1.5 .
The behaviour of the system states and their interval estimates (bounds) are illustrated in Figure 16. It is clear to see that the true state trajectory remains bounded between the upper and lower estimates, that is, x ^ + ( t ) x ( t ) x ^ ( t ) ,   t 0 . Furthermore, the estimation errors practically converge to a bounded set, given by the presence of bounded perturbations, verifying the theoretical conditions in Theorem 1.
The estimation errors are depicted in Figure 17. There, the time axis is drawn on a logarithmic scale. This scale allows us to show in one diagram the initial conditions for the estimation error as well as the final values that the estimation error achieves. There, one can also see that the upper and lower error bounds monotonically converge toward values close to zero, indicating that the width of the estimation interval decreases over time.

5.4. Mechanical System, Discrete-Time Case

Applying the Euler discretisation, with a sampling period τ = 0.1 s, to the plant considered in (28), we obtain the discrete-time model
z [ k + 1 ] = A d z [ k ] + B d u [ k ] + D d v [ k ] ,
where the derivative is approximated by z ˙ ( t ) z [ k + 1 ] z [ k ] τ . The matrices are A d = I + τ A , B d = 0 τ B , D d = 0 τ D . Moreover, A , B , and D correspond to those defined in (28). Then, the matrices of the sampled system are given by
A d = 1 0 0.1 0 0 1 0 0.1 0.1667 0.1667 0.9667 0.0333 0.05 0.05 0.01 0.99 , B d = D d = 0 0 0.0333 0 .
In this case, the same initial conditions and input signals considered in the continuous-time scenario are used. By applying Theorem 4, the gains of the discrete-time interval observer (19) and (20) are obtained as
L 1 d = 0.9 0 0 0.9 , L 2 d = 0 2 x 2 , L 3 d = A 3 d = 0.1 0 0 0.1 , L 4 d = A 4 d 0.7 I 2 = 0.2667 0.0333 0.01 0.29 .
The behaviour of the true unmeasured states, together with their interval estimates, is shown in Figure 18, while the estimation errors are depicted in Figure 19. As expected, the figures confirm the partial ordering between the interval estimates and the true state trajectory for all time instants; that is, x ^ 2 + [ k ] x 2 [ k ] x ^ 2 [ k ] ,   k N .

6. Conclusions

This paper proposed a unified design framework for both full-order and reduced-order interval observers for continuous-time and discrete-time linear systems subject to bounded disturbances and uncertainties, including measurement noise. A central contribution of the proposed methodology is the constructive gain-selection procedure, which enables the estimation error dynamics to be assigned within an admissible class compatible with the observer structure while simultaneously ensuring the required stability and cooperativity properties. For continuous-time systems, this admissible class corresponds to Metzler–Hurwitz error dynamics, whereas for discrete-time systems, it corresponds to element-wise non-negative and Schur-stable error dynamics. This construction guarantees the preservation of the partial ordering between the true state trajectory and the upper and lower interval estimates, while ensuring practical stability of the estimation error dynamics. The unified formulation allows a consistent treatment of both time domains, making the proposed approach suitable for applications in physical systems. Simulation results confirmed the effectiveness and robustness of the proposed observers, demonstrating the interval closure for the state trajectories across various disturbance scenarios. Future research will focus on extending the methodology to nonlinear systems, incorporating time delays, and validating the proposed observers in experimental testbeds for biological processes. A comparative analysis with LMI-based interval observer approaches, considering computational time, interval width, conservatism, and robustness margins, will also be addressed in future work.

Author Contributions

Conceptualisation, F.L.-C. and J.D.A.; Formal analysis, F.L.-C. and J.D.A.; Investigation, F.L.-C., J.D.A. and G.B.-N.; Methodology, F.L.-C., J.D.A., G.B.-N., R.M. and C.M.; Project administration, J.D.A., R.M. and C.M.; Validation, F.L.-C. and J.D.A.; Writing—original draft, F.L.-C., J.D.A., G.B.-N., R.M. and C.M.; Writing—review and editing, F.L.-C., J.D.A., G.B.-N., R.M. and C.M. All authors have read and agreed to the published version of the manuscript.

Funding

F.L.-C. acknowledges the financial support provided by Universidad de Guanajuato by means of the Convocatoria Insitucional de Investigación Científica, project 51/2024. The authors also acknowledge the financial support provided by Universidad Autónoma de Baja California for covering the publication costs of this work.

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A. Proofs

Proof of the Theorem 1. 
In this proof, we consider only the upper observer case. The proof for the lower observer case follows analogously by symmetry of the design.
Since y ( t ) = x 1 ( t ) + ρ ( t ) , the plant (10) in the coordinates ( y ( t ) , x 2 ( t ) ) can be equivalently expressed as follows:
d d t y ( t ) x 2 ( t ) = A 1 A 3 A 2 A 4 y ( t ) x 2 ( t ) + 0 B u ( t ) + 0 D v ( t ) A 1 A 2 ρ ( t ) + I n 1 0 n 2 × n 1 ρ ˙ ( t ) .
where the latter two additive terms arise from the presence of noise in the output. For analysis purposes, the upper-bound observer can be rewritten as
d d t x ^ 1 + ( t ) x ^ 2 + ( t ) = A 1 A 3 A 2 A 4 y ( t ) x ^ 2 + ( t ) + 0 B u + ( t ) + 0 D v + ( t ) L 1 L 2 y ^ + ( t ) y ( t ) L 3 L 4 x ^ 2 + ( t ) x 2 ( t ) + σ , y ^ + ( t ) = x ^ 1 + ( t ) , σ = | A 1 | | A 2 | 1 n 1 r 1 + I n 1 0 n 2 × n 1 1 n 1 r 2 .
(i) 
Cooperativity. By defining the upper estimation error as e + ( t ) : = e 1 + ( t ) e 2 + ( t ) , where e 1 + ( t ) : = y ^ + ( t ) y ( t ) and e 2 + ( t ) : = x ^ 2 + ( t ) x 2 ( t ) , then the dynamics of the upper estimation error system can be written in compact form as
e ˙ + ( t ) = F 1 e + ( t ) + B ˜ d + ( t )
with
B ˜ : = 0 0 I n 1 B D I n 2 ,
and the grouped input vector is defined as d + ( t ) = u ¯ ( t ) v ¯ ( t ) σ ¯ ( t ) , with u ¯ ( t ) : = u + ( t ) u ( t ) 0 , v ¯ ( t ) : = v + ( t ) v ( t ) 0 , and
σ ¯ ( t ) : = σ + A 1 A 2 ρ ( t ) I n 1 0 n 2 × n 1 ρ ˙ ( t ) 0 .
It should be noted that the functions σ ( t ) and σ ¯ ( t ) are constructed using the bounds in Assumption 3, where r 1 and r 2 denote the upper bounds of ρ ( t ) and ρ ˙ ( t ) , respectively. By construction, both functions are non-negative, ensuring that σ ( t ) 0 and σ ¯ ( t ) 0 for all t. According to the above assumptions, the state matrix F 1 is Metzler and Hurwitz, and the d ( t ) vector has non-negative entries, d ( t ) 0 . Thus, this formulation establishes the cooperativity of the error dynamics. Consequently, if the initial condition satisfies x ^ + ( 0 ) x ( 0 ) , then the upper estimate remains an upper bound of the true state trajectory; that is,
x ^ + ( t ) x ( t ) , t 0 .
(ii) 
Practical Stability: Input-to-State-Stability. Now, to guarantee the stability of the observation error, we consider the Lyapunov function candidate V ( e + ( t ) ) = e + ( t ) P e + ( t ) , where e + ( t ) : = e 1 + ( t ) e 2 + ( t ) . P = P > 0 satisfies the Lyapunov equation; that is,
F 1 P + P F 1 = Q ,
for some Q = Q > 0 . Then, the quadratic function V ( e + ( t ) ) satisfies the following inequality:
λ min ( P ) e + 2 V ( e + ) λ max ( P ) e + 2 .
Then, the time derivative along system trajectories is described as follows:
V ˙ ( e + ( t ) ) = e + ( t ) F 1 P + PF 1 e + ( t ) + 2 e + ( t ) P B ˜ d + ( t ) = e + ( t ) Q e + ( t ) + 2 e + ( t ) P B ˜ d + ( t )
which is bounded by
V ˙ ( e + ( t ) ) λ min ( Q ) e + ( t ) 2 + 2 λ max ( P ) B ˜ e + ( t ) d + ( t ) κ 1 e + ( t ) 2 κ 2 e + ( t ) 2 + 2 κ 3 e + ( t ) d + ( t )
with κ 1 = 1 θ λ min ( Q ) , κ 2 = θ λ min ( Q ) , κ 3 = λ max ( P ) B ˜ , and θ 0 , 1 . Therefore,
V ˙ ( e + ( t ) ) 1 θ λ min ( Q ) e + ( t ) 2 , whenever e + ( t ) ς + d + ( t ) ,
for any θ 0 , 1 . In a similar way to the proof of Proposition 4, with the terms α 1 + ( r ) = λ min ( P ) r 2 , α 2 + ( r ) = λ max ( P ) r 2 , ς + ( r ) = 2 θ λ max ( P ) B ˜ λ min ( Q ) r , and the ISS gain γ + ( r ) = λ max ( P ) λ min ( P ) · 2 λ max ( P ) B ˜ θ λ min ( Q ) r . This concludes that the estimation error system is ISS with respect to d + ( t ) . Furthermore, the ultimate bound of the upper of the estimation error is given by
lim sup t e + ( t ) λ max ( P ) λ min ( P ) · 2 λ max ( P ) B ˜ θ λ min ( Q ) d + ( t ) .
As a result, the true state trajectory remains enclosed within the constructed interval bounds,
x ^ + ( t ) x ( t ) x ^ ( t ) , t 0 .
Finally, to eliminate the dependence on the unmeasured state x 2 ( t ) , we first express it in terms of the measurable output y ( t ) . From (10c), we obtain
x 2 ( t ) = A 3 y ˙ ( t ) A 3 A 1 y ( t ) + A 3 A 1 ρ ( t ) A 3 ρ ˙ ( t ) .
Next, we introduce the transformed observer coordinates
w 1 + ( t ) w 2 + ( t ) : = x ^ 1 + ( t ) x ^ 2 + ( t ) L 3 L 4 A 3 y ( t ) .
Taking the time derivative yields
d d t x ^ 1 + ( t ) L 3 A 3 y ( t ) x ^ 2 + ( t ) L 4 A 3 y ( t ) = d d t x ^ 1 + ( t ) x ^ 2 + ( t ) L 3 L 4 A 3 y ˙ ( t ) .
Substituting the observer dynamics (16) and the expression of x 2 ( t ) from (18), and expanding all terms, we obtain
d d t x ^ 1 + L 3 A 3 y x ^ 2 + L 4 A 3 y = A 1 A 3 A 2 A 4 y x ^ 2 + + 0 B u + + 0 D v + L 1 L 2 ( y ^ + y ) L 3 L 4 ( x ^ 2 + x 2 ) + L 3 L 4 A 3 A 1 ρ A 3 ρ ˙ + σ + L 3 A 3 A 1 L 4 A 3 A 1 1 n 1 r 1 + L 3 A 3 L 4 A 3 1 n 1 r 2 .
Using the definition x ^ 2 + = w 2 + + L 4 A 3 y , and rearranging terms, we obtain
d d t w 1 + w 2 + = L 1 A 3 L 3 L 2 A 4 L 4 y ^ + x ^ 2 + + 0 B u + ( t ) + 0 D v + ( t ) + A 1 + L 1 L 3 A 3 A 1 A 2 + L 2 L 4 A 3 A 1 y ( t ) + η .
Finally, rewriting the expression in terms of w + ( t ) , we obtain
d d t w 1 + ( t ) w 2 + ( t ) = F 1 w 1 + ( t ) w 2 + ( t ) + F 2 y ( t ) + 0 B u + ( t ) + 0 D v + ( t ) + η ,
where F 1 and F 2 are defined in (13a)–(13b), and η is given in (14). □
Proof of the Theorem 2. 
We present the proof for the upper observer of x 2 ( t ) . From the expression of the plant in the coordinates y ( t ) , x 2 ( t ) in (A1), we have
d d t x 2 t = A 2 y t + A 4 x 2 ( t ) + B u ( t ) + D v ( t ) A 2 ρ ( t )
let the observer of the form
d d t x ^ 2 + t = A 2 y ( t ) + A 4 x ^ 2 + ( t ) L 4 x ^ 2 + ( t ) x 2 ( t ) + B u + ( t ) + D v + ( t ) + | A 2 | r 1 1 n 2 .
(i) 
Cooperativity. By defining e 2 + ( t ) : = x ^ 2 + ( t ) x 2 ( t ) , then the estimation error dynamics are given by
d d t e 2 + t = A 4 L 4 e 2 + t + B u ¯ ( t ) + D v ¯ ( t ) + δ ¯ ( t )
where δ ¯ ( t ) : = | A 2 | 1 n 2 r 1 + A 2 ρ ( t ) 0 , with u ¯ ( t ) = u + ( t ) u ( t ) 0 and v ¯ ( t ) = v + ( t ) v ( t ) 0 . Since A 4 L 4 is Metzler and Hurwitz, the estimation error dynamics are cooperative and stable.
(ii) 
Practical Stability: ISS. If we define the Lyapunov function candidate V R ( t ) : = e 2 + ( t ) P R e 2 + ( t ) , where the matrices P R = P R 0 and Q R = Q R 0 such that P R ( A 4 L 4 ) + ( A 4 L 4 ) P R = Q R . Moreover, the function V R ( t ) fulfills the inequality
λ min ( P R ) e 2 + ( t ) 2 V ( e 2 + ( t ) ) λ max ( P R ) e 2 + ( t ) 2 ,
then, its time derivative of V R ( t ) along the trajectories of the error system is given by
d d t V R ( t ) = e 2 + ( t ) Q R e 2 + ( t ) + 2 e 2 + ( t ) P R B u ¯ ( t ) + D v ¯ ( t ) + δ ¯ ( t ) λ min ( Q R ) e 2 + ( t ) 2 + 2 λ max ( P R ) e 2 + ( t ) B u ¯ ( t ) + D v ¯ ( t ) + δ ¯ ( t ) κ 1 e 2 + ( t ) 2 κ 2 e 2 + ( t ) 2 + κ 3 e 2 + ( t ) ( B u ¯ ( t ) + D v ¯ ( t ) + δ ¯ ( t ) ) ,
with κ 1 = ( 1 θ ) λ min ( Q R ) , κ 2 = θ λ min ( Q R ) , κ 3 = 2 λ max ( P R ) , and θ 0 , 1 . Therefore,
d d t V R ( t ) ( 1 θ ) λ min ( Q R ) e 2 + ( t ) 2 , θ 0 , 1 ,
whenever
e 2 + ( t ) 2 θ λ max ( P R ) λ min ( Q R ) B u ¯ ( t ) + D v ¯ ( t ) + δ ¯ ( t ) ,
which provides ISS-type conditions for the reduced-order error dynamics with the terms α 1 + ( r ) = λ min ( P R ) r 2 , α 2 + ( r ) = λ max ( P R ) r 2 , ς + ( r ) = 2 θ λ max ( P R ) λ min ( Q R ) r , and the ISS gain γ + ( r ) = λ max ( P R ) λ min ( P R ) · 2 λ max ( P R ) θ λ min ( Q R ) r . In addition, it holds that
x ^ 2 + ( t ) x 2 ( t ) x ^ 2 ( t ) , t 0 .
Finally, substituting the expression (A4) into (A5) and regrouping terms yields the implementable reduced-order observers (15) and (16) in terms of w 2 + ( t ) : = x ^ 2 + ( t ) L 4 A 3 y t . This completes the proof. □
Proof of the Theorem 3.
We prove the claim for the upper observer; the lower observer follows analogously.
  • The discrete-time plant in the coordinates y [ k ] , x 2 [ k ] takes the form
y [ k + 1 ] x 2 [ k + 1 ] = A 1 d A 3 d A 2 d A 4 d y [ k ] x 2 [ k ] + 0 B d u [ k ] + 0 D d v [ k ] A 1 d A 2 d ρ [ k ] + I n 1 0 n 2 × n 1 ρ [ k + 1 ]
Let the observer have the initial form
y ^ + [ k + 1 ] x ^ 2 + [ k + 1 ] = A 1 d A 3 d A 2 d A 4 d y [ k ] x ^ 2 + [ k ] + 0 B d u + [ k ] + 0 D d v + [ k ] L 1 d L 2 d y ^ + [ k ] y [ k ] L 3 d L 4 d x ^ 2 + [ k ] x 2 [ k ] + I n 1 + | A 1 d | | A 2 d | 1 n r 1 .
(i) 
Cooperativity condition. Setting the estimation errors as e 1 + [ k ] : = y ^ + [ k ] y [ k ] , e 2 + [ k ] : = x ^ 2 + [ k ] x 2 [ k ] , with e + [ k ] : = e 1 + [ k ] e 2 + [ k ] . Then, the discrete-time estimation error system can be written as
e + [ k + 1 ] = F 1 d e + [ k ] + B ˜ d z ¯ [ k ] ,
with
B ˜ d : = 0 0 I n 1 B d D d I n 2 ,
where z ¯ [ k ] : = u ¯ [ k ] v ¯ [ k ] σ ¯ d [ k ] , with u ¯ [ k ] : = u + [ k ] u [ k ] 0 , v ¯ [ k ] : = v + [ k ] v [ k ] 0 , and
σ ¯ d [ k ] : = I n 1 + | A 1 d | | A 2 d | 1 n r 1 + A 1 d A 2 d ρ [ k ] I n 1 0 n 2 × n 1 ρ [ k + 1 ] 0
Since F 1 d 0 , z ¯ [ k ] 0 , and σ ¯ d [ k ] 0 , then the discrete-time error system is cooperative. It follows that e + [ 0 ] 0 e + [ k ] 0 , k N . Thus, one obtains
x ^ + [ k ] x [ k ] .
(ii) 
Practical stability (ISS). Since ϱ ( F 1 d ) < 1 , the matrix F 1 d is Schur-stable. Then, for any Q d = Q d > 0 , there exists a matrix P d = P d > 0 satisfying the discrete Lyapunov equation
P d F 1 d P d F 1 d = Q d .
Consider the Lyapunov function candidate V [ k ] = e + [ k ] P d e + [ k ] satisfying the inequality
λ min ( P d ) e [ k ] 2 V [ k ] λ max ( P d ) e [ k ] 2 .
Thus, the Lyapunov difference Δ V [ k ] : = V [ k + 1 ] V [ k ] is described by
Δ V [ k ] = e + [ k ] P d F 1 d P d F 1 d e + [ k ] + 2 B ˜ d z ¯ [ k ] P d F 1 d e + [ k ] + B ˜ d z ¯ [ k ] P d B ˜ d z ¯ [ k ] = e + [ k ] Q d e + [ k ] + 2 z ¯ [ k ] B ˜ d P d F 1 d e + [ k ] + z ¯ [ k ] B ˜ d P d B ˜ d z ¯ [ k ] κ 1 e + [ k ] 2 κ 2 e + [ k ] 2 + 2 κ 3 e + [ k ] z ¯ [ k ] + κ 4 z ¯ [ k ] 2 ,
with κ 1 = 1 θ λ min ( Q d ) , κ 2 = θ λ min ( Q d ) , κ 3 = B ˜ d P d F 1 d , and κ 4 = B ˜ d P d B ˜ d , Therefore, for large enough values of x [ k ] , we obtain
Δ V [ k ] 1 θ λ min ( Q d ) e + [ k ] 2 , e + [ k ] ς d + z ¯ [ k ] ,
for some θ ( 0 , 1 ) , with the terms α 1 d + ( r ) = λ min ( P d ) r 2 , α 2 d + ( r ) = λ max ( P d ) r 2 , ς d + ( r ) = κ 3 + κ 3 2 + θ λ min ( Q d ) κ 4 θ λ min ( Q d ) r , and the ISS gain γ d + ( r ) = λ max ( P d ) λ min ( P d ) · κ 3 + κ 3 2 + θ λ min ( Q d ) κ 4 θ λ min ( Q d ) r . Therefore, the discrete-time estimation system in (A7) is ISS with respect to the inputs z ¯ [ k ] . Furthermore, the ultimate bound of the upper of the estimation error is given by
lim sup k e + [ k ] γ d + sup k 0 z ¯ [ k ] .
The cooperativity property guarantees preservation of the partial order, while Schur stability ensures practical boundedness of the interval estimations. Consequently, the state trajectory remains enclosed between the lower and upper estimates for all k N ; that is,
x ^ + [ k ] x [ k ] x ^ [ k ] , k N .
Finally, by using y [ k ] = x 1 [ k ] + ρ [ k ] , we can reconstruct
x 2 [ k ] = A 3 d y [ k + 1 ] A 3 d A 1 d y [ k ] + A 3 d A 1 d ρ [ k ] A 3 d ρ [ k + 1 ] .
Applying the transformed coordinates
w 1 ± [ k ] w 2 ± [ k ] : = x ^ 1 ± [ k ] x ^ 2 ± [ k ] L 3 d L 4 d A 3 d y [ k ] ,
to eliminate the direct dependence on y [ k + 1 ] , then one obtains the transformed observer dynamics in (19)–(20). □
Proof of Theorem 4.
We present the proof for the upper observer case. The proof for the lower observer follows analogously by symmetry of the design.
  • From the discrete-time plant (17), the unmeasured state dynamics are given as follows:
x 2 [ k + 1 ] = A 2 d y [ k ] + A 4 d x 2 [ k ] + B d u [ k ] + D d v [ k ] A 2 d ρ [ k ] .
For analysis purposes, consider the upper reduced-order observer in the form
x ^ 2 + [ k + 1 ] = A 2 d y [ k ] + A 4 d x ^ 2 + [ k ] L 4 d x ^ 2 + [ k ] x 2 [ k ] + B d u + [ k ] + D d v + [ k ] + σ R ,
where σ R : = | A 2 d | 1 n 1 r 1 .
(i) 
Cooperativity. If we define the upper estimation error e 2 + [ k ] : = x ^ 2 + [ k ] x 2 [ k ] , then the estimation error dynamics are expressed as
e 2 + [ k + 1 ] = ( A 4 d L 4 d ) e 2 + [ k ] + B d u ¯ [ k ] + D d v ¯ [ k ] + σ ¯ R [ k ] ,
where u ¯ [ k ] : = u + [ k ] u [ k ] 0 , v ¯ [ k ] : = v + [ k ] v [ k ] 0 , and
σ ¯ R [ k ] : = σ R + A 2 d ρ [ k ] 0 .
Since A 4 d L 4 d is assumed to be non-negative, and all components of u ¯ [ k ] , v ¯ [ k ] , and σ ¯ R [ k ] are non-negative, the estimation error dynamics define a cooperative discrete-time system. Therefore, if
x ^ 2 + [ 0 ] x 2 [ 0 ] x ^ 2 + [ k ] x 2 [ k ] , k N .
(ii) 
Practical stability: ISS. Now, since A 4 d L 4 d is Schur-stable, for any matrix Q R = Q R 0 , there exists a unique matrix P R = P R 0 satisfying the discrete-time Lyapunov equation
P R ( A 4 d L 4 d ) P R ( A 4 d L 4 d ) = Q R .
Consider the Lyapunov function candidate V R [ k ] = e 2 + [ k ] P R e 2 + [ k ] fulfilling the inequality
λ min ( P R ) e 2 + [ k ] 2 V ( e 2 + [ k ] ) λ max ( P R ) e 2 + [ k ] 2 .
Its Lyapunov difference is given by
Δ V R [ k ] : = V R [ k + 1 ] V R [ k ] = e 2 + [ k ] Q R e 2 + [ k ] + 2 B ˜ R d R [ k ] P R ( A 4 d L 4 d ) e 2 + [ k ] + B ˜ R d R [ k ] P R B ˜ R d R [ k ]
where B ˜ R : = B d D d I n 2 and d R [ k ] : = u ¯ [ k ] v ¯ [ k ] σ ¯ R [ k ] . Using norm inequalities, we obtain
Δ V R [ k ] λ min ( Q R ) e 2 + [ k ] 2 + 2 κ 1 e 2 + [ k ] d R [ k ] + κ 2 d R [ k ] 2 ( 1 θ ) λ min ( Q R ) e 2 + [ k ] 2 θ λ min ( Q R ) e 2 + [ k ] 2 + 2 κ 1 e 2 + [ k ] d R [ k ] + κ 2 d R [ k ] 2 .
where κ 1 : = B ˜ R P R ( A 4 d L 4 d ) κ 2 : = B ˜ R P R B ˜ R , and θ ( 0 , 1 ) . Thus,
Δ V R [ k ] ( 1 θ ) λ min ( Q R ) e 2 + [ k ] 2 , e 2 + [ k ] ς d + d R [ k ] ,
for some θ 0 , 1 , with α 1 + ( r ) = λ min ( P R ) r 2 , α 2 + ( r ) = λ max ( P R ) r 2 , ς + ( r ) = κ 1 + κ 1 2 + θ λ min ( Q R ) κ 2 θ λ min ( Q R ) r , and the discrete-time ISS gain γ d + : = λ max ( P d ) λ min ( P d ) κ 1 + κ 1 2 + θ λ min ( Q R ) κ 2 θ λ min ( Q R ) r . Therefore, the reduced-order estimation error system in (A9) is input-to-state stable with respect to d R [ k ] . As a consequence of the ISS property, the upper estimation error satisfies the ultimate bound,
lim sup k e 2 + [ k ] γ d + sup k 0 d R [ k ] .
Moreover, it follows that
x ^ 2 + [ k ] x 2 [ k ] x ^ 2 [ k ] , k 0 .
Finally, from the first equation of (17) and the output equation y [ k ] = x 1 [ k ] + ρ [ k ] , we obtain
y [ k + 1 ] = A 1 d y [ k ] + A 3 d x 2 [ k ] A 1 d ρ [ k ] + ρ [ k + 1 ] .
Since A 3 d has a left inverse A 3 d , it follows that
x 2 [ k ] = A 3 d y [ k + 1 ] A 3 d A 1 d y [ k ] + A 3 d A 1 d ρ [ k ] A 3 d ρ [ k + 1 ] .
Substituting (A11) into (A8) and regrouping terms yields the implementable reduced-order observers (23)–(24) in terms of w 2 + ( t ) : = x ^ 2 + ( t ) L 4 A 3 y t , with η d . The proof for the lower observer is analogous. Hence, Σ DRO + , Σ DRO constitute an interval observer for x 2 [ k ] . □

References

  1. Gouzé, J.L.; Moisan, M.; Bernard, O. A simple improvement of interval asymptotic observers for biotechnological processes. In Proceedings of the ROCOND 2006 Conference, Toulouse, France, 5–7 July 2006. [Google Scholar]
  2. Avilés, J.; Moreno, J. Cooperative observers for nonlinear systems. In Proceedings of the Joint 48th IEEE Conference on Decision and Control and 28th Chinese Control Conference, Shanghai, China, 16–18 December 2009; pp. 6125–6130. [Google Scholar]
  3. Mazenc, F.; Dinh, T.; Niculescu, S. Robust Interval Observers for Discrete Time Systems of Luenberger Type. In Proceedings of the 2013 IEEE American Control Conference ACC, Washington, DC, USA, 17–19 June 2013; pp. 2484–2489. [Google Scholar]
  4. Efimov, D.; Raïssi, T.; Chebotarev, S.; Zolghadri, A. Interval state observer for nonlinear time varying systems. Automatica 2013, 49, 200–205. [Google Scholar] [CrossRef] [Scilit]
  5. Avilés, J.D.; Moreno, J.A. Preserving order observers for nonlinear systems. Int. J. Robust. Nonlinear Control 2014, 24, 2153–2178. [Google Scholar] [CrossRef] [Scilit]
  6. Avilés, J.D.; Moreno, J.A. Dissipative observers for discrete-time nonlinear systems. J. Frankl. Inst. 2018, 355, 5759–5770. [Google Scholar] [CrossRef] [Scilit]
  7. Angeli, D.; Sontag, D. Monotone Control Systems. IEEE Trans. Autom. 2003, 48, 1684–1698. [Google Scholar] [CrossRef] [Scilit]
  8. Hirsch, M.; Smith, H. Monotone Dynamical Systems. In Handbook of Differential Equations: Ordinary Differential Equations; Elsevier B. V.: Amsterdam, The Netherlands, 2004; Volume 2, pp. 239–357. [Google Scholar]
  9. Gouze, J.L.; Rapaport, A.; Hadj-Sadok, M.Z. Interval observers for uncertain biological systems. Ecol. Model. 2000, 133, 45–56. [Google Scholar] [CrossRef] [Scilit]
  10. Alcaraz-Gonzalez, V.; Harmand, J.; Rapaport, A.; Steyer, J.; Gonzalez-Alvarez, V.; Pelayo-Ortiz, C. Software sensors for highly uncertain WWTPS: A new approach based on interval observers. Water Res. 2002, 36, 2515–2524. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  11. Bernard, O.; Gouze, J. Closed loop observers bundle for uncertain biotechnological models. J. Process Control 2004, 14, 765–774. [Google Scholar] [CrossRef] [Scilit]
  12. Moisan, M.; Bernard, O.; Gouze, J. Near optimal interval observers bundle for uncertain bioreactors. Automatica 2009, 45, 291–295. [Google Scholar] [CrossRef] [Scilit]
  13. Mazenc, F.; Bernard, O. Interval observers for linear time-invariant systems with disturbances. Automatica 2011, 47, 140–147. [Google Scholar] [CrossRef] [Scilit]
  14. Khan, A.; Xie, W.; Zhang, B.; Liu, L.W. A survey of interval observers design methods and implementation for uncertain systems. J. Frankl. Inst. 2021, 358, 3077–3126. [Google Scholar] [CrossRef] [Scilit]
  15. Mazenc, F.; Bernard, O. Asymptotically Stable Interval Observers for Planar systems with Complex Poles. IEEE Trans. Aut. Control 2010, 55, 523–527. [Google Scholar] [CrossRef] [Scilit]
  16. Efimov, D.; Perruquetti, W.; Raïssi, T.; Zolghadri, A. Interval Observers for Time-varying Discrete-Time Systems. IEEE Trans. Autom. Control 2013, 58, 3218–3224. [Google Scholar] [CrossRef] [Scilit]
  17. Thabet, R.E.H.; Raïssi, T.; Combastel, C.; Efimov, D.; Zolghadri, A. An effective method to interval observer design for time-varying systems. Automatica 2014, 50, 2677–2684. [Google Scholar] [CrossRef] [Scilit]
  18. Hirsch, M.; Smith, H. Monotone dynamical systems. Handb. Differ. Equ. Ordinary Differ. Equ. 2005, 2, 239–357. [Google Scholar]
  19. Efimov, D.; Perruquetti, W.; Raïssi, T.; Zolghadri, A. On Interval Observer Design for Time-Invariant Discrete-Time Systems. In ECC; IEEE: Zurich, Switzerland, 2013. [Google Scholar]
  20. Mazenc, F.; Dinh, T.; Niculescu, S. Interval Observers for Discrete Time Systems. Int. J. Robust. Nonlinear Control 2014, 24, 2867–2890. [Google Scholar] [CrossRef] [Scilit]
  21. Wang, Z.; Lim, C.C.; Shen, Y. Interval observer design for uncertain discrete-time linear systems. Syst. Control Lett. 2018, 116, 41–46. [Google Scholar] [CrossRef] [Scilit]
  22. Avilés, J.D.; Moreno, J.A. Dissipative interval observer design for discrete-time nonlinear systems. Asian J. Control 2020, 22, 1422–1436. [Google Scholar] [CrossRef] [Scilit]
  23. Sergiyenko, O.; Zhirabok, A.; Ibraheem, I.K.; Zuev, A.; Filaretov, V.; Azar, A.T.; Hameed, I.A. Interval observers for discrete-time linear systems with uncertainties. Symmetry 2022, 14, 2131. [Google Scholar] [CrossRef] [Scilit]
  24. Xu, F.; Yang, S.; Wang, X. A novel set-theoretic interval observer for discrete linear time-invariant systems. IEEE Trans. Autom. Control 2020, 66, 773–780. [Google Scholar] [CrossRef] [Scilit]
  25. Dinh, T.N.; Tran, G.Q.B. Systematic interval observer design for linear systems. Automatica 2025, 180, 112477. [Google Scholar] [CrossRef] [Scilit]
  26. Xu, F. An Interval Observer Optimization Design Method for Discrete Linear Time-Invariant Systems. IEEE Control Syst. Lett. 2025, 9, 300–305. [Google Scholar] [CrossRef] [Scilit]
  27. Luo, M.; Su, H.; Zheng, W.X. Interval Observer-Based Coordination Control for Discrete-Time Multi-Agent Systems. IEEE Trans. Syst. Man. Cybern. Syst. 2025, 55, 4102–4114. [Google Scholar] [CrossRef] [Scilit]
  28. Kailath, T.; Sayed, A.H.; Hassibi, B. Linear Estimation; Prentice Hall: Upper Saddle River, NY, USA, 2000. [Google Scholar]
  29. Farina, L.; Rinaldi, S. Positive Linear Systems: Theory and Applications; John Wiley & Sons: Hoboken, NJ, USA, 2000. [Google Scholar]
  30. Hirsch, M.; Smith, H. Monotone maps: A review. J. Differ. Equ. Appl. 2005, 11, 379–398. [Google Scholar] [CrossRef] [Scilit]
  31. Khalil, H.K.; Grizzle, J.W. Nonlinear Systems; Prentice Hall: Upper Saddle River, NJ, USA, 2002; Volume 3. [Google Scholar]
  32. Avilés, J.D.; Moreno, J.A.; Dávila, J.A.; Becerra, G.; Flores, F.; Chávez, C.A.; Márquez, C. Stability radii-based interval observers for discrete-time nonlinear systems. IEEE Access 2021, 10, 3216–3227. [Google Scholar] [CrossRef] [Scilit]
  33. Gu, G. Discrete-Time Linear Systems: Theory and Design with Applications; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2012. [Google Scholar]
  34. Jiang, Z.P.; Wang, Y. Input-to-state stability for discrete-time nonlinear systems. Automatica 2001, 37, 857–869. [Google Scholar] [CrossRef] [Scilit]
  35. Leśniak, A.; Danek, T.; Wojdyła, M. Application of Kalman filter to noise reduction in multichannel data. Schedae Informaticae 2009, 17, 63–73. [Google Scholar] [CrossRef] [Scilit]
  36. Stickel, J.J. Data smoothing and numerical differentiation by a regularization method. Comput. Chem. Eng. 2010, 34, 467–475. [Google Scholar] [CrossRef] [Scilit]
  37. Chartrand, R. Numerical differentiation of noisy, nonsmooth data. Int. Sch. Res. Not. 2011, 2011, 164564. [Google Scholar] [CrossRef] [Scilit]
  38. Van Breugel, F.; Kutz, J.N.; Brunton, B.W. Numerical differentiation of noisy data: A unifying multi-objective optimization framework. IEEE Access 2020, 8, 196865–196877. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  39. López-Caamal, F.; Avilés, J.D. A Linear Interval Observer for a Class of Linear Systems of Dimension 2n with n Measurements of the State. In Proceedings of the Memorias del Congreso Nacional de Control Automático, Acapulco de Juárez, Mexico, 25–27 October 2023; pp. 272–277. [Google Scholar]
  40. López-Caamal, F.; Avilés, J.D. Reduced Order Interval Observer for Linear Discrete-Time Systems with 2n states and n outputs. In Proceedings of the Memorias del Congreso Nacional de Control Automático, Mexico City, Mexico, 8–11 October 2024; pp. 405–409. [Google Scholar]
  41. Zhang, H.; Zhao, S.; Gao, Z. An active disturbance rejection control solution for the two-mass-spring benchmark problem. In Proceedings of the 2016 American Control Conference (ACC); IEEE: Boston, MA, USA, 2016; pp. 1566–1571. [Google Scholar]
Figure 1. Block diagram of the proposed full-order interval observer.
Figure 1. Block diagram of the proposed full-order interval observer.
Symmetry 18 00882 g001
Figure 2. Block diagram of the proposed reduced-order interval observer.
Figure 2. Block diagram of the proposed reduced-order interval observer.
Symmetry 18 00882 g002
Figure 3. Inputs to the plant. The left panel depicts in blue the control input u ( t ) , whereas the right one shows the perturbation v ( t ) . The upper and lower bounds of the signals are depicted in yellow and red, respectively.
Figure 3. Inputs to the plant. The left panel depicts in blue the control input u ( t ) , whereas the right one shows the perturbation v ( t ) . The upper and lower bounds of the signals are depicted in yellow and red, respectively.
Symmetry 18 00882 g003
Figure 4. Actual and estimated states of Plant (26) with the continuous-time, full-order observers in Equations (11) and (12). In all panels, the blue line represents the actual state; in turn, the yellow and red lines represent the upper and lower estimates, respectively.
Figure 4. Actual and estimated states of Plant (26) with the continuous-time, full-order observers in Equations (11) and (12). In all panels, the blue line represents the actual state; in turn, the yellow and red lines represent the upper and lower estimates, respectively.
Symmetry 18 00882 g004
Figure 5. Observation errors for the continuous-time, full-order observers in Equations (11) and (12), for the Plant (26). In all panels, the blue line represents zero error; in turn, the yellow and red lines represent the upper and lower estimation error, respectively.
Figure 5. Observation errors for the continuous-time, full-order observers in Equations (11) and (12), for the Plant (26). In all panels, the blue line represents zero error; in turn, the yellow and red lines represent the upper and lower estimation error, respectively.
Symmetry 18 00882 g005
Figure 6. Observation errors for the continuous-time, full-order observers in Equations (11) and (12) for the Plant (26), with measurement noise. In all panels, the blue line represents zero error; in turn, the yellow and red lines represent the upper and lower estimation error, respectively.
Figure 6. Observation errors for the continuous-time, full-order observers in Equations (11) and (12) for the Plant (26), with measurement noise. In all panels, the blue line represents zero error; in turn, the yellow and red lines represent the upper and lower estimation error, respectively.
Symmetry 18 00882 g006
Figure 7. Actual and estimated states of Plant (26) with continuos-time, reduced-order observers in Equations (15) and (16). In all panels, the blue line represents the actual state; in turn, the yellow and red lines represent the upper and lower estimates, respectively.
Figure 7. Actual and estimated states of Plant (26) with continuos-time, reduced-order observers in Equations (15) and (16). In all panels, the blue line represents the actual state; in turn, the yellow and red lines represent the upper and lower estimates, respectively.
Symmetry 18 00882 g007
Figure 8. Observation errors for the continuos-time, reduced-order observers in Equations (15) and (16), for Plant (26). In all panels, the blue line represents zero error; in turn, the yellow and red lines represent the upper and lower estimation error, respectively.
Figure 8. Observation errors for the continuos-time, reduced-order observers in Equations (15) and (16), for Plant (26). In all panels, the blue line represents zero error; in turn, the yellow and red lines represent the upper and lower estimation error, respectively.
Symmetry 18 00882 g008
Figure 9. Observation errors for the continuos-time, reduced-order observers in Equations (15) and (16), for Plant (26), with measurement noise. In all panels, the blue line represents zero error; in turn, the yellow and red lines represent the upper and lower estimation error, respectively.
Figure 9. Observation errors for the continuos-time, reduced-order observers in Equations (15) and (16), for Plant (26), with measurement noise. In all panels, the blue line represents zero error; in turn, the yellow and red lines represent the upper and lower estimation error, respectively.
Symmetry 18 00882 g009
Figure 10. Actual and estimated states of Plant (27) with the discrete-time, full-order observers in Equations (19) and (20). In all panels, the blue line represents the actual state; in turn, the yellow and red lines represent the upper and lower estimates, respectively.
Figure 10. Actual and estimated states of Plant (27) with the discrete-time, full-order observers in Equations (19) and (20). In all panels, the blue line represents the actual state; in turn, the yellow and red lines represent the upper and lower estimates, respectively.
Symmetry 18 00882 g010
Figure 11. Observation errors with the discrete-time, full-order observers in Equations (19) and (20), for Plant (27). In all panels, the blue line represents zero error; in turn, the yellow and red lines represent the upper and lower estimation error, respectively.
Figure 11. Observation errors with the discrete-time, full-order observers in Equations (19) and (20), for Plant (27). In all panels, the blue line represents zero error; in turn, the yellow and red lines represent the upper and lower estimation error, respectively.
Symmetry 18 00882 g011
Figure 12. Observation errors with the discrete-time, full-order observers in Equations (19) and (20), for Plant (27) with measurement noise. In all panels, the blue line represents zero error; in turn, the yellow and red lines represent the upper and lower estimation error, respectively.
Figure 12. Observation errors with the discrete-time, full-order observers in Equations (19) and (20), for Plant (27) with measurement noise. In all panels, the blue line represents zero error; in turn, the yellow and red lines represent the upper and lower estimation error, respectively.
Symmetry 18 00882 g012
Figure 13. Actual and estimated states of Plant (27) with the discrete-time, reduced-order observers in Equations (23) and (24). In all panels, the blue line represents the actual state; in turn, the yellow and red lines represent the upper and lower estimates, respectively.
Figure 13. Actual and estimated states of Plant (27) with the discrete-time, reduced-order observers in Equations (23) and (24). In all panels, the blue line represents the actual state; in turn, the yellow and red lines represent the upper and lower estimates, respectively.
Symmetry 18 00882 g013
Figure 14. Observation errors of reduced-order observers in Equations (23) and (24), for Plant (27). In all panels, the blue line represents zero error; in turn, the yellow and red lines represent the upper and lower estimation error, respectively.
Figure 14. Observation errors of reduced-order observers in Equations (23) and (24), for Plant (27). In all panels, the blue line represents zero error; in turn, the yellow and red lines represent the upper and lower estimation error, respectively.
Symmetry 18 00882 g014
Figure 15. Observation errors with the discrete-time, reduced-order observers in Equations (23) and (24), for Plant (27), considering measurement noise. In all panels, the blue line represents zero error; in turn, the yellow and red lines represent the upper and lower estimation error, respectively.
Figure 15. Observation errors with the discrete-time, reduced-order observers in Equations (23) and (24), for Plant (27), considering measurement noise. In all panels, the blue line represents zero error; in turn, the yellow and red lines represent the upper and lower estimation error, respectively.
Symmetry 18 00882 g015
Figure 16. States of Plant (28) along with its upper and lower estimates computed with the continuous-time, full-order observers in Equations (11) and (12). In all panels, the blue line represents the actual state; in turn, the yellow and red lines represent the upper and lower estimates, respectively.
Figure 16. States of Plant (28) along with its upper and lower estimates computed with the continuous-time, full-order observers in Equations (11) and (12). In all panels, the blue line represents the actual state; in turn, the yellow and red lines represent the upper and lower estimates, respectively.
Symmetry 18 00882 g016
Figure 17. Estimation error with the continuous-time, full-order interval observer (11) and (12), for Plant (28). In all panels, the blue line represents zero error; in turn, the yellow and red lines represent the upper and lower estimation error, respectively.
Figure 17. Estimation error with the continuous-time, full-order interval observer (11) and (12), for Plant (28). In all panels, the blue line represents zero error; in turn, the yellow and red lines represent the upper and lower estimation error, respectively.
Symmetry 18 00882 g017
Figure 18. States of Plant (30), along with its upper and lower estimates via the discrete-time, full-order interval observer in (19) and (20). In all panels, the blue line represents the actual state; in turn, the yellow and red lines represent the upper and lower estimates, respectively.
Figure 18. States of Plant (30), along with its upper and lower estimates via the discrete-time, full-order interval observer in (19) and (20). In all panels, the blue line represents the actual state; in turn, the yellow and red lines represent the upper and lower estimates, respectively.
Symmetry 18 00882 g018
Figure 19. Estimation error of the discrete-time, full-order interval observer (19) and (20), for Plant (30). In all panels, the blue line represents zero error; in turn, the yellow and red lines represent the upper and lower estimation error, respectively.
Figure 19. Estimation error of the discrete-time, full-order interval observer (19) and (20), for Plant (30). In all panels, the blue line represents zero error; in turn, the yellow and red lines represent the upper and lower estimation error, respectively.
Symmetry 18 00882 g019
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

López-Caamal, F.; Avilés, J.D.; Becerra-Nunez, G.; Martínez, R.; Márquez, C. Full- and Reduced-Order Interval Observers for Linear Systems in Continuous and Discrete Time. Symmetry 2026, 18, 882. https://doi.org/10.3390/sym18060882

AMA Style

López-Caamal F, Avilés JD, Becerra-Nunez G, Martínez R, Márquez C. Full- and Reduced-Order Interval Observers for Linear Systems in Continuous and Discrete Time. Symmetry. 2026; 18(6):882. https://doi.org/10.3390/sym18060882

Chicago/Turabian Style

López-Caamal, Fernando, Jesús David Avilés, Guillermo Becerra-Nunez, Rigoberto Martínez, and Claudia Márquez. 2026. "Full- and Reduced-Order Interval Observers for Linear Systems in Continuous and Discrete Time" Symmetry 18, no. 6: 882. https://doi.org/10.3390/sym18060882

APA Style

López-Caamal, F., Avilés, J. D., Becerra-Nunez, G., Martínez, R., & Márquez, C. (2026). Full- and Reduced-Order Interval Observers for Linear Systems in Continuous and Discrete Time. Symmetry, 18(6), 882. https://doi.org/10.3390/sym18060882

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