Notes on non-holonomic control theory
Introduction
A Given system of Pffafian constraints of the form
J(θ,x)θ′=GT(θ,x)We convert it into a form
ωi(q)q′=0where q=(θ,x)∈Rn,i=1..k is the configuration of the system. where the ωi(q) are row vectors. We assume that the ωi are linearly independent at each point q∈Rn and each \omega_i describes one constraint on the directions in which q′ is permitted to take values.
A holonomic system restricts the motion on a smooth hypersurface (manifold), Locally a manifold can be represented by a set of equations of the form
hi(q)=0The dimension of the manifold on which this system evolves is n−k. The system is integrable if there exists functions hi:Rn→R,i=1..k such that
hi(q(t))=0⟺ωi(q)q′=0,i=1..kAn integrable Pffafian constraint is called a holonomic constraint. Its called nonholonomic if its not equivalent to a holonomic sytem.
Therefore the question now is, given a nonholonomic system is there a path between q0 to qf. This is called reachability.
Integrability
A system is integrable, if we can find a function h:Rn→R such that
ω(q)q′=0⟺h(q)=0Lets take a single constraint on the velocity and differntiate h(q) it can be written as
n∑j=1ωj(q)q′j=0⟺∂h(q)∂qjq′j=0This implies there is a function α(q) satisfying
α(q)ωj(q)=∂h(q)∂qj ∀j=1..nThus, a single Pfaffian constraint is holonomic if and only if there exists an integrating factor α(q) such that α(q)ω(q) is the derivative of some function h.
An integrable constraint restricts the motion of a system to level sets of h.
It will be convenient for us to convert problems with nonholonomic constraints into another form. Roughly speaking, we would like to ex- amine the systems not from the point of view of the constraints (namely, the directions that we cannot move), but rather from the viewpoint of the directions in which we are free to move.
Therefore we re-formulate the problem by choosing a rightnull space for ω(q) denoted by gj(q)∈Rn i=1,...,n−k=:m such that
ωi(q)gj(q)=0 i=1..k,j=1..n−ktherefore the allowable trajcetories can be written as
q′=m∑j=1gj(q)ujthat is q(t) is a feasible trajectory iff it satisfies the above equation, for some choice of controls u(t)∈Rm
Vector Fields
A vector field assigns a vector in the tangent space of a manifold, i.e. a smooth map f(q)∈TqRn, and is represented as a collumn
f=[f1(q)f2(q)..fn(q)]They can be thought of right hand side of the equation q′=f(q) The rate of change of a smooth function V:Rn→R along the flow of f is given by
V′=∂V∂qifiDenoted by
LfV=∂V∂qf(q)The flow of a vector field is the solution of the differential equation (9) Specifically the equation Φft(q) represents the state of the system starting from the q0 at time t=0 thus
dΦft(q)dt=f(Φft(q)) q∈RnA vector field is said to be complete if it is defined for all t.
Lie Brackets
Consider the composition Φg1t(q)∘Φg2s(q) gives the composition of flow along g2 for s-seconds with flow of g1 for t-seconds.
The Lie bracket is thus the infinitesimal motion that results from flowing around a square defined by two vector fields f and g.
[f,g]=∂g∂qf(q)−∂f∂qg(q)A distribution assigns a subspace of the tangent space to each point Rn in a smooth way. A special case of the distribution is given when it is defined by a set of smooth vector fields g1,g2,..gm in which a distribtion is defined as
Δq=span{g1(q),g2(q),..gm(q)}A distribution is called regular if the dimension of Δq doesn’t change with q. Its called involutive if its closed under a lie bracke, i.e. [f,g]∈Δ ∀ f,g∈Δ the closure operation is denoted by ˉΔ. That is, ˉΔ is the smallest distribution containing Δ such that if f,g∈ˉΔ then [f,g]∈ˉΔ.
Lie Algebra
A vectorspace V (over R) is a Lie Algebra if there exists a bilinear operation V×V→V denoted by [,] satisfying (i)Skew Symmetry ([f,g]=−[g,f]) and (ii) Jacobi Identity. The set of smooth vector fields on Rn with the Lie bracket is a Lie algebra and is denoted X (Rn). For a set of smooth fields g1,g2,..gm, the involutive closure ˉΔ is a Lie algebra, called the lie algebra generate by g1,g2,..gm and is often denoted by L(g1,g2,..gm)
A distribution Δ of constant dimension k, is said to be integrable if there exists a set of smooth function hi:Rn→R such that the row vectors ∂hi∂q are linearly independent for at q for every f∈Δ.
The hypersurfaces given by
{q:h1(q)=c1,..hn−k(q)=cn−k}are called integral manifolds.
Frobenius Theorem: A regular distribution is integrable if and only if it is involutive.
Thus if Δ is integrable then there are n−k functions defined locally hi:Rn→R i=1..n−k with level surfaces of h=(h1,..,hn−k), these level surfaces form a foliation of Rn, A single level surface is called a leaf of foliation.
Covectors
The dual space of TpRn is denoted by T∗pRn, analogus to the vector field a one-form is a map which assign to each point q a covector ω(q)∈T∗pRn in local coordinates a one-form is represented by a row-vector
ω(q)=[ω1(q),..ωn(q)]Differential of a smooth function is an example of an one-form for β:Rn→R
dβ=[∂β∂q1...∂β∂qn]A codistribution assigns a covector to each point in q∈T∗pRn
Ω=span{ω1(q),...ωn(q)}For a control problem we need to convert an equation given as one-forms ωi(q)q′=0 into an equivalent control system.
Annihilator For a given set of one-forms ωi , i=1..k there exists a set of smooth linearly independent vector fields gj j=1..n−k such that ωi(q)gj(q)=0
i.e for Ωq=span{ω1(q),...ωn(q)} there exists a Δq=span{g1(q),g2(q),..gn−k(q)} such that Δ=Ω⊥. We say that the Distribution Δ annihilates the codistribution Ω
The control system associated with the distribution is of the form
q′=g1(q)u1+..+gn−kun−kCan be written since ω(q)q′=0 and g1..gn−k is an annihilator (rightnull space of ω(q))
Controllability
Consider the control systems of the form
∑: q′=g1(q)u1+..+gmumU∈Rmq∈RnThis system is said to be drift-free when under zero input u the system doesn’t drift. The gi, i=1..m are assumed to be linearly independent vector fields on Rn
A system σ is said to be controllable if for any q0,qf there exists a set of controls u:[0,T]→U for T>0 which satisfies q(0)=q0 and q(T)=qf
Given an openset V⊆Rn define Rv(q0,t) to be the set of states q that there exists u:[0,T]→U that steers ∑ from q(0)=q0 to q(T)=qf and satisfies q(t)⊆V for 0⩽t⩽T and define the set of states reachable up to time T to be
Rv(q0,⩽T)=⋃0<τ⩽TRv(q0,τ)Let ˉΔ=L(g1,...,gm) be the Lie algebra generated by g1,...,gm. Referred to as the the controllability Lie algebra. A sequence of inputs
u1=+1 u2=0 for 0⩽t⩽ϵu1=0 u2=+1 for ϵ⩽t⩽2ϵu1=−1 u2=0 for 2ϵ⩽t⩽3ϵu1=0 u2=−1 for 3ϵ⩽t⩽4ϵGenerates motion in the direction of Lie Bracket [g1,g2] If we were to iterate on this sequence, it should be possible to generate motion along directions given by all the other Lie products associated with the gi
Chow’s Theorem: The control system ∑ is locally controllable at q∈Rn if Δq=TqRn.
Reference
A Mathematical Introduction to Robot Manipulation R.M Murray