Intrinsic Lipschitz Regularity of Mean-Field Optimal Controls
Beno\^it Bonnet, Francesco Rossi

TL;DR
This paper establishes conditions for Lipschitz regularity in space for solutions to mean-field optimal control problems, combining mean-field approximations with Wasserstein calculus to ensure regularity of feedback controls.
Contribution
It introduces a novel approach that combines mean-field approximations and Wasserstein calculus to prove Lipschitz regularity of optimal controls in infinite-dimensional settings.
Findings
Lipschitz regularity of controlled vector fields is achieved under new sufficient conditions.
A reformulation of coercivity estimates in Wasserstein calculus is key to the analysis.
Uniform Lipschitz bounds are obtained along empirical measure approximations.
Abstract
In this article, we provide sufficient conditions under which the controlled vector fields solution of optimal control problems formulated on continuity equations are Lipschitz regular in space. Our approach involves a novel combination of mean-field approximations for infinite-dimensional multi-agent optimal control problems, along with a careful extension of an existence result of locally optimal Lipschitz feedbacks. The latter is based on the reformulation of a coercivity estimate in the language of Wasserstein calculus, which is used to obtain uniform Lipschitz bounds along sequences of approximations by empirical measures.
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.
Intrinsic Lipschitz Regularity of Mean-Field Optimal Controls
Benoît Bonnet111CNRS, IMJ-PRG, UMR 7586, Sorbonne Université, 4 place Jussieu, 75252 Paris, France. E-mail: [email protected] , Francesco Rossi222Dipartimento di Matematica “Tullio Levi-Civita”, Università degli Studi di Padova, 63 via Trieste, Padova, Italy. E-mail: [email protected]
Abstract
In this article, we provide sufficient conditions under which the controlled vector fields solution of optimal control problems formulated on continuity equations are Lipschitz regular in space. Our approach involves a novel combination of mean-field approximations for infinite-dimensional multi-agent optimal control problems, along with a careful extension of an existence result of locally optimal Lipschitz feedbacks. The latter is based on the reformulation of a coercivity estimate in the language of Wasserstein calculus, which is used to obtain uniform Lipschitz bounds along sequences of approximations by empirical measures.
Keywords. Multi-Agent Systems, Mean-Field Optimal Control, Regularity of Minimisers, Wasserstein Calculus
**MSC2020 Subject Classification. 35B65, 49J20, 49J30, 49Q22, 58E25, 93A16 **
1 Introduction
The mathematical analysis of collective behaviours in large systems of interacting agents has received an increasing attention from several communities during the past decades. Multi-agent systems are ubiquitous in applications ranging from aggregation phenomena in biology [15] to the understanding of crowd motion [28], animal flocks [29] and swarms of autonomous vehicles [13]. While the first studies on multi-agent systems were formulated in a graph-theoretic framework (see e.g. [50] and references therein), several models now rely on continuous-time dynamical systems to depict this type of dynamics. In this context, a multi-agent system is usually described by a family of coupled ordinary differential equations (ODEs for short) of the form
[TABLE]
where denotes the state of all the agents and is a non-local velocity field depending both on the running agent and on the whole state of the system (see e.g. [6, 28, 29]). However general and useful, these models are generically not the most powerful ones when it comes to capturing the global features of a multi-agent system. Besides, their intrinsic dependence on the number of agents makes most of the classical computational approaches practically intractable for realistic scenarios.
One of the most natural ideas to circumvent this model limitation is to approximate the large system of coupled ODEs written in (1) by a single infinite-dimensional dynamics via a process called mean-field limit (see e.g. the survey [51]). In this setting, the agents are supposed to be indistinguishable, and the assembly of particles is described by means of its spatial density , which is represented by a measure. The evolution through time of this global quantity is then prescribed by a non-local continuity equation of the form
[TABLE]
Such a macroscopic approach has been successfully used e.g. to model pedestrian dynamics and biological systems [15, 28], as well as to transpose the study of classical patterns such as consensus or flocking formation to the mean-field setting [21, 44]. These research endeavours have hugely benefited from the recent progresses made in the theory of optimal transportation, for which we point to the reader to the monographs [5, 55, 56].
More recently, the problem of controlling multi-agent systems in order to promote a desired behaviour or configuration became relevant in a growing number of applications. Motivated by implementability and efficiency, many contributions have therefore aimed at generalising relevant notions of control theory to PDEs of the form (2) serving as mean-field approximations of the discrete system (1). The resulting class of controlled continuity equations are usually written as
[TABLE]
While a few articles have been dealing with controllability results [34, 35] or explicit syntheses of control laws [16, 53], the major part of the literature has been focusing on mean-field optimal control problems, with contributions ranging from existence results [38, 39, 40] to first-order optimality conditions [7, 8, 10, 11, 22, 23, 46, 54] and numerical methods [1, 14].
One of the distinctive features of continuity equations is that they require fairly restrictive regularity assumptions to be classically well-posed. While (3) makes sense whenever the drift and control are measurable and satisfy some integrability bounds, the associated notion of so-called superposition solution (see e.g. [5, Theorem 8.2.1]) is relatively weak and of limited practical use. In [2, 31], a theory of well-posedness was developed for continuity equations with Sobolev and velocity fields. However powerful and general, the latter has not yet been generalised to non-local driving fields, and is inherently restricted to measures which are absolutely continuous with respect to the ambient Lebesgue measure. Up to now, the only identified setting in which a strong form of classical well-posedness (see Theorem 5 below) holds for arbitrary measure curves solution of (3) is that of Cauchy-Lipschitz regularity (see e.g. [3, Section 3]). In this framework, solutions of non-local continuity equations exist, are unique, and stability estimates are available both with respect to the initial data and the velocity fields, see e.g. [9, 52]. This latter fact is highly relevant to our purpose, since optimal control problems formulated on continuity equations are frequently studied in an “optimise-then-discretise” spirit. Indeed, the main desirable property of a control law designed for the kinetic model (3) is to provide a strategy which can be in turn applied – either exactly or approximately – to finite-dimensional systems of the form (1). As the infinite-dimensional strategy is not strictly optimal for the discrete multi-agent system in general, one would also like to have access to quantitative error estimates between the true solution and the approximate one. From a computational standpoint, Cauchy-Lipschitz regularity is also relevant to ensure the well-posedness of numerical methods such as semi-Lagrangian schemes (see e.g. [20, 24]), as well as to prevent the apparition of Lavrentiev-type instabilities in the context of optimal control (see e.g. [48]). For all these reasons, a wide portion of the literature of mean-field control has been dealing with problems in which one imposes an a priori Lipschitz-in-space regularity on the admissible controls (see e.g. [8, 11, 17, 39, 40, 53]), or at least some continuity assumptions on the driving fields (see [22, 23, 46]). A natural question is then to ask whether such regularity property may hold intrinsically or not. In this paper, we investigate this problem in the setting of mean-field optimal control problems formulated on the controlled dynamics (3).
It is well-known that solutions of optimal control problems in Wasserstein spaces need not be regular in general. Indeed, there exists a vast literature devoted to the study of the regularity properties of solutions to the optimal transport problem in Monge formulation (see e.g. [30, 37] for some of the farthest-reaching contributions on this topic), mostly via PDE techniques. However, few of these results can be translated into regularity properties on the optimal tangent velocity field solving the Benamou-Brenier problem
[TABLE]
For the optimal control problem , it can be shown for instance by building on [56, Theorem 12.50]) that whenever have densities with respect to the ambient Lebesgue measure with regularity at least for some , and that their supports are smooth and convex. Another context in which the regularity of mean-field optimal controls has been (indirectly) investigated is that of mean-field games (see [45, 47]). Indeed, there is a large literature dedicated to the regularity of the value function solving the backward Hamilton-Jacobi equation of the coupled system
[TABLE]
In the setting of variational mean-field games, the velocity field is the optimal control associated to a mean-field optimal control problem. Therefore, is expected to have a regularity with one order of differentiation fewer than the value function. We refer the reader e.g. to [18] for Sobolev regularity results on the value function and to [19] for Hölder regularity (see also Remark 1 below).
In this article, we investigate the intrinsic Lipschitz regularity with respect to the space variable of the solutions of general mean-field optimal control problems of the form
[TABLE]
The set of admissible controls for is defined by , where is a convex and compact set, and is a fixed initial datum. Remark that, since we do not impose any a priori regularity assumptions on the control vector fields , there may exist no solutions to the non-local transport equation (3) driving problem . Moreover even when solutions do exist, they may not be classically well-posed and defined in a weak sense only.
The first main contribution of this manuscript is the following existence result of intrinsically Lipschitz-in-space mean-field optimal controls for .
Theorem 1** (Existence of Lipschitz-in-space solutions for ).**
Let and assume that hypotheses (H) of Section 4 below hold. Moreover, suppose that the control cost is strongly convex with a constant , where only depends on and on the -norm with respect to the measure and space variables of the dynamics and cost functionals of .
Then, there exists a constant and a trajectory-control pair which is optimal for such that is -Lipschitz for -almost every .
The proof of this result is obtained by combining two fairly separated arguments. The first one is an existence result for mean-field optimal controls which was derived in [38], and recalled in Theorem 6 below. In the latter, it is proven under very general assumptions that, given a sequence converging in the -metric towards , there exist optimal solutions of problem which can be recovered as -limits in a suitable topology of sequences of solutions to the discrete problems
[TABLE]
Here, , and the functionals , and are discrete approximations of , and respectively (see Definition 10 below).
The second key component of our approach is a careful adaptation of a methodology recently developed in [26, 33] to the family of problems , which provides sufficient conditions for the existence of locally optimal Lipschitz feedbacks around solutions of optimal control problems. In the context of mean-field control problems, this part crucially relies on the following uniform mean-field coercivity estimate
[TABLE]
which holds along any optimal mean-field Pontryagin triple (see Proposition 6 below) for , where is the Hamiltonian of the discrete problem. In this context, the operator stands for the restriction to empirical measures of the intrinsic Wasserstein Hessian bilinear form (see e.g. [25]), whose construction is further detailed in Section 2. In essence, this uniform coercivity estimate allows one to invert the optimality conditions stemming from the application of the Pontryagin Maximum Principle (PMP in the sequel) to , with a control on the Lipschitz constant of such inverse. The main subtlety here lies in the fact that we need these estimates to be uniform with respect to , which would not be the case if we were to apply verbatim the results of [33] to . For these reasons, we work with an adapted mean-field PMP – which is the discrete counterpart of the Wasserstein PMP studied in [7, 8, 10, 11] –, and express the coercivity condition in terms of Wasserstein calculus.
The combination of these two steps together with delicate projection arguments, we can build an optimal feedback for that is Lipschitz in uniformly with respect to . By standard compactness arguments (see e.g. [7, 40]), this allows us to obtain a result that is stronger than Theorem 1, which is the second main contribution of this manuscript.
Theorem 2** (Convergence of optimal Lipschitz feedbacks towards solutions of ).**
Let and be a sequence of empirical measures with uniformly compact supports such that as . Suppose that hypotheses (H) of Section 4 below are satisfied, and that the mean-field coercivity estimate (CON) described in Section 5 holds along any optimal Pontryagin triple for defined in the sense of Proposition 6.
Then, there exists a uniform constant depending only on the data of and a sequence of trajectory-control pairs such that the following holds.
- (a)
For any the pair is optimal for , i.e. and for -almost every . 2. (b)
The maps are -Lipschitz for -almost every and any . 3. (c)
For every , the cluster points of the sequence in the weak -topology are optimal controls for and are -Lipschitz in space.
While they are more general than that of Theorem 1, the statements of Theorem 2 are less intrinsic by nature, as they rely on the mean-field coercivity estimate (CON) which can only be formulated on the discrete approximations . For this reason, in Proposition 8 below, we show that the strong convexity assumption imposed on in Theorem 1 is in fact a sufficient condition for (CON). Hence, the statements of Theorem 1 – which present the advantage of involving quantities which are intrinsic to – can be recovered as a direct corollary of Theorem 2.
Remark 1** (Comparison with related contributions in mean-field games).**
It was recently brought to our attention that a result related to Theorem 1 and Theorem 2 above was derived in [42]. In the latter, the authors show that the value function of a certain class of first-order mean-field games is continuously differentiable with Lipschitz derivative when the data are of class and the time horizon is sufficiently small. These two requirement are very close to our standing assumptions. Indeed, we posit in hypotheses (H) below that all our data are , and it is illustrated in Section 6 that our uniform coercivity estimate (CON) can be interpreted as a quantitative condition comparing the size of the time horizon relatively to other constants of the problem, and in particular with the semi-convexity constant of the cost functionals. The results of [42] have then been extended in [49] to broader classes of first-order mean-field games systems, and improved in the very recent [41], in which it is shown that the value function is regular when the small time horizon condition is replaced by the displacement convexity (see e.g. [5, Chapter 9]) of the Lagrangian. Incidentally for mean-field control problems, this scenario is also contained in our main result Theorem 1. Indeed, if the running cost of the problem is displacement convex, the final cost equal to zero, and the non-local dynamics reduced to a linear controlled vector-field, it can be shown that and the controls are Lipschitz-regular in space whenever the control cost is strongly convex with constant .
We also stress that the proof strategies developed in [41, 42, 49] are fairly close to the one that we independently propose here, as they rely on the application of inverse function mappings to sequences of approximations by empirical measures, with a quantitative control on the Lipschitz constant of the inverse.
The structure of this article is the following. In Section 2, we recall several general prerequisites on measure theory and optimal transport. In particular in Section 2.3, we investigate in details the interplay between Wasserstein derivatives of functionals at empirical measures and classical derivatives of the discrete functionals which arguments are the corresponding support points. In Section 3, we review notions pertaining to finite-dimensional optimal control problems, with a particular emphasis on Lipschitz feedbacks. We proceed by exposing in Section 4 concepts dealing with continuity equations and mean-field optimal control problems, and move on to the proofs of our main results Theorem 1 and Theorem 2 in Section 5. More precisely, in Section 5.1, we state the coercivity assumption (CON) and use it to prove Theorem 2. We then show in Section 5.2 how the latter together with a standard convexity estimate for -regular functions on convex compact sets allows to recover Theorem 1. We conclude by providing in Section 6 an analytical example in which our coercivity estimate is both necessary and sufficient for the existence of Lipschitz-in-space mean-field optimal controls.
2 Preliminaries
In this section, we introduce results and notations that we will use throughout the article. Section 2.1 presents known results of analysis in measure spaces and optimal transport, while Section 2.2 deals with first- and second-order differential calculus in Wasserstein spaces. We introduce in Section 2.3 the notion of mean-field approximating sequence, along with a discretised counterpart of the Wasserstein calculus.
2.1 Analysis in measure spaces
In this section, we introduce some classical notations and results of analysis in measure spaces and optimal transport. For these topics, we refer the reader to [4] and [5, 55, 56] respectively.
We denote by the Banach space of -dimensional vector-valued finite Radon measures defined on endowed with the total variation norm, defined for any by . Here, the total variation measure associated to is given on any Borel set by
[TABLE]
where is the norm of the element . It is known by Riesz’s Theorem (see e.g. [4, Theorem 1.54]) that can be identified with the topological dual of the Banach space , which is the completion of the space of continuous and compactly supported functions. The latter is endowed with the duality product
[TABLE]
defined for any and . Given a positive Borel measure and an element , the notations and stand for the spaces of -integrable and Sobolev functions respectively. In the case where is the standard -dimensional Lebesgue measure , we simply denote these spaces by and .
We use the notation for the space of Borel probability measures, and given , we denote by the subset of of measures having finite -th moment, i.e.
[TABLE]
We define the support of as the closed set \textnormal{supp}(\boldsymbol{\nu}):=\{x\in\mathbb{R}^{d}\leavevmode\nobreak\ \text{s.t.}\leavevmode\nobreak\ |\boldsymbol{\nu}(\pazocal{N})|\neq 0\leavevmode\nobreak\ for any neighbourhood of , and denote by the subset of probability measures with compact support.
Definition 1** (Absolute continuity and Radon-Nikodym derivative).**
Let and be two Borel sets. Given a pair of measures , we say that is absolutely continuous with respect to , and write , provided that whenever for any Borel set . Moreover, it holds that if and only if there exists a Borel map such that . This map is referred to as the Radon-Nikodym derivative of with respect to , and denoted by .
We now recall the definitions of pushforward and transport plan for Borel probability measure.
Definition 2** (Pushforward of a measure through a Borel map).**
Given a measure and a Borel map , the pushforward of through is the Borel probability measure defined by for any Borel set .
Definition 3** (Transport plans).**
Let . We say that is a transport plan between and , denoted by , if and , where denote the projection on the first and second component respectively.
In what follows, we recall the definition and some of the main properties of the so-called Wasserstein spaces (see e.g. [5, Chapter 7] or [56, Chapter 6]).
Definition 4** (Wasserstein spaces).**
Given and , the Wasserstein distance of order between and is defined by
[TABLE]
The set of optimal transport plans realising this optimal value is non-empty and denoted by . The space of probability measures with finite momentum of order endowed with the -metric is called the Wasserstein space of order .
Proposition 1** (Elementary properties of the Wasserstein spaces).**
For any , the metric space is complete and separable, and the -distance metrises the weak-∗ topology induced by (4), i.e.
[TABLE]
Given two elements , the Wasserstein distances are ordered, i.e. whenever . Moreover when , the following Kantorovich-Rubinstein duality formula holds
[TABLE]
where denotes the Lipschitz constant of over a subset .
We end this introductory paragraph by recalling the concept of disintegration for vector-valued measures (see e.g. [4, Theorem 2.28]).
Theorem 3** (Disintegration).**
Let , and be Borel sets. Let and be the projection on the first factor. Defining the measure , there exists a -almost uniquely determined Borel family of measures such that
[TABLE]
for any Borel map . This construction is referred to as the disintegration of onto , and it is denoted by .
2.2 First- and second-order differential calculus over
In this section, we recall key concepts related to first- and second-order differential calculus in the Wasserstein space . We refer the reader to [5, Chapters 9-11] and [43] for an exhaustive treatment of the first-order theory, and borrow the main notions dealing with Wasserstein Hessians from [25, Section 3].
Throughout this section, we denote by an extended real-valued functional with non-empty effective domain . We will also denote by any such functional such that . In the following definition, we recall the notions of classical subdifferential and superdifferential for functionals defined over .
Definition 5** (Wasserstein subdifferential and superdifferentials).**
Let . We say that a map belongs to the classical subdifferential of at provided that
[TABLE]
for all . Similarly, we say that a map belongs to the classical superdifferential of at if .
Following [5, Chapter 8], we define the analytical tangent space at by
[TABLE]
In the next definition, we recall the notion of differentiable functional over .
Definition 6** (Differentiable functionals in ).**
A functional is said to be differentiable at if . In this case, there exists a unique elements , called the Wasserstein gradient of at , which satisfies
[TABLE]
for any and .
From the characterisation (8) of the Wasserstein gradient , we can write a chain rule along elements of (see e.g. [5, Proposition 10.3.18] or the recent improvement of [10, Proposition 3.6]).
Proposition 2** (First-order chain rule).**
Suppose that is differentiable at . Then for any , the map is differentiable at with
[TABLE]
where denotes the Lie derivative of at in the direction .
In the sequel, we will also need a notion of second-order derivatives for functionals defined over .
Definition 7** (Hessian bilinear form in ).**
Suppose that is differentiable at and suppose that for any , the map
[TABLE]
is also differentiable at . Then, the partial Wasserstein Hessian of at is the bilinear form defined by
[TABLE]
for any . Moreover, if there exists a constant such that
[TABLE]
we denote again by its extension to and say that is twice differentiable at .
In the following proposition, we recollect several statements from [25, Section 3] which yield an analytical expression of the Wasserstein Hessian. This also allows to write a second-order differentiation formula for functionals defined over .
Proposition 3** (Wasserstein Hessian and second-order expansion).**
Suppose that is differentiable at in the sense of Definition 6, and that the maps
[TABLE]
are continuously differentiable at and respectively. Then, is twice differentiable in the sense of Definition 7, and its Wasserstein Hessian can be written explicitly as
[TABLE]
for any . Here, is the Fréchet differential of at , while denotes the matrix-valued map whose columns are the Wasserstein gradients of the components in the sense of Definition 6. Moreover, the following identity
[TABLE]
holds for any .
We finally introduce the notion of -Wasserstein regularity, which will be used throughout this article.
Definition 8** (-Wasserstein regularity).**
A functional is said to be -Wasserstein regular* if it is twice differentiable over for any compact set , and satisfies*
[TABLE]
where is a constant which only depends .
2.3 Mean-field adapted structures and empirical measures
In this section, we present several notions dealing with functionals defined over empirical measures in the spirit of [38], along with an adapted discrete version of the differential structure described in Section 2.2.
We denote by the set of -empirical probability measures over . For any , we denote by a given element of and by its associated empirical measure.
Definition 9** (Symmetric maps defined over ).**
A map is said to be symmetric if for any -blockwise permutation .
In the following definition, we introduce the notion of mean-field approximating sequence for continuous functionals defined over .
Definition 10** (Mean-field approximating sequence).**
Given an integer and a set , we define the mean-field approximating sequence of a functional as the family of symmetric maps , defined by
[TABLE]
for any and all .
We henceforth endow the vector space with the rescaled inner product defined by
[TABLE]
for any , where is the standard Euclidean product of . We also denote by the corresponding norm over , and observe that is an Hilbert space.
In the following proposition, we show that the Wasserstein differential structure described in Section 2.2 for functionals defined over induces a natural differential structure on the Hilbert space . We will use the notation to refer to functionals between finite-dimensional normed vector spaces which are twice differentiable with locally Lipschitz derivatives up to the second-order.
Proposition 4** (Mean-field derivatives of symmetric maps).**
Let be -Wasserstein regular in the sense of Definition 8 above and be the mean-field approximating sequence of .
Then, for any , and the following Taylor expansion formula
[TABLE]
holds for any . Here, we introduced the mean-field gradient and mean-field Hessian bilinear form of , given respectively by
[TABLE]
and
[TABLE]
for any . Defining the -norm of over with respect to differential structure of as
[TABLE]
it further holds for each compact set that
[TABLE]
where the -Wasserstein norm of is defined as in (13).
Proof.
Take and and define . Consider the map given by
[TABLE]
and let be a symmetric mollifier centred at the origin and supported on . We define the tangent vector at by
[TABLE]
Remark that by construction, one has
[TABLE]
so that in particular for any sufficiently small.
Recall now that is differentiable at by hypothesis. Hence by Proposition 2, it holds
[TABLE]
Recalling the definition of approximating maps given in (14), we further obtain
[TABLE]
where we used (22) along with the fact that . It is straightforward to check that the directional derivative of defined in (23) is a linear form and that it is continuous with respect to the rescaled Euclidean metric . Whence, the map is Fréchet differentiable at , and by Riesz’s Theorem (see e.g. [12, Theorem 5.5]), its differential can be represented in the Hilbert space by the mean-field gradient defined in (17).
Consider now two elements and the corresponding tangent vectors built as in (21). Since is twice differentiable in the sense of Definition 7, it holds by (12) in Proposition 3
[TABLE]
Observe now that for -almost every by (21), so that . Furthermore, by the definition of along with that of , equation (24) can be equivalently rewritten as
[TABLE]
where we used the analytical expression (11) of the Wasserstein Hessian. We accordingly introduce the mean-field Hessian bilinear form of at , defined as in (18). It is again possible to verify that defines a continuous bilinear form with respect to the rescaled metric , so that the map is twice Fréchet differentiable over . The expansion formula (16) can then be derived by developing using the classical Taylor theorem in along with (23) and (25).
We now prove the regularity bound of (20). Given , we obtain from the fact that is a mean-field approximating sequence for together with the definition of displayed in (17), that
[TABLE]
and
[TABLE]
Analogously, using the definition of given in (18), we can deduce
[TABLE]
as well as the Lipschitz estimate
[TABLE]
where we used the fact that for . By plugging (26), (27), (28) and (29) into (19) and recalling the definition (13) of , we conclude that (20) holds. ∎
Remark 2** (Matrix representation of the mean-field Hessian in ).**
By Riesz’s Theorem applied in the Hilbert space , the action of the Hessian bilinear form can be represented as
[TABLE]
for any , where is a matrix. In this case, its components can be obtained via a simple identification in (18), and be written explicitly as
[TABLE]
for any pair of indices such that .
3 Locally optimal Lipschitz feedbacks in optimal control
In this section, we recall classical facts about finite dimensional optimal control problems, and describe in Theorem 4 a result proven in [33], which provides sufficient conditions for the existence of locally optimal Lipschitz feedbacks in a neighbourhood of an optimal trajectory. Throughout this section, we will study the finite-dimensional optimal control problem
[TABLE]
under the following assumptions.
Hypotheses (H)****.
- (i)
The set of admissible controls is given by where is convex and compact. 2. (ii)
The control cost is -regular and strictly convex over . 3. (iii)
The map is Lipschitz with respect to and -regular with respect to . Moreover, there exists a constant such that
[TABLE]
for any . 4. (iv)
The running cost is Lipschitz with respect to and -regular with respect to . Similarly, the final cost is -regular over .
It can be easily seen that one could choose integrable maps to express the sub-linearity and Lipschitz regularity of instead of constants. As a direct consequence of (H), we have the following lemma.
Lemma 1** (Uniform compactness of admissible trajectories).**
Given , there exists a compact set such that each admissible curve for associated to a control satisfies .
Proof.
This follows directly from an application of Grönwall’s Lemma. ∎
Proposition 5** (Existence of solutions for problem ).**
Let be a compact set given as in Lemma 1 and suppose that hypotheses (H) hold. Then, there exists an optimal trajectory-control pair for problem .
Proof.
This result is standard under our working hypotheses and can be found e.g. in [27, Theorem 23.11]. ∎
We introduce the Hamiltonian function associated with , defined by
[TABLE]
Let be an optimal trajectory-control pair for . By the Pontryagin Maximum Principle (see e.g. [27, Theorem 22.2]), there exists a curve such that the couple is a solution of the forward-backward Hamiltonian system
[TABLE]
Moreover, the Pontryagin maximisation condition
[TABLE]
holds along this extremal pair for -almost every . Such a collection of optimal state, costate and control curves is called an optimal Pontryagin triple for . Let it be noted that, since the end-points of are free, there are no abnormal curves stemming from the maximum principle.
Lemma 2** (Compactness and regularity of the costate).**
Let be a compact set given by Lemma 1 and suppose that hypotheses (H) hold. Then, there exists a compact set such that .
Proof.
The backward Cauchy problem satisfied by in (31) can be written explicitly as
[TABLE]
for -almost every . Since is uniformly bounded by (H)-, it follows from Grönwall’s Lemma that . Moreover, recall that is also uniformly bounded as a consequence of (H)-, thus upon invoking Grönwall’s Lemma again, there exists a compact set such that . ∎
From now on, we denote by the uniform compact set containing the admissible times, states, costates and controls for , and by be the Lipschitz constant over of the maps , , and and and of their derivatives with respect to the variables up to the second order. Observe that both quantities exist as a consequence of Lemma 1, Lemma 2 and hypotheses (H).
Definition 11** (Coercivity estimate).**
We say that an optimal Pontryagin triple for satisfies the uniform coercivity estimate with constant if the following inequality holds
[TABLE]
for any pair of maps solution of the linearised system
[TABLE]
We are now ready to recall the main contribution of [33, Theorem 5.2], which we will use in the proof of Theorem 2. Below, we use the notations and for the closed-ball of center and radius in .
Theorem 4** (Existence of locally optimal feedbacks for ).**
Let be an optimal Pontryagin triple for problem . Suppose that (H) hold and that satisfies the uniform coercivity estimate (33)-(34) with constant .
Then, there exist positive constants , an open subset and a locally optimal feedback whose Lipschitz constant depends only on and , such that the following holds.
- (a)
* for all times .* 2. (b)
\big{(}\textnormal{Graph}(x^{*}(\cdot))+\{0\}\times B(0,\epsilon)\big{)}\subset\pazocal{N}. 3. (c)
For each , the equation
[TABLE]
has a unique solution such that . 4. (d)
The map satisfies
[TABLE]
for any open-loop pair for such that .
The proof of Theorem 4 in [33] is based on a general strategy elaborated in [26], in which several quantitative inverse function theorems are proven under hypotheses akin to (33) for non-linear optimal control problems. The key point of this approach is to remark (see e.g. [32]) that the first-order linearisation of the PMP system (31)-(32) corresponds to the PMP of the linearised problem
[TABLE]
associated to , where
[TABLE]
and
[TABLE]
for all times . In this context, the coercivity estimate plays the role of a strong positive-definiteness condition on the cost of along optimal trajectories, which allows to invert the corresponding optimality system with a control on the Lipschitz constant of the inverse. In the sequel, we will use the important fact that Theorem 4 holds true in any finite-dimensional Hilbert space, and in particular in .
4 Non-local transport equations and mean-field optimal control
In this section, we recall some results concerning continuity equations and mean-feld optimal control problems. We recall in Section 4.1 concepts pertaining to non-local continuity equations, and detail in Section 4.2 a powerful existence result of so-called mean-field optimal controls for problem , which is borrowed from [38].
In the sequel, we focus on the optimal control problems in Wasserstein spaces written in the general form
[TABLE]
Here, is a fixed initial datum, and the minimisation is taken over the set of admissible controls where is a trajectory-control pair. We make the following working assumption on the data of problem .
Hypotheses (H)****.
- (i)
The set of admissible control values is convex and compact. 2. (ii)
The control cost is -regular and strictly convex over . 3. (iii)
The non-local velocity field is Lipschitz with respect to and continuous in the -topology with respect to . Besides, there exists such that
[TABLE]
for all times and any . Moreover, there exist such that
[TABLE]
for any and , where is an arbitrary compact set. 4. (iv)
The map is -Wasserstein regular. 5. (v)
The running cost is Lipschitz with respect to and -Wasserstein regular with respect to . 6. (vi)
The final cost is -Wasserstein regular.
Observe that by classical well-posedness results for non-local continuity equations (see e.g. [9, 52]) together with known existence results in the context mean-field optimal control problems (see e.g. [38]), it would be sufficient to have locally Lipschitz dynamics and continuous cost functionals for solutions of to exist.
4.1 Non-local transport equations in
Given a time horizon , we denote by the renormalised Lebesgue measure on . For any , a curve of measures can be uniquely lifted to a measure defined by disintegration as in the sense of Theorem 3. We shall say that solves a continuity equation with initial condition driven by a Lebesgue-Borel velocity field provided that
[TABLE]
This equation has to be understood in duality against smooth and compactly supported functions, namely
[TABLE]
for any .
It has been well-known since the works of Ambrosio in [2] (see also [5, Chapter 8]) that weak solutions of continuity equations can exist in this low regularity context. However as already explained in the introduction above, such solutions are not well tailored to the practical investigation of mean-field control problem. Thus in Theorem 5 below, we recall an existence result which was first derived in [52], and that is concerned with classical well-posedness for non-local transport equations in under stronger regularity assumptions.
Theorem 5** (Well-posedness of non-local transport equations).**
Let be a non-local velocity field satisfying hypotheses (H)-. Then for each , there exists a unique solution of (36) driven by . Furthermore, there exist constants such that
[TABLE]
for all times .
4.2 Existence of mean-field optimal controls for problem
In this section, we show how problem can be reformulated so as to encompass a suitable sequence of approximating discrete problems . We subsequently recall a powerful existence result derived in [38] for general multi-agent optimal control problems formulated in Wasserstein spaces.
We start by fixing an integer , an initial datum , and the associated empirical measure as in Section 2.3. As exposed in the introduction, we consider the family of discrete problems
[TABLE]
with , and where the mean-field approximating functionals are defined by
[TABLE]
for any . It can be checked that as a consequence of hypotheses (H), the problems satisfy hypotheses (H). We can thus deduce the following lemma directly from Proposition 5.
Lemma 3** (Existence of solutions for ).**
Under hypotheses (H) for each , there exists an optimal trajectory-control pair solution of .
We proceed by recasting problem into a framework which also encompasses the sequence of problems . Recall that, by Definition 1, a vector-valued measure is absolutely continuous with respect to if and only if there exists a map such that . Moreover, the absolute continuity of with respect to implies the existence of a -almost unique family of measures such that in the sense of Theorem 3. Whence, problem can be relaxed as
[TABLE]
where we introduced the set of generalised measure controls, and the map
[TABLE]
One can then associate to any optimal trajectory-control pair for a measure trajectory-control pair , defined by
[TABLE]
In the following theorem, we state a condensed version of the main result of [38], which shows that this relaxation allows to prove the -convergence of the discrete problems towards .
Theorem 6** (Existence of mean-field optimal controls for ).**
Let be given, be a sequence of uniformly compactly supported empirical measures associated with such that as , and assume that hypotheses (H) hold. For any , let be an optimal trajectory-control pair for and be the corresponding measure trajectory-control pair defined as in (39).
Then, there exists a pair such that
[TABLE]
along a suitable subsequence. Moreover, the classical trajectory-control pair
[TABLE]
is optimal for , where .
Remark 3** (Comparison between (H) and the assumptions of [38]).**
In [38], it is assumed that is a subspace of in order to recover the inequality in the proof of their main result Theorem 3.2. This hypothesis could be relaxed up to an additional projection argument by asking that is convex and closed. Besides, the requirements that is radial and super-linear at infinity are primarily used to recover integral bounds on the controls, which automatically hold in our context since we posit that the control set is compact.
5 Proof of Theorem 1 and Theorem 2
In this section, we prove the two main results of this article. We start by working with the discrete approximations of in order to prove Theorem 2. We then proceed to recover Theorem 1 as a corollary, by formulating a sufficient condition under which (CON) below holds.
5.1 Mean-field coercivity estimate and proof of Theorem 2
In this section, we start by proving Theorem 2. We suppose that hypotheses (H) of Section 4 hold, along with the following additional mean-field coercivity assumption.
Hypothesis (CON**)****.**
There exists a constant such that for every mean-field optimal Pontryagin triple for defined in the sense of Proposition 6 below, the following coercivity estimate holds
[TABLE]
along all the solutions of the linearised system
[TABLE]
Our argument is split into three steps. In Step 1, we write a PMP adapted to the mean-field structure of problem . We proceed by building in Step 2 a sequence of Lipschitz-in-space optimal control maps for the discrete problems by combining Theorem 4 and (CON). We then show in Step 3 that this sequence of control maps is compact in a suitable weak topology preserving its Lipschitz regularity in space, and that its limit point coincide with the mean-field optimal control introduced in Theorem 6.
Step 1: Solutions of and mean-field Pontryagin Maximum Principle.
In this first step, we characterise and derive uniform estimates on the optimal pairs for . Our analysis is based on a reformulation of the PMP applied to as a Hamiltonian flow with respect to the inner product .
Proposition 6** (Characterisation of the solutions of ).**
Let be an optimal trajectory-control pair for . Then, there exists a rescaled covector such that satisfies the mean-field Pontryagin Maximum Principle
[TABLE]
where the mean-field Hamiltonian of the system is defined by
[TABLE]
for all . Furthermore, there exist uniform constants which are independent of , such that
[TABLE]
Proof.
By hypothesis (H)-, there exists a constant such that . Together with the definition (38) of the approximating sequences and (H)-, this implies
[TABLE]
for all times . By summing over the indices and applying Grönwall’s Lemma, there exists a constant independent of such that
[TABLE]
Plugging (44) into (43) and applying Gröwall’s Lemma yet another time, we recover the existence of two constants independent of such that for every index , it holds
[TABLE]
As a consequence of the standard PMP applied to (see for instance [27, Theorem 22.2]), there exists a family of costate curves such that
[TABLE]
where the classical Hamiltonian of the system is defined as
[TABLE]
for every . Introducing the rescaled curves , one has
[TABLE]
[TABLE]
[TABLE]
where we used the definition of the mean-field gradient given in Proposition 4. Moreover, in this setting, the maximisation condition in (46) can be rewritten for -almost every as
[TABLE]
Merging this condition with (47), (48) and (49), we recover that satisfies the mean-field Pontryagin Maximum Principle (40) associated with the mean-field Hamiltonian .
We now prove an estimate akin to (45) for the costate variable . Observe that, as a consequence of the uniform bounds of (45) and Proposition 4, it holds for all times and any that
[TABLE]
and
[TABLE]
By invoking the -Wasserstein regularity assumptions (H)- and by Grönwall’s Lemma, we obtain
[TABLE]
for all , where is independent of . Again as a consequence of Proposition 4, it holds
[TABLE]
which is uniformly bounded by hypothesis (H)-, so that
[TABLE]
for all and some uniform constants . Thus, we have shown that there exist two constants independent of , such that
[TABLE]
This concludes the proof of Proposition 6. ∎
We end the first step of our proof by a simple corollary in which we provide a common Lipschitz constant for all the maps involved in that is uniform with respect to .
Corollary 1**.**
Let where is defined as in Proposition 6. Then, there exists a constant such that
[TABLE]
are bounded by and -Lipschitz over uniformly with respect to , and such that the -norms defined in the sense of (19) of the maps
[TABLE]
are bounded by over , uniformly with respect to .
Proof.
This result follows directly from the the Lipschitz regularity (H)- of the velocity field and the -Wasserstein regularity hypotheses (H)-, along with the estimate (20) of Proposition 4. ∎
Step 2 : Construction of Lipschitz-in-space optimal controls for .
In this second step, we associate to any optimal pair for a mean-field optimal control map , which Lipschitz constant with respect to the space variable is uniformly bounded with respect to .
Proposition 7** (Existence of locally optimal uniformly-Lipschitz feedbacks for ).**
Assume that hypotheses (H) hold and let be an optimal Pontryagin triple for in the sense of Proposition 6 along which the mean-field coercivity estimate (CON) holds.
Then, for any , there exists a Lipschitz map such that
[TABLE]
for all times , where is independent of .
Proof.
Recall that first that by Corollary 1, the bounded-Lipschitz norms in and the -norms in of the datum of are uniformly bounded over by a constant . As mentioned in Section 3, Theorem 4 can be applied in provided that (CON) is indeed a strong positive-definiteness condition for the canonical linearised problem associated to . To verify this, consider such that for -almost every and . Then, it holds
[TABLE]
for all times , where is the matrix whose rows are the mean-field gradients with respect to of the components for . Analogously, one also has333Here for convenience, we use the matrix representation (30) introduced in Remark 2 for mean-field Hessians.
[TABLE]
[TABLE]
[TABLE]
as a consequence of the chain rule of Proposition 4. Following [32], it can be checked that the first-order linearisation of the optimality system (40) obtain by combining (52), (53), (54) and (55) is the PMP of
[TABLE]
where the set of admissible controls is defined by
[TABLE]
and the matrices defining the cost functionals write
[TABLE]
for all times . Thus, the coercivity estimate (CON) is indeed a strong positive-definiteness condition for expressed in terms of the differential structure of . Hence, by Theorem 4 applied to , there exists a neighbourhood of and a locally optimal feedback
[TABLE]
such that for all times and
[TABLE]
for any , where depends only on the structural constant introduced in Corollary 1 and on the coercivity constant exhibited in (CON). In particular, is independent of .
For any , we can in turn associate to each agent trajectory the projected control map
[TABLE]
for any , where we introduced the notation
[TABLE]
and where the agent-based neighbourhoods are defined by
[TABLE]
These sets are well-defined and non-empty, since the projection operations onto coordinates are open mappings. Moreover, for any and such that , it holds
[TABLE]
as a consequence of (57). Observe now that by (58), the quantity can be further estimated as
[TABLE]
for all , since for any . By merging (59) and (60), we recover that the maps defined in (56) are -Lipschitz in space over for any .
To conclude the proof of Proposition 7, there remains to “patch together” the locally optimal agent feedbacks defined above. First, observe that since the maps are Lipschitz for any , all the individual agent trajectories are solution of the well-posed Cauchy-Lipschitz ODEs
[TABLE]
for -almost every . Besides, if for some time with , then the fact that is a locally optimal feedback necessarily implies that for all times such that . Thus, no finite-time collisions can occur between agents, so that the sets can be chosen to be disjoint and the map
[TABLE]
is well-defined. By using McShane’s Extension Theorem (see e.g. [36, Theorem 3.1]) combined with a projection on the convex and compact set , one can define a global optimal control map such that for all and
[TABLE]
for -almost every , where the new Lipschitz constant is . ∎
Step 3 : Existence of Lipschitz optimal controls for problem .
In this third step, we show that the sequence of optimal maps constructed in Proposition 7 is compact in a suitable topology and that the limits along subsequences are optimal solutions of problem .
Lemma 4** (Compactness of Lipschitz-in-space optimal maps).**
Let be a positive constant and be a bounded set. Then, the set
[TABLE]
is compact in the weak -topology for any .
Proof.
See e.g. [40, Theorem 2.5]. ∎
This allows to derive the following convergence result on the sequence of controls built in Step 2.
Corollary 2** (Convergence of Lipschitz optimal control).**
There exists a map such that the sequence of Lipschitz optimal controls defined in Proposition 7 converges up to a subsequence towards in the weak -topology for any .
Proof.
This result comes from a direct application of Lemma 4 to the sequence of optimal maps built in Proposition 7 up to choosing and redefining . ∎
We now prove that the generalised optimal control for problem is induced by the Lipschitz-in-space optimal control defined in Corollary 2. By construction, it holds for any that
[TABLE]
where denotes the generalised empirical control measure introduced in Theorem 6. In the following proposition, we prove that the sequence converges weakly-∗ towards .
Lemma 5** (Convergence of generalised Lipschitz optimal controls).**
Let be given by Proposition 6, and be the sequence of optimal measure curves associated with . Let be as in Proposition 7 and be one of its cluster points in the weak -topology for some . Then, converges towards in the weak-∗ topology of .
Proof.
Recall first that the topological dual of the Banach space can be identified with , where is the conjugate exponent of . Hence, the fact that in as can be reformulated as
[TABLE]
for any , where denotes the duality bracket of .
Since we assumed that , it holds by Morrey’s Embedding (see e.g. [12, Theorem 9.12]) that . By taking the topological dual of this inclusion, we obtain that . This relation, combined with (4) and (61), yields
[TABLE]
for any curve and any . Moreover, for each it holds
[TABLE]
The first term in the right-hand side of (63) vanishes as as a consequence of (62). By invoking Kantorovich-Rubinstein duality formula (5) along with the -Lipschitz regularity of the maps , we obtain the following upper bound on the second term in the right-hand side of (63)
[TABLE]
where C_{\xi}:=\pazocal{L}_{U}\max_{t\in[0,T]}\big{(}\left\|\xi(t,\cdot)\right\|_{C^{0}(\Omega)}+\textnormal{Lip}(\xi(t,\cdot);\Omega)\big{)}. Therefore, we recover the convergence result
[TABLE]
for any . Since the measure curves are uniformly compactly supported in , one can show that (64) holds for any by a classical approximation argument (see e.g. [38]). This precisely amounts to saying that as along the same subsequence. ∎
By uniqueness of the weak-∗ limit in , we obtain by combining Lemma 5 with Theorem 6 that the optimal solution of is induced by . Whence the pair is a classical optimal pair for , which concludes the proof of Theorem 2.
5.2 A sufficient condition for coercivity and proof of Theorem 1
In this section, we prove a simple and general sufficient condition for the coercivity estimate (CON) to hold, and use it to deduce Theorem 1 from Theorem 2.
Proposition 8** (A sufficient condition for mean-field coercivity).**
Let and suppose that hypotheses (H) hold. Then, there exists a constant such that, if the control cost is strongly convex with constant , then the coercivity (CON) holds along any optimal mean-field Pontryagin triple with . Moreover, the constant is intrinsic to , in the sense that it only depends on the -Wasserstein norms of the dynamics and cost functionals.
The main ingredient involved in this result is contained in the following technical lemma, which proof is provided for the sake of completeness.
Lemma 6** (-functions are -convex on products of convex compact sets).**
Let be a convex compact set and be -Wasserstein regular with discrete approximating sequence . Then
[TABLE]
for any .
Proof.
Let and . As a consequence of Proposition 4, one can write the following integral Taylor formulas for
[TABLE]
Combining the two equations of (65), it then holds
[TABLE]
where we used the fact that both and belong to , since this set is convex. Therefore, we have shown that the map is -convex over with .
Choosing in particular with small, the -convexity (66) of can be expressed as
[TABLE]
By applying the chain rule (16) to (67), we obtain
[TABLE]
so that dividing by and letting , we finally recover that
[TABLE]
for any . One can finally check that, as a consequence of (17), it holds
[TABLE]
which concludes the proof of our claim, since for any . ∎
Proof of Proposition 8.
As a consequence of hypotheses (H) together with Proposition 4, the partial Hamiltonian and the final cost are -regular uniformly with respect to , with constants that only depend on the -Wasserstein norms of the dynamics and cost functionals, where is given by Proposition 6.
By repeating the Grönwall estimates made on the costate variables in the proof of Proposition 6, one can check that the solutions of the mean-field linearised system described in (CON) are contained in a product of compact sets . Moreover, they also satisfy the estimate
[TABLE]
for a given uniform constant . Merging these facts together along with the statement of Lemma 6, there exists an intrinsic constant independent of such that
[TABLE]
along any linearising pair . Observe now that if is -strongly convex, it also holds
[TABLE]
for any map . Combining (68) and (69), we obtain the uniform coercivity-type estimate
[TABLE]
Therefore, up to choosing a control cost with strong convexity constant , the coercivity estimate (CON) holds along any optimal mean-field Pontryagin triple with . ∎
We can now use this intermediate result together with Theorem 2 to prove Theorem 1.
Proof of Theorem 1.
By Theorem 6 and under hypotheses (H), one can associate to any sequence of uniformly compactly supported measures such that as a sequence of generalised trajectory-control pairs which converges to an optimal pair for .
Moreover, we assumed that is strongly convex with , where is the intrinsic constant introduced in Proposition 8. Thus, the coercivity estimate (CON) holds along any optimal mean-field Pontryagin triple for . Thus, by Theorem 2 there exist a constant together with a mean-field optimal control for such that is -Lipschitz for -almost every . ∎
6 Sharpness of the coercivity estimate (CON)**
In this section, we develop an example in which the mean-field coercivity condition (CON) is both necessary and sufficient for the Lipschitz-in-space regularity of optimal controls. With this goal in mind, we consider the mean-field optimal control problem
[TABLE]
In , one aims at maximising the variance at time of a measure curve starting from the normalised indicator function of , while penalising the running -norm of the control . Here, the set of admissible control values is for a positive constant , and the parameter is the relative weight between the final cost and the control penalisation. It can be verified straightforwardly that this problem satisfies hypotheses (H) of Section 4.
Given a sequence of empirical measures converging in the -metric towards , we can define the family of discretised multi-agent problems associated to as
[TABLE]
where and . As a consequence of Proposition 5, there exists for any an optimal trajectory-control pair solution of . The mean-field Hamiltonian associated with is given by
[TABLE]
By the mean-field PMP of Proposition 6, there exists a covector such that
[TABLE]
Therefore, the optimal covector is constant and uniquely determined via
[TABLE]
for any . As a consequence of the maximisation condition one can express the components of the optimal control explicitly as
[TABLE]
for all , where is the standard projection onto the closed convex set . It follows directly from this expression that
[TABLE]
for all times . In the following lemma, we derive a simple and explicit necessary and sufficient condition such that (CON) holds for .
Lemma 7** (Charaterisation of the coercivity condition for ).**
The mean-field coercivity condition (CON) holds for if and only if . In this case, the optimal coercivity constant is given by .
Proof.
We first compute the Hessians involved in the coercivity estimate. For any , one has
[TABLE]
Let be the solution of the linearised Cauchy problem along a given optimal pair for , which writes
[TABLE]
with . By Cauchy-Schwarz’s inequality, one can estimate as
[TABLE]
which allows us to recover
[TABLE]
Thus, the mean-field coercivity condition (CON) holds whenever .
Conversely, let us choose a constant admissible control perturbation such that . It is always possible to make such a choice, since by (71), there exist at least two indices such that for all times . It is then sufficient to choose such that
[TABLE]
where is a small parameter. As a consequence of (72), the corresponding state perturbation is such that . Moreover, it also holds that
[TABLE]
Therefore, we have shown that this particular linearised trajectory-control pair is such that
[TABLE]
so that is the sharp mean-field coercivity constant of , and (CON) holds if and only if . ∎
Remark 4** (Connection with the sufficient coercivity conditions).**
In Lemma 7, we have proven that the sharpest constant depending for which may serve as a sufficient lower-bound for coercivity via Proposition 8 is given by . Performing the same computations in the context of a final variance minimisation, our sharp constant would be given by , so that (CON) would hold for every .
We can now use this characterisation of the coercivity condition to show that it is itself equivalent to the uniform Lipschitz regularity in space of the optimal controls. For the sake of computational tractability, we will assume that the initial condition is symmetric with respect to the origin and that .
Proposition 9** (Coercivity and regularity for ).**
The following assertions are equivalent.
- (a)
The mean-field coercivity condition holds. 2. (b)
For any sequence of symmetrically distributed empirical measures converging narrowly towards with associated discrete optimal pairs , it holds
[TABLE]
for all times , where is the sharp coercivity constant of .
Proof.
First, suppose that (a) does not hold, i.e. . Since the optimal controls are constant over as a consequence of (71) and we assumed that , the total cost of can be rewritten as
[TABLE]
for any -tuple . Since , the minimum of is achieved by taking for all . This further implies
[TABLE]
so that for any pair of indices such that , it holds
[TABLE]
The fact that as implies that for all , there exists such that for any , there exists at least one pair of indices such that and . Thus, it follows from (73) that (b) fails to hold for some pairs of indices, at least for small times.
Suppose now that (a) is true, i.e. , and denote by the corresponding sharp coercivity constant. Let be the sets of indices defined respectively by
[TABLE]
For sufficiently large, is necessarily non-empty since and narrowly converges towards . Then for any , one has that
[TABLE]
and for any such indices, the optimal controls are given by . In which case, one has
[TABLE]
so that
[TABLE]
for any pair of indices . It can be checked reciprocally that for any , which furthermore yields by (73) that
[TABLE]
Indeed, in this case whenever and . Suppose now that we are given a pair of indices such that and . If , it holds that
[TABLE]
since by definition of . Symmetrically if , one can easily show that
[TABLE]
By merging (74), (75), (76) and (77), we conclude that (b) holds whenever . ∎
In Proposition 9, we have proven that the mean-field coercivity estimate is both necessary and sufficient for the existence of a uniform Lipschitz constant for the sequence of finite-dimensional optimal controls with symmetric initial data. Since we assumed that and , the fact that the initial distribution are symmetric about the origin holds up to a small error as . Observing in addition that for any the discrete optimal trajectory-control pairs are uniquely determined, we conclude that the mean-field coercivity condition (CON) is necessary and sufficient in the limit for the existence of a Lipschitz-in-space optimal control for .
Acknowledgements:
This research was partially supported by the Padua University grant SID 2018 “Controllability, stabilizability and infimun gaps for control systems”, prot. BIRD 187147. The first author was supported by the Archimède Labex (ANR-11-LABX-0033) and by the A*MIDEX project (ANR-11-IDEX-0001-02), funded by the “Investissements d’Avenir” French Government program managed by the French National Research Agency (ANR).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Y. Achdou and M. Laurière. On the System of Partial Differential Equations Arising in Mean Field type Control. Discrete and Continuous Dynamical Systems , 35(9):3879–3900, 2015.
- 2[2] L. Ambrosio. Transport Equation and Cauchy Problem for BV Vector Fields. Inventiones Mathematicae , 158(2):227–260, 2004.
- 3[3] L. Ambrosio and G. Crippa. Continuity Equations and ODE Flows with Non-Smooth Velocities. Proceedings of the Royal Society of Edinburgh , 144(6):1191–1244, 2014.
- 4[4] L. Ambrosio, N. Fusco, and D. Pallara. Functions of Bounded Variations and Free Discontinuity Problems . Oxford Mathematical Monographs, 2000.
- 5[5] L. Ambrosio, N. Gigli, and G. Savaré. Gradient Flows in Metric Spaces and in the Space of Probability Measures . Lectures in Mathematics ETH Zürich. Birkhäuser Verlag, 2008.
- 6[6] N. Bellomo, P. Degond, E. Tadmor, et al. Active Particles, Volume 1: Advances in Theory, Models, and Applications . Springer, 2017.
- 7[7] M. Bongini, M. Fornasier, F. Rossi, and F. Solombrino. Mean Field Pontryagin Maximum Principle. Journal of Optimization Theory and Applications , 175:1–38, 2017.
- 8[8] B. Bonnet. A Pontryagin Maximum Principle in Wasserstein Spaces for Constrained Optimal Control Problems. ESAIM COCV , 25(52), 2019.
