Additive state decomposition

Additive state decomposition occurs when a system is decomposed into two or more subsystems with the same dimension as that of the original system.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 3 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

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. Taking a system for example, it is decomposed into two subsystems: and , where and , respectively.

The lower-order subsystem decomposition satisfies : n = n_p + n_s\text{ and } P = P_p \oplus P_s By contrast, the additive state decomposition satisfies : n = n_p = n_s \text{ and } P = P_p + P_s

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. Taking a system for example, it is decomposed into two subsystems: and , where and , respectively.

The lower-order subsystem decomposition satisfies n = n_p + n_s\text{ and } P = P_p \oplus P_s By contrast, the additive state decomposition satisfies n = n_p = n_s \text{ and } P = P_p + P_s \dot{x} - \dot{x}_p = f(t,x,u) - f_p (t,x_p,u_p), x(0) = x_0 New variables x_s\in\R^n are defined as follows: Then the secondary system can be further written as follows: From the definition ( ), it follows x(t)=x_p(t)+x_s(t), t\geq 0. The process is shown in this picture: \dot{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: \dot{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. e(t)=e_p(t)+e_s(t) Since \| e(t) \| \le \| e_p(t) \| + \| e_s(t) \| the tracking error can be analyzed by and separately.

If and are bounded and small, then so is . Fortunately, note that ( ) is a linear time-invariant system and is independent of the secondary system ( ), 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 ( ) as it is time-varying. \dot{x}=Ax+B(u_1+u_2) , x(0)=0 the statement of the superposition principle means , where \dot{x}_p = A x_p + Bu_1, x_p(0) = 0 \dot{x}_s = A x_s + Bu_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.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1314972519 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001314972519 · captured 1759546745.0 · version history

Cite this page as: encyclopegia.org, “Additive state decomposition”, snapshot enwiki-001314972519. https://encyclopegia.org/a/additive-state-decomposition

Sources cited in this revision

4 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.