Differential Flatness by Pure Prolongation: Necessary and Sufficient Conditions
Abstract
In this article, we introduce the notion of differential flatness by pure prolongation: loosely speaking, a system admits this property if, and only if, there exists a pure prolongation of finite order such that the prolonged system is feedback linearizable. We obtain Lie-algebraic necessary and sufficient conditions for a general nonlinear multi-input system to satisfy this property. These conditions are comprised of the involutivity and relative invariance of a pair of filtrations of distributions of vector fields. An algorithm computing the minimal prolongation lengths of the input channels that achieve the system linearization, yielding the associated flat outputs, is deduced. Examples that show the efficiency and computational tractability of the approach are then presented.
Keywords— differential flatness; Lie-Bäcklund isomorphism; Lie brackets; distributions of vector fields; prolongation of vector fields; dynamic feedback linearization.
1 Introduction
The notions of static feedback linearization [17, 14] and dynamic feedback linearization of a nonlinear system, whose preliminary results were reported in [6, 7, 32, 1] (see also [33, 34, 11, 2, 12]), were at the origin of a so far uninterrupted thread of studies in nonlinear system theory. In particular, during the last three decades, they gave birth to the concept of differential flatness, that plays a prominent part in motion planning and trajectory tracking problems and their applications (see [24, 9, 10] and [21] for a thorough presentation).
Sufficient or necessary conditions in special cases, as well as a general differential flatness characterization, although without an upper bound on the number of iterations of the corresponding algorithm, have been obtained (see e.g. [21, 22] for a historical review). Nevertheless, the question of obtaining computationally tractable general necessary and sufficient conditions for dynamic feedback linearization as well as for differential flatness, remains open. In this paper, we restrict our study to the class of differentially flat systems by pure prolongation, i.e. , roughly speaking, the class of -dimensional systems with inputs
for which there exists a multi-index such that the prolonged system
(1.1) | ||||
of dimension , where we have denoted by the -th order time derivative of , is locally static feedback linearizable.
The corresponding transformation is called pure dynamic extension in [33, 34] in the context of finding upper bounds on the indices , if they exist. We prefer using here the word prolongation initially introduced in [7], in reference to É. Cartan [5] (see also [32]).
This special class of differentially flat systems, initially introduced in the framework of dynamic feedback linearization [6, 7, 32, 1], has also been studied in [11, 12], under the name of linearization by prolongation, again in terms of upper bounds of prolongation orders, and in [2] where an algorithm, yielding a sufficient condition, is obtained.
However, the necessary and sufficient conditions presented in this paper, tackled via the here introduced concept of equivalence by pure prolongation, are original to the author’s knowledge. Moreover, they are easily checkable by an algorithm that only involves Lie bracket and linear algebra operations, yielding the minimal pure prolongations if they exist.
Our main contributions are:
-
1.
The introduction of the equivalence relation of systems by pure prolongation, strictly coarser than the well-known equivalence by diffeomorphism and feedback (see e.g. [17, 15, 16, 28, 20]) and strictly finer than the Lie-Bäcklund equivalence (see e.g. [10, 21]). For this equivalence relation, the set of flat systems by pure prolongation is identified with the equivalence class of 0 (modulo the trivial vector field)(see definition 4.2);
-
2.
Proposition 3.2, extending and specifying results implicitly present in various forms in [7, 11, 2, 12], where we prove that, whatever the prolongation , the filtration of prolonged distributions, built on the successive Lie brackets of the prolonged drift with the prolonged control vector fields, is decomposable into the direct sum of two filtrations of distributions. The first one, denoted by , is, at each point of the prolonged manifold, generated by vector fields belonging to the original tangent bundle, of dimension (in a suitably defined vertical bundle, see (3.13)); The second one, denoted by , is generated by the sequence of prolonged control vector fields of decreasing orders up to 1, i.e. (see (3.12));
-
3.
Theorem 4.1 giving the necessary and sufficient conditions: (i) must be involutive with locally constant dimension and (ii) invariant by for all , and (iii) must be equal to for all large enough (strong controllability);
- 4.
-
5.
Algorithm 4.2 whose input comprises the system vector fields and whose output is either the list of minimal prolongation lengths or the claim that the system is not flat by pure prolongation, deduced in a finite number of steps.
The paper is organized as follows: In section 2, we present the necessary recalls of basic results on differential flatness and feedback linearization. Then we introduce and study the purely prolonged distributions and the associated vertical ones in section 3. The equivalence by pure prolongation and the definition of flatness by pure prolongation, followed by its necessary and sufficient conditions and by the pure prolongation algorithm are then presented in section 4. A series of five examples, four with two inputs (sections 5.1, 5.2, 5.3 and 5.4) and one with three inputs (section 5.5) then illustrate our results in section 5. Moreover, the pendulum example (section 5.4), is proven to be non flat by pure prolongation, though known to be differentially flat [10, 21], thus proving that the set of flat systems by pure prolongation is strictly contained in the set of differentially flat ones. The paper ends with concluding remarks and an appendix establishing a comparison formula between prolonged and non prolonged Lie brackets.
2 Recalls on Differential Flatness and Feedback Linearization
Consider a non-linear system over a smooth -dimensional manifold given by
(2.1) |
where is the -dimensional state vector, the input or control vector, with , and a vector field in the tangent bundle of for each and whose dependence on is of class .
Before going further, we need the following notations, valid all along this paper:
-
•
Boldface letters are systematically used to denote multi-integers, i.e.
-
•
We denote the minimum of two arbitrary integers and by , and their maximum by .
Also, for every and , we use the componentwise minimum notation
(2.2) Accordingly, the componentwise maximum is denoted by
(2.3) If , we also use the notations and , with in regular math typeface.
-
•
Overlined symbols will denote a collection of successive time derivatives of a time-dependent function as follows. Given a multi-integer and a locally defined function ,
-
–
denotes the vector of dimension , with and , , ;
-
–
denotes the infinite sequence
where is the product of an infinite number of copies of .
-
–
2.1 Recalls on Lie-Bäcklund Equivalence
For a detailed presentation of the topics of this section, the reader may refer e.g. to [10, 29, 21, 22, 30].
Definition 2.1.
The infinite order jet space prolongation of system (2.1) is given by the pair , where is the product of with an infinite number of copies of , with coordinates , endowed with the Cartan field
(2.4) |
defined on , the tangent bundle of .
Definition 2.2 (Lie-Bäcklund equivalence).
Consider two systems:
(2.5) |
and their respective prolongations , with coordinates and Cartan field
(2.6) |
and , with coordinates , and Cartan field
(2.7) |
We say that they are Lie-Bäcklund equivalent at a pair of points and if, and only if, there exists neighborhoods and and a isomorphism111Recall that a continuous function and, a fortiori, differentiable, resp. , depends, by definition of the source and target product topologies, on a finite number of components of its variables, namely (resp. ) depends an a finite number of components of (resp. ) (see e.g. [19, 36, 21]). satisfying , with inverse , such that the respective Cartan fields are and related, i.e. in and in .
In other words, the two systems are Lie-Bäcklund equivalent at the points and if there exist neighborhoods of these points where every integral curve of the first system is mapped to an integral curve of the second one and conversely, with the same time parameterization. Clearly, this relation is an equivalence relation.
We recall, without proof, a most important result from [24] (see also [9, 10, 21]) giving an interpretation of the Lie-Bäcklund equivalence in terms of diffeomorphism in finite dimension and endogenous dynamic feedback, that will be useful later on.
Theorem 2.1 (Martin [24]).
If the two systems (2.5) are Lie-Bäcklund equivalent at a given pair of points, then (i) and (ii) must be satisfied:
-
(i)
, i.e. they must have the same number of independent inputs;
-
(ii)
there exist
-
–
an endogenous dynamic feedback222A dynamic feedback is said endogenous if, and only if, the closed-loop system and the original one are Lie-Bäcklund equivalent, i.e. if, and only if, the extended state can be locally expressed as a smooth function of , and a finite number of time derivatives of (see [24, 9, 10, 21]).
(2.8) where belongs to , a finite dimensional smooth manifold,
-
–
a multi-integer333Recall that we denote by . ,
-
–
and a local diffeomorphism ,
all defined in a neighborhood of the considered points, such that the extended system
(2.9) and the closed-loop one
(2.10) are -related for all , i.e.
(2.11) and
(2.12) where we have denoted
-
–
2.2 Recalls on Differential Flatness
Definition 2.3.
We say that system (2.1) is differentially flat (or, more shortly, flat) at the pair of points and if and only if, it is Lie-Bäcklund equivalent to the trivial system ( where is the trivial Cartan field
(2.13) |
at the considered points.
Otherwise stated, the locally defined flat output is such that , with444The first component of , corresponding to the component, is denoted by so that the component effectively corresponds to the th time derivative of . for all sufficiently differentiable function .
This definition immediately implies that a system is flat if, and only if, there exists a generalized output of dimension , depending at most on a finite number of derivatives of , with independent derivatives of all orders, such that and can be expressed in terms of and a finite number of its successive derivatives, i.e. , and such that the system equation is identically satisfied for all sufficiently differentiable .
For a flat system, with the notations of theorem 2.1, the vector field , or indifferently, corresponds to the linear system in Brunovský canonical form
(2.14) |
and , defined by (2.7), is the trivial Cartan field , with given by (2.13).
Remark 2.1.
In view of Definition 2.2, since the trivial Cartan field (2.13) is the infinite jet prolongation of , , system (2.1) is flat if, and only if, it is Lie-Bäcklund equivalent to simple integrators in parallel. We may also remark that, since the Cartan field is equal to 0 (modulo , the class of flat systems may be identified with the Lie-Bäcklund equivalence class of 0 (modulo ).
Theorem 2.1 reads:
Corollary 2.1.
Consequently, a flat system can be transformed, by diffeomorphism and feedback of a suitably extended space, in a linear controllable system, which motivates the recalls of the next section.
2.3 Recalls on Feedback Linearization
Feedback linearizable systems [17, 15] (see also [16, 28, 23, 20]) constitute a subclass of differentially flat systems. They correspond to the equivalence class of linear controllable systems with respect to the following finer equivalence relation, called equivalence by diffeomorphism and feedback.
Definition 2.4.
The two systems given by (2.5) are said equivalent by diffeomorphism and feedback if, and only if, there exists
-
•
a local diffeomorphism from a neighborhood of an equilibrium point of (which may be chosen, without loss of generality, as the origin ) to a suitable neighborhood of ,
-
•
and a static feedback , being invertible with respect to for all in the above mentioned neighborhood of the origin, i.e. for all and as above,
such that ,
Indeed, this equivalence implies that and that both and are -dimensional.
Definition 2.5 (Feedback Linearizability).
System (2.1) is said static feedback linearizable or, shortly, feedback linearizable if the context allows, if, and only if, it is equivalent by diffeomorphism and feedback to a linear system in Brunovský controllability canonical form
(2.15) |
where the multi-integer , whose components are called the controllability indices of system (2.15), satisfies .
Indeed, since the -dimensional vector
and are diffeomorphic (again we have noted ), it is immediate to verify that is a flat output and that every feedback linearizable system is differentially flat.
These systems have been first characterized by [17, 14, 15] for control-affine systems, i.e. systems given by . More generally, it can be easily proven that systems of the form (2.1) are feedback linearizable if, and only if, the first-order control-affine prolongation
(2.16) | ||||
with state and control vector , is feedback linearizable (see e.g. [6, 31, 33, 20]).
Indeed, in the local coordinates555We introduce the superscript (0) from now on to get ready to work with higher order prolongations (see section 3). of , denoting the associated vector fields by
(2.17) |
defined on the tangent bundle , system (2.16) reads
(2.18) |
with the usual abuse of notations identifying a vector field expressed in local coordinates with its associated (Lie derivative) first order partial differential operator.
2.4 Recalls on Lie brackets and Distributions
The Lie bracket of two arbitrary vector fields and of is given, in the -coordinates, by , with .
For iterated Lie brackets, we use the notation and for , with the convention that . In addition, if is an arbitrary distribution of vector fields on , we note .
The distribution is said involutive if, and only if, for every pair of vector fields , to which case we note , or , where denotes the involutive closure of , i.e. the smallest involutive distribution containing .
If the distribution is locally generated by vector fields , with arbitrary, we write . We also denote by the vector space generated by the vectors at a point .
Consider the (th-order or non prolonged) filtration of distributions built on the vector fields (2.17)666As before, the superscript (0) is used to indicate that the distributions and the related indices and are built on the non prolonged vector fields (2.17) and to distinguish them from the prolonged distributions of arbitrary th order, , and related indices, and , later introduced in sections 3 and 4.:
(2.19) |
indeed satisfying .
Note that, according to (2.17) and (2.19), is involutive with constant dimension, equal to , by construction.
Theorem 2.2 provides a construction of flat outputs via Frobenius theorem (see e.g. [8]) and the list of the so-called Brunovský’s controllability indices [4] as follows:
Definition 2.6.
Consider the sequence of integers
The Brunovský controllability indices ’s are defined by
where denotes the number of elements of an arbitrary set .
It can be proven (see e.g. [17, 15, 16, 28, 20]) that, for a feedback linearizable nonlinear system (2.1), or (2.16), we have:
-
•
the sequences and are non increasing,
-
•
for all , for all ,
-
•
,
-
•
.
The list is uniquely defined up to input permutation, invariant by static state feedback and state diffeomorphism, and is indeed equal to the list of controllability indices of the associated linear system (2.15) with , .
Moreover, for all and all , and possibly up to a suitable input reordering, we have
Then, flat outputs are locally non trivial solutions of the system of PDE’s
(2.20) | ||||
for , where we have denoted by the Lie derivative of a vector function along the vector field . These solutions are such that the mapping
is a local diffeomorphism.
Remark 2.2.
Recall from [6] that, for single input systems, differential flatness and feedback linearizability are equivalent.
3 System Pure Prolongation
3.1 Purely Prolonged Distributions
We now introduce higher order prolongations of the vector fields defined by (2.17), called pure prolongations [7] (see also [33, 34, 2, 12]).
Given a multi-integer , we note, as before, and the prolonged state:
with , .
Let be the associated -th order jet manifold of dimension with coordinates .
The pure prolongation of order of system (2.16), or otherwise said, of the vector fields (2.17), in the tangent bundle , is defined by
(3.1) | ||||
with the convention that if .
They are naturally associated to the adjunction of pure integrators to in (2.16) (with the same usual abuse of notations as in (2.18)):
(3.2) |
or
being the new control vector of this purely prolonged system, whose state is .
Remark 3.1.
Note that the state of the -th prolonged system, , coincides with the image of by the projection for all . In addition, the family of projections for all such that for all , that we note , indeed satisfies for all and thus allows us to identify the manifold with the projective limit of the family for all and all such that , i.e. (see e.g. [3, Chap. I,§10]). A similar identification trivially holds for the associated tangent bundles, i.e. relatively to the family of tangent projections, hence the identification of the Cartan field , defined by (2.4), with , the projective limit of the vector fields . Nevertheless, this property does not hold for the control vector fields since is not equal to , for and . Moreover, the Lie bracket of vector fields is not preserved by this family of projections. This is one of the reasons why prolongations may enlarge the range of the system transformations.
Remark 3.2.
Given an arbitrary point around which system (2.16) is defined, it is convenient to consider the shift
such that is mapped to the origin of , denoted by , thus inducing the shift of vector fields:
(3.3) |
now defined in a neighborhood of . For the sake of simplicity, we will only consider such shifted vector fields in the sequel while keeping the same notation as before, though abusive, but yet unambiguous.
We now introduce the following filtration of -th order purely prolonged distributions of :
(3.4) |
Indeed, for , i.e. , this filtration coincides with the th order one given by (2.19). Similarly to the th order case, is involutive with constant dimension, equal to , by construction.
Moreover, since every , with , we have
Proposition 3.1.
There exists a finite integer such that for all and
(3.5) |
Proof.
Remark 3.3.
In full generality, depends on the point where it is evaluated. However, if is constant in an open dense subset of for all large enough , so is .
Let us inductively define the -dimensional vector functions , for , , and arbitrary as follows:
(3.6) |
with
(3.7) |
For an arbitrary and given , thanks to (3.7), it is readily seen that depends at most of and thus, if , thanks to (3.6), depends at most of .
3.2 Vertical Distributions of Purely Prolonged Ones
Before stating the next Lemma, we need to recall the definition of vertical bundle. Given an arbitrary and the fiber bundle , with , its vertical space at , denoted by , is the tangent space . Its vertical bundle, denoted by , is the vector bundle made of the vertical spaces at each , i.e. the set of linear combinations whose coefficients are smooth functions that depend at most on and where are local coordinates of .
The same definition indeed holds for the vertical bundle associated to the fiber bundle , i.e. the set of linear combinations of whose coefficients are smooth functions of .
We now establish some comparison formulae between Lie brackets of the vector fields of the purely prolonged system and those of the original (non prolonged) one. More complete formulae may be found in Lemma A.1 of the Appendix A.
Lemma 3.1.
For all satisfying , for all and , we have:
(3.8) |
and for all :
(3.9) |
Moreover, we have
(3.10) |
Proof.
Then, for , using the fact that for all , and , we have:
(3.11) | ||||
which proves that and that (3.9) holds at the order .
Assuming that (3.9) holds up to , with depending at most on , we have
and, according to (3.6)-(3.7), for all , , since we differentiate with respect to , it is immediate to verify that depends at most on
and on if , hence (3.9).
Concerning (3.10), since depends at most on , the derivative of with respect to is indeed null if , hence the result. ∎
3.3 Decomposition of Purely Prolonged Distributions
Let us assume, without loss of generality, that the control components have been reordered in such a way that . Moreover, we may suppose that , as shown to be sufficient in the next section.
We now introduce two new filtrations of , noted and , for , as follows
(3.12) |
(3.13) |
with the convention that if , .
We indeed have for all . Thus, for all .
Remark 3.4.
Note that, unlike the filtration that is increasing for , the mapping is only non-decreasing in general.
Remark 3.5.
In our definition of , we consider Lie brackets of the form , as opposed to [2] where Lie brackets of the form are used.
Proposition 3.2.
For all such that , with finite, if and for some , we have for all .
Moreover, for all ,
(3.15) |
(3.16) |
and we have
(3.17) |
Furthermore, the finite integer , satisfying (3.5), is such that and for all .
If, in addition, , then
(3.18) |
Proof.
By definition, the generators of are independent for all and thus their number is equal to , hence (3.15). The dimension of , in turn, is lesser than, or equal to, the number of its generators, in number , if (respectively , if ), and, since, according to (3.9) of Lemma 3.1, is contained in if , (respectively in if ), its dimension is bounded above by (resp. ), hence (3.16)
The proof of (3.17) is by induction. For , by (3.12)-(3.13), we indeed have . Thus, (3.17) is valid at the order 0.
Assume now that (3.17) holds true up to the order with for some , assuming that . If , the reader may immediately go to the case below.
Remark 3.6.
The inequality (3.18) reads and may thus be interpreted as an estimate of the gap between and the average value of the prolongation lengths , provided that the prolonged system satisfies the strong accessibility rank condition .
4 Flatness by Pure Prolongation
4.1 Equivalence by Pure Prolongation
Consider the two systems (2.5) with , and .
Given arbitrary and , we recall that the associated prolonged vector fields are
The prolonged states are, respectively, and , and the control inputs and .
Definition 4.1.
The systems (2.5) are equivalent by pure prolongation (in short -equivalent) at a point if, and only if, there exist finite and such that the prolonged systems of order and respectively are equivalent by diffeomorphism and feedback, i.e. if, and only if, there exists a local diffeomorphism and a feedback :
with invertible with respect to for all in a suitable neighborhood of , such that
This equivalence indeed implies that .
Remark 4.1.
The equivalence relation by diffeomorphism and feedback is easily seen to be strictly finer than the -equivalence (take ), which in turn is strictly finer than the Lie-Bäcklund equivalence (see e.g. Example 5.4).
Definition 4.2.
We say that system (2.16) is flat by pure prolongation (in short -flat) at a point if, and only if, it is -equivalent to , and is called -flat output.
It is therefore immediate to remark that a system is -flat if, and only if, there exists a pure prolongation of finite order such that the prolonged system is feedback linearizable at , thus recovering the definition of linearization by prolongation already introduced in [11, 12, 2].
Moreover, a -flat output being obviously a flat output and pure prolongations being particular cases of Lie-Bäcklund isomorphisms, the class of -flat systems is indeed contained in the class of Lie-Bäcklund equivalence to (modulo the trivial field ), i.e. constitutes a subclass of differentially flat systems.
Lemma 4.1.
We consider system (3.2), denoted by , with , assuming, without loss of generality, that , possibly up to input renumbering. We denote by , and by the corresponding system. Then is -flat at a given point if, and only if, is also -flat at this point. Moreover, every -flat output of at is a -flat output of at the same point, and conversely.
Proof.
Since is -flat, there exists and such that is feedback equivalent to the linear system . Therefore, since, by assumption, , is also -flat. The converse is trivial as well as the fact that and have the same -flat output. ∎
4.2 Necessary and Sufficient Conditions
The following Proposition is a straightforward adaptation of Theorem 2.2 for an arbitrary order . Note that, at this stage, nothing is said about a possible choice of , a question that will be dealt with in subsection 4.3, theorem 4.2.
Proposition 4.1.
The prolonged system of order is feedback linearizable at if, and only if, is involutive with locally constant dimension for all and such that .
Again, flat outputs can be computed via Frobenius theorem, once established the list of Brunovský’s controllability indices of order , as follows:
Definition 4.3.
Consider the sequence of integers
The Brunovský controllability indices of order are defined by
As in the th order case, if the prolonged system of order is feedback linearizable at , we have:
-
•
’s and ’s are non increasing sequences,
-
•
for all and for all ,
-
•
,
-
•
.
The list is uniquely defined up to input permutation, invariant by prolonged state feedback and prolonged state diffeomorphism, and is thus equal to the list of controllability indices of the associated linear system (2.15) with , .
Moreover, for all and all , and possibly up to a suitable input reordering, we have
and flat outputs are locally non trivial solutions of the system of PDE’s
(4.1) |
Finally, the mapping
is a local diffeomorphism.
In virtue of Lemma 4.1, it suffices to restrict our analysis to prolongations of order such that .
We are now ready to state our main result.
Theorem 4.1.
A necessary and sufficient condition for -flatness at is that there exists , , such that
-
(i)
with locally constant for all ,
-
(ii)
for all ,
-
(iii)
is such that and for all .
Proof.
By (3.17) of Proposition 3.2, we have for all . Then, implies that . Since for all , and since by Lemma 3.1 and (3.14), we deduce that , hence and , i.e. , for all .
Conversely, and for all trivially implies that for all .
Moreover, since is constant by construction, the fact that has locally constant dimension is equivalent to the fact that has locally constant dimension too for all , hence (i).
Finally, (iii) is an immediate consequence of the condition that for all , and the theorem is proven. ∎
4.3 The Pure Prolongation Algorithm
From now on, for every sequence , we systematically re-order the indices by a suitable permutation such that . Moreover, for simplicity’s sake, the permutation will be omitted. We will thus abusively replace by , i.e. .
In the following algorithm we assume that the computations are done in a suitable open dense neighborhood of where all the distributions involved have constant dimension.
4.3.1 Initialization
Consider the filtration defined by (2.19). If every satisfies the conditions of theorem 2.2, the system is feedback linearizable and no prolongation is needed. In particular, for , a case where flatness and feedback linearizability are equivalent, the results of this section are pointless.
Otherwise, we have the following alternative:
-
•
either there must exist such that is not involutive while every is involutive for (note that since is always involutive),
-
•
or the ’s are all involutive but with .
First Case.
There exists , first index for which is not involutive.
Let be any involutive distribution included in , of the form
(4.2) |
for some .
By (A.3), for all and, thanks to (3.10), we have for all with and all . Therefore we can choose
(4.3) |
and
(4.4) |
for any
(4.5) |
since they naturally satisfy and for all given by (4.5), i.e. with .
However if, for ,
(4.6) |
and
(4.7) |
also satisfy and , the previous choice (4.3)-(4.4)-(4.5) maybe replaced by (4.6)-(4.7) with .
These choices, namely (4.3)-(4.4)-(4.5), or (4.6)-(4.7) with , for any given by (4.2), constitutes the initialization of the algorithm.
Note that there are at most possibilities of such initialization.
Second Case.
Lemma 4.2.
Assume that the ’s are all involutive with . Then for all and and for all .
Proof.
We immediately conclude that, in this case, the strong controllability rank condition does not hold, which contradicts (iii) of theorem 2.2, hence the non-flatness by pure prolongation. Therefore, this case must be discarded.
4.3.2 Recursion
For all and all given by:
(4.8) |
and denoting by (resp. ) the componentwise minimum (resp. maximum) of a collection of -tuples in a set , with , let us introduce the following numbers
(4.9) | ||||
(4.10) | ||||
and
(4.11) | ||||
Remark 4.5.
In view of the definition (3.13) of , if for some and , does not depend on . Thus .
Proposition 4.2.
Proof.
(4.13) is an immediate consequence of (3.10) and of the definitions of and . Moreover, since, according to remark 3.4, is non decreasing and bounded by , then there exists a finite such that for all and thus the maximum with respect to in (4.11) is achieved for . The C-minimal prolongation orders are thus obtained by varying the initializations built on (4.2). ∎
We thus have proven:
Theorem 4.2.
We have the following alternative:
-
1.
If, for every choice of initialization built on (4.2), there exists a for which or if for all , then the system is not flat by pure prolongation.
- 2.
Proof.
Straightforward from what precedes. ∎
We immediately deduce the following algorithm:
Algorithm 1. flatness by pure prolongation
- Input:
-
the vector fields (see (2.17))
- output:
-
the minimal lengths and or fail if the system is not flat by pure prolongation.
- Initialization.
- Step .
- Step .
-
Determine . If , stop. Otherwise, fail.
5 Examples
All the examples of this paper concern two input systems, i.e. , except example 5.5, with inputs, resuming the example 2 of [18].
In the two input examples, the prolongation index is supposed to be such that , up to a suitable input permutation. However, for the sake of readability, we will keep the original input numbering unchanged and thus consider that or depending on the context. At the exception of this modification, we strictly apply algorithm 4.2 in all the examples.
The first example gives a detailed presentation of the application of this algorithm, in particular the role played by and . The second one shows the importance of the sole number to determine the prolongation length, and the third one, borrowed from [7], and carried on again in [2, Section 3.1], is reported here to compare our approach with the one of [2]. Then, the pendulum example is presented to show that non flat systems by pure prolongation can be detected in a finite number of steps. To conclude this section, the last example, with 3 inputs, compares the constuction proposed in [18, Example 2] with our algorithm leading to a minimal prolongation, strictly smaller than the one of [18].
5.1 Chained System [25]
(5.1) | ||||
This system has been proven to be flat in [25, section 3.1.1] with the following flat output
(5.2) |
5.1.1 Associated Non Prolonged Distributions
Let us start this section by showing that system (5.1) is not static feedback linearizable.
We denote the state coordinates by ( and ), with , , , and , .
The two input variables are , .
The system vector fields are
(5.3) | ||||
One can verify that
and
Therefore
since, e.g. , , and whereas ,
and for all . Moreover, . We conclude that the system is not feedback linearizable.
Since is not involutive, there are two possible initializations:
(5.4) |
or
(5.5) |
We use the second possibility, which amounts to prolonging the first input.
5.1.2 Flatness by Pure Prolongation of the First Input
Let us now apply theorem 4.1 and algorithm 4.2 with , i.e. to determine if this system is flat by pure prolongation and compute . Recall that we have set .
We have , and for all .
If ,
and
Moreover, .
Now, for , we have and which is not involutive.
Thus and which implies that
If , we have
and
Moreover, it is readily verified that only if , condition (ii) of theorem 4.1 being violated if and we have and which implies that .
Again, if , we have:
and
provided that . We also indeed have for hence and .
If , we have and since .
If now , and
We thus immediately get for all .
Finally, the reader may easily check that for all and
We also indeed have for all .
Hence, for all , the minimal is equal to and we conclude that system (5.1), with the first input channel prolonged up to , i.e. controlled by , is feedback linearizable.
5.1.3 Flat output computation
The prolonged system is now expressed in the state coordinates
still with , , , and , . We indeed still have but the prolonged state dimension is now equal to with the two input variables and .
The prolonged system vector fields are
and the corresponding distributions are, according to (3.17),
This confirms that the system (5.1) is flat by pure prolongation in any neighborhood excluding , with . The reader may easily verify that for and for , which yields and .
The corresponding flat outputs are thus obtained by solving the set of P.D.E.’s
(5.6) | ||||
whose solution is
(5.7) |
Remark 5.1.
Remark 5.2.
In [25, section 3.1.1], the authors consider a dual notion of minimality, called -flatness, where is the minimal number over all possible flat outputs of the maximal number of derivatives of the inputs that appear in the flat outputs, i.e.
They conjectured that should be equal to 1 in the present case (with their notations, , and ). As the reader may easily verify, it is indeed minimal since the minimal is and moreover since, by the equations of the first line of (5.6), neither can depend on nor on , and, by the second line, cannot depend on but explicitly depends on by the definition of .
5.2 4-dimensional Driftless Bilinear System [25, 26, 27]
(5.8) | ||||
It is immediate to verify that this system is flat with flat output
(5.9) |
(see [26, 27] and [25, theorems 4 and 5]) but not static feedback linearizable.
According to our formalism, we consider the state of dimension 6, with and , and the new inputs . The associated vector fields are
The reader may easily verify that is not involutive and that there are two possible initializations:
or
We use the second one, which amounts to prolonging the first input .
5.2.1 the distributions and
We set , . We thus have
and
for all .
If , we have
and if ,
We thus have and for all , hence .
If , we have
and if ,
Finally, if ,
We thus have and for all but, for , is not involutive. Therefore, and our search may be restricted to .
If , we have
If ,
If ,
Therefore, and for all and .
We conclude that the conditions of theorem 4.1 hold true whenever , which proves that system (5.8) with the pure prolongation of order is feedback linearizable.
The reader may easily check that, using the first initialization , since is not involutive for all , no pure prolongation of the second input channel, , can lead to the linearizability conditions. Therefore the minimal prolongation is .
5.2.2 Flat output computation
The prolonged state is now of dimension 8, and the new inputs are .
hence the feedback linearizability of the purely prolonged system with and .
5.3 An Example from [7]
In our formalism, considering the inputs as part of the state, with and , this example from [7, Example 2] reads:
(5.11) | ||||
It is shown in [7] that this sytem does not satisfy the sufficient, but otherwise not necessary, condition for dynamic linearization of Theorem 4.2 of this paper. Nevertheless, it satisfies the algorithm of [2, section 3.1], that constitutes a sufficient condition for flatness by pure prolongation, without proof of minimality of the obtained prolongation. We show here that it is linearizable by pure prolongation by application of our algorithm, thus providing the minimal prolongation.
The non prolonged vctor fields are
and it is easily seen that
and that the subdistributions
or
can be taken as possible initializations.
Choosing amounts to prolonging the second input at an arbitrary order and set . For , we denote, as before,
and we indeed have
For all , and
For :
For all , and
But for :
therefore, and we must exclude .
For all , and, if we exclude the points where and ,
The reader may then easily check that the same holds for :
Since and are linear combinations of , and only, we have, for all :
and, for , using the fact that , we have
and
hence and .
We conclude that the conditions of theorem 4.1 are satisfied for all provided that .
On the contrary, initializing the algorithm by , which amounts to prolonging the first input , we may easily check that, for all ,
is not involutive, thus contradicting condition (i) of Theorem 4.1, which proves that the minimal prolongation of the second input is equal to 3.
Let us finally give the construction of the flat output and prolonged state diffeomorphism. The prolonged state is of dimension .
We get
The Brunovský’s controllability indices are and and the system of PDE’s that the flat outputs must satisfy is :
Its solution is given by , .
5.4 The Pendulum Example [10, section II. C]
This model of pendulum in the vertical plane has been studied in [10, section II. C], [21, section 6.2.3],[22, section 5.3] where it is shown to be flat. We prove here that it is not flat by pure prolongation.
Though naturally control-affine, it is presented here in its prolonged form (2.16):
(5.12) |
The state is , of dimension . The associated non prolonged vector fields are
(5.13) | ||||
We have
and
but
As before, we may initialize the pure prolongation algorithm by choosing
which amounts to prolonging , or
which amounts to prolonging .
It is noticeable that the inputs and play a symmetric role . Thus, one may choose indifferently one of them as the non prolonged input. Let us choose as non prolonged input, with the initialization . Thus, the vector fields associated to a prolongation of length on the second input read:
(5.14) | ||||
For all ,
and if ,
Thus, we have and for all .
For all ,
If ,
If ,
Again, we have for all , but for all since, e.g.
for all . Changing the non prolonged input in , as previously announced, a similar calculation, left to the reader, shows that is not involutive for all . Thus, according to the first item of theorem 4.2, system (5.12) is not flat by pure prolongation, though differentially flat, as shown in [10, section C].
5.5 An example with 3 inputs [18]
(5.15) |
The state is (of dimension ) and the control inputs are . The reader may easily see that is not involutive and thus that this system is not static feedback linearizable.
This example may be found in [18] in the context of control affine systems with states and inputs with the property that there exists such that
(5.16) |
with
a property satisfied for since
Therefore, in [18, Theorem 3], flat outputs are exhibited as 3 independent first integrals of , yielding the prolongation , , with and thus .
We show here that this prolongation is not minimal and we compute the minimal one.
We initialize the algorithm by remarking that is the unique maximal involutive subdistribution of , thus indicating that and are suitable candidates of non prolonged inputs. We thus, consider the following vector fields, corresponding to prolongations of , for all :
The reader may easily check that and for all and , and that . Therefore, the prolongation , with , is minimal and the minimally purely prolonged system is equivalent by diffeomorphism and feedback to
with flat outputs
and with
6 Concluding Remarks
We have established necessary and sufficient conditions for a system to be flat by pure prolongation, i.e. belonging to the equivalence class of with respect to the equivalence by pure prolongation relation. These conditions extend preliminary results of [6, 7, 33, 34, 2, 12] thanks to a thorough study of purely prolonged vector fields. We then deduce a computationally tractable algorithm giving the minimal prolongation in a finite number of steps using only Lie brackets and linear algebra.
Possible extensions of this work towards general flatness necessary and sufficient conditions are under study.
Acknowledgements— The author wishes to express his warm thanks to Ph. Martin and Y. Kaminski for many fruitful discussions.
References
- [1] E. Aranda-Bricaire, C.H. Moog, and J.-B. Pomet, A linear algebraic framework for dynamic feedback linearization, IEEE Trans. Automat. Contr. 40 (1995), no. 1, 127–132.
- [2] S. Battilotti and C. Califano, A constructive condition for dynamic feedback linearization, Systems & Control Letters 52 (2004), 329–338.
- [3] N. Bourbaki, Algèbre, Éléments de Mathématiques, Chapitres 1-3, Hermann, Paris, 1970.
- [4] P. Brunovský, A classification of linear controllable systems, Kybernetika 6 (1970), 173–178.
- [5] É. Cartan, Sur l’équivalence absolue de certains systèmes d’équations différentielles et sur certaines familles de courbes, Bull. Soc. Math. France 42 (1914), 12–48, in Oeuvres Complètes, part II, vol 2, pages 1133–1168, CNRS, Paris, 1984.
- [6] B. Charlet, J. Lévine, and R. Marino, On dynamic feedback linearization, Systems & Control Letters 13 (1989), 143–151.
- [7] , Sufficient conditions for dynamic state feedback linearization, SIAM J. on Control and Optimization 29 (1991), no. 1, 38–57.
- [8] C. Chevalley, Theory of Lie Groups, Princeton University Press, 1946.
- [9] M. Fliess, J. Lévine, Ph. Martin, and P. Rouchon, Flatness and defect of nonlinear systems: introductory theory and examples, Int. J. Control 61 (1995), no. 6, 1327–1361.
- [10] , A Lie-Bäcklund approach to equivalence and flatness of nonlinear systems, IEEE Trans. Automat. Contr. 44 (1999), no. 5, 922–937.
- [11] J. Franch, Flatness, tangent systems and flat outputs, Ph.D. thesis, Universitat Politecnica de Catalunya, 1999.
- [12] J. Franch and E. Fossas, Linearization by prolongations: New bound on the number of integrators, European Journal of Control 11 (2005), 171–179.
- [13] R. Hermann and A.J. Krener, Nonlinear controllability and observability, IEEE Trans. Automat. Contr. 22 (1977), 728–740.
- [14] L.R. Hunt, R. Su, and G. Meyer, Design for multi-input nonlinear systems, Differential Geometric Control Theory (R.W. Brockett, R.S. Millman, and H.J. Sussmann, eds.), Birkhäuser, Boston, 1983, pp. 268–298.
- [15] , Global transformations of nonlinear systems, IEEE Trans. Automat. Contr. 28 (1983), 24–31.
- [16] A. Isidori, Nonlinear Control Systems. An Introduction, 1st ed., Springer, Berlin, New York, 1985.
- [17] B. Jakubczyk and W. Respondek, On linearization of control systems, Bull. Acad. Pol. Sci. Ser. Sci. Math. 28 (1980), no. 9–10, 517–522.
- [18] Y. J. Kaminski, J. Lévine, and F. Ollivier, On singularities of flat affine systems with states and controls, International Journal of Robust and Nonlinear Control 30 (2020), no. 9, 3547–3565.
- [19] I. S. Krasil’shchik, V. V. Lychagin, and A. M. Vinogradov, Geometry of Jet Spaces and Nonlinear Partial Differential Equations, Gordon and Breach, New York, 1986.
- [20] J. Lévine, Static and dynamic state feedback linearization, Nonlinear Systems (A. Fossard and D. Normand-Cyrot, eds.), vol. 3, Chapman & Hall, 1997, pp. 93–126.
- [21] , Analysis and Control of Nonlinear Systems: A Flatness-based Approach, Mathematical Engineering, Springer, 2009.
- [22] , On necessary and sufficient conditions for differential flatness, Applicable Algebra in Engineering, Communication and Computing 22 (2011), 47–90.
- [23] R. Marino, On the largest feedback linearizable subsystem, Systems & Control Letters 6 (1986), 345–351.
- [24] Ph. Martin, Contribution à l’étude des systèmes diffèrentiellement plats, Ph.D. thesis, École des Mines de Paris, 1992.
- [25] Ph. Martin, R.M. Murray, and P. Rouchon, Flat systems, Plenary Lectures and Minicourses, Proc. ECC 97, Brussels (G. Bastin and M. Gevers, eds.), 1997, pp. 211–264.
- [26] Ph. Martin and P. Rouchon, Any (controllable) driftless system with 3 inputs and 5 states is flat, Systems & Control Letters 25 (1995), 167–173.
- [27] , Any (controllable) driftless system with m inputs and m+2 states is flat, Proc. of the 34th IEEE Conf. on Decision and Control, New Orleans, 1995, pp. 2886–2891.
- [28] H. Nijmeijer and A.J. van der Schaft, Nonlinear Dynamical Control Systems, Springer, New York, 1990.
- [29] J.-B. Pomet, A differential geometric setting for dynamic equivalence and dynamic linearization, Geometry in Nonlinear Control and Differential Inclusions (B. Jakubczyk, W. Respondek, and T. Rzeżuchowski, eds.), Banach Center Publications, Warsaw, 1993, pp. 319–339.
- [30] , A necessary condition for dynamic equivalence, SIAM J. on Control and Optimization 48 (2009), 925–940.
- [31] A.J. van der Schaft, Linearization and input-output decoupling for general nonlinear systems, Systems & Control Letters 5 (1984), 27–33.
- [32] W.F. Shadwick, Absolute equivalence and dynamic feedback linearization, Systems & Control Letters 15 (1990), 35–39.
- [33] W.M. Sluis, A necessary condition for dynamic feedback linearization, Systems & Control Letters 21 (1993), 277–283.
- [34] W.M. Sluis and D.M. Tilbury, A bound on the number of integrators needed to linearize a control system, Systems & Control Letters 29 (1996), no. 1, 43–50.
- [35] H.J. Sussmann and V. Jurdjevic, Controllability of nonlinear systems, J. Differential Equations 12 (1972), 95–116.
- [36] V.V. Zharinov, Geometrical Aspect of Partial Differential Equations, World Scientific, Singapore, 1992.
Appendix A A Comparison Formula
We establish a comparison formula expressing the iterated Lie brackets for all , in terms of a combination of Lie brackets of the vector fields , , …, of the original system (2.16).
For simplicity’s sake, we introduce a fictitious input so that , , and for all . Thus, , and
Lemma A.1.
For every , we have:
(A.1) |
and, for , for all ,
Proof.
By induction. It is immediately seen that
Iterating this computation up to yields (A.1). In particular:
Then, for , using the fact that for all , and , we have:
(A.6) | ||||
which proves that (A.2) and (A.3) hold at the order , i.e. , the summation of the right-hand side of (A.3) being equal to 0 since . Furthermore, a direct calculation shows that
(A.7) |
which proves that , where is the vertical bundle of , i.e. the set of vector fields that are linear combinations of , and whose coefficients are smooth functions that depend at most on (but not of for all ). It results that for all , all , and all .
Assume now that (A.2) and (A.3) hold up to , with , and that all the brackets and depend at most on . We immediately deduce that
for all , , , , , and . Thus:
Applying the Leibnitz rule to the penultimate line, using the fact that by the induction assumption, we get , with , and , which proves that the latter formula holds for all . We leave as an exercise to the reader the proof of the converse inclusion . Therefore (A.2) is valid for all . The proof of (A.3) follows exactly the same lines. The lemma is proven. ∎