This work deals with the problem of managing the excursionist flow in historic cities. Venice is considered as a case study. There, in high season, thousands of excursionists arrive by train in the morning; spend the day visiting different sites; reach again the train station in late afternoon and leave. With the idea of avoiding congestion by directing excursionists along different routes, a mean field model is introduced. Network/switching is used to describe the excursionists costs as a func- tion of their position, taking into consideration whether they have already visited a site or not, i.e. allowing excursionists to have memory of the past when making decisions. The problem is analized in the framework of Hamilton-Jacobi/transport equations, as it is standard in mean field games theory. In addition, to provide a starting datum for iterative solution algorithms, we introduce a second model in the framework of mathematical programming. For this second approach we present some numerical experiments.

Non-memoryless Pedestrian Flow in a Crowded Environment with Target Sets

Raffaele Pesenti
2018-01-01

Abstract

This work deals with the problem of managing the excursionist flow in historic cities. Venice is considered as a case study. There, in high season, thousands of excursionists arrive by train in the morning; spend the day visiting different sites; reach again the train station in late afternoon and leave. With the idea of avoiding congestion by directing excursionists along different routes, a mean field model is introduced. Network/switching is used to describe the excursionists costs as a func- tion of their position, taking into consideration whether they have already visited a site or not, i.e. allowing excursionists to have memory of the past when making decisions. The problem is analized in the framework of Hamilton-Jacobi/transport equations, as it is standard in mean field games theory. In addition, to provide a starting datum for iterative solution algorithms, we introduce a second model in the framework of mathematical programming. For this second approach we present some numerical experiments.
2018
Advances in Dynamic and Mean Field Games
File in questo prodotto:
File Dimensione Formato  
BagagioloPesenti_final.pdf

non disponibili

Descrizione: Preprint
Tipologia: Documento in Pre-print
Licenza: Accesso chiuso-personale
Dimensione 528.87 kB
Formato Adobe PDF
528.87 kB Adobe PDF   Visualizza/Apri

I documenti in ARCA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10278/3696618
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? 2
social impact