Time-Optimal Control Problem With State Constraints In A Time-Periodic Flow Field
Roman Chertovskih, Nathalie T. Khalil, Fernando Lobo Pereira

TL;DR
This paper develops a computational framework using Pontryagin's maximum principle to solve time-optimal control problems with state constraints in time-periodic flow fields, exemplified by tidal path-planning.
Contribution
It introduces a regularity-based indirect method for solving constrained control problems in time-dependent flows, with new conditions to avoid singular controls.
Findings
Effective computation of extremals in tidal flow scenarios
Continuity of measure Lagrange multipliers under natural assumptions
Examples demonstrating optimal solutions in periodic fluid flows
Abstract
This article contributes to a framework for a computational indirect method based on the Pontryagin maximum principle to efficiently solve a class of state constrained time-optimal control problems in the presence of a time-dependent flow field. Path-planning in a flow with tidal variations is an emblematic real-life task that serves as an example falling in the class of problems considered here. Under rather natural assumptions on the flow field, the problem is regular and the measure Lagrange multiplier, associated with the state constraint, is continuous. These properties (regularity and continuity) play a critical role in computing the field of extremals by solving the two-point boundary value problem given by the maximum principle. Moreover, some sufficient conditions preventing the emergence of singular control processes are given. A couple of examples of time-periodic fluid flows…
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.
11institutetext: Research Center for Systems and Technologies (SYSTEC), Electrical and Computer Engineering Department, Faculty of Engineering, University of Porto, 4200-465, Portugal 11email: [email protected], [email protected], [email protected]
https://www.nathaliekhalil.com/, https://paginas.fe.up.pt/~flp/
Time-Optimal Control Problem With State Constraints In A Time-Periodic Flow Field
††thanks: This work was supported by FCT (Portugal): support of FCT R&D Unit SYSTEC – POCI-01-0145-FEDER-006933/SYSTEC funded by ERDF COMPETE2020 FCT/MEC PT2020 extension to 2018, and NORTE-01-0145-FEDER-000033, by ERDF NORTE 2020. Results described in Chapter 5 were obtained during research visit of R. Chertovskih to the Federal Research Center “Computer Science and Control” (Russian Academy of Sciences) supported by the Russian Science Foundation (project no. 19-11-00258).
Roman Chertovskih 11 0000-0002-5179-4344
Nathalie T. Khalil 11 0000-0002-4761-5868
Fernando L. Pereira 11 0000-0002-9602-2452
Abstract
This article contributes to a framework for a computational indirect method based on the Pontryagin maximum principle to efficiently solve a class of state constrained time-optimal control problems in the presence of a time-dependent flow field. Path-planning in a flow with tidal variations is an emblematic real-life task that serves as an example falling in the class of problems considered here. Under rather natural assumptions on the flow field, the problem is regular and the measure Lagrange multiplier, associated with the state constraint, is continuous. These properties (regularity and continuity) play a critical role in computing the field of extremals by solving the two-point boundary value problem given by the maximum principle. Moreover, some sufficient conditions preventing the emergence of singular control processes are given. A couple of examples of time-periodic fluid flows are studied and the corresponding optimal solutions are found.
Keywords:
path-planning optimal control state constraints indirect method Pontryagin maximum principle two-point boundary value problems
1 Introduction
In this article, we consider a state-constrained time-optimal control problem in the presence of a time-periodic flow field, the so-called “navigation problem”. We are interested in computing its set of extremals using an indirect method based on the necessary optimality conditions provided by the maximum principle [1]. However, indirect methods represent significant challenges for optimal control problems with state constraints. Indeed, the difficulty is due to the fact that the state constraint Lagrange multiplier appearing in the necessary optimality conditions whenever the state constraint becomes active is a mere Borel measure. Thus, in general, this multiplier is discontinuous, and this leads to serious difficulties in computing the set of extremals at the times in which the state trajectory meets the boundary of the state constraint set. Therefore, in order to overcome this difficulty, we employ a not so commonly used form of the maximum principle - the so-called Gamkrelidze form - and impose a regularity condition on the data of the problem that entails the continuity of the measure Lagrange multiplier. This is crucial to ensure the appropriate behavior of the proposed numerical procedure to find the corresponding set of extremals.
Moreover, we also present certain conditions that, once satisfied, prevent the emergence of singular control processes. These may be helpful in guiding the computational procedures, by enabling to check the absence of singular controls.
To better grasp the proposed indirect method in the framework of regular problems, we study a navigation problem in . More precisely, we consider an object moving in a closed state domain, subject to a time-dependent fluid flow vector field. The dynamics of the proposed model is affine in the control variable whose values are constrained to the unit square in , and is affected by the vector flow field action. For this model, we are interested in computing the optimal time of a path which connects two given distinct initial and terminal points. For the problem in question, the regularity condition is satisfied under non-restrictive conditions on the vector flow field. In order to develop the proposed indirect method, we derive the corresponding necessary optimality conditions in the non-degenerate Gamkrelidze form, from which the expression of the optimal control is computed. Moreover, the regularity of the problem entails an explicit expression for the measure multiplier. The points where the extremal trajectories reach the boundary of the state constraint can be computed as a result of the continuity of the measure Lagrange multiplier. The two expressions - of the control and the measure multiplier - are functions of the state and adjoint variables, and are replaced in the associated two-point boundary value problem, solved via a shooting algorithm. From the set of all extremals, only the optimal ones, i.e., with the minimal time, are selected as solutions to the given time-optimal problem. We discuss some examples of time-periodic vector flow fields, and we plot the corresponding set of extremals.
The proposed numerical approach based indirect method was discussed in [2] for the steady flow field case. Our paper extends the analysis to time-periodic flow fields. The dependence of the flow on time is crucial for many realistic path planning problems. For example, tides play an important role in shaping water velocity fields in rivers, mainly near their mouth [3]. Moreover, in our paper we discuss, with more details, sufficient conditions for the non-occurrence of singular controls for a particular choice of control set.
The area of state-constrained optimal control problems has been widely investigated in the literature, cf. [4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14]. Questions related to the non-degeneracy of the necessary optimality conditions can be found in [15, 16, 17, 18, 19, 20, 21, 22]. Issues on the continuity of the measure multiplier are extensively studied in [23, 24, 25, 26, 27, 28, 29, 30]. Numerical methods for computing the set of extremals in the presence of state constraints can be found in [31, 32, 33, 34, 35, 36, 37, 38, 39]. For indirect methods, we refer the reader to [32, 34, 35] [36, 37, 38, 39], among many others.
The article is organized as follows: the formulation of the time-optimal navigation problem is described in Section 2 and the regularity concept is discussed. In Section 3, the necessary optimality conditions in the Gamkrelidze’s form are given in a non-degenerate form. Section 4 is devoted to the application of the maximum principle to the problem in question when the control set is constrained to the unit square in and to derive the explicit formulas for the corresponding measure multiplier and extremal control. Sufficient conditions for the non-occurrence of singular controls are also discussed. Numerical results and the description of the algorithm are featured in Section 5. Section 6 concerns a conclusion, and the Appendix contains detailed proofs of the key results.
2 Problem Formulation: Navigation Problem
We consider an object driven by a dynamical system in a two-dimensional time-space dependent flow field , and while subject to affine state constraints. The ultimate goal is to compute a control process that yields the minimum transit time between two given starting and final points and within the set of extremals, i.e., the set of control processes satisfying the maximum principle conditions. The corresponding problem is described as follow:
[TABLE]
where , and are, respectively, the state and the control variables. The point is the starting point, while is the terminal point, and is a smooth map which defines a fluid flow varying in time and space. Moreover, is a given vector-valued mapping representing the control constraint set . The state constraint set is represented by the inequality . The terminal time is to be minimized by the optimal control process.
2.1 Regularity Condition
For the problem (LABEL:problem) we consider here, the function , defined by the scalar product of the gradient of the function defining the considered active inequality state constraint and the corresponding dynamics, as
[TABLE]
Denote by the set of ’s such that (). In the sequel of the regularity concept in [29], we state the following definition:
Definition 1
Assume that, for all , and , such that , and , the set of vectors and , for all is linearly independent. Then, we say that problem (LABEL:problem) is regular with respect to the state constraint.
As it will be explained in the coming sections, the regularity of the problem is, in the context of our paper, crucial for the appropriate behavior of the numerical proposed approach at points in which the trajectory meets the boundary of the state constraint set. The regularity condition might seem restrictive. However, for a large class of engineering problems it is automatically satisfied under natural assumptions. An example will be featured in Section 4 for a specific case of control set .
3 Maximum Principle
In this section, we derive non-degenerate necessary optimality conditions in the Gamkrelidze’s form for problem (LABEL:problem). We start by considering the extended time-dependent Hamilton-Pontryagin function
[TABLE]
where , and .
In order to satisfy the notation in what follows, we denote by the function in which is replaced by the reference value .
Theorem 3.1
We assume that problem (LABEL:problem) is regular in the sense of Definition 1. Then, for an optimal process , there exist a set of Lagrange multipliers: a number , an absolutely continuous adjoint arc , and a scalar function , such that:
- (a)
Adjoint equation
[TABLE]
- (b)
Maximum condition
[TABLE]
- (c)
Time-transversality condition
[TABLE]
*a.a. ; *
- (d)
* is constant on the time intervals where , increasing on , and decreasing on . Moreover, is continuous on ;*
- (e)
Non-triviality condition
[TABLE]
Remark 1
- a)
The proof of Theorem 3.1 can be found in the Appendix. It relies on a time-reparametrization technique converting problem (LABEL:problem) into a fixed and time-independent one, and on results of [19], [40], and [21, Theorem 4.1].
- b)
From the regularity property of the problem, the expression of the measure multiplier can be found in terms of the state and the adjoint variables. The junction points – the points at which the trajectory meets the state constraint boundary – can be computed as a result of the continuity of the measure multiplier (condition (d)). From these considerations, explicit formulae for the measure multiplier can be obtained. This is the core of our computational scheme proposed in this article for finding the set of extremals.
- c)
The non-triviality condition (e), which asserts the non-degeneracy of the Maximum Principle, implies that
[TABLE]
A proof is provided in the Appendix.
4 Applications: Control Set Constrained to the Square
In this section, we consider the specific case of a control set represented as the unit square in , i.e.
[TABLE]
We study how a simple assumption on the vector flow field can automatically lead to regularity in the sense of Definition 1. Thereafter, we use the necessary optimality condition derived in Section 3 to obtain explicit expressions of the optimal control and the measure Lagrange multiplier in terms of the state and adjoint variables. These expressions will be substituted in the associated boundary-value problem to numerically find the set of extremals (see Section 5).
4.1 Sufficient Condition for Regularity
In the problem considered here, the following simple assumption suffices to ensure regularity as defined above.
- (H)
for all .
Indeed, if the starting and/or terminal positions are in the interior of the state constraint domain, and if the flow is much faster at the boundary of the state constraint set, , assumption (H) is crucial to guarantee that the moving object is able to overcome the flow field effect, and, thus, leave the boundary of the state constraint, and move across the river along the axis .
Proposition 1
Assume that (H) is satisfied. Then, the problem (LABEL:problem), with the specific choice of the control set , as defined in (3), is regular in the sense of Definition 1.
Proof
For , -a.e., and the strict inequality holds at the boundary of the state constraint set. Then, the regularity condition is satisfied if the vectors , and constitute a linearly independent set. For our particular problem, , and . Therefore, the problem (LABEL:problem) with the particular choice in (3) is regular.
Remark 2
Under assumption (H), the necessary conditions of optimality expressed by Theorem 3.1, guaranteeing the non-degeneracy of the Lagrange multipliers, and the continuity of the Borel measure , can be applied.
4.2 Explicit formulas for and
From the maximum condition (b) of Theorem 3.1, for a.a. ,
[TABLE]
This implies that the value of the optimal control process varies w.r.t. the sign of and , as follows:
[TABLE]
The expressions of and differ for points belonging to the boundary of the state constraint set or for points in its interior. Next, we discuss these two cases.
When the trajectory stays on the boundary of the state constraint set during a certain set , then -a.e. on , and, by continuity, everywhere on . Thus, under assumption (H), . Therefore, from the maximum condition, we have
[TABLE]
Moreover, as a result of (2), we have for all such that and, thus, .
Now, let be a time interval during which the trajectory lies in the interior of the state constraint set, i.e. . For any point , the Lagrange measure multiplier is constant. Thus, it follows that, for some in a nonzero Lebesgue measure subset of , we have , and since is constant on , and hence, , on this subset. From the adjoint equations, we conclude that . From the non-triviality condition, we have to have -a.e. on , and, thus, -a.e. on . In this case the maximum condition is not informative for the first component of the control. This is one case of the so-called singular control, i.e., the controls cannot be defined on a non-zero measure set. Another singular situation corresponds to the case when for some in a nonzero Lebesgue measure subset of . Next, we present and prove sufficient conditions that preclude the emergence of singular control by imposing additional conditions on the flow vector-field .
Let , and , such that , and
[TABLE]
In what follows, we suppress the -dependence of as it does not play any role in the developments.
Proposition 2
- a)
If on , then .
- b)
If on , then .
- c)
On we always have .
Proof
Proof of item . Clearly, for all , , and, thus for all . Since , we readily conclude that -meas.
Proof of item . Now, for , we have . Thus, if , then , and, thus, -meas.
Proof of item . Consider some . The system of adjoint equations can be written as follows
[TABLE]
Since on , we have
[TABLE]
If there exists some such that , then on a nonzero Lebesgue measure subset of . From the above, also follows that is constant on this subset what contradicts on . From this, and the nontriviality condition of the multipliers, we have the desired conclusion.
Remark 3
Proposition 2 represents sufficient conditions to avoid singular controls. These conditions allow the maximum condition to stay informative and to define the optimal controls on a non-zero measure set. Since the conditions are only sufficient, this means that there might be some cases in which the singular controls do not occur even if these conditions are not satisfied.
5 Numerical Results
In this section, we present and discuss some numerical results for the above stated optimal control problem by using an indirect method based on the considered Maximum Principle. The conditions of this Maximum Principle lead to the following two-point Boundary Value Problem (BVP):
[TABLE]
The control variables and are given by (4) and the measure Lagrange multiplier is constant for trajectories not meeting the boundary and is defined by (5) along the boundary of the state constraint. Boundary conditions at [math] and for the adjoint arc are absent.
The BVP problem (7) is solved by a variant of the shooting method (see, e.g., [41] for a brief overview of the shooting methods). The shooting parameter is the angle parameterizing the initial boundary condition for :
[TABLE]
Starting from the initial conditions (7c) and (8) for a given value of , the Cauchy problem for the system of ordinary differential equations (7a)–(7b) is solved by the classical order Runge-Kutta method with the constant time step . The set of solutions to the BVP (7) constitute the field of extremals. By integrating the system (7a)–(7b) forward in time, the measure Lagrange multiplier is set to zero for the trajectory in the interior of the domain (i.e. when ). If it reaches the boundary, , at, say, , then is computed by (5). By using the continuity of the measure Lagrange multiplier [29], we deem, that if , the point is a junction point of an extremal and integration of the system is continued following the domain boundary. At each time step along the boundary, the trajectories leaving it with constant values of are computed. This is done to find another junction point or a segment joining the boundary with the terminal point . If at a certain time the terminal boundary condition (7d) is satisfied to the accuracy , the corresponding trajectory represents an extremal. To find all extremals, the parameter is varied from [math] to in (8) with a constant step of , being the bisection method used if the required accuracy is not achieved. Once all extremals, i.e., field of extremals) are computed, the one possessing minimal travelling time among all the extremals is the optimal solution to the original control problem (LABEL:problem).
The first example considers the steady fluid flow
[TABLE]
which is represented by the black arrows in Fig. 2. We clearly notice that, for this specific field, everywhere, while at points such that . However the field of extremal can still be numerically found, supporting Remark 3. The initial and final positions are and , respectively. The field of extremals is also shown in Fig. 2. The optimal extremal is the red one with travelling time s time units.
In the next example, a perturbation of the flow periodic in time (9) is considered for the same trajectory endpoints and . Here,
[TABLE]
reflects the fact that tidal variations affect only the component transversal to the main flow. Even Proposition 2 is violated at some points, the field of extremals is computed and it is shown in Fig. 2, displaying four extremals as in the steady case considered above. In contrast to the problem for the steady flow (9), only one extremal (shown in blue) does not meet the boundary; two extremals (black) meet the right boundary and only one (red) has the left boundary segment. The optimal extremal is again the one (shown in red, with travelling time s) involving the left boundary segment, however, the travelling time along the extremal (black) involving the right boundary, s, is not significantly larger.
The last example concerns the flow vector field
[TABLE]
For this field, , while when . The corresponding field of extremals is computed and shown in Fig. 3. This field contains five inner trajectories not touching the state constraint boundary, one right trajectory, and an optimal one that reaches the final point after time units.
6 Conclusion
In this article, we presented an approach based on the maximum principle amenable to the numerical computation of solutions to a regular class of state-constrained optimal control navigation problems subject to a flow field effects. In order to overcome the computational difficulties due to the Borel measure associated with the state constraints, a not so common version of the maximum principle - the so-called Gamkrelidze form - was adopted and a regularity condition on the data of the problem was imposed to ensure the continuity of the Borel measure multiplier. We showed how this property plays a significant role for trajectories meeting the state constraint boundary. We also proved that this regularity assumption is not restrictive, and it is naturally satisfied by a wide class of optimal control problems. The theoretical analysis was supported by several illustrative examples (for steady and time-periodic flows mimicking real river currents) for which the corresponding fields of extremals were constructed, and optimal solutions were found.
Appendix
In the first part of this appendix, the proof of Theorem 3.1 is provided. The second part concerns the proof of condition (2).
Proof of Theorem 3.1. Following Remark 1 a), a time-reparametrization is needed. Indeed, for a minimizer of the original problem (LABEL:problem), we consider the extended fixed and independent-time optimal control problem associated to (LABEL:problem).
[TABLE]
where is a new state variable which parameterizes the time, and the associated control defined in where . We can prove that if is a minimizer for (LABEL:problem) then is a minimizer for (LABEL:problem:extended).
The corresponding time-independent Hamiltonian is denoted and defined as follow:
[TABLE]
Here is the extended Hamiltonian for the original problem (LABEL:problem). The application of the maximum principle to (LABEL:problem:extended) yields the existence of a number , , and a scalar function , such that
- (i)
- (ii)
for a.e. ;
- (iii)
(Conservation law)
- (iv)
is constant on the time intervals where increasing on , and decreasing on . Moreover, is continuous on ;
- (v)
Remark 4
These necessary optimality conditions are results of [19], [40], and [21, Theorem 4.1]. Moreover, the non-triviality condition (v) is implied by the regularity of the extended problem (LABEL:problem:extended), in the sense of Definition 1. More details can be found in [2].
We explicit now these necessary conditions (i)-(v).
Condition (i) is equivalent to the following:
[TABLE]
which proves condition (a) of Theorem 3.1, and
[TABLE]
Expliciting the maximum condition (ii) implies
[TABLE]
i.e.
[TABLE]
for all and , in particular for . Therefore, for all
[TABLE]
which confirms that the maximum condition (b) of Theorem 3.1 holds true.
Furthermore, the maximum condition (ii) is equivalent to
[TABLE]
This allows us to deduce that . Therefore, owing to the adjoint equation (11) associated to , we obtain
[TABLE]
However, . We deduce that
[TABLE]
confirming the time-transversality condition (c) of Theorem 3.1.
The non-triviality condition (e) is a direct consequence of (2). It suffices to prove it by contradiction. Finally, condition (d) is direct from condition (iv). Therefore, Theorem 3.1 is proved.
Proof of Condition (2). We recall that condition (2) is
[TABLE]
Condition (v) above implies that
[TABLE]
Indeed, by contradiction, if there exists some such that (12) is violated, then the conservation law (iii)
[TABLE]
implies that , contradicting (v). Now to prove (2), we suppose that there exists such that (2) is violated. Then, replacing in the maximum condition (ii), we obtain
[TABLE]
which implies that (recalling that ). Therefore, (12) is violated. This proves that (2) holds true.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Pontryagin, L.S., Boltyanskii, V.G., Gamkrelidze, R.V., and Mishchenko, E.F.: The Mathematical Theory of Optimal Processes, Interscience, New York (1962).
- 2[2] Chertovskih, R., Karamzin, D., Khalil, N.T., Pereira, F.L. An Indirect Method For Regular State-Constrained Optimal Control Problems in Flow Fields. Submitted (2019).
- 3[3] Joseph, A. Measuring Ocean Currents: Tools, Technologies, and Data. Elsevier Science (2013).
- 4[4] Gamkrelidze, R.V.: Optimal control processes with restricted phase coordinates, Izv. Akad. Nauk SSSR Scr. Mat., 24, 315–356 (1960).
- 5[5] Berkovitz, L.D.: On control problems with bounded state variables, J. Math. Anal. Appl., 5 (1962).
- 6[6] Warga, J.: Minimizing variational curves restricted to a preassigned set, Trans. Amer. Math. Soc., 112 (1964).
- 7[7] Gamkrelidze, R.V.: On some extremal problems in the theory of differential equations with applications to the theory of optimal control, SIAM J. Control, 3 (1965).
- 8[8] Dubovitskii, A.Ya., Milyutin, A.A.: Extremum problems in the presence of restrictions, Zh. Vychisl. Mat. Mat. Fiz., 5(3), pp. 395–453 (1965); U.S.S.R. Comput. Math. Math. Phys., 5(3), pp. 1–80 (1965).
