Additive state decomposition - Alchetron, the free social encyclopedia

Additive state decomposition occurs when a system is decomposed into two or more subsystems with the same dimension as that of the original system. A commonly used decomposition in the control field is to decompose a system into two or more lower-order subsystems, called lower-order subsystem decomposition here. In contrast, additive state decomposition is to decompose a system into two or more subsystems with the same dimension as that of the original system.

Additive state decomposition on a dynamical control system

Consider an ‘original’ system as follows:

where x ∈ R n .

First, a ‘primary’ system is brought in, having the same dimension as the original system:

where x p ∈ R n .

From the original system and the primary system, the following ‘secondary’ system is derived:

x ˙ − x ˙ p = f ( t , x , u ) − f p ( t , x p , u p ) , x ( 0 ) = x 0

New variables x s ∈ R n are defined as follows:

Then the secondary system can be further written as follows:

From the definition (3), it follows

x ( t ) = x p ( t ) + x s ( t ) , t ≥ 0.

The process is shown in this picture:

Example 1

In fact, the idea of the additive state decomposition has been implicitly mentioned in existing literature. An existing example is the tracking controller design, which often requires a reference system to derive error dynamics. The reference system (primary system) is assumed to be given as follows:

x ˙ r = f ( t , x r , u r ) , x r ( 0 ) = x r , 0

Based on the reference system, the error dynamics (secondary system) are derived as follows:

x ˙ e = f ( t , x e + x r , u ) − f ( t , x r , u r ) , x e ( 0 ) = x 0 − x r , 0

where x e = x − x r

This is a commonly used step to transform a tracking problem to a stabilization problem when adaptive control is used.

Example 2

Consider a class of systems as follows:

Choose (5) as the original system and design the primary system as follows:

Then the secondary system is determined by the rule (4):

By additive state decomposition

e ( t ) = e p ( t ) + e s ( t )

Since

∥ e ( t ) ∥ ≤ ∥ e p ( t ) ∥ + ∥ e s ( t ) ∥

the tracking error e(t) can be analyzed by e_p(t) and e_s(t) separately. If e_p(t) and e_s(t) are bounded and small, then so is e(t). Fortunately, note that (6) is a linear time-invariant system and is independent of the secondary system (7), for the analysis of which many tools such as the transfer function are available. By contrast, the transfer function tool cannot be directly applied to the original system (5) as it is time-varying.

Example 3

Consider a class of nonlinear systems as follows:

where x, y, u represent the state, output and input, respectively; the function φ(•) is nonlinear. The objective is to design u such that y − r → 0 as t → ∞. Choose (8) as the original system and design the primary system as follows:

Then the secondary system is determined by the rule (4):

where u_s = u_p. Then x = x_p + x_s and y = y_p + y_s. Here, the task y_p → 0 is assigned to the linear time-invariant system (9) (a linear time-invariant system being simpler than a nonlinear one). On the other hand, the task x_s → 0 is assigned to the nonlinear system (10) (a stabilizing control problem is simpler than a tracking problem). If the two tasks are accomplished, then y = y_p + y_s → 0. The basic idea is to decompose an original system into two subsystems in charge of simpler subtasks. Then one designs controllers for two subtasks, and finally combines them to achieve the original control task. The process is shown in this picture:

Comparison with superposition principle

A well-known example implicitly using additive state decomposition is the Superposition Principle, widely used in physics and engineering.
superposition principle: For all linear systems, the net response at a given place and time caused by two or more stimuli is the sum of the responses which would have been caused by each stimulus individually. For a simple linear system:

x ˙ = A x + B ( u 1 + u 2 ) , x ( 0 ) = 0

the statement of the superposition principle means x = x_p + x_s, where

x ˙ p = A x p + B u 1 , x p ( 0 ) = 0 x ˙ s = A x s + B u 2 , x s ( 0 ) = 0

Obviously, this result can also be derived from the additive state decomposition. Moreover, the superposition principle and additive state decomposition have the following relationship. From Table 1, additive state decomposition can be applied not only to linear systems but also nonlinear systems.

Applications

Additive state decomposition is used in stabilizing control, and can be extended to additive output decomposition.

References

Additive state decomposition Wikipedia

(Text) CC BY-SA

Contents