Controllability and optimal control of the transport equation with a localized vector field
Michel Duprez (I2M), Morgan Morancey (I2M), Francesco Rossi (LSIS)

TL;DR
This paper investigates the controllability of a transport PDE related to crowd models, establishing conditions under which the system can be controlled via a localized Lipschitz vector field and analyzing minimal time requirements.
Contribution
It provides new controllability results for a transport PDE with localized control, including necessary crossing conditions and minimal time estimates.
Findings
Controllability depends on the uncontrolled dynamics crossing the control set.
Minimal time is related to the mass in the control region.
Control is achievable with Lipschitz vector fields under certain conditions.
Abstract
We study controllability of a Partial Differential Equation of transport type, that arises in crowd models. We are interested in controlling such system with a control being a Lipschitz vector field on a fixed control set . We prove that, for each initial and final configuration, one can steer one to another with such class of controls only if the uncontrolled dynamics allows to cross the control set . We also prove a minimal time result for such systems. We show that the minimal time to steer one initial configuration to another is related to the condition of having enough mass in to feed the desired final configuration.
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.
Controllability and optimal control of the transport equation with a localized vector field*
Michel Duprez1 and Morgan Morancey2 and Francesco Rossi3 This work was supported by Archimède Labex (ANR-11-LABX-0033) and of the AMIDEX project (ANR-11-IDEX-0001-02), funded by the “Investissements d’Avenir” French Government programme managed by the French National Research Agency (ANR). The second and third authors acknowledge the support of the ANR project CroCo ANR-16-CE33-0008.1Aix Marseille Université, CNRS, Centrale Marseille, I2M, LSIS, Marseille, France. [email protected]2Aix Marseille Université, CNRS, Centrale Marseille, I2M, Marseille, France. [email protected]3Aix Marseille Université, CNRS, ENSAM, Université de Toulon, LSIS, Marseille, France. [email protected]
Abstract
We study controllability of a Partial Differential Equation of transport type, that arises in crowd models. We are interested in controlling such system with a control being a Lipschitz vector field on a fixed control set .
We prove that, for each initial and final configuration, one can steer one to another with such class of controls only if the uncontrolled dynamics allows to cross the control set .
We also prove a minimal time result for such systems. We show that the minimal time to steer one initial configuration to another is related to the condition of having enough mass in to feed the desired final configuration.
I INTRODUCTION
In recent years, the study of systems describing a crowd of interacting autonomous agents has draw a great interest from the control community (see e.g. the Cucker-Smale model [4]). A better understanding of such interaction phenomena can have a strong impact in several key applications, such as road traffic and egress problems for pedestrians. Beside the description of interaction, it is now relevant to study problems of control of crowds, i.e. of controlling such systems by acting on few agents, or on the crowd localized in a small subset of the configuration space.
Two main classes are widely used to model crowds of interacting agents. In microscopic models, the position of each agent is clearly identified; the crowd dynamics is described by a large dimensional ordinary differential equation, in which couplings of terms represent interactions. In macroscopic models, instead, the idea is to represent the crowd by the spatial density of agents; in this setting, the evolution of the density solves a partial differential equation of transport type. This is an example of a distributed parameter system. Some nonlocal terms can model the interactions between the agents. In this article, we focus on this second approach.
To our knowledge, there exist few studies of control of this kind of equations. In [7], the authors provide approximate alignment of a crowd described by the Cucker-Smale model [4]. The control is the acceleration, and it is localized in a control region which moves in time. In a similar situation, a stabilization strategy has been established in [2], by generalizing the Jurdjevic-Quinn method to distributed parameter systems.
In this article, we study a partial differential equation of transport type, that is widely used for modeling of crowds. Let be a nonempty open connected subset of (), being the portion of the space on which the control is allowed to act. Let be a vector field assumed Lipschitz and uniformly bounded. Consider the following linear transport equation
[TABLE]
where is the time-evolving measure representing the crowd density and is the initial data. The control is the function . The function represents the velocity field acting on . System (1) is a first approximation for crowd modeling, since the uncontrolled vector field is given, and it does not describe interactions between agents. Nevertheless, it is necessary to understand controllability properties for such simple equation. Indeed, the results contained in this article will be instrumental to a forthcoming paper, where we will study more complex crowd models, with a non-local term .
We now recall the precise notion of approximate controllability for System (1). We say that System (1) is approximately controllable from to on the time interval if for each there exists such that the corresponding solutions to System (1) satisfies . The definition of the Wasserstein distance is recalled in Section II.
To control System (1), from a geometrical point of view, the uncontrolled vector field needs to send the support of to forward in time and the support of to backward in time. This idea is formulated in the following Condition:
Condition 1** (Geometrical condition).**
Let be two probability measures on satisfying:
- (i)
For all , there exists such that where is the flow associated to , i.e. the solution to the Cauchy problem
[TABLE] 2. (ii)
For all , there exists such that .
Remark 1.
Condition 1 is the minimal one that we can expect to steer any initial condition to any targets. Indeed, if the first item of Condition 1 is not satisfied, there exists a whole sub-population of the measure that never intersects the control region, thus, we cannot act on it.
We denote by the set of admissible controls, that are functions Lipschitz in space, measurable in time and uniformly bounded. If we impose the classical Carathéodory condition of being in , then the flow is an homeomorphism (see [1, Th. 2.1.1]). As a result, one cannot expect exact controllability, since for general measures there exists no homeomorphism sending one to another. We then have the following result of approximate controllability.
Theorem 1**.**
*Let be two probability measures on compactly supported absolutely continuous with respect to the Lebesgue measure and satisfying Condition 1. Then there exists such that System (1) is approximately controllable at time from to with a control in . *
The proof of this result will be given in Section III. After having proven approximate controllability for System (1), we aim to study the minimal time problem, i.e. the minimal time to send to . We have the following result.
Theorem 2**.**
Let be two probability measures, with compact support, absolutely continuous with respect to the Lebesgue measure and satisfying Condition 1.
We say that is an admissible time if it satisfies
- (a)
For each
[TABLE] 2. (b)
For each
[TABLE] 3. (c)
There exists a sequence of -functions equal to [math] in such that
[TABLE]
*Let be the infimum of such . Then, for all , System (1) is approximately controllable from to at time . *
The proof of this Theorem is given in Section IV.
Remark 2.
The meaning of condition (2) is the following: functions are used to store the mass in . Thus, condition (2) means that at each time there is more mass that has entered that mass that has exited. This is the minimal condition that we can expect in this setting, since control can only move masses, without creating them.
This paper is organized as follows. In Section II, we recall some properties of the continuity equation and the Wasserstein distance. Sections III and IV are devoted to prove Theorems 1 and 2, respectively. We conclude with some numerical examples in Section V.
II The continuity equation and the Wasserstein distance
In this section, we recall some properties of the continuity equation (1) and of the Wasserstein distance, which will be used all along this paper.
We denote by the space of probability measures in with compact support, and by the subset of of measures which are absolutely continuous with respect to the Lebesgue measure. First of all, we give the definition of the push-forward of a measure and of the Wasserstein distance.
Definition 1**.**
Denote by the set of the Borel maps . For a , we define the push-forward of a measure of as follows:
[TABLE]
for every subset such that is -measurable.
Definition 2**.**
Let and . Define
[TABLE]
Proposition 1**.**
* is a distance on , called the Wasserstein distance. *
The Wasserstein distance can be extended to all pairs of measures compactly supported with the same mass , by the formula
[TABLE]
For more details about the Wasserstein distance, in particular for its definition on the whole space of measures , we refer to [8, Chap. 7].
We now recall a standard result for the continuity equation:
Theorem 3** (see [8]).**
Let , and be a vector field uniformly bounded, Lipschitz in space and measurable in time. Then the system
[TABLE]
admits a unique solution111Here, is equipped with the weak topology, that coincides with the topology induced by the Wasserstein distance , see [8, Thm 7.12]. in . Moreover, it holds for all , where the flow is the unique solution at time to
[TABLE]
In the rest of the paper, the following properties of the Wasserstein distance will be helpful.
Property 1** (see [6]).**
Let . Let be a vector field uniformly bounded, Lipschitz in space and measurable in time. For each , it holds
[TABLE]
*where is the Lipschitz constant of . *
Property 2**.**
Let some positive measures satisfying and . It then holds
[TABLE]
Using the properties of Wasserstein distance given in Section 1 of [6], we can replace by in the definition of the approximate controllability.
III Proof of Theorem 1
In this section, we prove approximate controllability of System (1). The proof is based on three approximation steps, corresponding to Proposition 2, 3, and 4. The proof is then given at the end of the section.
In a first step, we suppose that the open connected control subset contains the support of both , .
Proposition 2**.**
*Let be such that and . Then, for all , System (1) is approx. contr. at time with in . *
Proof.
We assume that , and , but the reader will see that the proof can be clearly adapted to any space dimension. Fix . Define , and the points for all by induction as follows: suppose that for the points and are given, then and are the smallest values satisfying
[TABLE]
Again, for all , we define , and supposing that for a the points and are already defined, and are the smallest values such that
[TABLE]
where and . Since and have a mass equal to and are supported in , then and for all . We give in Figure 1 an example of such decomposition.
If one aims to define a vector field sending each to , then some shear stress is naturally introduced to the interfaces of the cells. To overcome this problem, we first define sets and for all . We then send the mass of from each to each , while we do not control the mass contained in . More precisely, for all , we define, the smallest values such that
[TABLE]
and
[TABLE]
We similarly define . We finally define
[TABLE]
The goal is to build a solution to System (1) such that the corresponding flow satisfies
[TABLE]
for all . We observe that we do not take into account the displacement of the mass contained in . We will show that the corresponding term tends to zero when goes to the infinity. The rest of the proof is divided into two steps. In a first step, we build a flow and a velocity field such that its flow satisfies (8). In a second step, we compute the Wasserstein distance between and showing that it converges to zero when goes to infinity.
Step 1: We first build a flow satisfying (8). For all , we denote by and the linear functions equal to and at time and equal to and at time , respectively i.e.
[TABLE]
Similarly, for all , we denote by and the linear functions equal to and at time and equal to and at time , respectively, i.e.
[TABLE]
Consider the application being the following linear combination of and in , i.e.
[TABLE]
when . Let us prove that an extension of the application is a flow associated to a velocity field . We remark that is and is solution to
[TABLE]
where for all
[TABLE]
For all , consider the set We remark that and . On , we then define the velocity field by
[TABLE]
for all (). We extend by a and uniformly bounded function outside , then having . Then, System (1) admits a unique solution and the flow on is given by the expression (9).
Step 2: We now prove that the refinement of the grid provides convergence to the target , *i.e. *
[TABLE]
We remark that
[TABLE]
Hence, by defining we also have
[TABLE]
It comes that
[TABLE]
We estimate each term in the right-hand side. Since we deal with absolutely continuous measures, using Proposition 1, there exist measurable maps , for all , and such that
[TABLE]
and
[TABLE]
In the first term, for each , observe that moves masses inside only. Thus
[TABLE]
Concerning the second term in (11), observe that moves a small mass in the bounded set . Thus it holds
[TABLE]
We thus have (10) by combining (11), (12) and (13).
In the rest of the section, we remove the constraints and , now imposing Condition 1. First of all, we give a consequence of Condition 1.
Lemma 1**.**
*If Condition 1 is satisfied for , then the following Condition 2 is satisfied too: *
Condition 2**.**
There exist two real numbers , and a non-empty open set such that
- (i)
For all , there exists such that 2. (ii)
For all , there exists such that .
Proof.
We use an compactness argument. Let and assume that Condition 1 holds. Let . Using Condition 1, there exists such that Choose such that , that exists since is open. By continuity of the application (see [1, Th. 2.1.1]), there exists such that
[TABLE]
Since is compactly supported, we can find a set such that
[TABLE]
Thus the first item of Lemma 1 is satisfied for
[TABLE]
The proof of the existence of is similar.
We now prove that we can store nearly the whole mass of in , under Condition 2.
Proposition 3**.**
*Let satisfying the first item of Condition 2. Then there exists such that *
[TABLE]
Proof.
Let . We denote by , and . We define a cutoff function on of class satisfying
[TABLE]
Define
[TABLE]
We remark that the support of is included in . Let . Define
[TABLE]
Consider the flow associated to without control, i.e. the solution to
[TABLE]
and the flow associated to with the control given in (16), i.e. the solution to
[TABLE]
We now prove that the range of for is included in the range of for . Consider the solution to the following system
[TABLE]
Since and are Lipschitz, then System (18) admits a solution defined for all times. We remark that is solution to System (17). Indeed for all
[TABLE]
By uniqueness of the solution to System (17), we obtain
[TABLE]
Using the fact that and the definition of , we have
[TABLE]
We deduce that, for all ,
[TABLE]
We now prove that for all large enough, there exists such that for all , then . Consider . By continuity, there exists such that for all . For all , we can find such that By compactness of , there exists a finite subcover of . We denote by . Let be such that . Thus
[TABLE]
There exists a ball , such that for all and . Thus, by compactness of , for large enough, for all .
The third step of the proof is to restrict a measure contained in to a measure contained in a hypercube .
Proposition 4**.**
Let satisfying Define an open hypercube strictly included in and choose . Then there exists such that the corresponding solution to System (1) satisfies
[TABLE]
Proof.
From [5, Lemma 1.1, Chap. 1] and [3, Lemma 2.68, Chap. 2], there exists a function satisfying
[TABLE]
with . We extend by zero outside of . . We denote by
[TABLE]
Let . Consider the flow associated to , i.e. the solution to system
[TABLE]
The properties of imply that on , where represents that exterior normal vector to . We deduce that, for large enough, on . Thus for all .
We now prove that there exists and such that for all and , for all . By contradiction, assume that there exists three sequences , and satisfying , and
[TABLE]
Consider the function defined for all by
[TABLE]
Its time derivative is given by
[TABLE]
Then, using (19) and the properties of , it holds
[TABLE]
which is in contradiction for large enough with
[TABLE]
Thus we deduce that, for a and a , for all , and .
We now have all the tools to prove Theorem 1. The idea is the following: we first send inside with a control , then from to an hypercube with a control . On the other side, we send inside backward in time with a control , then from to with a control . When both the source and the target are in , we send one to the other with a control .
Proof of Theorem 1: Consider satisfying Condition 1. Then, by Lemma 1, there exist for which satisfy Condition 2. Define with .
Choose and denote by , , and . Using Propositions 3 and 4, there exists some controls and a square such that the solutions to
[TABLE]
and
[TABLE]
satisfy , and
We now apply Proposition 2 to approximately steer to inside : this gives a control on the time interval . Thus, concatenating on the time interval , we approximately steer to . ∎
IV Proof of Theorem 2
In this section, we prove Theorem 2 about minimal time. To achieve controllability in this setting, one needs to store the mass coming from in and to send it out with a rate adapted to approximate .
Let be the infimum satisfying Condition (2), and fix . We now prove that System (1) is approximately controllable at time . Consider , , , and . Define
[TABLE]
where \left\{\begin{array}[]{l}t^{0}(x^{0}):=\inf\{t\in\mathbb{R}^{+}:\Phi_{t}^{v}(x^{0})\in\omega\},\\ t^{1}(x^{1}):=\inf\{t\in\mathbb{R}^{+}:\Phi_{-t}^{v}(x^{1})\in\omega\}.\end{array}\right.
We remark that represents the mass of which has entered at time and the mass of which need to exit in the time interval . Then, by hypothesis of the Theorem, there exists such that
[TABLE]
The function can be then used to store the mass of in . The meaning of the previous equation is that the stored mass is sufficient to fill the required mass for .
We now define the control achieving approximate controllability at time as follows: First of all, using the same strategy as in the Proof of Theorem 1, we can send a part of approximately to during the time interval . More precisely, we replace and by and in the proof of Theorem 1. Thus, we send the mass of contained in near to the mass of contained in . We repeat this process on each time interval for to . Thus, the mass of is globally sent close to the mass of in time .
V Example of minimal time problem
In this section, we give explicit controls realizing the approximate minimal time in one simple example. The interest of such example is to show that the minimal time can be realized by non-Lipschitz controls, that are unfeasible.
We study an example on the real line. We consider a constant initial data and a constant uncontrolled vector field . The control set is . Our first target is the measure . We now consider the following control strategy:
[TABLE]
where is defined as follows:
[TABLE]
The choice of given above has the following meaning: the vector field is linearly increasing on the interval, thus an initial measure with constant density with will be transformed to a measure with constant density, supported in , where is the unique solution of the ODE
[TABLE]
and similarly for . As a consequence, we can easily describe the solution of (1) with control (22) and initial data . For simplicity, we only describe the measure evolution and the vector field on the time interval in Figure 2. One can observe that the linearly increasing time-varying control allows to rarefy the mass.
Two remarks are crucial:
- •
The vector field is not Lipschitz, since it is discontinuous. Thus, one needs to regularize such vector field with a Lipschitz mollificator. As a consequence, the final state does not coincide with , but it can be chosen arbitrarily close to it;
- •
The strategy presented here cuts the measure in three slices of mass , and rarefying each of them separately. Its total time is . One can apply the same strategy with a larger number of slices, and rarefying the mass in by choosing the control . With this method, one can reduce the total time to , then being approximately close to the minimal time given by Theorem 2.
VI Conclusion
In this article, we studied the control of a transport equation, where the control is a Lipschitz vector field in a fixed set . We proved that approximate controllability can be achieved under reasonable geometric conditions for the uncontrolled systems. We also proved a result of minimal time control from one configuration to another. Future research directions include the study of more general transport equations, namely when the uncontrolled dynamics presents interaction terms, such as in models for crowds and opinion dynamics.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. Bressan and B. Piccoli. Introduction to the mathematical theory of control , volume 2 of AIMS Series on Applied Mathematics . American Institute of Mathematical Sciences (AIMS), Springfield, MO, 2007.
- 2[2] M. Caponigro, B. Piccoli, F. Rossi, and E. Trélat. Mean-field sparse jurdjevic-quinn control. Submitted , 2017.
- 3[3] J.-M. Coron. Control and nonlinearity , volume 136 of Mathematical Surveys and Monographs . American Mathematical Society, Providence, RI, 2007.
- 4[4] F. Cucker and S. Smale. Emergent behavior in flocks. IEEE Trans. Automat. Control , 52(5):852–862, 2007.
- 5[5] A. V. Fursikov and O. Yu. Imanuvilov. Controllability of evolution equations , volume 34 of Lecture Notes Series . Seoul National University, Research Institute of Mathematics, Global Analysis Research Center, Seoul, 1996.
- 6[6] B. Piccoli and F. Rossi. Transport equation with nonlocal velocity in Wasserstein spaces: convergence of numerical schemes. Acta Appl. Math. , 124:73–105, 2013.
- 7[7] B. Piccoli, F. Rossi, and E. Trélat. Control to flocking of the kinetic Cucker-Smale model. SIAM J. Math. Anal. , 47(6):4685–4719, 2015.
- 8[8] C. Villani. Topics in optimal transportation , volume 58 of Graduate Studies in Mathematics . American Mathematical Society, Providence, RI, 2003.
