ACUMES aims at developing a rigorous framework for numerical simulations and optimal control for transportation and buildings, with focus on multi-scale, heterogeneous, unsteady phenomena subject to uncertainty. Starting from established macroscopic Partial Differential Equation (PDE) models, we pursue a set of innovative approaches to include small-scale phenomena, which impact the whole system. Targeting applications contributing to sustainability of urban environments, we couple the resulting models with robust control and optimization techniques.

Modern engineering sciences make an important use of mathematical models and numerical simulations at the conception stage. Effective models and efficient numerical tools allow for optimization before production and to avoid the construction of expensive prototypes or costly post-process adjustments. Most up-to-date modeling techniques aim at helping engineers to increase performances and safety and reduce costs and pollutant emissions of their products. For example, mathematical traffic flow models are used by civil engineers to test new management strategies in order to reduce congestion on the existing road networks and improve crowd evacuation from buildings or other confined spaces without constructing new infrastructures. Similar models are also used in mechanical engineering, in conjunction with concurrent optimization methods, to reduce energy consumption, noise and pollutant emissions of cars, or to increase thermal and structural efficiency of buildings while, in both cases, reducing ecological costs.

Nevertheless, current models and numerical methods exhibit some limitations:

This project focuses on the analysis and optimal control of classical and non-classical evolutionary systems of Partial Differential Equations (PDEs) arising in the modeling and optimization of engineering problems related to safety and sustainability of urban environments, mostly involving fluid-dynamics and structural mechanics. The complexity of the involved dynamical systems is expressed by multi-scale, time-dependent phenomena, possibly subject to uncertainty, which can hardly be tackled using classical approaches, and require the development of unconventional techniques.

The project develops along the following two axes:

These themes are motivated by the specific problems treated in the applications, and represent important and up-to-date issues in engineering sciences. For example, improving the design of transportation means and civil buildings, and the control of traffic flows, would result not only in better performances of the object of the optimization strategy (vehicles, buildings or road networks level of service), but also in enhanced safety and lower energy consumption, contributing to reduce costs and pollutant emissions.

Dynamical models consisting of evolutionary PDEs, mainly of hyperbolic type, appear classically in the applications studied by the previous Project-Team Opale (compressible flows, traffic, cell-dynamics, medicine, etc). Yet, the classical purely macroscopic approach is not able to account for some particular phenomena related to specific interactions occurring at smaller scales. These phenomena can be of greater importance when dealing with particular applications, where the "first order" approximation given by the purely macroscopic approach reveals to be inadequate. We refer for example to self-organizing phenomena observed in pedestrian flows 109, or to the dynamics of turbulent flows for which large scale / small scale vortical structures interfere 136.

Nevertheless, macroscopic models offer well known advantages, namely a sound analytical framework, fast numerical schemes, the presence of a low number of parameters to be calibrated, and efficient optimization procedures. Therefore, we are convinced of the interest of keeping this point of view as dominant, while completing the models with information on the dynamics at the small scale / microscopic level. This can be achieved through several techniques, like hybrid models, homogenization, mean field games. In this project, we will focus on the aspects detailed below.

The development of adapted and efficient numerical schemes is a mandatory completion, and sometimes ingredient, of all the approaches listed below. The numerical schemes developed by the team are based on finite volumes or finite elements techniques, and constitute an important tool in the study of the considered models, providing a necessary step towards the design and implementation of the corresponding optimization algorithms, see Section 3.3.

Modeling of complex problems with a dominant macroscopic point of view often requires couplings with small scale descriptions. Accounting for systems heterogeneity or different degrees of accuracy usually leads to coupled PDE-ODE systems.

In the case of heterogeneous problems the coupling is "intrinsic", i.e. the two models evolve together and mutually affect each-other. For example, accounting for the impact of a large and slow vehicle (like a bus or a truck) on traffic flow leads to a strongly coupled system consisting of a (system of) conservation law(s) coupled with an ODE describing the bus trajectory, which acts as a moving bottleneck. The coupling is realized through a local unilateral moving constraint on the flow at the bus location, see 80 for an existence result and 65, 79 for numerical schemes.

If the coupling is intended to offer higher degree of accuracy at some locations, a macroscopic and a microscopic model are connected through an artificial boundary, and exchange information across it through suitable boundary conditions. See 71, 97 for some applications in traffic flow modelling, and 90, 94, 96 for applications to cell dynamics.

The corresponding numerical schemes are usually based on classical finite volume or finite element methods for the PDE, and Euler or Runge-Kutta schemes for the ODE, coupled in order to take into account the interaction fronts. In particular, the dynamics of the coupling boundaries require an accurate handling capturing the possible presence of non-classical shocks and preventing diffusion, which could produce wrong solutions, see for example 65, 79.

We plan to pursue our activity in this framework, also extending the above mentioned approaches to problems in two or higher space dimensions, to cover applications to crowd dynamics or fluid-structure interaction.

Rigorous derivation of macroscopic models from microscopic ones offers a sound basis for the proposed modeling approach, and can provide alternative numerical schemes, see for example 72, 85 for the derivation of Lighthill-Whitham-Richards 122, 135 traffic flow model from Follow-the-Leader and 91 for results on crowd motion models (see also 112). To tackle this aspect, we will rely mainly on two (interconnected) concepts: measure-valued solutions and mean-field limits.

The notion of measure-valued solutions for conservation laws was first introduced by DiPerna 86, and extensively used since then
to prove convergence of approximate solutions and deduce existence results, see for example 92 and references therein.
Measure-valued functions have been recently advocated as the appropriate notion of solution
to tackle problems for which
analytical results (such as existence and uniqueness of weak solutions in distributional sense) and numerical convergence are missing 54, 93.
We refer, for example,
to the notion of solution for non-hyperbolic systems 99, for which no general theoretical result is available at present,
and to the convergence of finite volume schemes for systems of hyperbolic conservation laws in several space dimensions, see 93.

In this framework, we plan to investigate and make use of measure-based PDE models for vehicular and pedestrian traffic flows.
Indeed, a modeling approach based on (multi-scale) time-evolving measures (expressing the agents probability distribution in space)
has been recently introduced (see the monograph 76),
and proved to be successful for studying emerging self-organised flow patterns 75.
The theoretical measure framework proves to be also relevant in addressing micro-macro limiting procedures
of mean field type 100, where one lets the number of agents going to infinity, while keeping the
total mass constant. In this case, one must prove that the empirical measure, corresponding to the sum of Dirac measures concentrated at the agents positions, converges to a measure-valued solution of the corresponding
macroscopic evolution equation.
We recall that a key ingredient in this approach is the use of the Wasserstein distances 144, 143.
Indeed, as observed in 129, the usual

This procedure can potentially be extended to more complex configurations, like for example road networks or different classes of interacting agents, or to other application domains, like cell-dynamics.

Another powerful tool we shall consider to deal with micro-macro limits is the so-called Mean Field Games (MFG)
technique (see the seminal paper 121).
This approach has been recently applied to some of the systems studied by the team, such as traffic flow and cell dynamics.
In the context of crowd dynamics, including the case of several populations with different targets, the mean field game approach has been adopted in 61, 62, 87, 120, under the assumption
that the individual behavior evolves according to a stochastic process, which gives rise to parabolic equations greatly simplifying the analysis of the system.
Besides, a deterministic context is studied in 131, which considers a non-local velocity field.
For cell dynamics, in order to take into account the fast processes that occur in the migration-related machinery, a framework such the one developed in 78 to handle games "where agents evolve their strategies according to the best-reply scheme on a much faster time scale than their social configuration variables" may turn out to be suitable. An alternative framework to MFG is also considered. This framework is based on the formulation of -Nash- games constrained by the Fokker-Planck (FP, 52) partial differential equations that govern the time evolution of the probability density functions -PDF- of stochastic systems and on objectives that may require to follow a given PDF trajectory or to minimize an expectation functional.

Non-local interactions can be described through macroscopic models based on integro-differential equations. Systems of the type

where

General analytical results on non-local conservation laws, proving existence and possibly uniqueness of solutions of the Cauchy problem for (1),
can be found in 50
for scalar equations in one space dimension (

Relying on these encouraging results, we aim to push a step further the analytical and numerical study of non-local models of type (1), in particular concerning well-posedness of initial - boundary value problems, regularity of solutions and high-order numerical schemes.

Different sources of uncertainty can be identified in PDE models, related to the fact that the problem of interest is not perfectly known. At first, initial and boundary condition values can be uncertain. For instance, in traffic flows, the time-dependent value of inlet and outlet fluxes, as well as the initial distribution of vehicles density, are not perfectly determined 63. In aerodynamics, inflow conditions like velocity modulus and direction, are subject to fluctuations 108, 127. For some engineering problems, the geometry of the boundary can also be uncertain, due to structural deformation, mechanical wear or disregard of some details 89. Another source of uncertainty is related to the value of some parameters in the PDE models. This is typically the case of parameters in turbulence models in fluid mechanics, which have been calibrated according to some reference flows but are not universal 137, 142, or in traffic flow models, which may depend on the type of road, weather conditions, or even the country of interest (due to differences in driving rules and conductors behaviour). This leads to equations with flux functions depending on random parameters 138, 141, for which the mean and the variance of the solutions can be computed using different techniques. Indeed, uncertainty quantification for systems governed by PDEs has become a very active research topic in the last years. Most approaches are embedded in a probabilistic framework and aim at quantifying statistical moments of the PDE solutions, under the assumption that the characteristics of uncertain parameters are known. Note that classical Monte-Carlo approaches exhibit low convergence rate and consequently accurate simulations require huge computational times. In this respect, some enhanced algorithms have been proposed, for example in the balance law framework 126. Different approaches propose to modify the PDE solvers to account for this probabilistic context, for instance by defining the non-deterministic part of the solution on an orthogonal basis (Polynomial Chaos decomposition) and using a Galerkin projection 108, 118, 123, 146 or an entropy closure method 84, or by discretizing the probability space and extending the numerical schemes to the stochastic components 46. Alternatively, some other approaches maintain a fully deterministic PDE resolution, but approximate the solution in the vicinity of the reference parameter values by Taylor series expansions based on first- or second-order sensitivities 132, 142, 145.

Our objective regarding this topic is twofold. In a pure modeling perspective, we aim at including uncertainty quantification in models calibration and validation for predictive use. In this case, the choice of the techniques will depend on the specific problem considered 55. Besides, we plan to extend previous works on sensitivity analysis 89, 124 to more complex and more demanding problems. In particular, high-order Taylor expansions of the solution (greater than two) will be considered in the framework of the Sensitivity Equation Method 58 (SEM) for unsteady aerodynamic applications, to improve the accuracy of mean and variance estimations. A second targeted topic in this context is the study of the uncertainty related to turbulence closure parameters, in the sequel of 142. We aim at exploring the capability of the SEM approach to detect a change of flow topology, in case of detached flows. Our ambition is to contribute to the emergence of a new generation of simulation tools, which will provide solution densities rather than values, to tackle real-life uncertain problems. This task will also include a reflection about numerical schemes used to solve PDE systems, in the perspective of constructing a unified numerical framework able to account for exact geometries (isogeometric methods), uncertainty propagation and sensitivity analysis w.r.t. control parameters.

The non-classical models described above are developed in the perspective of design improvement for real-life applications. Therefore, control and optimization algorithms are also developed in conjunction with these models. The focus here is on the methodological development and analysis of optimization algorithms for PDE systems in general, keeping in mind the application domains in the way the problems are mathematically formulated.

Adjoint methods (achieved at continuous or discrete level) are now commonly used in industry for steady PDE problems. Our recent developments 134 have shown that the (discrete) adjoint method can be efficiently applied to cost gradient computations for time-evolving traffic flow on networks, thanks to the special structure of the associated linear systems and the underlying one dimensionality of the problem. However, this strategy is questionable for more complex (e.g. 2D/3D) unsteady problems, because it requires sophisticated and time-consuming check-pointing and/or re-computing strategies 53, 103 for the backward time integration of the adjoint variables. The sensitivity equation method (SEM) offers a promising alternative 88, 113, if the number of design parameters is moderate. Moreover, this approach can be employed for other goals, like fast evaluation of neighboring solutions or uncertainty propagation 89.

Regarding this topic, we intend to apply the continuous sensitivity equation method to challenging problems. In particular, in aerodynamics, multi-scale turbulence models like Large-Eddy Simulation (LES) 136 , Detached-Eddy Simulation (DES) 140 or Organized-Eddy Simulation (OES) 59, are more and more employed to analyse the unsteady dynamics of the flows around bluff-bodies, because they have the ability to compute the interactions of vortices at different scales, contrary to classical Reynolds-Averaged Navier-Stokes models. However, their use in design optimization is tedious, due to the long time integration required. In collaboration with turbulence specialists (M. Braza, CNRS - IMFT), we aim at developing numerical methods for effective sensitivity analysis in this context, and apply them to realistic problems, like the optimization of active flow control devices. Note that the use of SEM allows computing cost functional gradients at any time, which permits to construct new gradient-based optimization strategies like instantaneous-feedback method 116 or multiobjective optimization algorithm (see section below).

A major difficulty in shape optimization is related to the multiplicity of geometrical representations handled during the design process. From high-order Computer-Aided Design (CAD) objects to discrete mesh-based descriptions, several geometrical transformations have to be performed, that considerably impact the accuracy, the robustness and the complexity of the design loop. This is even more critical when multiphysics applications are targeted, including moving bodies.

To overcome this difficulty, we intend to investigate isogeometric analysis114 methods, which propose to use the same CAD representations for the computational domain and the physical solutions yielding geometrically exact simulations. In particular, hyperbolic systems and compressible aerodynamics are targeted.

In differentiable optimization, multi-disciplinary, multi-point, unsteady optimization or robust-design can all be formulated as
multi-objective optimization problems. In this area, we have proposed the Multiple-Gradient Descent Algorithm (MGDA)
to handle all criteria concurrently 8281.
Originally, we have stated a principle according which,
given a family of local gradients, a descent direction common to all considered
objective-functions simultaneously is identified, assuming the Pareto-stationarity condition is not satisfied.
When the family is linearly-independent, we dispose of a direct algorithm.
Inversely, when the family is linearly-dependent, a quadratic-programming problem should be solved.
Hence, the technical difficulty is mostly conditioned by the number

The multi-point situation is very similar and, being of great importance for engineering applications, will be treated at large.

Moreover, we intend to develop and test a new methodology for robust design that will include uncertainty effects. More precisely, we propose to employ MGDA to achieve an effective improvement of all criteria simultaneously, which can be of statistical nature or discrete functional values evaluated in confidence intervals of parameters. Some recent results obtained at ONERA 130 by a stochastic variant of our methodology confirm the viability of the approach. A PhD thesis has also been launched at ONERA/DADS.

Lastly, we note that in situations where gradients are difficult to evaluate, the method can be assisted by a meta-model 148.

Bayesian Optimization (BO) relies on Gaussian processes, which are used as emulators (or surrogates) of the black-box model outputs based on a small set of model evaluations. Posterior distributions provided by the Gaussian process are used to design acquisition functions that guide sequential search strategies that balance between exploration and exploitation. Such approaches have been transposed to frameworks other than optimization, such as uncertainty quantification. Our aim is to investigate how the BO apparatus can be applied to the search of general game equilibria, and in particular the classical Nash equilibrium (NE). To this end, we propose two complementary acquisition functions, one based on a greedy search approach and one based on the Stepwise Uncertainty Reduction paradigm 95. Our proposal is designed to tackle derivative-free, expensive models, hence requiring very few model evaluations to converge to the solution.

Most if not all the mathematical formulations of inverse problems (a.k.a. reconstruction, identification, data recovery, non destructive engineering,...) are known to be ill posed in the Hadamard sense. Indeed, in general, inverse problems try to fulfill (minimize) two or more very antagonistic criteria. One classical example is the Tikhonov regularization, trying to find artificially smoothed solutions close to naturally non-smooth data.

We consider here the theoretical general framework of parameter identification coupled to (missing) data recovery. Our aim is to design, study and implement algorithms derived within a game theoretic framework, which are able to find, with computational efficiency, equilibria between the "identification related players" and the "data recovery players". These two parts are known to pose many challenges, from a theoretical point of view, like the identifiability issue, and from a numerical one, like convergence, stability and robustness problems. These questions are tricky 48 and still completely open for systems like e.g. coupled heat and thermoelastic joint data and material detection.

The reduction of CO2 emissions represents a great challenge for the automotive and aeronautic industries, which committed respectively a decrease of 20% for 2020 and 75% for 2050. This goal will not be reachable, unless a significant improvement of the aerodynamic performance of cars and aircrafts is achieved (e.g. aerodynamic resistance represents 70% of energy losses for cars above 90 km/h). Since vehicle design cannot be significantly modified, due to marketing or structural reasons, active flow control technologies are one of the most promising approaches to improve aerodynamic performance. This consists in introducing micro-devices, like pulsating jets or vibrating membranes, that can modify vortices generated by vehicles. Thanks to flow non-linearities, a small energy expense for actuation can significantly reduce energy losses. The efficiency of this approach has been demonstrated, experimentally as well as numerically, for simple configurations 147.

However, the lack of efficient and flexible numerical tools, that allow to simulate and optimize a large number of such devices on realistic configurations, is still a bottleneck for the emergence of this technology in industry. The main issue is the necessity of using high-order schemes and complex models to simulate actuated flows, accounting for phenomena occurring at different scales. In this context, we intend to contribute to the following research axes:

Intelligent Transportation Systems (ITS) is nowadays a booming sector, where the contribution of mathematical modeling and optimization is widely recognized. In this perspective, traffic flow models are a commonly cited example of "complex systems", in which individual behavior and self-organization phenomena must be taken into account to obtain a realistic description of the observed macroscopic dynamics 110. Further improvements require more advanced models, keeping into better account interactions at the microscopic scale, and adapted control techniques, see 60 and references therein.

In particular, we will focus on the following aspects:

The latest statistics published by the International Agency for Research on Cancer show that in 2018, 18.1 million new cancer cases have been identified and 9.6 million deaths have been recorded worldwide making it the second leading cause of death globally. Prostate cancer ranks third in incidence with 1.28 million cases and represents the second most commonly diagnosed male cancer.

Prostate cells need the hormone androgen to survive and function properly. For this to happen, the androgens have to bind to a protein in the prostate cells called Androgen Receptor and activate it. Since androgens act as a growth factor for the cells, one way of treating prostate cancer is through the antihormone therapy that hinder its activity. The Androgen Deprivation Therapy (ADT) aims to either reduce androgen production or to stop the androgens form working through the use of drugs. However, over time, castration-resistant cells that are able to sustain growth in a low androgen environment emerge. The castration-resistant cells can either be androgen independent or androgen repressed meaning that they have a negative growth rate when the androgen is abundant in the prostate. In order to delay the development of castration resistance and reduce its occurrence, the Intermittent Androgen Deprivation Therapy is used.

On the other hand, brachytherapy is an effective radiation therapy used in the treatment of prostate cancer by placing a sealed radiation source inside the prostate gland. It can be delivered in high dose rates (HDR) or low dose rates (LDR) depending on the radioactive source used and the duration of treatment.

In the HDR brachytherapy the source is placed temporarily in the prostate for a few minutes to deliver high dose radiation while for the LDR brachytherapy low radiations dose are delivered from radioactive sources permanently placed in the prostate. The radioactivity of the source decays over time, therefore its presence in the prostate does not cause any long-term concern as its radioactivity disappears eventually. In practice, brachytherapy is prescribed either as monotherapy, often for localized tumors, or combined with another therapy such as external beam radiation therapy for which the total dose prescribed is divided between internal and external radiation. Brachytherapy can also be prescribed in combination with hormone therapy.

However, in the existing literature there is currently no mathematical model that explores this combination of treatments. Our aim is to develop a computational model based on partial differential equations to assess the effectiveness of combining androgen deprivation therapy with brachytherapy in the treatment of prostate cancer. The resulting simulations can be used to explore potential unconventional therapeutic strategies.

Besides the above mentioned axes, which constitute the project's identity, the methodological tools described in Section have a wider range of application. We currently carry on also the following research actions, in collaboration with external partners.

Game strategies for thermoelastography.
Thermoelastography is an innovative non-invasive control technology, which has numerous advantages over other techniques, notably in medical imaging 125. Indeed,
it is well known that most pathological changes are associated with changes in tissue stiffness, while remaining isoechoic, and hence difficult to detect by ultrasound techniques.
Based on elastic waves and heat flux reconstruction, thermoelastography shows no destructive or aggressive medical sequel, unlike X-ray and comparables techniques, making it a potentially prominent choice for patients.

Physical principles of thermoelastography originally rely on dynamical structural responses of tissues, but as a first approach, we only consider static responses of linear elastic structures.

The mathematical formulation of the thermoelasticity reconstruction is based on data completion and material identification, making it a harsh ill posed inverse problem. In previous works 105, 117, we have demonstrated that Nash game approaches are efficient to tackle ill-posedness. We intend to extend the results obtained for Laplace equations in 105, and the algorithms developed in Section 3.3.5 to the following problems (of increasing difficulty):

- Simultaneous data and parameter recovery in linear elasticity, using the so-called Kohn and Vogelius functional (ongoing work, some promising results obtained).

- Data recovery in coupled heat-thermoelasticity systems.

- Data recovery in linear thermoelasticity under stochastic heat flux, where the imposed flux is stochastic.

- Data recovery in coupled heat-thermoelasticity systems under stochastic heat flux, formulated as an incomplete information Nash game.

- Application to robust identification of cracks.

Constraint elimination in Quasi-Newton methods.
In single-objective differentiable optimization, Newton's method requires the specification of both gradient and Hessian.
As a result, the convergence is quadratic, and Newton's method is often considered as the target reference.
However, in applications to distributed systems, the functions to be minimized are usually “functionals”, which
depend on
the optimization variables by the solution of an often complex set of PDE's,
through a chain of computational procedures.
Hence,
the exact calculation of the full Hessian becomes a complex and costly computational endeavor.

This has fostered the development of
quasi-Newton's methods that mimic Newton's method but use only the gradient, the Hessian being iteratively
constructed by successive approximations inside the algorithm itself. Among such methods,
the Broyden-Fletcher-Goldfarb-Shanno (BFGS) algorithm is well-known and commonly employed.
In this method, the Hessian is corrected at each new iteration by rank-one matrices defined from several evaluations
of the gradient only. The BFGS method has "super-linear convergence".

For constrained problems,
certain authors have developed so-called
Riemannian BFGS, e.g. 133, that have the desirable convergence property in
constrained problems. However, in this approach, the constraints are assumed to be known formally,
by explicit expressions.

In collaboration with ONERA-Meudon, we are exploring the possibility of representing constraints, in successive iterations, through local approximations of the constraint surfaces, splitting the design space locally into tangent and normal sub-spaces, and eliminating the normal coordinates through a linearization, or more generally a finite expansion, and applying the BFGS method through dependencies on the coordinates in the tangent subspace only. Preliminary experiments on the difficult Rosenbrock test-case, although in low dimensions, demonstrate the feasibility of this approach. On-going research is on theorizing this method, and testing cases of higher dimensions.

Multi-objective optimization for nanotechnologies.
Our team takes part in a larger collaboration with CEA/LETI (Grenoble),
initiated by the Inria Project-Team Nachos (now Atlantis), and related to the Maxwell equations.
Our component in this activity relates to the optimization of nanophotonic devices,
in particular with respect to the control of thermal loads.
We have first identified a gradation of representative test-cases of increasing complexity:

- infrared micro-source;

- micro-photoacoustic cell;

- nanophotonic device.

These cases involve from a few geometric parameters to be optimized to a functional minimization subject to a finite-element solution involving a large number of dof's. CEA disposes of such codes, but considering the computational cost of the objective functions in the complex cases, the first part of our study is focused on the construction and validation of meta-models, typically of RBF-type. Multi-objective optimization will be carried out subsequently by MGDA, and possibly Nash games.

The research conducted with the startup Mycophyto aims at reducing the use of chemical fertilisers and phytopharmaceutical products by developing natural biostimulants (mycorrhyzal fungi). It started with the arrival of Khadija Musayeva in October 2020.

Acumes's research activity in traffic modeling and control is intended to improve road network efficiency, thus reducing energy consumption and pollutant emission.

Regarding the impact on health care, our research activity and preliminary results on hormono-radio therapies for prostate cancer show that combining hormone therapy with brachytherapy allowed us to reduce the radiative dose used from 120Gy to 80Gy. When the treatments are given at the same time, the final tumor volume is significantly reduced compared to using each therapy separately. The outcomes for public health in terms of financial cost and limitations of undesired side effects is of very high potential.

The research activities related to isogeometric analysis aim at facilitating the use of shape optimization methods in engineering, yielding a gain of efficiency, for instance in transportation industry (cars, aircrafts) or energy industry (air conditioning, turbines).

M. Binois received the ENBIS 2022 Young Statistician Award and a prix innovation et recherche appliquée by Université Côte d'Azur.

A. Bayen, M.L. Delle Monache, M. Garavello, P. Goatin and B. Piccoli, Control Problems for Conservation Laws with Traffic Applications: Modeling, Analysis, and Numerical Methods, Progress in Nonlinear Differential Equations and Their Applications (Vol. 99), Springer Nature (2022). 36

The software relies upon a basic MGDA tool which permits to calculate a descent direction common to an arbitrary set of cost functions whose gradients at a computational point are provided by the user, as long as a solution exists, that is, with the exclusion of a Pareto-stationarity situation.

More specifically, the basic software computes a vector d whose scalar product with each of the given gradients (or directional derivative) is positive. When the gradients are linearly independent, the algorithm is direct following a Gram-Schmidt orthogonalization. Otherwise, a sub-family of the gradients is identified according to a hierarchical criterion as a basis of the spanned subspace associated with a cone that contains almost all the gradient directions. Then, one solves a quadratic programming problem formulated in this basis.

This basic tool admits the following extensions: - constrained multi-objective optimization - prioritized multi-objective optimization - stochastic multi-objective optimization.

Chapter 1: Basic MGDA tool Software to compute a descent direction common to an arbitrary set of cost functions whose gradients are provided in situations other than Pareto stationarity.

Chapter 2: Directions for solving a constrained problem Guidelines and examples are provided according the Inria research report 9007 for solving constrained problems by a quasi-Riemannian approach and the basic MGDA tool.

Chapter 3: Tool for prioritized optimization Software permitting to solve a multi-objective optimization problem in which the cost functions are defined by two subsets: - a primary subset of cost functions subject to constraints for which a Pareto optimal point is provided by the user (after using the previous tool or any other multiobjective method, possibly an evolutionary algorithm) - a secondary subset of cost functions to be reduced while maintaining quasi Pareto optimality of the first set. Procedures defining the cost and constraint functions, and a small set of numerical parameters are uploaded to the platform by an external user. The site returns an archive containing datafiles of results including graphics automatically generated.

Chapter 4: Stochastic MGDA Information and bibliographic references about SMGDA, an extension of MGDA applicable to certain stochastic formulations.

Concerning Chapter 1, the utilization of the platform can be made via two modes : – the interactive mode, through a web interface that facilitates the data exchange between the user and an Inria dedicated machine, – the iterative mode, in which the user downloads the object library to be included in a personal optimization software. Concerning Chapters 2 and 3, the utilizer specifies cost and constraint functions by providing procedures compatible with Fortran 90. Chapter 3 does not require the specification of gradients, but only the functions themselves that are approximated by the software by quadratic meta-models.

Traffic control by Connected and Automated Vehicles

We present a general multi-scale approach for modeling the interaction of controlled and automated vehicles (CAVs) with the surrounding traffic flow. The model consists of a scalar conservation law for the bulk traffic, coupled with ordinary differential equations describing the possibly interacting CAV trajectories. The coupling is realized through flux constraints at the moving bottleneck positions, inducing the formation of non-classical jump discontinuities in the traffic density. In turn, CAVs are forced to adapt their speed to the downstream traffic average velocity in congested situations. We analyze the model solutions in a Riemann-type setting, and propose an adapted finite volume scheme to compute approximate solutions for general initial data. The work paves the way to the study of general optimal control strategies for CAV velocities, aiming at improving the overall traffic flow by reducing congestion phenomena and the associated externalities. Controlling CAV desired speeds allows to act on the system to minimize any traffic density dependent cost function. More precisely, we apply Model Predictive Control (MPC) to reduce fuel consumption in congested situations.

Traffic flow model calibration by statistical approaches

In the framework of A. Würth's PhD thesis, we employ a Bayesian approach including a bias term to estimate first and second order model parameters, based on two traffic data sets: a set of loop detector data located on the A50 highway between Marseille and Aubagne provided by DirMED, and publicly available data from the Minnesota Department of transportation (MnDOT).
In 30, we propose a Bayesian approach for parameter uncertainty quantification in macroscopic traffic flow models from cross-sectional data. A bias term is introduced and modeled as a Gaussian process to account for the traffic flow models limitations. We validate the results comparing the error metrics of both first and second order models, showing that second order models globally perform better in reconstructing traffic quantities of interest.

Besides, we proved an existence result for the associated initial-boundary value problem for general second order macroscopic models in 43.

Routing strategies in traffic flows on networks

In 42, we introduce a macroscopic differential model coupling a conservation law with a Hamilton-Jacobi equation to respectively model the nonlinear transportation process and the strategic choices of users. Furthermore, the model is adapted to the multi-population case, where every population differs in the level of traffic information about the system. This enables us to study the impact of navigation choices on traffic flows on road networks.

The co-existence of different geometrical representations in the design loop (CAD-based and mesh-based) is a real bottleneck for the application of design optimization procedures in industry, yielding a major waste of human time to convert geometrical data. Isogeometric analysis methods, which consists in using CAD bases like NURBS in a Finite-Element framework, were proposed a decade ago to facilitate interactions between geometry and simulation domains.

We investigate the extension of such methods to Discontinuous Galerkin (DG) formulations, which are better suited to hyperbolic or convection-dominated problems. Specifically, we develop a DG method for compressible Euler and Navier-Stokes equations, based on rational parametric elements, that preserves exactly the geometry of boundaries defined by NURBS, while the same rational approximation space is adopted for the solution. The following research axes are considered in this context:

Arbitrary Eulerian-Lagrangian formulation for high-order meshes

To enable the simulation of flows around moving or deforming bodies, an Arbitrary Eulerian-Lagrangian (ALE) formulation is proposed in the context of the isogeometric DG method. It relies on a NURBS-based grid velocity field, integrated along time over moving NURBS elements. The approach has been applied to the simulation of morphing airfoils 28.

Geometrically exact sliding interfaces

In the context of rotating machines (compressors, turbines, etc), computations are achieved using a rotating inner grid interfaced to an outer fixed grid. This coupling is cumbersome using classical piecewise-linear grids due to a lack of common geometrical interface. Thus, we have developed a method based on a geometrically exact sliding interface using NURBS elements, ensuring a fully conservative scheme 27.

Isogeometric shape optimization

We develop an optimization procedure entirely based on NURBS representations. The mesh, the shape to be optimized, as well as the flow solutions are represented by NURBS, which avoid any geometrical conversion and allows to exploit NURBS properties regarding regularity or hierarchy. The approach has also been employed in the framework of Bayesian optimization for airfoil design 28, 34.

Bayesian optimization of nano-photonic devices

In collaboration with Atlantis Project-Team, we consider the optimization of optical meta-surface devices, which are able to alter light properties by operating at nano-scale. In the context of Maxwell equations, modified to account for nano-scale phenomena, the geometrical properties of materials are optimized to achieve a desired electromagnetic wave response, such as change of polarization, intensity or direction. This task is especially challenging due to the computational cost related to the 3D time-accurate simulations, the difficulty to handle the different geometrical scales in optimization and the presence of uncertainties 35.

Massively parallel Bayesian optimization

Motivated by a large scale multi-objective optimization problem for which thousands of evaluations can be conducted in parallel, we develop an efficient approach to tackle this issue in 39.

One way to reduce the time of conducting optimization studies is to evaluate designs in parallel rather than just one-at-a-time. For expensive-to-evaluate black-boxes, batch versions of Bayesian optimization have been proposed. They work by building a surrogate model of the black-box that can be used to select the designs to evaluate efficiently via an infill criterion. Still, with higher levels of parallelization becoming available, the strategies that work for a few tens of parallel evaluations become limiting, in particular due to the complexity of selecting more evaluations. It is even more crucial when the black-box is noisy, necessitating more evaluations as well as repeating experiments. Here we propose a scalable strategy that can keep up with massive batching natively, focused on the exploration/exploitation trade-off and a portfolio allocation. We compare the approach with related methods on deterministic and noisy functions, for mono and multiobjective optimization tasks. These experiments show similar or better performance than existing methods, while being orders of magnitude faster.

Multi-fidelity modeling and optimization

To reduce the computational cost related to the use of high-fidelity simulations when evaluating the cost function, we investigate the construction of multi-fidelity auto-regressive Gaussian Process models, that can rely on different physical models (e.g. inviscid or viscous flows) or numerical accuracy (e.g. coarse or fine meshes). The objective is to construct a model that is accurate regarding the high-fidelity evaluations, but mostly based on low-fidelity simulations. Of particular interest is the definition of an efficient acquisition function, that selects both the next design point to evaluate and the corresponding fidelity level to use. This work is achieved in collaboration with SecondMind company and was the topic of Maha Ouali's internship.

Besides Bayesian optimization as above, Gaussian processes are useful for a variety of other related tasks. Here we first present a method to deal with non-stationarity of the process, handling global and local scales. Secondly, we review the state of the art for high-dimensional GP modeling.

Sensitivity prewarping for local surrogate modeling

In the continual effort to improve product quality and decrease operations costs, computational modeling is increasingly being deployed to determine feasibility of product designs or configurations. Surrogate modeling of these computer experiments via local models, which induce sparsity by only considering short range interactions, can tackle huge analyses of complicated input-output relationships. However, narrowing focus to local scale means that global trends must be re-learned over and over again. In 31, we propose a framework for incorporating information from a global sensitivity analysis into the surrogate model as an input rotation and rescaling preprocessing step. We discuss the relationship between several sensitivity analysis methods based on kernel regression before describing how they give rise to a transformation of the input variables. Specifically, we perform an input warping such that the "warped simulator" is equally sensitive to all input directions, freeing local models to focus on local dynamics. Numerical experiments on observational data and benchmark test functions, including a high-dimensional computer simulator from the automotive industry, provide empirical validation.

A survey on high-dimensional Gaussian process modeling with application to Bayesian optimization

In 22 we propose a review of high-dimensional GP modeling. Extending the efficiency of Bayesian optimization (BO) to larger number of parameters has received a lot of attention over the years. Even more so has Gaussian process regression modeling in such contexts, on which most BO methods are based. A variety of structural assumptions have been tested to tame high dimension, ranging from variable selection and additive decomposition to low dimensional embeddings and beyond. Most of these approaches in turn require modifications of the acquisition function optimization strategy as well. Here we review the defining assumptions, and discuss the benefits and drawbacks of these approaches in practice.

In 44, to prepare for the analysis of complex biological data, this work focuses on multi-label learning from small number of labelled data. We demonstrate that the straightforward binary-relevance extension of the interpolated label propagation algorithm, the harmonic function, is a competitive learning method with respect to many widely-used evaluation measures. This is achieved mainly by a new transition matrix that better captures the underlying manifold structure. Furthermore, we show that when there exists label dependence, we can use the outputs of a competitive learning method as part of the input to the harmonic function to provide improved results over those of the original model. Finally, since we are using multiple metrics to thoroughly evaluate the performance of the algorithm, we propose to use the game-theory based method of Kalai and Smorodinsky to output a single compromise solution. This method can be applied to any learning model irrespective of the number of evaluation measures used.

This work concerns the development of black-box optimization methods based on single-step deep reinforcement learning (DRL) and their conceptual similarity to evolution strategy (ES) techniques 29. The connection of policy-based optimization (PBO) to evolutionary strategies (especially covariance matrix adaptation evolutionary strategy) is discussed. Relevance is assessed by benchmarking PBO against classical ES techniques on analytic functions minimization problems, and by optimizing various parametric control laws intended for the Lorenz attractor. This contribution definitely establishes PBO as a valid, versatile black-box optimization technique, and opens the way to multiple future improvements building on the inherent flexibility of the neural networks approach.

Ordinary differential equations have been derived for the adjoint Euler equations first using the method of characteristics in 2D. For this system of partial-differential equations, the characteristic curves appear to be the streamtraces and the well-known curves of the theory applied to the flow. The differential equations satisfied along the streamtraces in 2D have then been extended and demonstrated in 3D by linear combinations of the original adjoint equations.

These findings extend their well-known counterparts for the direct system and should serve analytical and possibly numerical studies of the perfect-flow model with respect to adjoint fields or sensitivity questions. In addition to the analytical theory, the results have been illustrated by the numerical integration of the compatibility relationships for discrete 2D flow fields and dual-consistent adjoint fields over a very fine grid about an airfoil 26.

The present work reflects our cooperation with the Information Processing and Systems Department (DTIS) of Onera Toulouse.

In the multi-objective optimization of a complex system, after the Pareto front associated with preponderant objective functions (“primary cost functions”), has been approximated, usually at a demanding computational cost, the decision to elect the final concept is still to be made since a whole set of indiscriminate Pareto-optimal solutions is available.

To complete the decision process, we had proposed a Nash game construction initiated from one such Pareto-optimal solution to target a reduction of “secondary cost functions” while quasi-maintaining the Pareto optimality of the primary cost functions. Convergence proof and first examples were given in 7.

This method has been applied to the multi-objective optimization of the flight performance of an Airbus-A320-type aircraft in terms of take-off fuel mass and operational empty weight (primary cost functions) concurrently with ascent-to-cruise altitude duration (secondary). The optimization was subject to functional constraints on geometry and longitudinal stability. Designs were evaluated by means of the FAST-OAD open-source software developed by ONERA and ISAE-SUPAERO, and the prioritized optimization conducted by our Nash-MGDA software (MGDA). The experiment demonstrated the efficacy of the method to greatly reduce the ascent duration, and its great efficiency in terms of computational time, permitting the numerical process to be interactive 41.

We extend in two directions our results published in 106 to tackle ill posed Cauchy-Stokes inverse problems as Nash games. First, we consider the problem of detecting unknown pointwise sources in a stationary viscous fluid, using partial boundary measurements. The considered fluid obeys a steady Stokes regime, the boundary measurements are a single compatible pair of Dirichlet and Neumann data, available only on a partial accessible part of the whole boundary. This inverse source identification for the Cauchy-Stokes problem is ill-posed for both the sources and missing data reconstructions, and designing stable and efficient algorithms is challenging. We reformulate the problem as a three-player Nash game. Thanks to a source identifiability result derived for the Cauchy-Stokes problem, it is enough to set up two Stokes BVP, then use them as state equations. The Nash game is then set between 3 players, the first two targeting the data completion while the third one targets the detection of the number, location and magnitude of the unknown sources. We provided the third player with the location and magnitude parameters as strategy, with a cost functional of Kohn-Vogelius type. In particular, the location is obtained through the computation of the topological sensitivity of the latter function. We propose an original algorithm, which we implemented using Freefem++. We present 2D numerical experiments for many different test-cases.The obtained results corroborate the efficiency of our 3-player Nash game approach to solve parameter or shape identification for Cauchy-Stokes problems 45

The second direction is dedicated to the solution of the data completion problem for non-linear flows. We consider two kinds of non linearities leading to either a non Newtonian Stokes flow or to Navier-Stokes equations. Our recent numerical results show that it is possible to perform a one-shot approach using Nash games : players exchange their respective state information and solve linear systems. At convergence to a Nash equilibrium, the states converge to the solution of the non linear systems. To the best of our knowledge, this is the first time where such an approach is applied to solve inverse problems for nonlinear systems 107.

Prostate cancer is a hormone-dependent cancer characterized by two types of cancer cells, androgen-dependent cancer cells and androgen-resistant ones. The objective of this work is to present a novel mathematical model for the treatment of prostate cancer under combined hormone therapy and brachytherapy. Using a system of partial differential equations, we quantify and study the evolution of the different cell densities involved in prostate cancer and their responses to the two treatments. The numerical simulations are carried out on FreeFem++ using a 2D finite element method. Numerical simulations of tumor growth under different therapeutic strategies are explored and discussed as summarized hereafter. Combining hormone therapy with brachytherapy allowed us to reduce the dose used from 120Gy to 80Gy. When the treatments are given at the same time, the final tumor volume is significantly reduced compared to using each therapy separately. However, starting with hormone therapy gave better results. When using intermittent hormone therapy combined with brachytherapy, we found that once the PSA level drops below the critical level, it stays at reasonable levels and therefore the hormone therapy does not reactivate. When we use continuous hormone therapy instead, the prostate is unnecessarily deprived of androgen for an almost non-existent reduction in tumor volume compared to intermittent deprivation. The use of hormone therapy over a short period of time is therefore sufficient to give good results. The results also showed that the dose used in the combined treatments affects the tumor relapse.

This project tackles theoretical and numerical issues arising in the mathematical study of conservation laws with non-local flux functions. These equations include in a variety of applications, ranging from traffic flows to industrial processes and biology, and are intended to model macroscopically the action of non-local interactions occurring at the microscopic level.

The team, bi-located in France and Chile, has complementary skills covering the analysis, numerical approximation and optimization of non-linear hyperbolic systems of conservation laws, and their application to the modeling of vehicular and pedestrian traffic flows, sedimentation and other industrial problems.

Based on the members' expertise and on the preliminary results obtained by the team, the project will focus on the following aspects: - The development of efficient, high-order finite volume numerical schemes for the computation of approximate solutions of non-local equations. - The sensitivity analysis of the solutions on model parameters or initial conditions

The impact of the project is therefore twofold: while addressing major mathematical advances in the theory and numerical approximation of highly non-standard problems, it puts the basis for innovative tools to handle modern applications in engineering sciences.

See also: project web site

Many physical, biological, chemical, financial or even social phenomena can be described by dynamical systems. It is quite common that the dynamics arises as a compound effect of the interaction between sub-systems in which case we speak about coupled systems. This Action shall study such interactions in particular cases from three points of view:

The purpose of this Action is to bring together leading groups in Europe working on a range of issues connected with modelling and analysing mathematical models for dynamical systems on networks. It aims to develop a semigroup approach to various (non-)linear dynamical systems on networks as well as numerical methods based on modern variational methods and applying them to road traffic, biological systems, and further real-life models. The Action also explores the possibility of estimating solutions and long time behaviour of these systems by collecting basic combinatorial information about underlying networks.

Project OPERA (2019-2022): Adaptive planar optics

This project is composed of Inria teams ATLANTIS, ACUMES and HIEPACS, CNRS CRHEA lab. and company NAPA. Its objective is the characterization and design of new meta-surfaces for optics (opera web site).

Institute 3IA Côte d'Azur : The 3IA Côte d'Azur is one of the four "Interdisciplinary Institutes of Artificial Intelligence" that were created in France in 2019. Its ambition is to create an innovative ecosystem that is influential at the local, national and international levels, and a focal point of excellence for research, education and the world of AI.

ACUMES is involved with the project “Data driven traffic management” in the axis AI for smart and secure territories (2020-2024), for which P. Goatin is chair holder. This project aims at contributing to the transition to intelligent mobility management practices through an efficient use of available resources and information, fostering data collection and provision. We focus on improving traffic flow on road networks by using advanced mathematical models and statistical techniques leveraging the information recovered by real data.