activity
20112023
most citedKinetic description of collision avoidance in pedestrian crowds by sidestepping

14 citations · 35 across the 16 of their papers we have counts for

collaborators

20 papers

math.AP2023

Forward-Forward Mean Field Games in mathematical modeling with application to opinion formation and voting models

Adriano Festa, Simone Gottlich, Michele Ricciardi

While the general theory for the terminal-initial value problem in mean-field games is widely used in many models of applied mathematics, the modeling potential of the correspondin…

math.OC2020★ 4 cited

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

Fabio Bagagiolo, Adriano Festa, Luciano Marzufero

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-bas…

math.OC2020★ 5 cited

The orienteering problem: a hybrid control formulation

Fabio Bagagiolo, Adriano Festa, Luciano Marzufero

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 relat…

math.OC2020★ 1 cited

A hybrid control framework for an optimal visiting problem

Fabio Bagagiolo, Adriano Festa, Luciano Marzufero

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 dy…

math.NA2019

Stochastic hybrid differential games and match race problems

Simone Cacace, Roberto Ferretti, Adriano Festa

We discuss the general framework of a stochastic two-player, hybrid differential game, and we apply it to the modelling of a "match race" between two sailing boats, namely a compet…

math.NA2018

A semi-Lagrangian scheme for Hamilton-Jacobi equations on networks with application to traffic flow models

Elisabetta Carlini, Adriano Festa, Nicolas Forcadel

We present a semi-Lagrangian scheme for the approximation of a class of Hamilton-Jacobi-Bellman equations on networks. The scheme is explicit and stable under some technical condit…

math.AP2018

A model for a network of conveyor belts with discontinuous speed and capacity

Adriano Festa, Simone Göttlich, Marion Pfirsching

We introduce a macroscopic model for a network of conveyor belts with various speeds and capacities. In a different way from traffic flow models, the product densities are forced t…

math.OC2017★ 2 cited

A Mean Field Games approach for multi-lane traffic management

Adriano Festa, Simone Göttlich

In this work we discuss an Mean Field Games approach to traffic management on multi-lane roads. Such approach is particularly indicated to model self driven vehicles with perfect i…

math.NA2017★ 3 cited

A Hybrid control approach to the route planning problem for sailing boats

Roberto Ferretti, Adriano Festa

We present an optimal hybrid control approach to the problem of stochastic route planning for sailing boats, especially in short course fleet races, in which minimum average time i…

math.AP2017★ 1 cited

An Adjoint-based Numerical Method for a class of nonlinear Fokker-Planck Equations

Adriano Festa, Diogo A. Gomes, Roberto M. Velho

Here, we introduce a numerical approach for a class of Fokker-Planck (FP) equations. These equations are the adjoint of the linearization of Hamilton-Jacobi (HJ) equations. Using t…

math.NA2016★ 2 cited

The Hughes model for pedestrian dynamics and congestion modelling

Elisabetta Carlini, Adriano Festa, Francisco J. Silva

In this paper we present a numerical study of some variations of the Hughes model for pedestrian flow under different types of congestion effects. The general model consists of a c…

physics.soc-ph2016★ 14 cited

Kinetic description of collision avoidance in pedestrian crowds by sidestepping

Adriano Festa, Andrea Tosin, Marie-Therese Wolfram

In this paper we study a kinetic model for pedestrians, who are assumed to adapt their motion towards a desired direction while avoiding collisions with others by stepping aside. T…

math.NA2016

A discrete Hughes' model for pedestrian flow on graphs

Fabio Camilli, Adriano Festa, Silvia Tozza

In this paper, we introduce a discrete time-finite state model for pedestrian flow on a graph in the spirit of the Hughes dynamic continuum model. The pedestrians, represented by a…

math.NA2016

A Semi-Lagrangian scheme for a modified version of the Hughes model for pedestrian flow

Elisabetta Carlini, Adriano Festa, Francisco J. Silva +1

In this paper we present a Semi-Lagrangian scheme for a regularized version of the Hughes model for pedestrian flow. Hughes originally proposed a coupled nonlinear PDE system descr…

math.OC2014

Decomposition of Differential Games

Adriano Festa, Richard Vinter

This paper provides a decomposition technique for the purpose of simplifying the solution of certain zero-sum differential games. The games considered terminate when the state reac…

math.NA2014

Domain decomposition based parallel Howard's algorithm

Adriano Festa

The Classic Howard's algorithm, a technique of resolution for discrete Hamilton-Jacobi equations, is of large use in applications for its high efficiency and good performances. A s…

math.NA2014★ 2 cited

Reconstruction of Independent Sub-domains for a class of Hamilton Jacobi Equations and its Application to Parallel Computing

Adriano Festa

A previous knowledge of the domains of dependence of an Hamilton Jacobi equation can be useful in its study and approximation. Information of this nature are, in general, difficult…

math.OC2013

A decomposition technique for pursuit evasion games with many pursuers

Adriano Festa, Richard B. Vinter

Here we present a decomposition technique for a class of differential games. The technique consists in a decomposition of the target set which produces, for geometrical reasons, a…

math.NA2013

An approximation scheme for an Eikonal Equation with discontinuous coefficient

Adriano Festa, Maurizio Falcone

We consider the stationary Hamilton-Jacobi equation where the dynamics can vanish at some points, the cost function is strictly positive and is allowed to be discontinuous. More pr…

math.AP2011★ 1 cited

An approximation scheme for an Hamilton-Jacobi equation defined on a network

Fabio Camilli, Adriano Festa, Dirk Schieborn

In this paper we study an approximation scheme for an Hamilton-Jacobi equation of Eikonal type defined on a network. We introduce an appropriate notion of viscosity solution for th…