翻訳と辞書
Words near each other
・ Backwater (album)
・ Backwater (band)
・ Backwater (river)
・ Backwater (song)
・ Backwater Awhile
・ Backwater Blues
・ Backwater butterfly ray
・ Backwater Reservoir
・ Backstage.bbc.co.uk
・ Backstairs at the White House
・ Backstairs Passage
・ Backstairs Passage Glacier
・ Backstamp
・ Backstay
・ Backstay insulator
Backstepping
・ Backsticking
・ Backstitch
・ Backstone Bank and Baal Hill Woods
・ Backstop
・ Backstop resources
・ BackStoppers
・ Backstory
・ Backstreet (album)
・ Backstreet Boys
・ Backstreet Boys (1996 album)
・ Backstreet Boys (1997 album)
・ Backstreet Boys (disambiguation)
・ Backstreet Boys discography
・ Backstreet Cultural Museum


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Backstepping : ウィキペディア英語版
Backstepping
In control theory, backstepping is a technique developed circa 1990 by Petar V. Kokotovic and others for designing stabilizing controls for a special class of nonlinear dynamical systems. These systems are built from subsystems that radiate out from an irreducible subsystem that can be stabilized using some other method. Because of this recursive structure, the designer can start the design process at the known-stable system and "back out" new controllers that progressively stabilize each outer subsystem. The process terminates when the final external control is reached. Hence, this process is known as ''backstepping.''
==Backstepping approach==
The backstepping approach provides a recursive method for stabilizing the origin of a system in strict-feedback form. That is, consider a system of the form〔
:\begin \dot) + g_x(\mathbf) z_1\\
\dot_1 = f_1(\mathbf,z_1) + g_1(\mathbf,z_1) z_2\\
\dot_2 = f_2(\mathbf,z_1,z_2) + g_2(\mathbf,z_1,z_2) z_3\\
\vdots\\
\dot_i = f_i(\mathbf,z_1, z_2, \ldots, z_, z_i) + g_i(\mathbf,z_1, z_2, \ldots, z_, z_i) z_ \quad \text 1 \leq i < k-1\\
\vdots\\
\dot_ = f_(\mathbf,z_1, z_2, \ldots, z_) + g_(\mathbf,z_1, z_2, \ldots, z_) z_k\\
\dot_k = f_k(\mathbf,z_1, z_2, \ldots, z_, z_k) + g_k(\mathbf,z_1, z_2, \dots, z_, z_k) u\end
where
* \mathbf \in \mathbb^n with n \geq 1,
* z_1, z_2, \ldots, z_i, \ldots, z_, z_k are scalars,
* u is a scalar input to the system,
* f_x, f_1, f_2, \ldots, f_i, \ldots, f_, f_k vanish at the origin (i.e., f_i(0,0,\dots,0) = 0),
* g_1, g_2, \ldots, g_i, \ldots, g_, g_k are nonzero over the domain of interest (i.e., g_i(\mathbf,z_1,\ldots,z_k) \neq 0 for 1 \leq i \leq k).
Also assume that the subsystem
:\dot) + g_x(\mathbf) u_x(\mathbf)
is stabilized to the origin (i.e., \mathbf = \mathbf\,) by some known control u_x(\mathbf) such that u_x(\mathbf) = 0. It is also assumed that a Lyapunov function V_x for this stable subsystem is known. That is, this \mathbf subsystem is stabilized by some other method and backstepping extends its stability to the \textbf shell around it.
In systems of this ''strict-feedback form'' around a stable \mathbf subsystem,
* The backstepping-designed control input u has its most immediate stabilizing impact on state z_n.
* The state z_n then acts like a stabilizing control on the state z_ before it.
* This process continues so that each state z_i is stabilized by the ''fictitious'' "control" z_.
The backstepping approach determines how to stabilize the \mathbf subsystem using z_1, and then proceeds with determining how to make the next state z_2 drive z_1 to the control required to stabilize \mathbf. Hence, the process "steps backward" from \mathbf out of the strict-feedback form system until the ultimate control u is designed.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Backstepping」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.