arXiv subjects

Mauro Garavello

Publications and source records attributed to Mauro Garavello.

27 records · Page 2Linked to original sources

arXiv2017

Polynomial Profits in Renewable Resources Management

A system of renewal equations on a graph provides a framework to describe the exploitation of a biological resource. In this context, we formulate an optimal control problem, prove the existence of an optimal control and ensure that the target cost function is polynomial in the control. In specific situations, further information about the form of this dependence is obtained. As a consequence, in some cases the optimal control is proved to be necessarily bang--bang, in other cases the computations necessary to find the optimal control are significantly reduced.

math.AP↗

arXiv2014

Differential Equations Modeling Crowd Interactions

Nonlocal conservation laws are used to describe various realistic instances of crowd behaviors. First, a basic analytic framework is established through an "ad hoc" well posedness theorem for systems of nonlocal conservation laws in several space dimensions interacting non locally with a system of ODEs. Numerical integrations show possible applications to the interaction of different groups of pedestrians, and also with other "agents".

math.AP↗

arXiv2014

Stability and Optimization in Structured Population Models on Graphs

We prove existence and uniqueness of solutions, continuous dependence from the initial datum and stability with respect to the boundary condition in a class of initial--boundary value problems for systems of balance laws. The particular choice of the boundary condition allows to comprehend models with very different structures. In particular, we consider a juvenile-adult model, the problem of the optimal mating ratio and a model for the optimal management of biological resources. The stability result obtained allows to tackle various optimal management/control problems, providing sufficient conditions for the existence of optimal choices/controls.

math.AP↗

arXiv2012

Conservation laws in the modeling of moving crowds

This paper is a proceeding of the conference hyp2012 that was held in Padova in June 2012. Models for crowd dynamics are presented and compared. Well posedness results allow to exhibit the existence of optimal controls in various situations. A new approach not based on partial differential equations is also briefly considered.

math.AP↗

arXiv2011

A Class of Non-Local Models for Pedestrian Traffic

We present a new class of macroscopic models for pedestrian flows. Each individual is assumed to move towards a fixed target, deviating from the best path according to the instantaneous crowd distribution. The resulting equation is a conservation law with a nonlocal flux. Each equation in this class generates a Lipschitz semigroup of solutions and is stable with respect to the functions and parameters defining it. Moreover, key qualitative properties such as the boundedness of the crowd density are proved. Specific models are presented and their qualitative properties are shown through numerical integrations.

math.AP↗

arXiv2010

The Aw-Rascle traffic model with locally constrained flow

We consider solutions of the Aw-Rascle model for traffic flow fulfilling a constraint on the flux at $x=0$. Two different kinds of solutions are proposed: at $x=0$ the first one conserves both the number of vehicles and the generalized momentum, while the second one conserves only the number of cars. We study the invariant domains for these solutions and we compare the two Riemann solvers in terms of total variation of relevant quantities. Finally we construct ad hoc finite volume numerical schemes to compute these solutions.

math.AP↗

arXiv2009

Entropy type conditions for Riemann solvers at nodes

This paper deals with conservation laws on networks, represented by graphs. Entropy-type conditions are considered to determine dynamics at nodes. Since entropy dispersion is a local concept, we consider a network composed by a single node $J$ with $n$ incoming and $m$ outgoing arcs. We extend at $J$ the classical Kružkov entropy obtaining two conditions, denoted by (E1) and (E2): the first requiring entropy condition for all Kružkov entropies, the second only for the value corresponding to sonic point. First we show that in case $n \ne m$, no Riemann solver can satisfy the strongest condition. Then we characterize all the Riemann solvers at $J$ satisfying the strongest condition (E1), in the case of nodes with at most two incoming and two outgoing arcs. Finally we focus three different Riemann solvers, introduced in previous papers. In particular, we show that the Riemann solver introduced for data networks is the only one always satisfying (E2).

math.AP↗

arXiv2009

On the 1D Modeling of Fluid Flowing through a Junction

Consider a fluid flowing through a junction between two pipes with different sections. Its evolution is described by the 2D or 3D Euler equations, whose analytical theory is far from complete and whose numerical treatment may be rather costly. This note compares different 1D approaches to this phenomenon.

math.AP↗

arXiv2002

Verification Theorems for Hamilton-Jacobi-Bellman equations

We study an optimal control problem in Bolza form and we consider the value function associated to this problem. We prove two verification theorems which ensure that, if a function $W$ satisfies some suitable weak continuity assumptions and a Hamilton-Jacobi-Bellman inequality outside a countably $\mathcal H^n$-rectifiable set, then it is lower or equal to the value function. These results can be used for optimal synthesis approach.

math.OC↗