Time-Optimal Trajectories of Generic Control-Affine Systems Have at Worst Iterated Fuller Singularities
Francesco Boarotto (CaGE, CMAP), Mario Sigalotti (CMAP, CaGE)

TL;DR
This paper proves that for generic control-affine systems, time-optimal trajectories are mostly smooth except at a finite hierarchy of singularities, which are well-structured and limited in complexity.
Contribution
It establishes a generic regularity result for time-optimal controls, showing they are smooth except at a finite hierarchy of iterated singularities depending on system dimension.
Findings
Optimal controls are smooth except at isolated points and their iterated accumulations.
The non-smoothness set is finite and structured, with complexity bounded by system dimension.
The result applies to generic control-affine systems, providing a detailed regularity characterization.
Abstract
We consider in this paper the regularity problem for time-optimal trajectories of a single-input control-affine system on a n-dimensional manifold. We prove that, under generic conditions on the drift and the controlled vector field, any control u associated with an optimal trajectory is smooth out of a countable set of times. More precisely, there exists an integer K, only depending on the dimension n, such that the non-smoothness set of u is made of isolated points, accumulations of isolated points, and so on up to K-th order iterated accumulations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Variational Analysis · Control and Stability of Dynamical Systems
Time-optimal trajectories of generic control-affine systems have at worst iterated Fuller singularities
Francesco Boarotto
Laboratorie Jacques-Louis Lions, Sorbonne Université, Université Paris-Diderot SPC, CNRS, Inria, France
and
Mario Sigalotti
Inria & Laboratorie Jacques-Louis Lions, Sorbonne Université, Université Paris-Diderot SPC, CNRS, Inria, France
Abstract.
We consider in this paper the regularity problem for time-optimal trajectories of a single-input control-affine system on a -dimensional manifold. We prove that, under generic conditions on the drift and the controlled vector field, any control associated with an optimal trajectory is smooth out of a countable set of times. More precisely, there exists an integer , only depending on the dimension , such that the non-smoothness set of is made of isolated points, accumulations of isolated points, and so on up to -th order iterated accumulations.
1. Introduction
1.1. Single-input systems and chattering phenomena
Let be a smooth111i.e., throughout the whole paper., connected, -dimensional manifold and denote by the space of smooth vector fields on . Consider the (single-input) control-affine system
[TABLE]
An admissible trajectory of (1.1) is an absolutely continuous curve , , such that there exists so that for almost every .
For any fixed initial datum , the time-optimal control problem associated with (1.1) consists into looking for admissible trajectories , , that minimize the time needed to steer to among all admissible trajectories.
A necessary (but not sufficient) condition for an admissible trajectory to be time-optimal is provided by the Pontryagin maximum principle (PMP, in short) [21]. Introducing the control-dependent Hamiltonian
[TABLE]
the PMP states that if a trajectory associated with the control is time-optimal, then it is extremal, i.e., there exists an absolutely continuous curve such that maximizes for a.e. , and such that a.e. on . (For the precise definition of the Hamiltonian vector field and further details see Section 2.) We call the triple an extremal triple. In particular, the PMP reduces the problem of finding time-optimal trajectories to the study of extremal ones.
The kind of results we are interested in concern the regularity of time-optimal trajectories, even though our techniques handle in fact the broader class of extremal ones. Observe in any case that this is a hopeless task in full generality since, as proved by Sussmann in [29], for any given measurable control , there exist a dynamical system of the form (1.1) and an initial datum for which the admissible trajectory driven by and starting at is time-optimal. It makes then sense to look for better answers imposing some genericity conditions on (with respect to the Whitney topology on the space of pairs of smooth vector fields on ). The question we are then lead to tackle is the following: “What kind of behavior can we expect for time-optimal trajectories of a generic system?” Such a question corresponds to one of the open problems posed by A. Agrachev in [3].
The problem of the regularity of extremal trajectories for control-affine systems of the form (1.1) is known to be delicate. In his striking example, Fuller [13] exhibited a polynomial system of the kind studied here, in which controls associated with optimal trajectories have a converging sequence of isolated discontinuities. Since then the phenomenon of fast oscillations (or chattering) is also called the Fuller phenomenon, and his presence has important consequences for example on the study of optimal syntheses [9, 11, 18, 20, 27]. Another striking feature of this phenomenon is its stability: if the dimension of is sufficiently high, then chattering is structurally stable (i.e., it cannot be destroyed by a small perturbation of the initial system). The first result in this direction was presented in [16, Theorem 0] starting from dimension , but it was subsequently extensively explored in [31]. It is however worth mentioning the fact that, to the best of our knowledge, none of these extremal trajectories have yet been proved to be time-optimal, nor it is known in lower dimensions (already in the D case) whether or not the chattering appears for a generic choice of system (1.1). Finally, we remark that the absence of Fuller phenomena for (1.1) has been proved in dimension for analytic systems and generic smooth systems [17, 19, 28, 26]. A first extensive investigation of the chattering phenomenon for multi-input affine-control systems has been presented in [32].
1.2. Fuller times along extremals trajectories
Many contributions have been provided to the description of the structure of optimal trajectories around a given point . The natural setting in which this problem is usually tackled is the study of all possible Lie bracket configurations between and at [4, 7, 10, 15, 22, 23, 25, 30]. This approach, although very precise in its answers, has unfortunately the disadvantage of becoming computationally extremely difficult already for mildly degenerate situations in dimension .
Definition 1**.**
Given an admissible trajectory of (1.1), we denote by (or simply if no ambiguity is possible) the maximal open subset of such that there exists a control , associated with , which is smooth on . We also define (or if no ambiguity is possible) by
[TABLE]
An arc is a connected component of . An arc is said to be bang if can be chosen so that along , and singular otherwise. Two arcs are concatenated if they share one endpoint. The time-instant between two arcs is a switching time.
The set , defined as above, depends only on the trajectory in the following sense: as long as is different from zero, the control is uniquely identified up to modification on a set of measure zero, while can be chosen arbitrarily on .
Definition 2** (Fuller Times).**
Let be the set of isolated points in and define the Fuller times as the elements of the set . By recurrence, is defined as the set of isolated points of . If then is a Fuller time of order . We say that a Fuller time is of infinite order if it belongs to
[TABLE]
The leading idea of this paper is to characterize the worst stable behavior for generic single-input systems of the form (1.1), in terms of the maximal order of its Fuller times. The heuristics behind our strategy is the following: thinking of points in as “accumulations of switchings”, points in as “accumulations of accumulations” and so on, then if is a Fuller time of sufficiently high order, a large number of relations between and can be derived. The existence of such a point can then be ruled out by standard arguments based on Thom’s transversality theorem (see, e.g., [1, Proposition 19.1], which can be used in combination with [14, §1.3.2] in order to the guarantee that the dense set of “good” systems can be taken open with respect to the Whitney topology on the space of vector fields). The main result of this paper is the following.
Theorem 3**.**
Let be a -dimensional smooth manifold. There exists an open and dense set such that, if the pair is in , then for every extremal triple of the time-optimal control problem
[TABLE]
the trajectory has at most Fuller times of order , i.e.,
[TABLE]
where and are defined as in Definition 2.
Remark 4*.*
Since each , for , is discrete, as a consequence of Theorem 3 we deduce that the control associated with any extremal triple is smooth out of a finite union of discrete sets (in particular, out of a set of measure zero).
As we already explained, deriving dependence relations directly on and is extremely complicated. The PMP naturally suggests to rather search for conditions in the cotangent space , where they are more easily characterizable, and to subsequently project them down on the level of vector fields. On the other hand, the estimate on the maximal order of Fuller points obtained in this way is far from being optimal. The computation of the sharpest bound on the order of Fuller points is still an open problem.
1.3. Structure of the paper
In Section 2 we introduce the technical tools we need in the rest of the paper and we present a brief survey of related results. Section 3 is the starting point of the novel contributions of the paper: we prove that at Fuller times of order larger than zero, i.e., for , in addition to the conditions , one also has that either or . The computations leading to this result do not require any genericity assumption. Section 4, which constitutes the technical core of this work, explains how to derive new conditions at each accumulation step and how to prove their independence. Section 5 concludes the proof of Theorem 3 and, finally, in Section 6, the case of time-optimal trajectories on three dimensional manifolds is analyzed in greater detail.
Acknowledgements
The authors have been supported by the ANR SRGI (reference ANR-15-CE40-0018) and by a public grant as part of the Investissement d’avenir project, reference ANR-11-LABX-0056-LMH, LabEx LMH, in a joint call with Programme Gaspard Monge en Optimisation et Recherche Opérationnelle. The authors also wish to thank the anonymous referee for the careful revision of the paper, and the detailed comments that let us significantly improve the quality of our exposition.
2. Previous results and consequences of Theorem 3
2.1. Notations
Let us introduce some technical notions which will be extensively used throughout the rest of the paper. Consider the cotangent space of , endowed with the canonical symplectic form . For any Hamiltonian function , its Hamiltonian lift is defined using the relation
[TABLE]
For all and we define the attainable set from at time as
[TABLE]
The precise content of the PMP, already mentioned at the beginning of Section 1, is then recalled below (see [6, 21]).
Theorem** (PMP).**
Let be an admissible trajectory of (1.1), associated with a control , such that . Then there exists absolutely continuous such that is an extremal triple, i.e., in terms of the control-dependent Hamiltonian introduced in (1.2),
[TABLE]
Let be an extremal triple. The curve is in particular said to be an extremal trajectory. We associate with the switching function
[TABLE]
Differentiating a.e. on , it follows from (2.4) that for every smooth vector field on
[TABLE]
In particular, is of class and, setting
[TABLE]
we have for every .
Remark 5*.*
The maximality condition (2.3) implies that
[TABLE]
In particular, whenever .
Repeated differentiation shows that is smooth when the control is. In particular, in terms of the set introduced in Definition 1, .
A folklore result on bang and singular arcs is the following. Recall that, for every , denotes the adjoint action defined by .
Proposition 6**.**
Assume that and for every . Fix an extremal triple and an arc . Then, either for at most finitely many and the arc is bang, or on and the arc is singular.
Proof.
Let us set and . Assume by contradiction that has infinitely many points and that it is different from . We have from Remark 5 that, up to modifying on a set of measure zero, on and on . If has measure [math], then, by continuity of , or on . In particular, or on . Since between any two vanishing points for there is a vanishing point for , we deduce that at every cluster point for (i.e., the limit of infinitely many distinct points in ), annihilates either for every or for every , leading to a contradiction.
In the case where the measure of is positive, there exists which is both a cluster point for and for either or . By continuity of for every , we deduce that either for every or for every and we conclude as above. ∎
Notice that the assumption that and for every holds true generically with respect to . From now on the term generic is used to express that a property of the pair of vector fields holds true on an open and dense subset of .
Definition 7**.**
Let be the alphabet containing the letters , and let be a word of length in . Then we employ the shorthand notation
[TABLE]
with the convention that . Moreover, given an extremal triple on , we set
[TABLE]
2.2. Previous results
Sussmann proved in [29] that for every and every control there exists a control system of the type (1.1) and an initial datum such that the trajectory starting at and corresponding to is time-optimal. In generic situations, however, some further regularity can be expected, as recalled in the following three results.
Theorem 8** ([8, Theorem 0], [12, Theorem 2.6]).**
Generically with respect to , for any extremal triple on such that , the set is of full measure in and almost everywhere on .
Theorem 9** ([2, Proposition 1]).**
Let denote the ideal generated by . If for every , then, for every extremal trajectory , the set is open and dense in .
Theorem 10** ([7, Proposition 2]).**
Assume that and for every . Consider an extremal trajectory such that the union of all bang arcs is open and dense in . Then either or there exists an infinite sequence of concatenated bang arcs.
Theorem 3 can be seen as an extension of Theorem 9 in the sense that it guarantees that, generically with respect to , the open set is not only dense but also of countable complement and hence of full measure in (see Remark 4). A similar observation can be done for Theorem 10, which is generalized by Theorem 3 as follows: generically, for every , either or there exists a subinterval of such that is a converging sequence.
Concerning Theorem 8, we can strengthen its conclusion as stated in Corollary 11 below. The corollary is a direct consequence of Proposition 28, which is a step of the proof of Theorem 3 contained in Section 5.
Corollary 11**.**
Generically with respect to the pair , for any extremal triple on such that , the set has countable complement in and almost everywhere on .
2.3. Chattering and singular extremals
Classical instances of the chattering phenomenon occur when trying to join singular and bang arcs along time-optimal trajectories of control systems as in (1.1). Legendre condition [6, Theorem 20.16] holds along singular extremal triples, and imposes the inequality . If the inequality is strict, then the control is characterized as in Theorem 8, but there are significant examples of mechanical problems in which the third bracket vanishes identically (e.g. Dubin’s car with acceleration [6, Section 20.6]). This case has been intensively studied in [31], and the situation that forces the chattering can be essentially summarized as follows.
Theorem 12** ([6, Proposition 20.23]).**
Assume that the vector fields and satisfy the identity . Let be a time-optimal trajectory of system (1.1) which is the projection of a unique (up to a scalar factor) curve such that is an extremal triple. Assume moreover that on . Then cannot contain a singular arc concatenated with a bang arc.
In particular, under the hypotheses of the theorem, the only possibility for an optimal trajectory to exit a singular arc is through chattering.
3. Annihilation conditions at Fuller times of an extremal trajectory
Let us fix an extremal triple on . The goal of this section is to prove some useful annihilation conditions of functions of the form , with a word in (compare with Definition 7), at Fuller times, i.e., on .
Since is (absolutely) continuous and for almost every such that , then
[TABLE]
Moreover, between two zeroes of , has at least one zero, which yields
[TABLE]
The following proposition states that both and vanish at every which is at positive distance from .
Proposition 13**.**
Let be such that is identically equal to zero on a neighborhood of . Then .
Proof.
Let be a neighborhood of such that . Therefore, the same is true for and
[TABLE]
Let us first prove that . By contradiction and up to reducing , we have that for every . By (3.1), moreover, for almost every .
Notice that the differential system generated by the smooth autonomous Hamiltonian
[TABLE]
is well-defined on and all its trajectories are smooth. Since, moreover, the absolutely continuous curve satisfies almost everywhere on , we deduce that is a solution of the Hamiltonian system generated by and that the control is smooth on , contradicting the fact that .
We conclude by showing that also . Following (3.1), we have
[TABLE]
and then we conclude by continuity of and . ∎
Proposition 14**.**
Assume that there exists an infinite sequence of concatenated bang arcs converging to . Then either or .
Proof.
First notice that . Assume by contradiction that neither nor is equal to zero. Consider a neighborhood of in (with respect to the topology induced by ) such that
[TABLE]
for some positive constant .
By assumption, there exists a sequence of concatenated bang arcs in , whose lengths we denote by , with the agreement that (respectively, ) on the intervals of length (respectively, ) and that the arc of length is concatenated with the arc of length , which is concatenated with the arc of length and so on. Without loss of generality, the bang arcs converge towards from the left, so that we can further assume that the arc of length is concatenated at its right with the arc of length (see Figure 1).
By convention, let [math] be the starting time of the sequence in Figure 1. Taylor’s formula yields that
[TABLE]
where the notation has the following meaning: using an analogous Taylor expansion for each positive bang arc of length , we obtain a reminder such that is uniformly bounded. We deduce from (3.4) that , where this notation is used to indicate that
[TABLE]
for some constant . Moreover, from the expansion , we get
[TABLE]
Combining these two relations we obtain
[TABLE]
The same computations also imply that
[TABLE]
In particular, the sequence satisfies the relation . The contradiction is then a consequence of Lemma 15 below. ∎
Lemma 15**.**
Let be a sequence of positive numbers satisfying the relation
[TABLE]
Then, .
Proof.
Let be such that
[TABLE]
Assume by contradiction that . In particular, .
Up to discarding the first terms of the sequence , we can assume that for all . Iterating (3.9) we deduce that
[TABLE]
Hence, for every ,
[TABLE]
where is such that for all . The contradiction comes by noticing that the left-hand side goes to as , while the right-hand side stays uniformly bounded. ∎
We say that an arc is bi-concatenated if it is concatenated both at its right and at its left with other arcs.
Proposition 16**.**
Let be a bang arc compactly contained in and which is not bi-concatenated. Then there exists such that either or .
Proof.
Without loss of generality, assume that on and that is not concatenated with any other arc at . In particular, is a cluster point for . If on a right neighborhood of , then the conclusion follows from Proposition 13 and the continuity of and .
We can then assume that there exists a sequence of times converging from above to and at which is not zero. Then, necessarily, there exist a sequence of arcs converging to . Pick, for every a time such that . By construction, the sequence converges to and, by continuity, we deduce that also .
Since , then by the mean value theorem vanishes at an interior point of , and this in turns implies that also vanishes somewhere on . ∎
The main result of the section is the following theorem.
Theorem 17**.**
Let . Then and, in addition, either or .
Proof.
We already noticed that vanishes on and on . We are going to prove the theorem by showing that there exists a sequence of points converging to at which either or vanishes.
Since and thanks to Proposition 13, we can assume without loss of generality that does not vanish identically on a neighborhood of . Hence, there exists a sequence converging to such that for every . Each is contained in an arc . If the arc is singular, then it contains a nonempty subinterval on which . Since moreover has either a positive maximum or a negative minimum on , we deduce that there exists an inflection point of on at which or vanishes.
We can then assume without loss of generality that is a bang arc for every . Let us consider the maximal concatenation of bang arcs from towards . Three possibilities occur: (i) the concatenation is infinite and converges to a point between and , (ii) the concatenation stops with a bang arc which is not bi-concatenated, and (iii) the concatenation stops with a bang arc concatenated with a singular one. In each of the three cases, we prove that there exists a point between and at which either or vanishes. In cases (i) and (ii) the conclusion follows from Propositions 14 and 16 respectively. In the case of a bang arc concatenated with a singular one, either does not vanish everywhere on the singular arc, and we deduce as above that there exists an inflection point of on the singular arc at which or vanishes, or at the junction of the two arcs and then the bang arc contains an inflection point of at which or vanishes. This concludes the analysis in case (iii) and hence the proof of the theorem. ∎
4. High-order Fuller points and genericity results
In this section we look at the new dependence conditions appearing for accumulations of Fuller points of order higher than one. We start by introducing some useful notation.
Remark 18*.*
For any given word , with , , , and at least one in , an easy inductive argument proves that, with the notations of Definition 7, we can decompose as
[TABLE]
where are all words of length written only with letters in , ending with the string and such that, if counts the number of occurrences of the letter in , then
[TABLE]
Moreover, and are uniquely determined by this requirement.
Definition 19**.**
Let . A function is said to be a simple relation of degree if there exists a word of length such that , where
[TABLE]
Similarly, we call a polynomial relation if there exist and words such that
[TABLE]
Moreover, we set .
Finally, given two simple relations , with a slight abuse of notation we say that the Poisson bracket between and is the simple relation , where is defined by concatenation of words. We extend the Poisson bracket notation to polynomial relations by linearity and the Leibnitz rule.
In the following two lemmas we show how to derive new algebraic conditions on the jets of the vector fields and when increasing the order of the Fuller point.
Lemma 20**.**
Let and consider words with for every and , where we denote by the concatenation of the letter and the word . Fix an integer and consider the family of simple relations , , using the notation introduced in (4.3). Define the set by
[TABLE]
If is an extremal triple on for the time-optimal control problem (1.1) associated with the pair , and if the sequence is such that
- i)
* for every ,*
- ii)
there exists ,
then there exists a further simple relation
[TABLE]
such that
[TABLE]
Finally, defining for every the set by
[TABLE]
if the codimension of in is equal to , then
[TABLE]
Proof.
Let be an extremal triple defined on and be a sequence of points satisfying i) and ii) in the statement. Then, since for every word we have that vanishes for every , by continuity the same is also true for , which implies that the point belongs to .
Now, up to the choice of a suitable subsequence of , we infer the identity
[TABLE]
which is valid for every . The first of our claims is then proved. Indeed, if we use (4.5) with to deduce that
[TABLE]
so that is in the form , and we are done. If, on the other hand, we apply (4.5) with , and we deduce that
[TABLE]
The combination of the relations at the point yields
[TABLE]
which in turn implies that
[TABLE]
so that we conclude by taking .
To prove the second claim of the statement, it is not restrictive to work within a coordinate neighborhood centered at the origin (identified with ), the whole argument being local. Then on , for . On , and are given in local coordinates respectively by
[TABLE]
Moreover, since , without loss of generality we can assume that
[TABLE]
Let the codimension of in be equal to , and assume that is of the form . In particular, the degree of is maximal among . Following Remark 18, let us write the decomposition
[TABLE]
where we recall that is uniquely identified by the requirement that it contains the maximal number, say , of occurrences of the letter [math]. Writing the analogous decomposition for simple relations
[TABLE]
we see that the coordinate expression of at takes the form
[TABLE]
where is a polynomial expression in the coordinates of , and that does not contain any term of the form , for . By construction, these terms do not appear in any of the other summands , for , neither among all other simple relations . Therefore, as , we infer the existence of a further independent relation, and we conclude that
[TABLE]
The case in which can be tackled similarly. In this situation for every . We may again exploit Remark 18, and isolate the terms and in the decompositions of and respectively. Observe that, by definition of and , one has and . Moreover, [math] appears times in , while appears times in , and both and are maximal among their corresponding decompositions, so that we can write
[TABLE]
where are polynomial expressions in the coordinates of , and that do not contain any term of the form and , for . In addition, these two terms are neither found among all other simple relations . Thus, as , the relations and are mutually independent (since their gradients are not parallel) and also independent from , . ∎
Lemma 21**.**
Let and consider words with for every and . Suppose that there exists such that and . Using the notations introduced in (4.3) and (4.4), consider the family of polynomial relations , , constructed inductively using the simple relations as follows
[TABLE]
Fix , an integer , and define the set by
[TABLE]
If is an extremal triple on , and if the sequence is such that
- i)
* for every ,*
- ii)
there exists ,
then, setting
[TABLE]
either
[TABLE]
or
[TABLE]
Finally, defining for every the set by
[TABLE]
if the codimension of in is equal to , then
[TABLE]
Proof.
The proof of the first part of the statement follows along the same lines of Lemma 20, using equation (4.5) both on and on , with the convention that . We prove in this way that the relations
[TABLE]
hold at , where the value is the same in both identities, since it is computed as the limit of a common sequence. If vanishes on the triple , then so does . From equation (4.13) we also deduce that is in the kernel of
[TABLE]
and therefore that its determinant vanishes at .
In order to prove the second part of the statement, as in Lemma 21 the idea is to express all relations in local coordinates around on the product space , with the non-restrictive hypothesis that and . Notice that for what concerns the codimension of we can reason exactly as in Lemma 21, since we deal in fact only with simple relations. Thus we are left with the task of proving that, if , each polynomial relation provides a condition independent from and .
By construction, is a polynomial relation in the variables , where is the concatenation of a word of length at most with letters in and a word equal either to or . It is not hard to show, by induction, that
[TABLE]
where denotes the iterated Poisson bracket with and is a polynomial relation in the same variables as except for . Following Remark 18, we further decompose as , where the letter [math] appears in the maximal number of times, say , among the collection . In coordinates we then write
[TABLE]
where is a polynomial expression in , and that does not contain any term of the form . Since and the above is true for any , we conclude that, as soon as , each gives a new independent condition, and the claim on the codimension follows. ∎
4.1. Collinear case
The computation of the codimension of the sets identified in Lemmas 20 and 21 relies on the linear independence at of and . We study in this section what happens when the condition fails to hold.
We associate with the pair the collinearity set
[TABLE]
Lemma 22**.**
Let and be a trajectory of the control system (1.1) associated with the control . Assume that is such that and that there exists a sequence converging to such that for every . Then there exists
[TABLE]
and .
Proof.
First notice that, by continuity, . Moreover, since , the set is, locally around , contained in an embedded -dimensional manifold transversal to the vector field . This can be seen, for instance, by choosing a local system of coordinates such that near . Write . Then is locally described by the conditions . Furthermore, up to restricting the coordinate chart, the condition implies that there exists such that is nowhere vanishing. In particular, is locally contained in the manifold , which is transversal to .
Let us take any coordinate system around . Notice that any converging subsequence of is tangent to . Writing
[TABLE]
we deduce that for every converging subsequence of , its limit is such that is tangent to . The proof is concluded by noticing that, by transversality of and , the only vector of the form which is tangent to is zero. ∎
Remark 23*.*
The lemma says in particular that for every and every trajectory of (1.1), almost everywhere on we have . This result is in the same spirit as [12, Theorem 2.1], where the multi-input case in considered.
Definition 24**.**
For any extremal triple on of the time-optimal control problem (1.1), we call . Moreover, we denote by the set of all isolated points in , and inductively we declare to be the set of isolated points in .
Theorem 25**.**
Let and let be any extremal trajectory on of the time-optimal control problem (1.1). Assume that there exist a sequence and an integer such that
- a)
* for every ,*
- b)
there exists and .
Then there exists such that, with the notation , we have
[TABLE]
Proof.
We proceed by induction on , and we begin with the case . First notice that for both and . Hence, also . By continuity and by Rolle’s theorem, for every . Also notice that for every . Moreover, by item b) and Lemma 22, there exists
[TABLE]
and .
From the identity
[TABLE]
which is valid for every , passing to the limit as we deduce the further relation .
Assume now that the theorem holds for some , and consider any sequence of points satisfying items a) and b). Apply Lemma 22 and define as above. The conclusion comes from noticing that
[TABLE]
∎
Inspired by the arguments of [8, Definition 4 and Lemma 4], we are now in the position of deducing quantitative estimates on the possible accumulations of points of within the collinearity set .
Lemma 26**.**
Let and . Let us define the following two subsets of :
[TABLE]
Then
[TABLE]
Proof.
The first assertion is clear. For the second one just notice that for every , the dimension of is smaller than if and only if, in coordinates,
[TABLE]
The latter condition, taking as the unique scalar such that , identifies a set of codimension one inside
[TABLE]
Summing it up, we deduce that
[TABLE]
∎
Corollary 27**.**
Let . For a generic pair and for every extremal trajectory of the time-optimal control problem (1.1), we have , where and are defined as in Definition 24.
Proof.
If along an extremal triple there exists , which is not isolated in this set and such that , then by Theorem 25 annihilates for every , where is the proportionality coefficient between and . By Lemma 26 and Thom’s transversality theorem (see, e.g., [1, 14]), for a generic pair this is possible only at isolated points of . Equivalently, for a generic pair the set is equal to . On the other hand, another application of Thom’s transversality theorem says that, for a generic choice of , the points such that and are isolated (since when ). This concludes the proof. ∎
5. Proof of Theorem 3
Theorem 3 directly follows from Theorem 17 and Proposition 28 below.
Proposition 28**.**
There exists an open and dense set such that, for any pair and for any extremal triple on of the time-optimal control problem (1.1), the set
[TABLE]
satisfies , where denotes the set of isolated points of and denotes the set of isolated points of for .
Proof.
Let , and be a time-extremal trajectory of the time-optimal control problem (1.1). Let and assume for now that . Owing to the fact that is an accumulation point for and reasoning iteratively, we identify a set such that
[TABLE]
Using repeatedly Lemmas 20 and 21 and exploiting the fact that each application of one of the two lemmas yields a finite number of alternatives, we deduce from a diagonal extraction argument that, up to taking suitable subsequences,
- i)
There exist sets such that
[TABLE]
and
[TABLE]
for every , .
- ii)
For every , is defined by the vanishing of, say, simple relations and polynomial relations (using the terminology of Definition 19). Moreover, denoting , we have
[TABLE]
for every , .
By construction, the set is homogeneous with respect to the first component. To prove the proposition in the set it is then sufficient to show that there exists such that if , then there exists such that the codimension of in is strictly larger than . Indeed, if this were true, then denoting by the canonical projection, we would conclude by standard transversality arguments [14] combined with the inequality
[TABLE]
where the term is due to the homogeneity of with respect to the first component.
We introduce now a discrete dynamics on , which describes the admissible patterns of . Define three mappings by
[TABLE]
We say that an admissible curve of length for this dynamical system is a map such that
- i)
,
- ii)
there exists such that for and , with , for .
Observe that the initial condition fixed in i) reflects the definition of , describes the creation of a new simple relation (Lemma 20), while and encode the occurrence of, respectively, a new polynomial relation and two new simple relations (Lemma 21).
We are going to compute the minimal so that, for , any admissible curve of length exits the region . It is not difficult to see that the longest admissible curve staying in is as indicated in Figure 2, that is, we apply once , then times , then once , then times , once , and so on. The length of such curve is equal to
[TABLE]
which implies that .
It just remains to explain what can happen inside the collinearity set introduced in (4.14): for a generic choice of , along any extremal trajectory the points of can accumulate at most times according to Corollary 27. On the other hand any point of is itself an element of at worst, which implies that the order of the Fuller points can increase at most by within . This concludes the proof of Proposition 28 since . ∎
6. Time-optimal trajectories in dimension
We devote this section to a more careful analysis of Fuller times for time-optimal (and not only extremal) trajectories, in the case of a three dimensional manifold . In fact, for a time-optimal trajectory there are powerful second-order techniques [5] that permit us to be a bit sharper in our estimate on the maximal order of Fuller points, at least if we just focus on this smaller class of curves. By Theorem 3, we already know the upper bound . The main result of this section is the following.
Theorem 29**.**
For a generic pair , none of the time-optimal trajectories of the control system (1.1) has Fuller times of order greater than two.
For the rest of this section we adopt the following convention: for any subset , we denote by its image along the trajectory .
Let us fix then a time-optimal trajectory. We collect previous results from [7, 15, 24] in the following statement.
Proposition 30**.**
Let and be any time-optimal trajectory of the control system (1.1). Let us consider, with the notations of Definition 7, the subsets
[TABLE]
If , then .
Define now the set
[TABLE]
As a consequence of Proposition 30, we can infer the following result.
Lemma 31**.**
For a generic pair and for every time-optimal trajectory of the control system (1.1), is made of isolated points only.
Proof.
The result is proved by using the same computational approach based on transversality theory as in the proof of Lemma 20. Instead of working in as in Lemma 20, it is actually sufficient to prove that
[TABLE]
where and are the subsets of defined implicitly by the relations
[TABLE]
Pick then any point that satisfies . Then is already a set of codimension two in . Moreover, if , then necessarily the jets of at satisfy another nontrivial dependence relation, and we can conclude.
On the other hand, suppose that and that , the remaining case being identical. Then since we infer the relation . We pass now to the condition , and we see that this obliges . Finally, the relation forces , which in turn provides us with a third dependence relation at , and therefore once again we conclude. ∎
Proof of Theorem 29.
Lemma 31 states, in particular, that for a generic choice of the pair and for every time-optimal trajectory we have that , or equivalently that
[TABLE]
We are left to prove that the density points of are isolated.
We have already shown that along any time-extremal , whenever the relations
[TABLE]
hold true. Since, by definition, for every point both and belong to the two-dimensional space , then for every also . If is an accumulation point of , then, by Lemma 21 and using the Jacobi identity, either or and
[TABLE]
When , we conclude by transversality, noticing that
[TABLE]
provides a third independent condition on the jet of the pair at . In the case , let us define in a neighborhood of a system of coordinates so that is dual to . Then (6.3) says that the product of the third components of and is equal to one, which corresponds to a third independent condition on the jet of the pair at . ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] R. Abraham and J. Robbin. Transversal mappings and flows . An appendix by Al Kelley. W. A. Benjamin, Inc., New York-Amsterdam, 1967.
- 2[2] A. A. Agrachev. On regularity properties of extremal controls. J. Dynam. Control Systems , 1(3):319–324, 1995.
- 3[3] A. A. Agrachev. Some open problems. In Geometric control theory and sub-Riemannian geometry , volume 5 of Springer I Nd AM Ser. , pages 1–13. Springer, Cham, 2014.
- 4[4] A. A. Agrachev and R. V. Gamkrelidze. Symplectic geometry for optimal control. Nonlinear controllability and optimal control , 133:263–277, 1990.
- 5[5] A. A. Agrachev and R. V. Gamkrelidze. Symplectic geometry for optimal control. In Nonlinear controllability and optimal control , volume 133 of Monogr. Textbooks Pure Appl. Math. , pages 263–277. Dekker, New York, 1990.
- 6[6] A. A. Agrachev and Y. L. Sachkov. Control theory from the geometric viewpoint , volume 87 of Encyclopaedia of Mathematical Sciences . Springer-Verlag, Berlin, 2004. Control Theory and Optimization, II.
- 7[7] A. A. Agrachev and M. Sigalotti. On the local structure of optimal trajectories in ℝ 3 superscript ℝ 3 \mathbb{R}^{3} . SIAM J. Control Optim. , 42(2):513–531, 2003.
- 8[8] B. Bonnard and I. Kupka. Generic properties of singular trajectories. Ann. Inst. H. Poincaré Anal. Non Linéaire , 14(2):167–186, 1997.
