Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

A macroscopic traffic flow model with finite buffers on networks: Well-posedness by means of Hamilton-Jacobi equations

Abstract : We introduce a model dealing with conservation laws on networks and coupled boundary conditions at the junctions. In particular, we introduce buffers of fixed arbitrary size and time dependent split ratios at the junctions , which represent how traffic is routed through the network, while guaranteeing spill-back phenomena at nodes. Having defined the dynamics at the level of conservation laws, we lift it up to the Hamilton-Jacobi (H-J) formulation and write boundary datum of incoming and outgoing junctions as functions of the queue sizes and vice-versa. The Hamilton-Jacobi formulation provides the necessary regularity estimates to derive a fixed-point problem in a proper Banach space setting, which is used to prove well-posedness of the model. Finally, we detail how to apply our framework to a non-trivial road network, with several intersections and finite-length links.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [38 references]  Display  Hide  Download

https://hal.inria.fr/hal-02121812
Contributor : Nicolas Laurent-Brouty <>
Submitted on : Saturday, February 22, 2020 - 9:33:52 AM
Last modification on : Sunday, June 28, 2020 - 5:06:04 PM

File

Laurent-Brouty Keimer Goatin B...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02121812, version 2

Collections

Citation

Nicolas Laurent-Brouty, Alexander Keimer, Paola Goatin, Alexandre Bayen. A macroscopic traffic flow model with finite buffers on networks: Well-posedness by means of Hamilton-Jacobi equations. 2020. ⟨hal-02121812v2⟩

Share

Metrics

Record views

46

Files downloads

72