arXiv subjects

Luciano Marzufero

Publications and source records attributed to Luciano Marzufero.

8 recordsLinked to original sources

arXiv2026

Approximation of viscous transport and conservative equations with one sided Lipschitz velocity fields

The aim of this work is to investigate semi-Lagrangian approximation schemes on unstructured grids for viscous transport and conservative equations with measurable coefficients that satisfy a one-sided Lipschitz condition. To establish the convergence of the schemes, we exploit the characterization of the solution for these equations expressed in terms of measurable time-dependent viscosity solution and, respectively, duality solution. We supplement our theoretical analysis with various numerical examples to illustrate the features of the schemes.

math.NA↗

arXiv2026

A network model for urban planning

We study a mathematical model to describe the evolution of a city, which is determined by the interaction of two large populations of agents, workers and firms. The map of the city is described by a network with the edges representing at the same time residential areas and communication routes. The two populations compete for space while interacting through the labour market. The resulting model is described by a two population Mean-Field Game system coupled with an Optimal Transport problem.We prove existence and uniqueness of the solution and we provide several numerical simulations.

math.OC↗

arXiv2025

A zero-sum differential game for two opponent masses

We investigate an infinite dimensional partial differential equation of Isaacs' type, which arises from a zero-sum differential game between two masses. The evolution of the two masses is described by a controlled transport/continuity equation, where the control is given by the vector velocity field. Our study is set in the framework of the viscosity solutions theory in Hilbert spaces, and we prove the uniqueness of the value functions as solutions of the Isaacs equation.

math.OC↗

arXiv2025

A single player and a mass of agents: a pursuit evasion-like game

We study a finite-horizon differential game of pursuit-evasion like, between a single player and a mass of agents. The player and the mass directly control their own evolution, which for the mass is given by a first order PDE of transport equation type. Using also an adapted concept of non-anticipating strategies, we derive an infinite dimensional Isaacs equation, and by dynamic programming techniques we prove that the value function is the unique viscosity solution on a suitable invariant subset of a Hilbert space.

math.OC↗

arXiv2023

A time-dependent switching mean-field game on networks motivated by optimal visiting problems

Motivated by an optimal visiting problem, we study a switching mean-field game on a network, where both a decisional and a switching time-variable is at disposal of the agents for what concerns, respectively, the instant to decide and the instant to perform the switch. Every switch between the nodes of the network represents a switch from $0$ to $1$ of one component of the string $p = (p_1,\ldots, p_n)$ which, in the optimal visiting interpretation, gives information on the visited targets, being the targets labeled by $i=1,\ldots, n$. The goal is to reach the final string $(1, \ldots, 1)$ in the final time $T$, minimizing a switching cost also depending on the congestion on the nodes. We prove the existence of a suitable definition of an approximated $\varepsilon$-mean-field equilibrium and then address the passage to the limit when $\varepsilon$ goes to 0.

math.OC↗

arXiv2022

The orienteering problem: a hybrid control formulation

In the last years, a growing number of challenging applications in navigation, logistics, and tourism were modeled as orienteering problems. This problem has been proposed in relation to a sport race where certain control points must be visited in a minimal time. In a certain kind of these competitions, the choice of the number and the order for the control points are left to the competitor. We propose an original approach to solve the orienteering problem based on hybrid control. The continuous state of the system contains information about the navigation toward the next control point. In contrast, the discrete state keeps track of the already visited ones. The control problem is solved using non-standard dynamical programming techniques.

math.OC↗

arXiv2022

Hybrid control for optimal visiting problems for a single player and for a crowd

In an optimal visiting problem, we want to control a trajectory that has to pass as close as possible to a collection of target points or regions. We introduce a hybrid control-based approach for the classic problem where the trajectory can switch between a group of discrete states related to the targets of the problem. The model is subsequently adapted to a mean-field framework to study viability and crowd fluxes to model a multitude of indistinguishable players.

math.OC↗

arXiv2022

A hybrid control framework for an optimal visiting problem

The optimal visiting problem is the optimization of a trajectory that has to touch or pass as close as possible to a collection of target points. The problem does not verify the dynamic programming principle, and it needs a specific formulation to keep track of the visited target points. In this paper, we introduce a hybrid approach by adding a discontinuous part of the trajectory switching between a group of discrete states related to the targets. Then, we show the well-posedness of the related Hamilton-Jacobi problem, by reformulating the optimal visiting as a collection of time-dependent optimal stopping problems.

math.OC↗