Backstepping

From testwiki
Jump to navigation Jump to search

Template:Short description In control theory, backstepping is a technique developed circa 1990 by Petar V. Kokotovic, and others [1][2] 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.[3]

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[3]

{𝐱˙=fx(𝐱)+gx(𝐱)z1zΛ™1=f1(𝐱,z1)+g1(𝐱,z1)z2zΛ™2=f2(𝐱,z1,z2)+g2(𝐱,z1,z2)z3zΛ™i=fi(𝐱,z1,z2,,zi1,zi)+gi(𝐱,z1,z2,,zi1,zi)zi+1 for 1i<k1zΛ™k1=fk1(𝐱,z1,z2,,zk1)+gk1(𝐱,z1,z2,,zk1)zkzΛ™k=fk(𝐱,z1,z2,,zk1,zk)+gk(𝐱,z1,z2,,zk1,zk)u

where

  • 𝐱ℝn with n1,
  • z1,z2,,zi,,zk1,zk are scalars,
  • Template:Mvar is a scalar input to the system,
  • fx,f1,f2,,fi,,fk1,fk vanish at the origin (i.e., fi(0,0,,0)=0),
  • g1,g2,,gi,,gk1,gk are nonzero over the domain of interest (i.e., gi(𝐱,z1,,zk)0 for 1ik).

Also assume that the subsystem

𝐱˙=fx(𝐱)+gx(𝐱)ux(𝐱)

is stabilized to the origin (i.e., 𝐱=𝟎) by some known control ux(𝐱) such that ux(𝟎)=0. It is also assumed that a Lyapunov function Vx for this stable subsystem is known. That is, this Template:Math subsystem is stabilized by some other method and backstepping extends its stability to the z shell around it.

In systems of this strict-feedback form around a stable Template:Math subsystem,

  • The backstepping-designed control input Template:Mvar has its most immediate stabilizing impact on state zn.
  • The state zn then acts like a stabilizing control on the state zn1 before it.
  • This process continues so that each state zi is stabilized by the fictitious "control" zi+1.

The backstepping approach determines how to stabilize the Template:Math subsystem using z1, and then proceeds with determining how to make the next state z2 drive z1 to the control required to stabilize Template:Math. Hence, the process "steps backward" from Template:Math out of the strict-feedback form system until the ultimate control Template:Mvar is designed.

Recursive Control Design Overview

  1. It is given that the smaller (i.e., lower-order) subsystem
    𝐱˙=fx(𝐱)+gx(𝐱)ux(𝐱)
    is already stabilized to the origin by some control ux(𝐱) where ux(𝟎)=0. That is, choice of ux to stabilize this system must occur using some other method. It is also assumed that a Lyapunov function Vx for this stable subsystem is known. Backstepping provides a way to extend the controlled stability of this subsystem to the larger system.
  2. A control u1(𝐱,z1) is designed so that the system
    zΛ™1=f1(𝐱,z1)+g1(𝐱,z1)u1(𝐱,z1)
    is stabilized so that z1 follows the desired ux control. The control design is based on the augmented Lyapunov function candidate
    V1(𝐱,z1)=Vx(𝐱)+12(z1ux(𝐱))2
    The control u1 can be picked to bound VΛ™1 away from zero.
  3. A control u2(𝐱,z1,z2) is designed so that the system
    zΛ™2=f2(𝐱,z1,z2)+g2(𝐱,z1,z2)u2(𝐱,z1,z2)
    is stabilized so that z2 follows the desired u1 control. The control design is based on the augmented Lyapunov function candidate
    V2(𝐱,z1,z2)=V1(𝐱,z1)+12(z2u1(𝐱,z1))2
    The control u2 can be picked to bound VΛ™2 away from zero.
  4. This process continues until the actual Template:Mvar is known, and
    • The real control Template:Mvar stabilizes zk to fictitious control uk1.
    • The fictitious control uk1 stabilizes zk1 to fictitious control uk2.
    • The fictitious control uk2 stabilizes zk2 to fictitious control uk3.
    • ...
    • The fictitious control u2 stabilizes z2 to fictitious control u1.
    • The fictitious control u1 stabilizes z1 to fictitious control ux.
    • The fictitious control ux stabilizes Template:Math to the origin.

This process is known as backstepping because it starts with the requirements on some internal subsystem for stability and progressively steps back out of the system, maintaining stability at each step. Because

  • fi vanish at the origin for 0ik,
  • gi are nonzero for 1ik,
  • the given control ux has ux(𝟎)=0,

then the resulting system has an equilibrium at the origin (i.e., where 𝐱=𝟎, z1=0, z2=0, ..., zk1=0, and zk=0) that is globally asymptotically stable.

Integrator Backstepping

Before describing the backstepping procedure for general strict-feedback form dynamical systems, it is convenient to discuss the approach for a smaller class of strict-feedback form systems. These systems connect a series of integrators to the input of a system with a known feedback-stabilizing control law, and so the stabilizing approach is known as integrator backstepping. With a small modification, the integrator backstepping approach can be extended to handle all strict-feedback form systems.

Single-integrator Equilibrium

Consider the dynamical system

Template:NumBlk

where 𝐱ℝn and z1 is a scalar. This system is a cascade connection of an integrator with the Template:Math subsystem (i.e., the input Template:Mvar enters an integrator, and the integral z1 enters the Template:Math subsystem).

We assume that fx(𝟎)=0, and so if u1=0, 𝐱=𝟎 and z1=0, then

{𝐱˙=fx(𝟎𝐱)+(gx(𝟎𝐱))(0z1)=0+(gx(𝟎))(0)=𝟎 (i.e., π±=𝟎 is stationary)zΛ™1=0u1 (i.e., z1=0 is stationary)

So the origin (𝐱,z1)=(𝟎,0) is an equilibrium (i.e., a stationary point) of the system. If the system ever reaches the origin, it will remain there forever after.

Single-integrator Backstepping

In this example, backstepping is used to stabilize the single-integrator system in Equation (Template:EquationNote) around its equilibrium at the origin. To be less precise, we wish to design a control law u1(𝐱,z1) that ensures that the states (𝐱,z1) return to (𝟎,0) after the system is started from some arbitrary initial condition.

  • First, by assumption, the subsystem
𝐱˙=F(𝐱)whereF(𝐱)fx(𝐱)+gx(𝐱)ux(𝐱)
with ux(𝟎)=0 has a Lyapunov function Vx(𝐱)>0 such that
VΛ™x=Vx𝐱(fx(𝐱)+gx(𝐱)ux(𝐱))W(𝐱)
where W(𝐱) is a positive-definite function. That is, we assume that we have already shown that this existing simpler Template:Math subsystem is stable (in the sense of Lyapunov). Roughly speaking, this notion of stability means that:
    • The function Vx is like a "generalized energy" of the Template:Math subsystem. As the Template:Math states of the system move away from the origin, the energy Vx(𝐱) also grows.
    • By showing that over time, the energy Vx(𝐱(t)) decays to zero, then the Template:Math states must decay toward 𝐱=𝟎. That is, the origin 𝐱=𝟎 will be a stable equilibrium of the system – the Template:Math states will continuously approach the origin as time increases.
    • Saying that W(𝐱) is positive definite means that W(𝐱)>0 everywhere except for 𝐱=𝟎, and W(𝟎)=0.
    • The statement that VΛ™xW(𝐱) means that VΛ™x is bounded away from zero for all points except where 𝐱=𝟎. That is, so long as the system is not at its equilibrium at the origin, its "energy" will be decreasing.
    • Because the energy is always decaying, then the system must be stable; its trajectories must approach the origin.
Our task is to find a control Template:Mvar that makes our cascaded (𝐱,z1) system also stable. So we must find a new Lyapunov function candidate for this new system. That candidate will depend upon the control Template:Mvar, and by choosing the control properly, we can ensure that it is decaying everywhere as well.
  • Next, by adding and subtracting gx(𝐱)ux(𝐱) (i.e., we don't change the system in any way because we make no net effect) to the 𝐱˙ part of the larger (𝐱,z1) system, it becomes
{𝐱˙=fx(𝐱)+gx(𝐱)z1+(gx(𝐱)ux(𝐱)gx(𝐱)ux(𝐱))0zΛ™1=u1
which we can re-group to get
{xΛ™=(fx(𝐱)+gx(𝐱)ux(𝐱))F(𝐱)+gx(𝐱)(z1ux(𝐱))z1 error tracking uxzΛ™1=u1
So our cascaded supersystem encapsulates the known-stable 𝐱˙=F(𝐱) subsystem plus some error perturbation generated by the integrator.
  • We now can change variables from (𝐱,z1) to (𝐱,e1) by letting e1z1ux(𝐱). So
{𝐱˙=(fx(𝐱)+gx(𝐱)ux(𝐱))+gx(𝐱)e1eΛ™1=u1uΛ™x
Additionally, we let v1u1uΛ™x so that u1=v1+uΛ™x and
{𝐱˙=(fx(𝐱)+gx(𝐱)ux(𝐱))+gx(𝐱)e1eΛ™1=v1
We seek to stabilize this error system by feedback through the new control v1. By stabilizing the system at e1=0, the state z1 will track the desired control ux which will result in stabilizing the inner Template:Math subsystem.
  • From our existing Lyapunov function Vx, we define the augmented Lyapunov function candidate
V1(𝐱,e1)Vx(𝐱)+12e12
So
VΛ™1=VΛ™x(𝐱)+12(2e1eΛ™1)=VΛ™x(𝐱)+e1eΛ™1=VΛ™x(𝐱)+e1v1eΛ™1=Vx𝐱𝐱˙(i.e., d𝐱dt)VΛ™x (i.e.,dVxdt)+e1v1=Vx𝐱((fx(𝐱)+gx(𝐱)ux(𝐱))+gx(𝐱)e1)𝐱˙VΛ™x+e1v1
By distributing Vx/𝐱, we see that
VΛ™1=Vx𝐱(fx(𝐱)+gx(𝐱)ux(𝐱))W(𝐱)+Vx𝐱gx(𝐱)e1+e1v1W(𝐱)+Vx𝐱gx(𝐱)e1+e1v1
To ensure that VΛ™1W(𝐱)<0 (i.e., to ensure stability of the supersystem), we pick the control law
v1=Vx𝐱gx(𝐱)k1e1
with k1>0, and so
VΛ™1=W(𝐱)+Vx𝐱gx(𝐱)e1+e1(Vx𝐱gx(𝐱)k1e1)v1
After distributing the e1 through,
VΛ™1=W(𝐱)+Vx𝐱gx(𝐱)e1e1Vx𝐱gx(𝐱)0k1e12=W(𝐱)k1e12W(𝐱)<0
So our candidate Lyapunov function V1 is a true Lyapunov function, and our system is stable under this control law v1 (which corresponds the control law u1 because v1u1uΛ™x). Using the variables from the original coordinate system, the equivalent Lyapunov function

Template:NumBlk

As discussed below, this Lyapunov function will be used again when this procedure is applied iteratively to multiple-integrator problem.
  • Our choice of control v1 ultimately depends on all of our original state variables. In particular, the actual feedback-stabilizing control law

Template:NumBlk

The states Template:Math and z1 and functions fx and gx come from the system. The function ux comes from our known-stable 𝐱˙=F(𝐱) subsystem. The gain parameter k1>0 affects the convergence rate or our system. Under this control law, our system is stable at the origin (𝐱,z1)=(𝟎,0).
Recall that u1 in Equation (Template:EquationNote) drives the input of an integrator that is connected to a subsystem that is feedback-stabilized by the control law ux. Not surprisingly, the control u1 has a uΛ™x term that will be integrated to follow the stabilizing control law uΛ™x plus some offset. The other terms provide damping to remove that offset and any other perturbation effects that would be magnified by the integrator.

So because this system is feedback stabilized by u1(𝐱,z1) and has Lyapunov function V1(𝐱,z1) with VΛ™1(𝐱,z1)W(𝐱)<0, it can be used as the upper subsystem in another single-integrator cascade system.

Motivating Example: Two-integrator Backstepping

Before discussing the recursive procedure for the general multiple-integrator case, it is instructive to study the recursion present in the two-integrator case. That is, consider the dynamical system

Template:NumBlk

where 𝐱ℝn and z1 and z2 are scalars. This system is a cascade connection of the single-integrator system in Equation (Template:EquationNote) with another integrator (i.e., the input u2 enters through an integrator, and the output of that integrator enters the system in Equation (Template:EquationNote) by its u1 input).

By letting

  • 𝐲[𝐱z1],
  • fy(𝐲)[fx(𝐱)+gx(𝐱)z10],
  • gy(𝐲)[𝟎1],

then the two-integrator system in Equation (Template:EquationNote) becomes the single-integrator system

Template:NumBlk

By the single-integrator procedure, the control law uy(𝐲)u1(𝐱,z1) stabilizes the upper z2-to-Template:Math subsystem using the Lyapunov function V1(𝐱,z1), and so Equation (Template:EquationNote) is a new single-integrator system that is structurally equivalent to the single-integrator system in Equation (Template:EquationNote). So a stabilizing control u2 can be found using the same single-integrator procedure that was used to find u1.

Many-integrator backstepping

In the two-integrator case, the upper single-integrator subsystem was stabilized yielding a new single-integrator system that can be similarly stabilized. This recursive procedure can be extended to handle any finite number of integrators. This claim can be formally proved with mathematical induction. Here, a stabilized multiple-integrator system is built up from subsystems of already-stabilized multiple-integrator subsystems.

𝐱˙=fx(𝐱)+gx(𝐱)ux
that has scalar input ux and output states 𝐱=[x1,x2,,xn]Tℝn. Assume that
    • fx(𝐱)=𝟎 so that the zero-input (i.e., ux=0) system is stationary at the origin 𝐱=𝟎. In this case, the origin is called an equilibrium of the system.
    • The feedback control law ux(𝐱) stabilizes the system at the equilibrium at the origin.
    • A Lyapunov function corresponding to this system is described by Vx(𝐱).
That is, if output states Template:Math are fed back to the input ux by the control law ux(𝐱), then the output states (and the Lyapunov function) return to the origin after a single perturbation (e.g., after a nonzero initial condition or a sharp disturbance). This subsystem is stabilized by feedback control law ux.
  • Next, connect an integrator to input ux so that the augmented system has input u1 (to the integrator) and output states Template:Math. The resulting augmented dynamical system is
{𝐱˙=fx(𝐱)+gx(𝐱)z1zΛ™1=u1
This "cascade" system matches the form in Equation (Template:EquationNote), and so the single-integrator backstepping procedure leads to the stabilizing control law in Equation (Template:EquationNote). That is, if we feed back states z1 and Template:Math to input u1 according to the control law
u1(𝐱,z1)=Vx𝐱gx(𝐱)k1(z1ux(𝐱))+ux𝐱(fx(𝐱)+gx(𝐱)z1)
with gain k1>0, then the states z1 and Template:Math will return to z1=0 and 𝐱=𝟎 after a single perturbation. This subsystem is stabilized by feedback control law u1, and the corresponding Lyapunov function from Equation (Template:EquationNote) is
V1(𝐱,z1)=Vx(𝐱)+12(z1ux(𝐱))2
That is, under feedback control law u1, the Lyapunov function V1 decays to zero as the states return to the origin.
  • Connect a new integrator to input u1 so that the augmented system has input u2 and output states Template:Math. The resulting augmented dynamical system is
{𝐱˙=fx(𝐱)+gx(𝐱)z1zΛ™1=z2zΛ™2=u2
which is equivalent to the single-integrator system
{[𝐱˙zΛ™1]𝐱˙1=[fx(𝐱)+gx(𝐱)z10]f1(𝐱1)+[𝟎1]g1(𝐱1)z2 ( by Lyapunov function V1, subsystem stabilized by u1(x1) )zΛ™2=u2
Using these definitions of 𝐱1, f1, and g1, this system can also be expressed as
{𝐱˙1=f1(𝐱1)+g1(𝐱1)z2 ( by Lyapunov function V1, subsystem stabilized by u1(x1) )zΛ™2=u2
This system matches the single-integrator structure of Equation (Template:EquationNote), and so the single-integrator backstepping procedure can be applied again. That is, if we feed back states z1, z2, and Template:Math to input u2 according to the control law
u2(𝐱,z1,z2)=V1𝐱1g1(𝐱1)k2(z2u1(𝐱1))+u1𝐱1(f1(𝐱1)+g1(𝐱1)z2)
with gain k2>0, then the states z1, z2, and Template:Math will return to z1=0, z2=0, and 𝐱=𝟎 after a single perturbation. This subsystem is stabilized by feedback control law u2, and the corresponding Lyapunov function is
V2(𝐱,z1,z2)=V1(𝐱1)+12(z2u1(𝐱1))2
That is, under feedback control law u2, the Lyapunov function V2 decays to zero as the states return to the origin.
  • Connect an integrator to input u2 so that the augmented system has input u3 and output states Template:Math. The resulting augmented dynamical system is
{𝐱˙=fx(𝐱)+gx(𝐱)z1zΛ™1=z2zΛ™2=z3zΛ™3=u3
which can be re-grouped as the single-integrator system
{[𝐱˙zΛ™1zΛ™2]𝐱˙2=[fx(𝐱)+gx(𝐱)z2z20]f2(𝐱2)+[𝟎01]g2(𝐱2)z3 ( by Lyapunov function V2, subsystem stabilized by u2(x2) )zΛ™3=u3
By the definitions of 𝐱1, f1, and g1 from the previous step, this system is also represented by
{[𝐱˙1zΛ™2]𝐱˙2=[f1(𝐱1)+g1(𝐱1)z20]f2(𝐱2)+[𝟎1]g2(𝐱2)z3 ( by Lyapunov function V2, subsystem stabilized by u2(x2) )zΛ™3=u3
Further, using these definitions of 𝐱2, f2, and g2, this system can also be expressed as
{𝐱˙2=f2(𝐱2)+g2(𝐱2)z3 ( by Lyapunov function V2, subsystem stabilized by u2(x2) )zΛ™3=u3
So the re-grouped system has the single-integrator structure of Equation (Template:EquationNote), and so the single-integrator backstepping procedure can be applied again. That is, if we feed back states z1, z2, z3, and Template:Math to input u3 according to the control law
u3(𝐱,z1,z2,z3)=V2𝐱2g2(𝐱2)k3(z3u2(𝐱2))+u2𝐱2(f2(𝐱2)+g2(𝐱2)z3)
with gain k3>0, then the states z1, z2, z3, and Template:Math will return to z1=0, z2=0, z3=0, and 𝐱=𝟎 after a single perturbation. This subsystem is stabilized by feedback control law u3, and the corresponding Lyapunov function is
V3(𝐱,z1,z2,z3)=V2(𝐱2)+12(z3u2(𝐱2))2
That is, under feedback control law u3, the Lyapunov function V3 decays to zero as the states return to the origin.
  • This process can continue for each integrator added to the system, and hence any system of the form
{𝐱˙=fx(𝐱)+gx(𝐱)z1 ( by Lyapunov function Vx, subsystem stabilized by ux(x) )zΛ™1=z2zΛ™2=z3zΛ™i=zi+1zΛ™k2=zk1zΛ™k1=zkzΛ™k=u
has the recursive structure
{{{{{{{{𝐱˙=fx(𝐱)+gx(𝐱)z1 ( by Lyapunov function Vx, subsystem stabilized by ux(x) )zΛ™1=z2zΛ™2=z3zΛ™i=zi+1zΛ™k2=zk1zΛ™k1=zkzΛ™k=u
and can be feedback stabilized by finding the feedback-stabilizing control and Lyapunov function for the single-integrator (𝐱,z1) subsystem (i.e., with input z2 and output Template:Math) and iterating out from that inner subsystem until the ultimate feedback-stabilizing control Template:Mvar is known. At iteration Template:Mvar, the equivalent system is
{[𝐱˙zΛ™1zΛ™2zΛ™i2zΛ™i1]𝐱˙i1=[fi2(𝐱i2)+gi2(𝐱i1)zi20]fi1(𝐱i1)+[𝟎1]gi1(𝐱i1)zi ( by Lyap. func. Vi1, subsystem stabilized by ui1(xi1) )zΛ™i=ui
The corresponding feedback-stabilizing control law is
ui(𝐱,z1,z2,,zi𝐱i)=Vi1𝐱i1gi1(𝐱i1)ki(ziui1(𝐱i1))+ui1𝐱i1(fi1(𝐱i1)+gi1(𝐱i1)zi)
with gain ki>0. The corresponding Lyapunov function is
Vi(𝐱i)=Vi1(𝐱i1)+12(ziui1(𝐱i1))2
By this construction, the ultimate control u(𝐱,z1,z2,,zk)=uk(𝐱k) (i.e., ultimate control is found at final iteration i=k).

Hence, any system in this special many-integrator strict-feedback form can be feedback stabilized using a straightforward procedure that can even be automated (e.g., as part of an adaptive control algorithm).

Generic Backstepping

Systems in the special strict-feedback form have a recursive structure similar to the many-integrator system structure. Likewise, they are stabilized by stabilizing the smallest cascaded system and then backstepping to the next cascaded system and repeating the procedure. So it is critical to develop a single-step procedure; that procedure can be recursively applied to cover the many-step case. Fortunately, due to the requirements on the functions in the strict-feedback form, each single-step system can be rendered by feedback to a single-integrator system, and that single-integrator system can be stabilized using methods discussed above.

Single-step Procedure

Consider the simple strict-feedback system

Template:NumBlk

where

  • 𝐱=[x1,x2,,xn]Tℝn,
  • z1 and u1 are scalars,
  • For all Template:Math and z1, g1(𝐱,z1)0.

Rather than designing feedback-stabilizing control u1 directly, introduce a new control ua1 (to be designed later) and use control law

u1(𝐱,z1)=1g1(𝐱,z1)(ua1f1(𝐱,z1))

which is possible because g10. So the system in Equation (Template:EquationNote) is

{𝐱˙=fx(𝐱)+gx(𝐱)z1zΛ™1=f1(𝐱,z1)+g1(𝐱,z1)1g1(𝐱,z1)(ua1f1(𝐱,z1))u1(𝐱,z1)

which simplifies to

{𝐱˙=fx(𝐱)+gx(𝐱)z1zΛ™1=ua1

This new ua1-to-Template:Math system matches the single-integrator cascade system in Equation (Template:EquationNote). Assuming that a feedback-stabilizing control law ux(𝐱) and Lyapunov function Vx(𝐱) for the upper subsystem is known, the feedback-stabilizing control law from Equation (Template:EquationNote) is

ua1(𝐱,z1)=Vx𝐱gx(𝐱)k1(z1ux(𝐱))+ux𝐱(fx(𝐱)+gx(𝐱)z1)

with gain k1>0. So the final feedback-stabilizing control law is

Template:NumBlk

with gain k1>0. The corresponding Lyapunov function from Equation (Template:EquationNote) is

Template:NumBlk

Because this strict-feedback system has a feedback-stabilizing control and a corresponding Lyapunov function, it can be cascaded as part of a larger strict-feedback system, and this procedure can be repeated to find the surrounding feedback-stabilizing control.

Many-step Procedure

As in many-integrator backstepping, the single-step procedure can be completed iteratively to stabilize an entire strict-feedback system. In each step,

  1. The smallest "unstabilized" single-step strict-feedback system is isolated.
  2. Feedback is used to convert the system into a single-integrator system.
  3. The resulting single-integrator system is stabilized.
  4. The stabilized system is used as the upper system in the next step.

That is, any strict-feedback system

{𝐱˙=fx(𝐱)+gx(𝐱)z1 ( by Lyapunov function Vx, subsystem stabilized by ux(x) )zΛ™1=f1(𝐱,z1)+g1(𝐱,z1)z2zΛ™2=f2(𝐱,z1,z2)+g2(𝐱,z1,z2)z3zΛ™i=fi(𝐱,z1,z2,,zi)+gi(𝐱,z1,z2,,zi)zi+1zΛ™k2=fk2(𝐱,z1,z2,zk2)+gk2(𝐱,z1,z2,,zk2)zk1zΛ™k1=fk1(𝐱,z1,z2,zk2,zk1)+gk1(𝐱,z1,z2,,zk2,zk1)zkzΛ™k=fk(𝐱,z1,z2,zk1,zk)+gk(𝐱,z1,z2,,zk1,zk)u

has the recursive structure

{{{{{{{{𝐱˙=fx(𝐱)+gx(𝐱)z1 ( by Lyapunov function Vx, subsystem stabilized by ux(x) )zΛ™1=f1(𝐱,z1)+g1(𝐱,z1)z2zΛ™2=f2(𝐱,z1,z2)+g2(𝐱,z1,z2)z3zΛ™i=fi(𝐱,z1,z2,,zi)+gi(𝐱,z1,z2,,zi)zi+1zΛ™k2=fk2(𝐱,z1,z2,zk2)+gk2(𝐱,z1,z2,,zk2)zk1zΛ™k1=fk1(𝐱,z1,z2,zk2,zk1)+gk1(𝐱,z1,z2,,zk2,zk1)zkzΛ™k=fk(𝐱,z1,z2,zk1,zk)+gk(𝐱,z1,z2,,zk1,zk)u

and can be feedback stabilized by finding the feedback-stabilizing control and Lyapunov function for the single-integrator (𝐱,z1) subsystem (i.e., with input z2 and output Template:Math) and iterating out from that inner subsystem until the ultimate feedback-stabilizing control Template:Mvar is known. At iteration Template:Mvar, the equivalent system is

{[𝐱˙zΛ™1zΛ™2zΛ™i2zΛ™i1]𝐱˙i1=[fi2(𝐱i2)+gi2(𝐱i2)zi2fi1(𝐱i)]fi1(𝐱i1)+[𝟎gi1(𝐱i)]gi1(𝐱i1)zi ( by Lyap. func. Vi1, subsystem stabilized by ui1(xi1) )zΛ™i=fi(𝐱i)+gi(𝐱i)ui

By Equation (Template:EquationNote), the corresponding feedback-stabilizing control law is

ui(𝐱,z1,z2,,zi𝐱i)=1gi(𝐱i)(Vi1𝐱i1gi1(𝐱i1)ki(ziui1(𝐱i1))+ui1𝐱i1(fi1(𝐱i1)+gi1(𝐱i1)zi)Single-integrator stabilizing control uai(𝐱i)fi(𝐱i1))

with gain ki>0. By Equation (Template:EquationNote), the corresponding Lyapunov function is

Vi(𝐱i)=Vi1(𝐱i1)+12(ziui1(𝐱i1))2

By this construction, the ultimate control u(𝐱,z1,z2,,zk)=uk(𝐱k) (i.e., ultimate control is found at final iteration i=k). Hence, any strict-feedback system can be feedback stabilized using a straightforward procedure that can even be automated (e.g., as part of an adaptive control algorithm).

See also

References

Template:Reflist