${\mathcal L}^1$ limit solutions in impulsive control
Monica Motta, Caterina Sartori

TL;DR
This paper studies generalized solutions for nonlinear control systems with impulsive controls, introducing an extended notion of limit solutions to ensure the existence of optimal solutions, and establishing their equivalence with graph completion solutions in certain cases.
Contribution
It introduces an extended limit solution concept for impulsive control systems, ensuring existence of minima, and proves their equivalence with graph completion solutions under specific conditions.
Findings
Extended limit solutions coincide with original limit solutions for BV controls.
In systems with controls appearing in non-drift terms, extended solutions match graph completion solutions.
The new framework guarantees the existence of optimal solutions in impulsive control problems.
Abstract
We consider a nonlinear control system depending on two controls u and v, with dynamics affine in the (unbounded) derivative of u, and v appearing initially only in the drift term. Recently, motivated by applications to optimization problems lacking coercivity, [1] proposed a notion of generalized solution x for this system, called {\it limit solution,} associated to measurable u and v, and with u of possibly unbounded variation in [0,T]. As shown in [1], when u and x have bounded variation, such a solution (called in this case BV simple limit solution) coincides with the most used graph completion solution (see e.g. [6]). This correspondence has been extended in [24] to BV_loc u and trajectories (with bounded variation just on any [0,t] with t<T). Starting with an example of optimal control where the minimum does not exist in the class of limit solutions, we propose a notion of…
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
TopicsMicrobial metabolism and enzyme function · Stability and Controllability of Differential Equations
On limit solutions in impulsive control
Abstract.
We consider a nonlinear control system depending on two controls and , with dynamics affine in the (unbounded) derivative of , and appearing initially only in the drift term. Recently, motivated by applications to optimization problems lacking coercivity, [1] proposed a notion of generalized solution for this system, called limit solution, associated to measurable and , and with of possibly unbounded variation in . As shown in [1], when and have bounded variation, such a solution (called in this case BV simple limit solution) coincides with the most used graph completion solution (see e.g. [6]). This correspondence has been extended in [24] to BVloc inputs and trajectories (with bounded variation just on any with ). Starting with an example of optimal control where the minimum does not exist in the class of limit solutions, we propose a notion of extended limit solution , for which such a minimum exists. As a first result, we prove that extended and original limit solutions coincide in the special cases of BV and BVloc inputs (and solutions). Then we consider dynamics where the ordinary control also appears in the non-drift terms. For the associated system we prove that, in the BV case, extended limit solutions coincide with graph completion solutions.
Key words and phrases:
Impulsive control systems. Generalized solutions. Pointwisely defined measurable solutions. Non commutative control systems. Impulsive optimal control problems
1991 Mathematics Subject Classification:
Primary: 49N25, 93C10; Secondary: 93C15, 49J15.
This research is partially supported by the INdAM-GNAMPA Project 2017 ”Optimal impulsive control: higher order necessary conditions and gap phenomena”; and by the Padova University grant PRAT 2015 “Control of dynamics with reactive constraints”
Monica Motta
Dipartimento di Matematica “Tullio Levi-Civita”,
Università di Padova
Via Trieste, 63, Padova 35121, Italy
Caterina Sartori
Dipartimento di Matematica “Tullio Levi-Civita”,
Università di Padova
Via Trieste, 63, Padova 35121, Italy
1. Introduction
We consider a control system of the form
[TABLE]
[TABLE]
where , and , are compact sets. System (1) is a so-called impulsive control system, where a solution can be provided by the usual Carathéodory solution only if is an absolutely continuous control. For less regular , several concepts of impulsive solution have been introduced in the literature, either for commutative systems, * where the Lie brackets for all (see e.g. [9]), or assuming (and ) to be functions of bounded variation, when the Lie Algebra is non trivial. These solutions are described by different authors in fairly equivalent ways, and we will refer to them as graph completion solutions, since they are obtained by completing the graph of (see e.g. [8], [20], [25], [19], [27], [3], [14], [16]). In the less studied non commutative case with measurable controls of unbounded variation, let us mention [10], [18], and the definition of limit solution due to [1]. In the special case of BV simple limit solutions, in which and are of bounded variation, in [1] the authors showed that any limit solution is a graph completion solution and vice-versa (see Definitions 3.1, 5.3, 5.4). This is an important result, since, on the one hand, graph completion solutions have a simple explicit representation formula, not available for general limit solutions. On the other hand, it proves that (pointwisely defined) graph completion solutions are well-posed, in the sense that they coincide with all and only pointwise limits of classical solutions. In [24] we extended such a result to a case of unbounded variation, by introducing graph completion solutions associated to BVloc* inputs (and trajectories) and we proved that they coincide with a special subset of simple limit solutions, the BVloc simple limit solutions (see Definition 3.2).
In this paper we analyse the concept of limit solution and, starting from an example in optimal control for which the infimum over limit solutions is not a minimum, we introduce a notion of extended limit solution, where such a minimum does exist. As a first result, in Theorem 4.3 we prove that this new definition coincides with the original one in the special cases of of BV simple or BVloc simple limit solutions (see Definitions 3.1, 3.2). As a consequence, all the results available for these two classes of limit solutions are still valid for their extended counterpart.
Furthermore, we investigate control systems of the form
[TABLE]
where all the depend on the control . The definition of limit solution for (3) was left as an open problem in [1]. Indeed, our notion of extended limit solution can be adapted to this case, allowing us to show, in Theorem 5.2, that extended BV simple limit solution and graph completion solutions to (3), (2) coincide. This result extends to system (3) the analogous [1, Thm. 4.2] regarding (1). As remarked in [1], already when (and ) has bounded variation, the dependence of on is much more critical than just the -dependence of , in that a simultaneous jump of and makes the determination of the corresponding jump of quite delicate.
The precise definitions of limit solution and extended limit solution will be given in Sections 3, 4. Here we just point out that the notion of limit solution involves a control which is measurable, while the control and the corresponding solution are pointwisely defined and belong to the set of the everywhere defined integrable functions. Let us describe a special case of extended limit solution. An extended simple limit solution to (1), (2) associated to , is the pointwise limit of a sequence of classical trajectories to (1), (2), corresponding to controls with absolutely continuous and pointwisely converging to and in -norm (see Definition 4.1). We recall that a simple limit solution is instead defined in [1] as the pointwise limit of a sequence of classical trajectories associated to controls with as above and fixed (see Definition 3.1). Our extension is motivated by the observation that in optimal control problems minimizing sequences with absolutely continuous inputs , might converge to a map which is not a limit solution. Precisely, in Example 1 we have that the infimum value of an optimal control problem over limit solutions and extended limit solutions is the same, but it is a minimum only within the larger class of extended limit solutions. The two infima may be actually different, as shown in Example 2.
The need of considering generalized solutions to (1) or (3) and (2), associated to discontinuous comes, for instance, from optimal control, where, in absence of coercivity assumptions, it is reasonable to expect the existence of optimal solutions only in some enlarged class. The impulsive control theory, studied since the 50s, received in the last years a renewed attention because of the increasing number of applications in different fields, from Lagrangian mechanics with moving constraints [7], [6], or impactively blockable degrees of freedom [28], [13], to alternative models for hybrid systems [4], [12], [17], [15], just to give some examples. These applications set new problems also from the theoretical point of view, in particular since they lead to consider control systems nonlinear in the state variable like (1) or (3), and various types of constraints.
The paper is organized as follows. We end this section with some notation and the precise assumptions. In Section 2 we present two examples that motivate the notions of extended limit solutions, which we propose in Section 4. Section 3, is devoted to recall the original concepts of limit solution due to [1] and the recent definition of BVloc limit solution introduced in [24]. In Theorem 4.3 of Section 4 we prove that original and extended BVS limit solutions and BVlocS limit solutions, respectively, coincide. In Section 5 we introduce the -dependent control system (3) and in Theorem 5.2 we establish that a map is an extended BVS limit solution to (3), (2) if and only if it is a graph completion solution.
1.1. Notation
Let . Given , let
,
,
where denotes the (total) variation of in , and
We use to denote the set of the everywhere defined integrable functions on with values in , while is its usual quotient space with respect to the Lebesgue measure. When no confusion on the codomain may arise, we omit it and write, for instance, in place of . Let us set and call *modulus * (of continuity) any increasing, continuous function such that and for every .
For any control with , we let
[TABLE]
denote the (unique) Carathéodory solution to (1)–(2), defined on . We will say that such and are regular.
1.2. Assumptions
Let us recall the so–called Whitney property (see [26]).
Definition 1.1** (Whitney property).**
A compact subset has the Whitney property if there is some such that for every pair , there exists an absolutely continuous path verifying
[TABLE]
For instance, compact, star-shaped sets enjoy the Whitney property.
Throughout the paper we assume the following hypotheses:
-
(H0)
-
(i)
the sets , are compact and has the Whitney property;
- (ii)
the control vector field is continuous and, moreover, is locally Lipschitz on uniformly in ;
- (iii)
for each the control vector field is locally Lipschitz continuous;
- (iv)
there exists such that
[TABLE]
for every .
2. Examples
This section is devoted to motivate, by means of two simple examples, the need of enlarging the class of limit solutions, introducing a notion of extended limit solution. Precisely, in Example 1 we exhibit an optimal control problem where the infimum value over limit solutions and extended limit solutions is the same, but the minimum is achieved only within the larger class of extended limit solutions. In Example 2 we present a minimum problem where there is a gap between the infimum over limit solutions and extended limit solutions and a gap between the infimum over regular solutions and limit solutions.
These phenomena may happen since in both examples *any * regular minimizing control sequence verifies Var.
Example 1**.**
Let us consider the control system in ,
[TABLE]
with
[TABLE]
( is a cut-off function, sufficient to guarantee the sublinearity hypothesis on the dynamics) and initial condition
[TABLE]
Let us introduce the Bolza optimization problem
[TABLE]
where
[TABLE]
We now construct a minimizing sequence within the class of regular trajectory-control pairs. For every , let us set, for ,
[TABLE]
The corresponding solution is given, for , by
[TABLE]
One has that
[TABLE]
so that the infimum of the cost over regular trajectory-control pairs turns out to be [math]. Clearly, this is not a minimum, since the unique optimal control must be and a.e., whose associated Charathéodory solution to (5) gives a cost equal to . A minimum can be reached only over some enlarged set of generalized controls and solutions. Notice that
[TABLE]
Hence if we define as extended limit solution to (5) associated to the control a.e., the limit function
[TABLE]
for , we obtain
[TABLE]
Therefore in the class of extended limit solutions the minimum does exist (see Definition 4.1).
Let us point out that is not a limit solution as defined in [1], because of the varying (see Definition 3.1). Indeed, as already observed, the optimal control has to be a.e., but any sequence associated to an arbitrary sequence pointwisely converging to [math], verifies
[TABLE]
so that for every . Thus the minimum of the above optimization problem does not exist in the class of limit solutions.
Slightly modifying the previous example and adding some constraints, we can provide a case where the infima over regular solutions, over limit solutions and over extended limit solutions are all different.
Example 2**.**
Let us introduce the control system in , obtained by adding to (5) the equation
[TABLE]
with initial and end-point conditions
[TABLE]
Let us now set for any and consider the Mayer problem
[TABLE]
Let us call admissible the trajectory-control pairs satisfying the constraints. Since only controls with a.e. give rise to admissible trajectories, the calculations in Example 1 imply that the unique admissible regular solution has . Hence the infimum of the cost over regular solutions is equal to . All admissible limit solutions are pointwise limits of regular solutions , associated to regular control sequences converging to (and fixed ). Hence in any case, but taking defined by (6), one has , so that the minimum in the class of limit solutions is . Finally, the extended limit solution , where are given by (7), is associated to the control a.e., verifies the constraints and has cost . Therefore the minimum over extended limit solutions exists and is equal to [math].
Let us point out that when there are no constraints and the cost is continuous, by the very definition of limit solution, the infimum value over the different classes of solutions considered above is always the same. The difference between the infima, as in Example 2, is instead a generic situation in the presence of constraints, which are unavoidable in most applications. In this note we do not discuss the Lavrentiev-type gap issue, that is the occurrence of infimum gaps (see e.g. [2]). Let us just observe that in several real models, as for instance the mechanical examples in [6], only absolutely continuous controls are implementable. In these cases, the no-gap requirement is mandatory.
3. Definitions and preliminary results
We start recalling the concept of limit solution, given in [1] for vector fields depending on only and extended to -dependent data in [2]. We will write to denote the set of pointwisely defined Lebesgue integrable functions with values in and set , .
Definition 3.1** (Limit solutions).**
Let and let with .
- (1)
(Limit Solution) A map belonging to is called a limit solution of the Cauchy problem (1)-(2) corresponding to if, for every there is a sequence of controls such that and
- (iτ)
the sequence of the Carathéodory solutions to (1)-(2) is equibounded in ;
- (iiτ)
as . 2. (2)
(S limit solution) A limit solution is called a simple limit solution of (1)-(2), shortly S limit solution, if the sequences can be chosen independently of In this case we write to refer to the approximating sequence. 3. (3)
(BVS limit solution) An S limit solution is called a BVS limit solution of (1)-(2) if the approximating inputs have equibounded variation in .
For a detailed discussion on the notion of limit solution we refer the reader to [1], [2]. Here let us just underline that, already the BVS limit solution associated to a control is not unique, unless the system is commutative. Moreover, the sets of limit solutions, S limit solutions and BVS limit solutions form a decreasing sequence of sets.
The density approach adopted in Definition 3.1 allows a unified notion of trajectory (for commutative and non commutative systems with of possibly unbounded variation), but it does not give any explicit representation formula for the solution. In fact, such a representation exists if either the control system is commutative or if there are a priori bounds on the variation of the controls . In particular, in the latter case [1] proves that BVS limit solutions coincide with graph completion solutions. The graph completion approach is traditionally used to study impulsive control systems with bounded variation on (see e.g. [6] and the references therein). It provides a nice representation formula, suitable to derive, for instance necessary and sufficient optimality conditions for several optimization problems, both in terms of Pontrjagin Maximum Principle and of Hamilton-Jacobi-Bellman equations (see e.g. [25], [19], [16] and [21], [22]). In order to have a representation formula for limit solutions associated to controls with unbounded variation, in [24] we singled out the following set of controls:
[TABLE]
for which we extended the graph completion approach. Precisely, in [24] we introduced graph completions solutions associated to these controls and proved that they coincide with the following subset of S limit solutions.
Definition 3.2**.**
(BVlocS limit solution) Let and let with . An S limit solution is called a BVlocS limit solution of (1)-(2):
- (i)
on , if there exists a sequence of controls as in the definition of S limit solution, such that for any the approximating inputs have equibounded variation on ;
- (ii)
on , if, moreover, is bounded and there exists a decreasing map with and there exist two strictly increasing, diverging sequences , , , such that, for every there is with and
[TABLE]
The subclass of BVlocS limit solutions is relevant in controllability issues, like approaching a target set, and in optimization problems with endpoint constraints and certain running costs lacking coercivity (see e.g. Example 3.1 in [24], involving the Brockett nonholonomic integrator).
Remark 1**.**
Condition (ii) in Definition 3.2 is an equiuniformity condition on the sequence in a neighborhood of the final time . We point out that without (8), a BVlocS limit solution is a BVloc graph completion solution only on . Condition (ii) guarantees the equivalence of the two concepts on the closed interval (see [24]).
To better understand condition (ii) in Definition 3.2, for any traiectory-control pair let us introduce the following parametrization of the graph of , useful also in the sequel.
Definition 3.3** (Arc-length parametrization).**
Let with and set . We call arc-length graph-parametrization of the trajectory-control pair , the element defined by 111 Since every equivalence class contains Borel measurable representatives, here and in the sequel we tacitly assume that the maps and are Borel measurable, when necessary.
[TABLE]
Of course, .
Notice that, given defined as above, , and solves the following control system
[TABLE]
Here the apex ‘ ′ ’ denotes differentiation with respect to the parameter , in order to distinguish it from the time differentiation, denoted by a dot.
Differently from the original solution , which is defined on the fixed time interval and depends on an unbounded control derivative , the map is defined on a control-dependent interval with but with bounded valued, since a.e. in .
Condition (ii) in Definition 3.2 is more meaningful once we read it as an hypothesis on the graphs of the approximating sequence . Precisely, for any trajectory-control pair as in Definition 3.2, let be its arc-length graph parametrization (see Definition 3.3). Then (ii) is equivalent to:
the existence of a positive, decreasing map with and of two strictly increasing, diverging sequences and , , such that, for every :
[TABLE]
Clearly, (11) holds true when the sequence is uniformly convergent on (by considering, for every , the extension for every ).
4. Extended limit solution
Motivated by Examples 1, 2, we extend here the notions of limit solution given in [1], [24], by approximating in the ordinary control , which in the original definitions was kept fixed. Furthermore, in Theorem 4.3 we prove that extended and original and limit solutions, respectively, coincide. Hence the results in [1], [2] and in [24], dealing with and limit solutions, remain unchanged in the new extended framework.
Definition 4.1** (Extended limit solutions).**
Let and let with .
- (1)
(E-Limit Solution) A map is called an extended limit solution, shortly E-limit solution, of the Cauchy problem (1)-(2) corresponding to if, for every there is a sequence of controls such that and
- (iτ)
the sequence of the Carathéodory solutions to (1)-(2) is equibounded on ;
- (iiτ)
as . 2. (2)
(E-S limit solution) A limit solution is called an E-simple limit solution of (1)-(2), shortly E-S limit solution, if the sequences can be chosen independently of In this case we write to refer to the approximating sequence. 3. (3)
(E-BVS limit solution) An E-S limit solution is called an E-BVS limit solution, of (1)-(2) if the approximating inputs have equibounded variation on .
Definition 4.2** (Extended BVlocS limit solution).**
Let and let with . An E-S limit solution is called an extended BVlocS limit solution, shortly E-BVlocS limit solution, of (1)-(2):
- (i)
on , if there exist a sequence of controls as in the definition of an E-S limit solution, such that for any the approximating inputs have equibounded variation on ;
- (ii)
on , if, moreover, is bounded and there exists a decreasing map with and there exist two strictly increasing, diverging sequences , , , such that, for every there is with and
[TABLE]
Analogously to the case of limit solutions, the extended limit solution associated to a control is not unique, unless the system is commutative; moreover the sets of E-limit solutions, E-S, E-BVlocS, and E-BVS limit solutions are a decreasing sequence of sets.
Theorem 4.3**.**
Let , and let be such that . Then a map is an E-BVS limit solution [resp. E-BVlocS limit solution] corresponding to if and only if it is a BVS limit solution [resp. BVlocS limit solution] corresponding to the same input.
Proof.
The “ if” part is obvious for both cases. Let us prove the “only if” part.
Case 1: Let be an E-BVS limit solution corresponding to and let and be as in Definition 4.1, so that, in particular, there is some constant such that for every . Then, setting , by standard estimates it follows that
[TABLE]
with Let us denote by and a modulus of continuity of and a Lipschitz constant (in ) for the vector fields , when , respectively. Gronwall’s Lemma yields that
[TABLE]
Since there exists a subsequence of such that a.e. in and , take values in the compact set , the Dominated Convergence Theorem and the continuity of let us conclude that, for such a subsequence,
[TABLE]
so that for every . Therefore, for any and is a limit solution corresponding to
Case 2: Let now be an E-BVlocS, not E-BVS, limit solution and let , , and be as in Definition 4.2. For every , set and assume that is increasing and diverging. By (i) in Definition 4.2 there exists an increasing function with , and such that, for every ,
[TABLE]
Then by the proof of Case 1 we derive that
[TABLE]
To handle the convergence at , we use part (ii) of the definition of E-BVlocS limit solution. Let us introduce, for every , the arc-length graph parametrizations and of and , respectively (see Definition 3.3). Let us suppose that these arc-length graph parametrizations are extended to by the constant value assumed at . By assumption, there exists a constant such that
[TABLE]
and, recalling that a.e., standard estimates imply that for any there is some such that
[TABLE]
Let and be a modulus of continuity of and a Lipschitz constant (in ) of the vector fields for , respectively. Gronwall’s Lemma yields, for every ,
[TABLE]
with . Passing to a suitable subsequence of , still denoted by , as in (15) we have that, for every fixed , . Now we can construct a sequence , with , such that
[TABLE]
In particular, this implies that, for some ,
[TABLE]
Since , we need to modify the sequence using the Whitney property. Precisely, we set and
[TABLE]
where joins to and . We have and by standard estimates it follows that for some and
[TABLE]
Hence by (17), (8) and (17) we get
[TABLE]
The r.h.s. of (20) approaches [math] since by (19) its first term goes to [math] and, being an E-BVlocS limit solution, the last term approaches [math] too. Therefore, renaming the index in the sequence by , it is not difficult to prove that the sequence verifies statements (i) and (ii) and, by (20), also (ii) of Definition 4.1. ∎
5. A further extension
For with bounded variation, the graph completion technique has been extended since the 90s to control systems of the form
[TABLE]
[TABLE]
where the dependence on the ordinary control appears also in the coefficients of the control derivatives . This notion has been applied to several problems (see [20], [19], [16] and the references therein). As mentioned in [1], this kind of equation is relevant in mechanical applications, for instance, when is a shape parameter and is a control representing an external force or torque and in min-max control problems where the adjoint equations may contain a -dependent term multiplied by an unbounded control, like in (21) (see e.g. [5]). In this section we adapt the notion of extended BVS limit solution introduced in Definition 4.1 to (21), (22) and in Theorem 5.2 below we prove the one-to-one correspondence between such limit solutions and graph completion solutions to (21), (22). In this way we extend the result of [1, Thm. 4.2], where the same assertion is proved for independent of .
Throughout this section we assume that for every , the control vector field is continuous, is locally Lipschitz on uniformly in and there exists such that
[TABLE]
The notion of extended BVS limit solution to (21), (22) that we are going to introduce coincides with the Definition 4.1, 3., for not depending on , but the presence of the ordinary control in the for requires to take into account the interplay between and . We distinguish the two situations ( just in the drift or ‘everywhere’) by considering the more general control system
[TABLE]
with taking values in . For simplicity, we use the same notation of Definition 4.1 and still denote by a regular solution to (23), (22) associated to .
Definition 5.1** (Extended BVS limit solution).**
Let and let with .
- A map is called an extended BVS limit solution, shortly E-BVS limit solution, of the Cauchy problem (23)-(22) corresponding to if there is a sequence of controls such that , the approximating inputs have equibounded variation on and
- (i)
the sequence of the Carathéodory solutions to (23)-(22) verifies for every ,
as ;
- (ii)
there is some such that, setting , Var, one has as .
Theorem 5.2**.**
A map is a E-BVS-limit solution to (23)-(22) associated to with if and only if it is a graph completion solution to (23), (22) associated to the same control.
Before proving the theorem, let us briefly describe the graph completion approach and give the precise definition of graph completion solution to (23), (2). For more details we refer the interested reader to [20] and the references therein.
For and , let denote the subset of -Lipschitz maps
[TABLE]
such that , and , for almost every . We set .
We call space-time controls the elements with and . Let . We denote by the subset of space-time controls verifying and . The space-time control system is defined by
[TABLE]
and we use to denote its solution. Notice that by just identifying regular controls and trajectories with their graphs and considering a time parametrization , (21) can be embedded in the space-time system (24). However, when a space-time control has for , the pair describes on the ‘instantaneous evolution’ at time of the system; this is a way to define generalized controls and trajectories for the original control system in the extended, space-time setting. Now any space-time trajectory-control pair gives rise to a set-valued notion of generalized solution to (21), associated to a control with ; following [1], a (univalued) concept of graph completion solution is then obtained by the choice of a suitable selection.
Since the space-time control system (24) is rate-independent, without loss of generality we consider just controls verifying
[TABLE]
will denote the subset of such controls, to which we will refer to as feasible space-time controls.
Definition 5.3**.**
Let and . We say that a space-time control is a graph completion of if
[TABLE]
We call a clock any strictly increasing, surjective function such that
[TABLE]
Definition 5.4**.**
Given a control with , let be a graph- completion of and let be a clock. Set . A map
[TABLE]
is called a graph completion solution to (23), (2).
Proof of Theorem 5.2.
Let and . We begin by showing that a graph completion solution to (23), (22) associated to is a E-BVS limit solution. By Definitions 5.3 and 5.4, there exist a feasible space-time control and a surjective, strictly increasing function such that, setting , one has
[TABLE]
By [1, Thm. 5.1] as revisited in [24, Thm. 4.2], there exists a sequence of absolutely continuous, strictly increasing maps , such that
- (i)
, , and
[TABLE]
- (ii)
the maps are strictly increasing, -Lipschitz continuous, surjective and converge uniformly to in .
We are going to show that the sequences and defined by
[TABLE]
verify all the requirements of Definition 5.1, so proving that is a E-BVS limit solution of (21), (22) associated to .
In view of definition (25), the pointwise convergence of to follows from the continuity of . Moreover, the sequence has equibounded variation, since VarVar for every . In order to show that , take an arbitrary and consider a bounded, continuous map such that
[TABLE]
(such exists by well known density results). Hence
[TABLE]
where the last inequality follows from the properties of and . Now the first and the third integrals in the r.h.s., by the (continuous) change of variable and the discontinuous one (see e.g. [11]) respectively, are both less than , while the second integral tends to [math] by the Dominated Convergence Theorem, since is bounded and continuous. By the arbitrariness of , this concludes the proof that . Since
[TABLE]
the condition as is trivially satisfied.
It remains to show that is the pointwise limit of . To this aim, let us set . By the continuity of the input-output map associated to the control system (21) (see [20, Thm. 4.1]) we derive that converges uniformly to on . Since on , we finally obtain that, for every , one has
[TABLE]
Hence is a E-BVS limit solution.
Let us now show that an E-BVS limit solution to (23), (22) associated to is a graph completion solution. By Definition 5.1, there exist and a sequence with and Var for some such that, setting
[TABLE]
and , one has
[TABLE]
Arguing as in the proof of Theorem 4.3, Case 1, one can prove that it is possible to assume, without loss of generality, that for every . Let be the -Lipschitz continuous, increasing function such that
[TABLE]
Set Then the sequence of space-time controls is -Lipschitz continuous on and satisfies for a.e. (and for ). Therefore by Ascoli-Arzelà’s Theorem, taking if necessary a subsequence, still denoted by , it converges uniformly to a Lipschitz continuous function such that for . Let us observe that is a graph completion of , possibly not feasible (namely, not verifying the equality a.e.). Indeed, for every , there exist a subsequence and such that . Therefore, by the uniform convergence of it follows that
[TABLE]
Set
[TABLE]
where is the same as in (28) and define the solution associated to the space-time control . Moreover, let and . Clearly, . In order to prove that is a graph completion solution, let us first verify that . To this aim, we observe that this is true as soon as there exists a subsequence of uniformly converging in to . In this case indeed, for every , the pointwise convergence of to implies that
[TABLE]
At this point, if we introduce the change of variable
[TABLE]
denote by its the strictly increasing right-inverse, define the feasible space-time control
[TABLE]
and the clock , we can easily obtain that is a graph completion solution, since
[TABLE]
To conclude the proof it remains to show that, eventually for a subsequence, one has
[TABLE]
Since both the derivatives , are bounded, by standard estimates it follows that
[TABLE]
Let us denote by a modulus of continuity of , by a Lipschitz constant of in uniformly w.r.t. , and by an upper bund for all the vector fields , , in the compact set . After some calculations, setting
[TABLE]
and
[TABLE]
by the Gronwall’s Lemma we get to
[TABLE]
The uniform convergence of to on implies that the maps tend to in the weak∗ topology of , so that tends to 0 as for every . The uniform convergence to 0 of the ’s now follows from Ascoli-Arzelá Theorem, for the ’s are equibounded and equi-Lipschitzean. By (28) and the inequality a.e., we derive that . By a time-change, we get
[TABLE]
Hence, if we show that
[TABLE]
then there exists a subsequence of converging to 0 a.e. on , and by the Dominated Convergence Theorem we obtain that, for such subsequence,
[TABLE]
so concluding the proof of (29).
Since , when is a continuous function (31) holds true owing to the uniform continuity of and to the uniform convergence of to on . For , there exists, by density, such that Hence we get
[TABLE]
Performing the change of variable , the first integral on the r.h.s. is smaller than , while the second one converges to 0 because is continuous. For the third integral on the r.h.s., taking into account that and are bounded maps, by the weak∗ convergence of to we derive that
[TABLE]
as , and the last term is smaller than by the change of variable . By the arbitrariness of this concludes the proof of (31). ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M.S. Aronna, F. Rampazzo, ℒ 1 superscript ℒ 1 {\mathcal{L}}^{1} limit solutions for control systems, J. Differential Equations , 258 no. 3 (2015), 954–979.
- 2[2] M.S. Aronna, M. Motta and F. Rampazzo, Infimum gaps for limit solutions, Set-Valued Var. Anal. , 23 no. 1 (2015), 3–22.
- 3[3] A. Arutyunov, D. Karamzin and F. Pereira, On a generalization of the impulsive control concept: controlling system jumps, Discrete Contin. Dyn. Syst., 29 no. 2 (2011), 403–415.
- 4[4] J.-P. Aubin, Impulse Differential Equations and Hybrid Systems: A Viability Approach. Lecture Notes. University of California, Berkeley, 2000
- 5[5] E. Barron, H. Ishii, The Bellman equation for minimizing the maximum cost, Nonlinear Anal., 13 no. 9 (1989), 1067–1090.
- 6[6] A. Bressan, B. Piccoli, Introduction to the mathematical theory of control. AIMS Series on Applied Mathematics, 2. American Institute of Mathematical Sciences (AIMS), Springfield, MO, 2007.
- 7[7] A.Bressan, F. Rampazzo, Moving constraints as stabilizing controls in classical mechanics. Arch. Ration. Mech. Anal., 196 no. 1 (2010), 97–14.
- 8[8] A.Bressan, F. Rampazzo, On differential systems with vector-valued impulsive controls. Boll. Un. Mat. Ital. B (7) 2 no. 3 (1988), 641–656.
