Optimal control of the double integrator with minimum total variation
C. Yal\c{c}{\i}n Kaya

TL;DR
This paper derives the optimal control strategy for a double integrator that minimizes both energy and total variation, providing insights into the Pareto optimal solutions and their properties.
Contribution
It introduces a combined optimal control problem minimizing energy and total variation, deriving the unique solution and analyzing the Pareto front.
Findings
The optimal total variation asymptotically is 2/3 of the minimum-energy control.
The optimal control is piecewise constant with a single switch.
The paper characterizes the Pareto front for the multi-objective problem.
Abstract
We study the well-known minimum-energy control of the double integrator, along with the simultaneous minimization of the total variation in the control variable. We derive the optimality conditions and obtain the unique optimal solution to the combined problem, where the initial and terminal boundary points are specified. We study the problem from a multi-objective optimal control viewpoint, constructing the Pareto front. We show that the unique asymptotic optimal control function, for the minimization of the total variation alone, is piecewise constant with one switching at the midpoint of the time horizon. For any instance of the boundary conditions of the problem, we prove that the asymptotic optimal total variation is exactly of the total variation of the minimum-energy control. We illustrate the results for a particular instance of the problem and include a link to a video…
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.
Optimal Control of the Double Integrator with Minimum Total Variation
Authors
C. Yalçın Kaya111School of Information Technology and Mathematical Sciences, University of South Australia, Mawson Lakes, S.A. 5095, Australia. E-mail: [email protected] .
Abstract
We study the well-known minimum-energy control of the double integrator, along with the simultaneous minimization of the total variation in the control variable. We derive the optimality conditions and obtain the unique optimal solution to the combined problem, where the initial and terminal boundary points are specified. We study the problem from a multi-objective optimal control viewpoint, constructing the Pareto front. We show that the unique asymptotic optimal control function, for the minimization of the total variation alone, is piecewise constant with one switching at the midpoint of the time horizon. For any instance of the boundary conditions of the problem, we prove that the asymptotic optimal total variation is exactly of the total variation of the minimum-energy control. We illustrate the results for a particular instance of the problem and include a link to a video which animates the solutions while moving along the Pareto front.
Key words: Optimal control, Minimum-energy control, Total variation, Multi-objective optimal control, Pareto front.
AMS subject classifications. Primary 49J15, 90C29 Secondary 49N05
1 Introduction
The double integrator is a mathematical model for a point mass, typically idealizing a car in rectilinear motion on a flat and frictionless plane as schematically illustrated in Figure 1. It also constitutes a model for analogous rotational-mechanical and electrical systems [17]. One should recall that a cubic curve between two oriented points, which minimizes its averaged acceleration, or more precisely, the -norm of its acceleration, serves as a building block for cubic splines [3, 11]. This latter case can be represented as the energy-minimizing double integrator.
Due to its simplicity, optimal control of the double integrator is studied virtually in every course of lectures on optimal control theory. In the teaching of optimal control theory and its applications, although the minimum-energy, minimum-effort and minimum-time control of the double integrator are widely studied, minimization of total variation is not even considered, presumably because a maximum principle for the control minimizing its total variation does not exist.
The double integrator model is so simple that an analytical solution can be worked out easily for the problem of energy minimization. Moreover, for the case of minimum-time control, where the control variable is bound-constrained, the optimal control can simply be shown to be bang–bang with at most one switching, i.e., the control variable switches from one bound to the other, and it does so at most once. The control structure can also be worked out easily in the case of minimum-effort control, where the -norm of the control function is minimized. In summary, optimal control of the double integrator yields simple but rich-enough examples for illustrations of some key aspects of the theory of optimal control [12].
Total variation of a function can be broadly described as the total vertical distance traversed by the graph of the function (a precise definition is to be given in Section 3.1). A small total variation in the control function is obviously desirable, as it would make the control system easier to design and implement, resulting in, for example, smaller or lighter motors for a robot or a spacecraft.
Although there is a lack of theory and results for the pure minimization of total variation, it is often imposed in addition to the minimization of another functional, for instance, energy or duration of time. This is done in the earlier works [14, 10, 16], where the optimal control problem is discretized directly by assuming piecewise-constant optimal control variables. This discretization simplifies the expression for the total variation in control; however, optimality conditions for the original (continuous-time) problem cannot be derived or verified, because of the discretization itself.
Total variation is widely used as a regularization term in more general optimization problems such as imaging and signal processing (see [4] and the references therein). It has also relatively recently been used as a regularization term for parameter estimation in linear quadratic control [8]. A bound on the total variation in the control is derived for minimum-time linear control problems in [13], although the total variation itself is not incorporated into the minimization problem.
In the present article, in addition to the minimization of energy, we consider the minimization of the total variation in the control variable of the double integrator. In other words, we aim to study simultaneous minimization of energy and total variation, giving rise to multi-objective optimization and the study of the set of all trade-off/compromise solutions called the Pareto front. Optimal control problems which involve total variation have not been studied yet from the viewpoint of multi-objective optimal control.
In this paper, we use a tutorial approach. First, in Section 2, we introduce the double integrator model as well as the problem of energy minimization as an optimal control problem. This is a standard problem in optimal control; so, we derive the optimal solution without going into details.
In Section 3, we define the total variation of a function and state the energy and total variation minimization problem, by appending the total variation in control as a weighted term to the energy functional. Next, we augment the state variable vector, so that the problem can be rewritten and posed as an optimal control problem in standard form. We derive optimality conditions, and discuss the problem as a multi-objective optimal control problem. By means of asymptotic analysis, we derive an optimal solution for the pure total variation minimization problem. These kinds of results on total variation do not exist in the literature.
In Section 4, via an example instance of the problem, we illustrate the results given in Section 3. In particular, we provide, via a URL link in [7], a video illustration of the multi-objective solutions on the Pareto front, so that evolution of the solutions as the weight of total variation is varied can be animated and observed.
Finally, in Section 5, we offer concluding remarks and provide various relevant open problems.
2 Minimum-Energy Control
Consider the car as a point unit mass, moving on a frictionless planar ground in a fixed line of action, as shown in Figure 1. Let the position of the car at time be given by and the velocity by . By Newton’s second law of motion, , where is the summation of all the external forces applied on the car, in this case the force simply representing the acceleration and deceleration of the car. This differential equation model is referred to as the double integrator in system theory literature, since can be obtained by integrating twice.
Let and . The problem of minimizing the energy of the car, which starts at a position with a velocity and finishes at the final position with velocity , within one unit of time, can be posed as follows.
[TABLE]
Here, the functions and are referred to as the state variables and the control variable. As a first step in writing the conditions of optimality for this optimization problem, define the Hamiltonian function for Problem (Pe) in the usual way as
[TABLE]
where is the adjoint variable (or costate) vector such that (see [5])
[TABLE]
The equations in (2) simply reduce to
[TABLE]
where and are real constants. By calculus of variations, or the maximum principle with an unconstrained control variable (see [5]), if is optimal, then
[TABLE]
Substituting in (4) into the differential equations and solving these equations by also utilizing the boundary conditions in Problem (Pe), one gets the analytical solution
[TABLE]
for all , where
[TABLE]
We note that the position variable of the car is a cubic polynomial of time. Therefore, the minimum-energy control solution, despite being so simple, constitutes a building block for the problem of finding a cubic spline interpolant passing through a given set of points.
3 Minimization of Total Variation
3.1 Total variation of a function
The total variation of a function is defined as
[TABLE]
where the supremum is taken over all partitions
[TABLE]
of the interval (see [9]). Here, is arbitrary as is the choice of the values in which, however, must satisfy (11). The function is said to be of bounded variation on , if is finite. If is absolutely continuous on , in other words, , then
[TABLE]
where . Practically speaking, as given in (12) represents the total distance traversed by the projection of the vs. graph along the vertical axis. Figure 2 illustrates this interpretation with over , where clearly .
3.2 Minimum-Total-Variation Control of the Double Integrator
Recall that in the case when one has Problem (Pe), minimizing only the energy, the solution is as given in (5)–(9). So, clearly .
We consider optimal control problems where we aim to minimize the total variation in the control variables in addition to the energy functional.
[TABLE]
where is referred to as the weight. We assume that is absolutely continuous on , in other words, . Then we define the new control variable for a.e. . Using (12), Problem (Ptv) can now be reformulated by incorporating the new variable as
[TABLE]
In this augmented form of the problem, becomes a new state variable.
3.3 Optimality Conditions
The Hamiltonian function for Problem (Paug) is given by
[TABLE]
where and are adjoint variables defined by (see [5])
[TABLE]
In other words,
[TABLE]
where and are real constants. Note that, although the expressions in (14) are respectively the same as those in (2), the real constants and in this case depend on the value of and so are different in general.
Next we state the maximum principle (see [15, Theorem 1.5.1]) for our setting as follows.
Maximum Principle. Suppose that and solve Problem (Paug). Then there exist functions such that, for every , and, in addition to the state differential equations and other constraints given in Problem (Paug) and the adjoint differential equations in (14)–(15), the following condition holds:
[TABLE]
Condition (18) implies that
[TABLE]
for a.e. . Note that is not allowed by the maximum principle, as otherwise one would get .
In view of (19), when , a.e. , the original control is (possibly piecewise) constant. What if over a subinterval of ? If so, then we refer to the optimal control in this subinterval as singular control, which we elaborate further next.
Singular control. If there exist and such that for every (in fact, one has either or for every , because of the continuity of ), then the control variable for every is said to be singular. A candidate for a singular optimal control might be obtained by observing that, since is constant over , one will have for every . By using (17), this observation yields
[TABLE]
i.e.,
[TABLE]
and so
[TABLE]
for all .
Optimal control. With the incorporation of the singular control, and by the continuity of the adjoint variable , (19) can be rewritten as
[TABLE]
for all . Note that in (20) is piecewise-constant and so is piecewise-linear and continuous in . Then, by (17), is continuous and piecewise-quadratic in . Note in particular that, differentiating both sides of the ODE in (17), using and substituting (20), one gets
[TABLE]
The expression in (21) and the boundary conditions in (17) imply that there will be at most two junction points, , for . Namely, either or , for , and is quadratic in , for and , with the same constant second derivative . In other words,
[TABLE]
Then from and continuity of , one gets
[TABLE]
where and are unknown constants. Subsequently, ,
[TABLE]
and
[TABLE]
Note that (both equal to or ), which, after simple algebraic manipulations, yields
[TABLE]
We also note that , i.e.,
[TABLE]
Lemma 1
One has that .
Proof. The proof is furnished by the fact that and (25).
3.4 Multi-Objective Optimal Control
Problem (Ptv), or equivalently Problem (Paug), concerns a simultaneous minimization of two objectives, which can simply be written as
[TABLE]
where
[TABLE]
Problem (Pmo) is referred to as a multi-objective, or vector, optimal control problem, with representing the feasible, or admissible, set of all control functions satisfying the differential equation constraints and the boundary conditions—see [2] and the references therein. The set of all solutions of (27) is usually infinite, consisting of all trade-off, or Pareto, solutions. Broadly speaking, a Pareto solution is a solution where one cannot improve the value of one objective functional without making the other worse. The set of all Pareto solutions in the -plane (or the value space) is referred to as the Pareto front of Problem (Pmo). An example of a Pareto front is given in Figure 3(a) (see details in Section 4).
For solving (27), a typical approach is to consider a scalarization of the vector objective and so reduce Problem (Pmo) to a single-objective optimal control problem. Note that and are convex and the constraint set represents linear differential equations and linear boundary conditions. Therefore we can use the weighted-sum scalarization (see [2]):
[TABLE]
where . Since , we can define and write
[TABLE]
with . We note that Problems (Ps1) and (Ps2) are equivalent and that Problem (Ps2) is in the same form as Problem (Ptv).
In this case, the individual functionals in (28) can be calculated using (23) and (25), in terms of the unknown parameters , and , as follows.
[TABLE]
3.5 Solution
By using (23) and the initial conditions in Problem (Ptv), and by integrating directly, one can obtain the following expressions for the state variables and .
[TABLE]
[TABLE]
Finally, writing out the terminal conditions and using (31) and (32), respectively, using (25) and (34), and carrying out lengthy manipulations, we obtain the following.
[TABLE]
Once is determined as a solution of (33), the parameters , and in (34)–(36), respectively, can explicitly be found. The following lemma guides us as to which of the signs (in the coefficient of the -term) in (33) will yield a solution and that whether the solution will be unique or not.
Lemma 2** (Existence and uniqueness of the solution of a cubic equation)**
Let be a real constant. Then the equation
[TABLE]
has a unique solution for , and has no solution for , over the interval .
Proof. Let . Suppose that . Then , and that for all , implying that for a unique . One can easily check that , , where , , . We have that and that
[TABLE]
for all .
(i) Suppose . Then and . With for all , we conclude that has a unique zero in .
(ii) Suppose . Then . Since the only zero has is in the interval , and for all , has no zero in .
Remark 1
Lemma 1 states that , and Lemma 2 implies which sign in (37) needs to be considered in order to find a unique . By comparing (37) and (33), it is immediate to see that the sign of has to be taken into account. The following theorem provides the unique solution to Problem (Ptv), based on this observation.
Theorem 1** (Solution of Problem (Ptv))**
The solution to Problem (Paug) is unique and given by the expressions for the optimal control variable in (23), and the state variables in (31)–(32), where the parameter is the solution of the cubic in (37) on the interval , with such that
[TABLE]
the parameter given by
[TABLE]
and the parameters and given by (35)–(36). As a result, the optimal total variation is given by
[TABLE]
Proof. By Lemma 2 with , there exist a unique which solves (37) and satisfies the optimality condition in Lemma 1. Recall again Lemma 2 that, for , (37) has no solution in . Therefore, in (33), we use the plus sign when , and the minus sign when . Subsequently, this argument transforms (33) into (37) with . Furthermore, the sign in (34) is replaced by accordingly, yielding (39). The rest of the theorem follows from direct substitutions.
3.6 Asymptotic Solution (as )
As mentioned in the Introduction, it is not possible to write down the necessary conditions of optimality for the minimization of the total variation in the control variable alone. Nevertheless, an analytic solution of Problem (Ptv) can still be obtained by studying the asymptotic behaviour of the solutions when . In this case, Equation (33) becomes , which has three real roots: 1/2 and . This means that, in , . Then, by (25), . Moreover, from Equation (34), . However, these limit values of and make the expression in (35) indeterminate. Therefore, we need to write the asymptotic expressions for the state variables (with ), in order to proceed:
[TABLE]
[TABLE]
Now we can state the result, as , in the following theorem.
Theorem 2** (Asymptotic minimum total variation)**
The unique asymptotic optimal control variable of Problem (Ptv), as , is piecewise constant with a single switching at , namely
[TABLE]
Consequently, the asymptotic optimal total variation is given by
[TABLE]
Proof. The boundary conditions and using (40)–(41) yield, after manipulations,
[TABLE]
the solution of which is and , as required by (42). The switching time, , is found as explained in the first paragraph of this subsection 3.6. The expression in (43) is obtained by simply substituting the solutions for and above into .
Remark 2
Recall that when no minimization of the total variation in control is done, i.e., when only the energy is minimized, the total variation is . It is interesting to note that the asymptotic minimum total variation in (43) is exactly of the total variation in minimum-energy control.
4 An Example
To demonstrate the results in Theorems 1 and 2, as well as illustrate what the Pareto front looks like using the expressions in (29)–(30), we consider a particular instance when , , and . In view of the interpretation of the double integrator dynamics provided in the Introduction, this particular instance means that the car with an initial unit velocity is required to come to rest in the same position where it started the motion.
The minimum energy solution can be obtained directly, after substituting , , and into (5)–(9), as
[TABLE]
for . In this case, clearly, .
Figure 3 depicts the full Pareto front, as well as the optimal control variable for the parameter values , 0.05, 0.4 and . In drawing the graphs, first, Theorem 1 has been used: the unknown parameters , , , (and ). Then , and have been computed as given in (23) and (29)–(30), respectively.
Using a rather “continuous” range of values of , we have generated a movie, by using Matlab. The movie file is called mintotalvar.avi, which can be downloaded via the URL in Reference [7]. An instance of the movie for is shown in Figure 4. For a large number of values of , the movie depicts/animates the Pareto front (using (29)–(30)) and the graphs of the control and state variables (using (23) and (31)–(32)), as well as the graph of the adjoint variable divided (or normalized) by (using (24)). The graph of in the lower-right corner reconfirms that is constant when and is linear in when .
As expected, reduction in total control variation is obtained as the value of is increased, with the trade-off that minimum energy is increased. Figure 3(b), and the movie, clearly demonstrate that, as gets larger, the control variable appears to become closer to a piecewise-constant function, switching from the constant level to the constant level , resulting in . This reconfirms Theorem 2 as well as Remark 2.
Finally, with and , the asymptotic expressions for the state variables in (40)–(41) can be rewritten neatly as
[TABLE]
[TABLE]
5 Conclusion and Future Work
We have derived the unique solution to the optimal control problem of simultaneous minimization of energy and total variation in control for the double integrator. We obtained analytic expressions for the construction of the Pareto front. We have shown that the unique asymptotic optimal control function, for the minimization of the total variation alone, is piecewise constant with one switching at the midpoint of the time horizon. We computed the two constant levels of the asymptotic control function analytically. Subsequently, we have proved that the asymptotic optimal total variation is exactly of the total variation of the minimum-energy control. These results seem to be the first of their kind in the literature concerning optimal control with minimum total variation, even for a system as simple as the double integrator.
The minimum-energy control problem which we have also considered is a special case of a general linear quadratic control problem. An approach similar to the one employed in the current paper can be employed for the more general linear quadratic control (or linear quadratic programming) problem where one is additionally concerned with the minimization of total variation, namely the problem
[TABLE]
The time horizon in Problem (LQPTV) has been set to be , but, without loss of generality, it can be taken to be any interval , with and specified. The state variable vector and the control variable vector . The time-varying matrices and are continuous, is symmetric positive definite and continuous in , and is positive definite and continuous in . The initial and terminal states are specified as and , respectively. Since there are more than just one control variable, i.e., , the total variation in (12) can be generalized for this case as
[TABLE]
It should be noted that the problem we have studied in the current paper fits into the above problem description (LQPTV) with , , and , and the appropriate constant system and control matrices and .
The general linear quadratic problem is a convex problem, so the weighted-sum scalarization can still be used (see [2, 6]) when it is combined with the minimization of total variation. However, for a generalization to nonconvex problems, a scalarization different from the weighted-sum scalarization needs to be considered. This requires specialized numerical techniques in obtaining a solution—see [6] and the pertaining discussion therein for problems which also have constraints on the state and control variables.
Acknowledgments
The author would like to offer his warm thanks to two anonymous reviewers, whose comments and suggestions improved the paper.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] H. H. Bauschke, R. S. Burachik, and C. Y. Kaya , Constraint splitting and projection methods for optimal control of double integrator . Ar Xiv: 1804.03767 v 1, 2018. To appear in Splitting Algorithms, Monotone Operator Theory, and Applications, Springer, October 2019.
- 2[2] H. Bonnel and C. Y. Kaya , Optimization over the efficient set of multi-objective convex optimal control problems . J. Optim. Theory Appl., 147 (2010), 93–112.
- 3[3] A. L. Dontchev , Best interpolation in a strip , J. Approx. Theory, 73 (1993), 334–342.
- 4[4] D. Gong, M. K. Tan, Q. F. Shi, A. van den Hengel, and Y. N. Zhang , MPTV: Matching pursuit-based total variation minimization for image deconvolution . IEEE Trans. Image Proc., 28 (2019), 1851–1865.
- 5[5] M. R. Hestenes , Calculus of Variations and Optimal Control Theory . John Wiley & Sons, New York, 1966.
- 6[6] C. Y. Kaya and H. Maurer , A numerical method for nonconvex multi-objective optimal control problems . Comput. Optim. Appl., 57 (3) (2014), 685–702.
- 7[7] C. Y. Kaya , https://arxiv.org/src/1901.00491 v 1/anc/mintotalvar.avi . Ancillary file mintotalvar.avi for the preprint ar Xiv:1901.00491 v 1, 2018.
- 8[8] O. I. Kostyukova and M. A. Kurdina , Parametric identification problem with a regularizer in the form of the total variation of the control . Differential Equations (Differentsial’nye Uravneniya), 49 (2013), 1056–1068.
