This document discusses numerical methods for variational principles in traffic modeling. It begins with an introduction to variational principles in physical systems and their application to traffic modeling. It then provides an overview of macroscopic traffic flow models, including first-order Lighthill-Whitham-Richards models and higher-order Generic Second Order Models. The document explains that traffic models can be formulated as variational problems and solved using principles like minimum action, Hamilton-Jacobi equations, and dynamic programming. Numerical methods are needed to solve the resulting variational problems in modeling real-world traffic flows.
Contribution à l'étude du trafic routier sur réseaux à l'aide des équations d...Guillaume Costeseque
The document discusses traffic flow modeling on road networks. It begins by motivating the use of Hamilton-Jacobi equations to model traffic at a macroscopic scale on networks. It then provides an introduction to traffic modeling, including microscopic and macroscopic models. It focuses on the Lighthill-Whitham-Richards model and discusses higher-order models. It also discusses how microscopic models can be homogenized to derive macroscopic models using Hamilton-Jacobi equations. Finally, it discusses multi-anticipative traffic models and numerical schemes for solving the equations.
The document discusses second order traffic flow models on networks. It begins with an introduction to traffic modeling, including macroscopic representations of traffic flow using density, flow, and speed. First order models like Lighthill-Whitham-Richards (LWR) are introduced, as well as higher order Generic Second Order Models (GSOM) that can account for driver behavior and vehicle interactions. The document then discusses applying a variational principle and Hamilton-Jacobi formulation to both LWR and GSOM models, allowing them to be analyzed using tools from optimal control and viability theory.
Traffic flow modeling on road networks using Hamilton-Jacobi equationsGuillaume Costeseque
This document discusses traffic flow modeling using Hamilton-Jacobi equations on road networks. It motivates the use of macroscopic traffic models based on conservation laws and Hamilton-Jacobi equations to describe traffic flow. These models can capture traffic behavior at a aggregate level based on density, flow and speed. The document outlines different orders of macroscopic traffic models, from first order Lighthill-Whitham-Richards models to higher order models that account for additional traffic attributes. It also discusses the relationship between microscopic car-following models and the emergence of macroscopic behavior through homogenization.
Supervised Planetary Unmixing with Optimal TransportSina Nakhostin
This document presents a supervised planetary unmixing method using optimal transport. It introduces using the Wasserstein distance as a metric for comparing spectral signatures, which is defined over probability distributions and can account for shifts in frequency. The method formulates unmixing as an optimization problem that matches spectra to a dictionary using the Wasserstein distance, while also incorporating an abundance prior. Preliminary experiments on Vesta asteroid data show the abundance maps produced with this optimal transport approach.
Hamilton-Jacobi approach for second order traffic flow modelsGuillaume Costeseque
This document summarizes a presentation on using a Hamilton-Jacobi approach for second order traffic flow models. It begins with an introduction to traffic modeling, discussing both Eulerian and Lagrangian representations of traffic. It then discusses using a variational principle to apply to generic second order traffic flow models (GSOM), which account for additional driver attributes beyond just density. Specifically, it discusses formulating GSOM models in Lagrangian coordinates using a Hamilton-Jacobi framework. The document outlines solving the HJ PDE using characteristics, and decomposing problems into elementary blocks defined by piecewise affine initial, upstream and internal boundary conditions.
Contribution à l'étude du trafic routier sur réseaux à l'aide des équations d...Guillaume Costeseque
The document discusses traffic flow modeling on road networks. It begins by motivating the use of Hamilton-Jacobi equations to model traffic at a macroscopic scale on networks. It then provides an introduction to traffic modeling, including microscopic and macroscopic models. It focuses on the Lighthill-Whitham-Richards model and discusses higher-order models. It also discusses how microscopic models can be homogenized to derive macroscopic models using Hamilton-Jacobi equations. Finally, it discusses multi-anticipative traffic models and numerical schemes for solving the equations.
The document discusses second order traffic flow models on networks. It begins with an introduction to traffic modeling, including macroscopic representations of traffic flow using density, flow, and speed. First order models like Lighthill-Whitham-Richards (LWR) are introduced, as well as higher order Generic Second Order Models (GSOM) that can account for driver behavior and vehicle interactions. The document then discusses applying a variational principle and Hamilton-Jacobi formulation to both LWR and GSOM models, allowing them to be analyzed using tools from optimal control and viability theory.
Traffic flow modeling on road networks using Hamilton-Jacobi equationsGuillaume Costeseque
This document discusses traffic flow modeling using Hamilton-Jacobi equations on road networks. It motivates the use of macroscopic traffic models based on conservation laws and Hamilton-Jacobi equations to describe traffic flow. These models can capture traffic behavior at a aggregate level based on density, flow and speed. The document outlines different orders of macroscopic traffic models, from first order Lighthill-Whitham-Richards models to higher order models that account for additional traffic attributes. It also discusses the relationship between microscopic car-following models and the emergence of macroscopic behavior through homogenization.
Supervised Planetary Unmixing with Optimal TransportSina Nakhostin
This document presents a supervised planetary unmixing method using optimal transport. It introduces using the Wasserstein distance as a metric for comparing spectral signatures, which is defined over probability distributions and can account for shifts in frequency. The method formulates unmixing as an optimization problem that matches spectra to a dictionary using the Wasserstein distance, while also incorporating an abundance prior. Preliminary experiments on Vesta asteroid data show the abundance maps produced with this optimal transport approach.
Hamilton-Jacobi approach for second order traffic flow modelsGuillaume Costeseque
This document summarizes a presentation on using a Hamilton-Jacobi approach for second order traffic flow models. It begins with an introduction to traffic modeling, discussing both Eulerian and Lagrangian representations of traffic. It then discusses using a variational principle to apply to generic second order traffic flow models (GSOM), which account for additional driver attributes beyond just density. Specifically, it discusses formulating GSOM models in Lagrangian coordinates using a Hamilton-Jacobi framework. The document outlines solving the HJ PDE using characteristics, and decomposing problems into elementary blocks defined by piecewise affine initial, upstream and internal boundary conditions.
short course at CIRM, Bayesian Masterclass, October 2018Christian Robert
Markov Chain Monte Carlo (MCMC) methods generate dependent samples from a target distribution using a Markov chain. The Metropolis-Hastings algorithm constructs a Markov chain with a desired stationary distribution by proposing moves to new states and accepting or rejecting them probabilistically. The algorithm is used to approximate integrals that are difficult to compute directly. It has been shown to converge to the target distribution as the number of iterations increases.
Hamilton-Jacobi equation on networks: generalized Lax-Hopf formulaGuillaume Costeseque
The document discusses Hamilton-Jacobi equations on networks to model flows such as traffic. It presents an initial framework developed by Imbert-Monneau from 2010-2014 that models flows on a network as a single Hamilton-Jacobi equation with implicit junction conditions. This approach has good mathematical properties but lacks an explicit solution and does not model traffic flows satisfactorily. The document then outlines improvements to the approach including introducing time and space dependencies to better model traffic flows.
Numerical approach for Hamilton-Jacobi equations on a network: application to...Guillaume Costeseque
The document describes a numerical approach for solving Hamilton-Jacobi equations on networks and its application to modeling traffic flow. It presents a Hamilton-Jacobi model for traffic flow on a network that views the network as a graph with edges and vertices. A numerical scheme is developed that discretizes the Hamilton-Jacobi equations in space and time and couples them at junction points using a maximum principle. Theoretical results proving gradient bounds, existence and uniqueness of solutions, and convergence of the numerical solution are also presented.
Representation formula for traffic flow estimation on a networkGuillaume Costeseque
This document discusses representation formulas for traffic flow estimation on networks using Hamilton-Jacobi equations. It begins by motivating the use of HJ equations, noting advantages like smooth solutions and physically meaningful quantities. It then presents the basic ideas of Lax-Hopf formulas for solving HJ equations on networks, including a simple case study of a junction. The document outlines its topics which include notations from traffic flow modeling, basic recalls on Lax-Hopf formulas, HJ equations on networks, and a new approach.
This document provides an introduction to Bayesian analysis and Metropolis-Hastings Markov chain Monte Carlo (MCMC). It explains the foundations of Bayesian analysis and how MCMC sampling methods like Metropolis-Hastings can be used to draw samples from posterior distributions that are intractable. The Metropolis-Hastings algorithm works by constructing a Markov chain with the target distribution as its stationary distribution. The document provides an example of using MCMC to perform linear regression in a Bayesian framework.
Poster for Bayesian Statistics in the Big Data Era conferenceChristian Robert
The document proposes a new version of Hamiltonian Monte Carlo (HMC) sampling that is essentially calibration-free. It achieves this by learning the optimal leapfrog scale from the distribution of integration times using the No-U-Turn Sampler algorithm. Compared to the original NUTS algorithm on benchmark models, this new enhanced HMC (eHMC) exhibits significantly improved efficiency with no hand-tuning of parameters required. The document tests eHMC on a Susceptible-Infected-Recovered model of disease transmission.
no U-turn sampler, a discussion of Hoffman & Gelman NUTS algorithmChristian Robert
The document describes the No-U-Turn Sampler (NUTS), an extension of Hamiltonian Monte Carlo (HMC) that aims to avoid the random walk behavior and poor mixing that can occur when the trajectory length L is not set appropriately. NUTS augments the model with a slice variable and uses a deterministic procedure to select a set of candidate states C based on the instantaneous distance gain, avoiding the need to manually tune L. It builds up a set of possible states B by doubling a binary tree and checking the distance criterion on subtrees, then samples from the uniform distribution over C to generate proposals. This allows NUTS to automatically determine an appropriate trajectory length and avoid issues like periodicity that can plague
The document summarizes a talk given by Mark Girolami on manifold Monte Carlo methods. It discusses using stochastic diffusions and geometric concepts to improve MCMC methods. Specifically, it proposes using discretized Langevin and Hamiltonian diffusions across a Riemann manifold as an adaptive proposal mechanism. This is founded on deterministic geodesic flows on the manifold. Examples presented include a warped bivariate Gaussian, Gaussian mixture model, and log-Gaussian Cox process.
This document discusses Markov chain Monte Carlo (MCMC) methods. It begins with an outline of the Metropolis-Hastings algorithm, which is a generic MCMC method for obtaining a sequence of random samples from a probability distribution when direct sampling is difficult. The document then provides details on the Metropolis-Hastings algorithm, including its convergence properties. It also discusses the independent Metropolis-Hastings algorithm as a special case and provides an example to illustrate it.
The document discusses computational methods for Bayesian statistics when direct simulation from the target distribution is not possible or efficient. It introduces Markov chain Monte Carlo (MCMC) methods, including the Metropolis-Hastings algorithm and Gibbs sampler, which generate dependent samples that approximate the target distribution. The Metropolis-Hastings algorithm uses a proposal distribution to randomly walk through the parameter space. Approximate Bayesian computation (ABC) is also introduced as a method that approximates the posterior distribution when the likelihood is intractable.
International Conference on Monte Carlo techniques
Closing conference of thematic cycle
Paris July 5-8th 2016
Campus les cordeliers
Jere Koskela's slides
Likelihood-free methods provide techniques for approximating Bayesian computations when the likelihood function is unavailable or computationally intractable. Monte Carlo methods like importance sampling and iterated importance sampling generate samples from an approximating distribution to estimate integrals. Population Monte Carlo is an iterative Monte Carlo algorithm that propagates a population of particles over time to explore the target distribution. Approximate Bayesian computation uses simulation-based methods to approximate posterior distributions when the likelihood is unavailable.
The document provides an introduction to Markov Chain Monte Carlo (MCMC) methods. It discusses using MCMC to sample from distributions when direct sampling is difficult. Specifically, it introduces Gibbs sampling and the Metropolis-Hastings algorithm. Gibbs sampling updates variables one at a time based on their conditional distributions. Metropolis-Hastings proposes candidate samples and accepts or rejects them to converge to the target distribution. The document provides examples and outlines the algorithms to construct Markov chains that sample distributions of interest.
RSS discussion of Girolami and Calderhead, October 13, 2010Christian Robert
1. The document discusses discretizing Hamiltonians for Markov chain Monte Carlo (MCMC) methods. Specifically, it examines reproducing Hamiltonian equations through discretization, such as via generalized leapfrog.
2. However, the invariance and stability properties of the continuous-time process may not carry over to the discretized version. Approximations can be corrected with a Metropolis-Hastings step, so exactly reproducing the continuous behavior is not necessarily useful.
3. Discretization induces a calibration problem of determining the appropriate step size. Convergence issues for the MCMC algorithm should not be impacted by imperfect renderings of the continuous-time process in discrete time.
Why should you care about Markov Chain Monte Carlo methods?
→ They are in the list of "Top 10 Algorithms of 20th Century"
→ They allow you to make inference with Bayesian Networks
→ They are used everywhere in Machine Learning and Statistics
Markov Chain Monte Carlo methods are a class of algorithms used to sample from complicated distributions. Typically, this is the case of posterior distributions in Bayesian Networks (Belief Networks).
These slides cover the following topics.
→ Motivation and Practical Examples (Bayesian Networks)
→ Basic Principles of MCMC
→ Gibbs Sampling
→ Metropolis–Hastings
→ Hamiltonian Monte Carlo
→ Reversible-Jump Markov Chain Monte Carlo
A Markov Chain Monte Carlo approach to the Steiner Tree Problem in water netw...Carlo Lancia
The document describes using a Metropolis algorithm and Markov chain Monte Carlo (MCMC) approach to solve the minimal Steiner tree problem, which models finding the shortest water distribution network for a farm district. It formulates the problem on a graph and defines the optimization problem and statistical mechanics analogy. It then describes designing a Markov chain with transition probabilities following the Metropolis rule and a Hamiltonian function incorporating edge costs and penalties for configurations violating constraints.
A Compositional Encoding for the Asynchronous Pi-Calculus into the Join-Calculussmennicke
This document presents a compositional encoding of the asynchronous π-calculus (πa) into the join-calculus. It discusses the key differences between πa and the join-calculus in terms of their primitives for parallelism, communication, and restriction. It then reviews an existing encoding by Fournet and Gonthier, and Gorla's criteria for a good encoding in terms of compositionality, name invariance, and operational correspondence. The goal is to define a new encoding of πa into the join-calculus that satisfies Gorla's criteria for being a good encoding.
Intersection modeling using a convergent scheme based on Hamilton-Jacobi equa...Guillaume Costeseque
The document presents an intersection modeling approach using a Hamilton-Jacobi equation. It proposes modeling traffic flow at intersections as the maximization of total flow, without internal states. A numerical scheme is presented to solve the HJ equation based on conservation of vehicles and FIFO principles. Numerical simulations are shown for a diverging intersection with one incoming and two outgoing roads, demonstrating the propagation of density waves over time.
The document discusses second-order traffic flow models on networks. It provides motivation for higher-order models by noting limitations of first-order models like LWR in capturing phenomena observed in real traffic flows. It introduces the Generic Second-Order Model (GSOM) family, which incorporates an additional driver attribute variable beyond density to obtain more accurate descriptions of traffic. GSOM reduces to LWR when this additional variable is ignored. Several examples of GSOM models are also presented.
This document discusses second order traffic flow models on networks. It provides motivation for higher order models by noting limitations of first order models like the Lighthill-Whitham-Richards model. It introduces the Generic Second Order Model (GSOM) family which incorporates additional driver attributes beyond just density. GSOM models are presented in both Eulerian and Lagrangian coordinates. The variational principle and Hamilton-Jacobi formulation are discussed for applying dynamic programming and minimum principles to these models.
short course at CIRM, Bayesian Masterclass, October 2018Christian Robert
Markov Chain Monte Carlo (MCMC) methods generate dependent samples from a target distribution using a Markov chain. The Metropolis-Hastings algorithm constructs a Markov chain with a desired stationary distribution by proposing moves to new states and accepting or rejecting them probabilistically. The algorithm is used to approximate integrals that are difficult to compute directly. It has been shown to converge to the target distribution as the number of iterations increases.
Hamilton-Jacobi equation on networks: generalized Lax-Hopf formulaGuillaume Costeseque
The document discusses Hamilton-Jacobi equations on networks to model flows such as traffic. It presents an initial framework developed by Imbert-Monneau from 2010-2014 that models flows on a network as a single Hamilton-Jacobi equation with implicit junction conditions. This approach has good mathematical properties but lacks an explicit solution and does not model traffic flows satisfactorily. The document then outlines improvements to the approach including introducing time and space dependencies to better model traffic flows.
Numerical approach for Hamilton-Jacobi equations on a network: application to...Guillaume Costeseque
The document describes a numerical approach for solving Hamilton-Jacobi equations on networks and its application to modeling traffic flow. It presents a Hamilton-Jacobi model for traffic flow on a network that views the network as a graph with edges and vertices. A numerical scheme is developed that discretizes the Hamilton-Jacobi equations in space and time and couples them at junction points using a maximum principle. Theoretical results proving gradient bounds, existence and uniqueness of solutions, and convergence of the numerical solution are also presented.
Representation formula for traffic flow estimation on a networkGuillaume Costeseque
This document discusses representation formulas for traffic flow estimation on networks using Hamilton-Jacobi equations. It begins by motivating the use of HJ equations, noting advantages like smooth solutions and physically meaningful quantities. It then presents the basic ideas of Lax-Hopf formulas for solving HJ equations on networks, including a simple case study of a junction. The document outlines its topics which include notations from traffic flow modeling, basic recalls on Lax-Hopf formulas, HJ equations on networks, and a new approach.
This document provides an introduction to Bayesian analysis and Metropolis-Hastings Markov chain Monte Carlo (MCMC). It explains the foundations of Bayesian analysis and how MCMC sampling methods like Metropolis-Hastings can be used to draw samples from posterior distributions that are intractable. The Metropolis-Hastings algorithm works by constructing a Markov chain with the target distribution as its stationary distribution. The document provides an example of using MCMC to perform linear regression in a Bayesian framework.
Poster for Bayesian Statistics in the Big Data Era conferenceChristian Robert
The document proposes a new version of Hamiltonian Monte Carlo (HMC) sampling that is essentially calibration-free. It achieves this by learning the optimal leapfrog scale from the distribution of integration times using the No-U-Turn Sampler algorithm. Compared to the original NUTS algorithm on benchmark models, this new enhanced HMC (eHMC) exhibits significantly improved efficiency with no hand-tuning of parameters required. The document tests eHMC on a Susceptible-Infected-Recovered model of disease transmission.
no U-turn sampler, a discussion of Hoffman & Gelman NUTS algorithmChristian Robert
The document describes the No-U-Turn Sampler (NUTS), an extension of Hamiltonian Monte Carlo (HMC) that aims to avoid the random walk behavior and poor mixing that can occur when the trajectory length L is not set appropriately. NUTS augments the model with a slice variable and uses a deterministic procedure to select a set of candidate states C based on the instantaneous distance gain, avoiding the need to manually tune L. It builds up a set of possible states B by doubling a binary tree and checking the distance criterion on subtrees, then samples from the uniform distribution over C to generate proposals. This allows NUTS to automatically determine an appropriate trajectory length and avoid issues like periodicity that can plague
The document summarizes a talk given by Mark Girolami on manifold Monte Carlo methods. It discusses using stochastic diffusions and geometric concepts to improve MCMC methods. Specifically, it proposes using discretized Langevin and Hamiltonian diffusions across a Riemann manifold as an adaptive proposal mechanism. This is founded on deterministic geodesic flows on the manifold. Examples presented include a warped bivariate Gaussian, Gaussian mixture model, and log-Gaussian Cox process.
This document discusses Markov chain Monte Carlo (MCMC) methods. It begins with an outline of the Metropolis-Hastings algorithm, which is a generic MCMC method for obtaining a sequence of random samples from a probability distribution when direct sampling is difficult. The document then provides details on the Metropolis-Hastings algorithm, including its convergence properties. It also discusses the independent Metropolis-Hastings algorithm as a special case and provides an example to illustrate it.
The document discusses computational methods for Bayesian statistics when direct simulation from the target distribution is not possible or efficient. It introduces Markov chain Monte Carlo (MCMC) methods, including the Metropolis-Hastings algorithm and Gibbs sampler, which generate dependent samples that approximate the target distribution. The Metropolis-Hastings algorithm uses a proposal distribution to randomly walk through the parameter space. Approximate Bayesian computation (ABC) is also introduced as a method that approximates the posterior distribution when the likelihood is intractable.
International Conference on Monte Carlo techniques
Closing conference of thematic cycle
Paris July 5-8th 2016
Campus les cordeliers
Jere Koskela's slides
Likelihood-free methods provide techniques for approximating Bayesian computations when the likelihood function is unavailable or computationally intractable. Monte Carlo methods like importance sampling and iterated importance sampling generate samples from an approximating distribution to estimate integrals. Population Monte Carlo is an iterative Monte Carlo algorithm that propagates a population of particles over time to explore the target distribution. Approximate Bayesian computation uses simulation-based methods to approximate posterior distributions when the likelihood is unavailable.
The document provides an introduction to Markov Chain Monte Carlo (MCMC) methods. It discusses using MCMC to sample from distributions when direct sampling is difficult. Specifically, it introduces Gibbs sampling and the Metropolis-Hastings algorithm. Gibbs sampling updates variables one at a time based on their conditional distributions. Metropolis-Hastings proposes candidate samples and accepts or rejects them to converge to the target distribution. The document provides examples and outlines the algorithms to construct Markov chains that sample distributions of interest.
RSS discussion of Girolami and Calderhead, October 13, 2010Christian Robert
1. The document discusses discretizing Hamiltonians for Markov chain Monte Carlo (MCMC) methods. Specifically, it examines reproducing Hamiltonian equations through discretization, such as via generalized leapfrog.
2. However, the invariance and stability properties of the continuous-time process may not carry over to the discretized version. Approximations can be corrected with a Metropolis-Hastings step, so exactly reproducing the continuous behavior is not necessarily useful.
3. Discretization induces a calibration problem of determining the appropriate step size. Convergence issues for the MCMC algorithm should not be impacted by imperfect renderings of the continuous-time process in discrete time.
Why should you care about Markov Chain Monte Carlo methods?
→ They are in the list of "Top 10 Algorithms of 20th Century"
→ They allow you to make inference with Bayesian Networks
→ They are used everywhere in Machine Learning and Statistics
Markov Chain Monte Carlo methods are a class of algorithms used to sample from complicated distributions. Typically, this is the case of posterior distributions in Bayesian Networks (Belief Networks).
These slides cover the following topics.
→ Motivation and Practical Examples (Bayesian Networks)
→ Basic Principles of MCMC
→ Gibbs Sampling
→ Metropolis–Hastings
→ Hamiltonian Monte Carlo
→ Reversible-Jump Markov Chain Monte Carlo
A Markov Chain Monte Carlo approach to the Steiner Tree Problem in water netw...Carlo Lancia
The document describes using a Metropolis algorithm and Markov chain Monte Carlo (MCMC) approach to solve the minimal Steiner tree problem, which models finding the shortest water distribution network for a farm district. It formulates the problem on a graph and defines the optimization problem and statistical mechanics analogy. It then describes designing a Markov chain with transition probabilities following the Metropolis rule and a Hamiltonian function incorporating edge costs and penalties for configurations violating constraints.
A Compositional Encoding for the Asynchronous Pi-Calculus into the Join-Calculussmennicke
This document presents a compositional encoding of the asynchronous π-calculus (πa) into the join-calculus. It discusses the key differences between πa and the join-calculus in terms of their primitives for parallelism, communication, and restriction. It then reviews an existing encoding by Fournet and Gonthier, and Gorla's criteria for a good encoding in terms of compositionality, name invariance, and operational correspondence. The goal is to define a new encoding of πa into the join-calculus that satisfies Gorla's criteria for being a good encoding.
Intersection modeling using a convergent scheme based on Hamilton-Jacobi equa...Guillaume Costeseque
The document presents an intersection modeling approach using a Hamilton-Jacobi equation. It proposes modeling traffic flow at intersections as the maximization of total flow, without internal states. A numerical scheme is presented to solve the HJ equation based on conservation of vehicles and FIFO principles. Numerical simulations are shown for a diverging intersection with one incoming and two outgoing roads, demonstrating the propagation of density waves over time.
The document discusses second-order traffic flow models on networks. It provides motivation for higher-order models by noting limitations of first-order models like LWR in capturing phenomena observed in real traffic flows. It introduces the Generic Second-Order Model (GSOM) family, which incorporates an additional driver attribute variable beyond density to obtain more accurate descriptions of traffic. GSOM reduces to LWR when this additional variable is ignored. Several examples of GSOM models are also presented.
This document discusses second order traffic flow models on networks. It provides motivation for higher order models by noting limitations of first order models like the Lighthill-Whitham-Richards model. It introduces the Generic Second Order Model (GSOM) family which incorporates additional driver attributes beyond just density. GSOM models are presented in both Eulerian and Lagrangian coordinates. The variational principle and Hamilton-Jacobi formulation are discussed for applying dynamic programming and minimum principles to these models.
The document summarizes a presentation on using Hamilton-Jacobi equations to model traffic flow, specifically the moving bottleneck problem. It introduces traffic flow models including Lighthill-Whitham-Richards and extensions to mesoscopic and multiclass multilane models. It describes the moving bottleneck theory for modeling a slower vehicle generating queues. The talk outlines formulating the problem using partial differential equations coupling traffic flow with the moving bottleneck trajectory and discusses numerical methods for solving the equations.
Road junction modeling using a scheme based on Hamilton-Jacobi equationsGuillaume Costeseque
The document summarizes a numerical scheme for modeling traffic flow at road junctions using Hamilton-Jacobi equations. The scheme models traffic on each branch of the junction as well as at the junction point where branches meet. It introduces Hamiltonians representing traffic flow and establishes gradient estimates and existence/uniqueness results for the numerical solution. The scheme is shown to converge to the unique viscosity solution of the underlying partial differential equations as the grid is refined.
The document reviews optimal speed traffic flow models. It discusses macroscopic and microscopic models, with a focus on car-following models and the optimal velocity model (OVM). The OVM describes how each vehicle tries to travel at an optimal speed based on the distance to the preceding vehicle. Several improved models are presented, including the comprehensive optimal velocity model which considers both distance and speed difference, and the optimal velocity forecast model which incorporates anticipated speed changes. While the models reviewed consider single-lane traffic, the conclusion recommends including non-car vehicles and driver behaviors more common to Nigeria for greater applicability.
Spillover Dynamics for Systemic Risk Measurement Using Spatial Financial Time...SYRTO Project
Spillover Dynamics for Systemic Risk Measurement Using Spatial Financial Time Series Models. Andre Lucas. Amsterdam - June, 25 2015. European Financial Management Association 2015 Annual Meetings.
Differential game theory for Traffic Flow ModellingSerge Hoogendoorn
Lecture given at the INdAM symposium in Rome, 2017. The lecture shows how you can use differential games to model traffic flows, focussing on pedestrian simulation.
Numerical method for pricing american options under regime Alexander Decker
This document presents a numerical method for pricing American options under regime-switching jump-diffusion models. It begins with an abstract that describes using a cubic spline collocation method to solve a set of coupled partial integro-differential equations (PIDEs) with the free boundary feature. The document then provides background on regime-switching Lévy processes and derives the PIDEs that describe the American option price under different regimes. It presents the time and spatial discretization methods, using Crank-Nicolson for time stepping and cubic spline collocation for the spatial variable. The method is shown to exhibit second order convergence in space and time.
A Review Of Major Paradigms And Models For The Design Of Civil Engineering Sy...Tracy Morgan
The document discusses the evolution of paradigms for designing civil engineering systems. It identifies five classical paradigms (A through E) and proposes a new emerging paradigm (F):
1. The empirical model (Paradigm A), static descriptive deterministic method (Paradigm B), static stochastic descriptive model (Paradigm C), and dynamic stochastic descriptive model (Paradigm D) describe previous approaches.
2. The new proposed paradigm is the interactive multi-attribute learning paradigm (Paradigm F), which involves identifying actors, modeling structures, and using tools to generate alternatives, simulate responses, communicate features, and assess reactions and preferences in an interactive learning process.
Hamilton-Jacobi equations and Lax-Hopf formulae for traffic flow modelingGuillaume Costeseque
The document discusses using Hamilton-Jacobi equations and Lax-Hopf formulas to model traffic flow. It introduces the Lighthill-Whitham-Richards traffic model in both Eulerian and Lagrangian coordinates. In the Eulerian framework, the cumulative vehicle count satisfies a Hamilton-Jacobi equation, and Lax-Hopf formulas provide representations involving minimizing cost along trajectories. Similarly in the Lagrangian framework, vehicle position satisfies a Hamilton-Jacobi equation, and Lax-Hopf formulas involve minimizing cost along characteristic curves. The document outlines applying variational principles and optimal control interpretations to these traffic models.
The document summarizes the use of data assimilation methods to correct hydrological model forecasts based on measurements. It presents an example using the CATHY model and assimilating streamflow measurements to correct for uncertainties in initial conditions and atmospheric forcings. It also discusses applications to coupled hydrogeophysical inversion, and using data assimilation at the Landscape Evolution Observatory to estimate spatially distributed hydraulic conductivity fields based on sensor measurements under rainfall experiments.
The role of kalman filter in improving the accuracy of gps kinematic techniqueIAEME Publication
The document discusses using Kalman filtering to improve the accuracy of kinematic GPS positioning. It presents the principles of Kalman filtering, including the linear dynamic and observation models. It then applies a Kalman filter model to GPS data collected along a 30km highway route. The results show that the RMS error is reduced from 28m before filtering to 12m after filtering, demonstrating that Kalman filtering can effectively minimize noise and improve GPS positioning accuracy.
Mini useR! in Melbourne https://www.meetup.com/fr-FR/MelbURN-Melbourne-Users-of-R-Network/events/251933078/
MelbURN (Melbourne useR group) https://www.meetup.com/fr-FR/MelbURN-Melbourne-Users-of-R-Network
July 16th, 2018
Melbourne, Australia
Dynamic models of robot manipulators can be developed using either an Euler-Lagrange approach or a Newton-Euler approach. The Euler-Lagrange approach defines the kinetic and potential energies of each link to obtain the dynamic model analytically. It provides simpler intuition but is less computationally efficient. The Newton-Euler approach uses a recursive technique that exploits the serial structure of manipulators to efficiently compute dynamics in a non-closed form. Both approaches result in the same dynamic model relating joint forces/torques to accelerations.
The document discusses dynamic models of robot manipulators. It introduces the direct and inverse dynamic problems of computing joint accelerations/torques given forces/velocities. It describes modeling manipulators as rigid links using the Euler-Lagrange approach. This involves computing the kinetic and potential energy terms to derive equations of motion. Key steps are defining generalized coordinates as joint variables, computing link velocities using Jacobians, and expressing kinetic energy using link masses, centers of mass, and inertia matrices.
The document proposes a method called generalized time warping (GTW) to temporally align multi-modal sequences from multiple subjects performing similar activities. GTW aims to overcome limitations of existing approaches like dynamic time warping (DTW) which have quadratic complexity and cannot easily align multiple sequences. GTW uses multi-set canonical correlation analysis to find spatial transformations between modalities and models the temporal warping as a combination of monotonic basis functions, allowing a more flexible alignment. Experimental results show GTW can efficiently solve multi-modal temporal alignment and outperforms DTW for intra-modality alignment.
A Strategic Model For Dynamic Traffic AssignmentKelly Taylor
This document proposes a strategic model for dynamic traffic assignment. The key elements are:
1) Users follow strategies that assign preference orders to outgoing arcs from each node based on arrival time and congestion.
2) A time-space network is constructed to model flow variations over time on the original road network.
3) An equilibrium is achieved when expected delays are minimal for each origin-destination pair given the strategies and capacities.
This document discusses queue length estimation on urban corridors using an optimization-based framework that accounts for bounded vehicle acceleration. The approach formulates the problem as a mixed integer linear program (MILP) that finds traffic conditions satisfying macroscopic flow models and sparse GPS data constraints. Optimal solutions are used to compute traffic states and deduce queue lengths over time by identifying regions where density is near the jam density. Model constraints enforce compatibility between initial, boundary, and internal traffic conditions.
This document provides information about a computational stochastic processes course, including lecture details, prerequisites, syllabus, and examples. The key points are:
- Lectures will cover Monte Carlo simulation, stochastic differential equations, Markov chain Monte Carlo methods, and inference for stochastic processes.
- Prerequisites include probability, stochastic processes, and programming.
- Assessments will include a coursework and exam. The coursework will involve computational problems in Python, Julia, R, or similar languages.
- Motivating examples discussed include using Monte Carlo methods to evaluate high-dimensional integrals and simulating Langevin dynamics in statistical physics.
This document discusses atmospheric chemistry models and their use in quantifying atmospheric concentrations and fluxes. Global 3D models divide the atmosphere into grid boxes and use the continuity equation to track species concentrations over time, accounting for transport, chemistry, emissions and deposition. Transport is parameterized using turbulence and convection schemes. Chemistry is solved using operator splitting and implicit methods. Models are evaluated and improved using atmospheric observations from satellites, aircraft and surface sites through data assimilation techniques like inverse modeling. Examples are given of various applications of the GEOS-CHEM global model.
Similar to Numerical methods for variational principles in traffic (20)
Analyse des données du Registre de preuve de covoiturage à l'échelle régional...Guillaume Costeseque
Nous présentons des analyses spatio-temporelles ainsi qu'une modélisation du volume de déplacements en covoiturage à l'échelle régionale à partir des données issues du Registre de preuve de covoiturage (RPC) en France.
Support de cours "Transports intelligents" donné à l’École Centrale de Nantes le 12 mars 20201, auprès d'étudiants en 2eme année filière ingénierie urbaine, option Aménagement et Transport. Présentation des enjeux, des acteurs, du contexte et de quelques tendances des systèmes de transport intelligents avec quelques exemples d'application à Nantes
Support de cours "Transports intelligents" donné à l’École Centrale de Nantes le 9 mars 2020, auprès d'étudiants en 2eme année filière ingénierie urbaine, option Aménagement et Transport. Présentation des enjeux, des acteurs, du contexte et de quelques tendances des systèmes de transport intelligents avec quelques exemples d'application à Nantes
A multi-objective optimization framework for a second order traffic flow mode...Guillaume Costeseque
This slides deal with a common work with Paola Goatin (Inria Sophia-Antipolis), Simone Göttlich and Oliver Kolb (Universität Mannheim) about Riemann solvers for the ARZ model on a junction
Cette présentation a été réalisée lors du congrès ATEC ITS de janvier 2020. Elle aborde l'évaluation réalisée par le Cerema concernant l'expérimentation d'une navette Navya "Autonom Shuttle" en route ouverte sur le territoire de Nantes Métropole, entre mars et mai 2019.
Some recent developments in the traffic flow variational formulationGuillaume Costeseque
This document summarizes recent developments in modeling traffic flow using Hamilton-Jacobi equations. It discusses using Hamilton-Jacobi equations to model cumulative vehicle counts on highways with entrance and exit ramps. Source terms are added to the Hamilton-Jacobi equations to account for the effects of exogenous lateral inflows and outflows of vehicles onto the highway. Analytical solutions are presented for cases with constant inflow rates, and for an extended Riemann problem with piecewise constant boundary and inflow conditions.
Mesoscopic multiclass traffic flow modeling on multi-lane sectionsGuillaume Costeseque
This document presents a mesoscopic multiclass traffic flow model for multi-lane highway sections. It formulates the model using a system of coupled Hamilton-Jacobi partial differential equations to represent different vehicle classes. The model accounts for non-FIFO behavior and capacity drop at lane changes using a parameter. It is solved numerically using a Lax-Hopf scheme, with coupling conditions to represent interactions between classes.
The impact of source terms in the variational representation of traffic flowGuillaume Costeseque
This document examines the impact of source terms in the variational representation of traffic flow. It finds that variational theory solutions are valid in Eulerian coordinates for exogenous source terms but not for endogenous source terms that depend on traffic conditions. However, in discrete time steps, endogenous source terms from the previous step become exogenous for the current step, allowing improved numerical solution methods. Specifically, it presents Godunov's method and variational networks methods for solving the kinematic wave and Hamilton-Jacobi models of traffic flow in discrete time steps.
Numerical approach for Hamilton-Jacobi equations on a network: application to...Guillaume Costeseque
This document presents a numerical scheme for solving Hamilton-Jacobi equations on networks to model traffic flow. It describes applying a Godunov-type scheme using finite differences on networks consisting of branches connected at junctions. The scheme computes numerical solutions of the Hamilton-Jacobi equations on each branch and couples them at junctions using maximum operations. Gradient estimates, existence and uniqueness, and convergence properties of the numerical solutions are proven. The document also interprets the numerical solutions in terms of discrete car densities on the branches and shows the scheme is consistent with classical macroscopic traffic models.
This document discusses dynamic road traffic modeling. It explains that dynamic models are important because they consider time as a factor. Dynamic traffic models can be used for both long-term infrastructure planning and short-term traffic management. They aim to predict departure times, route choices, and how traffic loads networks over time based on traffic flow theory. Dynamic models can take a microscopic approach tracking individual vehicles or a macroscopic approach using averaged quantities. The document also outlines some common uses of dynamic macroscopic models, including estimating the current traffic state, forecasting future states, and optimizing control measures to achieve objectives.
The ORESTE project aims to optimize traffic flow in corridors using ramp metering and optimal rerouting strategies. It is a collaboration between Inria and UC Berkeley. The team has developed macroscopic traffic flow models and an adjoint method to compute gradients for optimal control problems related to ramp metering and rerouting compliant users. Numerical results on test cases show that ramp metering and rerouting can significantly reduce congestion. The team has published several journal and conference papers on their work and is pursuing additional research on junction models and controls based on autonomous vehicles.
ACEP Magazine edition 4th launched on 05.06.2024Rahul
This document provides information about the third edition of the magazine "Sthapatya" published by the Association of Civil Engineers (Practicing) Aurangabad. It includes messages from current and past presidents of ACEP, memories and photos from past ACEP events, information on life time achievement awards given by ACEP, and a technical article on concrete maintenance, repairs and strengthening. The document highlights activities of ACEP and provides a technical educational article for members.
Embedded machine learning-based road conditions and driving behavior monitoringIJECEIAES
Car accident rates have increased in recent years, resulting in losses in human lives, properties, and other financial costs. An embedded machine learning-based system is developed to address this critical issue. The system can monitor road conditions, detect driving patterns, and identify aggressive driving behaviors. The system is based on neural networks trained on a comprehensive dataset of driving events, driving styles, and road conditions. The system effectively detects potential risks and helps mitigate the frequency and impact of accidents. The primary goal is to ensure the safety of drivers and vehicles. Collecting data involved gathering information on three key road events: normal street and normal drive, speed bumps, circular yellow speed bumps, and three aggressive driving actions: sudden start, sudden stop, and sudden entry. The gathered data is processed and analyzed using a machine learning system designed for limited power and memory devices. The developed system resulted in 91.9% accuracy, 93.6% precision, and 92% recall. The achieved inference time on an Arduino Nano 33 BLE Sense with a 32-bit CPU running at 64 MHz is 34 ms and requires 2.6 kB peak RAM and 139.9 kB program flash memory, making it suitable for resource-constrained embedded systems.
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODELgerogepatton
As digital technology becomes more deeply embedded in power systems, protecting the communication
networks of Smart Grids (SG) has emerged as a critical concern. Distributed Network Protocol 3 (DNP3)
represents a multi-tiered application layer protocol extensively utilized in Supervisory Control and Data
Acquisition (SCADA)-based smart grids to facilitate real-time data gathering and control functionalities.
Robust Intrusion Detection Systems (IDS) are necessary for early threat detection and mitigation because
of the interconnection of these networks, which makes them vulnerable to a variety of cyberattacks. To
solve this issue, this paper develops a hybrid Deep Learning (DL) model specifically designed for intrusion
detection in smart grids. The proposed approach is a combination of the Convolutional Neural Network
(CNN) and the Long-Short-Term Memory algorithms (LSTM). We employed a recent intrusion detection
dataset (DNP3), which focuses on unauthorized commands and Denial of Service (DoS) cyberattacks, to
train and test our model. The results of our experiments show that our CNN-LSTM method is much better
at finding smart grid intrusions than other deep learning algorithms used for classification. In addition,
our proposed approach improves accuracy, precision, recall, and F1 score, achieving a high detection
accuracy rate of 99.50%.
Harnessing WebAssembly for Real-time Stateless Streaming PipelinesChristina Lin
Traditionally, dealing with real-time data pipelines has involved significant overhead, even for straightforward tasks like data transformation or masking. However, in this talk, we’ll venture into the dynamic realm of WebAssembly (WASM) and discover how it can revolutionize the creation of stateless streaming pipelines within a Kafka (Redpanda) broker. These pipelines are adept at managing low-latency, high-data-volume scenarios.
Understanding Inductive Bias in Machine LearningSUTEJAS
This presentation explores the concept of inductive bias in machine learning. It explains how algorithms come with built-in assumptions and preferences that guide the learning process. You'll learn about the different types of inductive bias and how they can impact the performance and generalizability of machine learning models.
The presentation also covers the positive and negative aspects of inductive bias, along with strategies for mitigating potential drawbacks. We'll explore examples of how bias manifests in algorithms like neural networks and decision trees.
By understanding inductive bias, you can gain valuable insights into how machine learning models work and make informed decisions when building and deploying them.
Literature Review Basics and Understanding Reference Management.pptxDr Ramhari Poudyal
Three-day training on academic research focuses on analytical tools at United Technical College, supported by the University Grant Commission, Nepal. 24-26 May 2024
NATURAL DEEP EUTECTIC SOLVENTS AS ANTI-FREEZING AGENT
Numerical methods for variational principles in traffic
1. Numerical methods for variational principles in traffic
Guillaume Costeseque
joint work with J-P. Lebacque
Ecole des Ponts ParisTech, CERMICS & IFSTTAR, GRETTIA
S´eminaire Mod´elisation des r´eseaux de transport
October 16, 2013 - Marne-la-Vall´ee
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 1 / 49
2. Introduction
Variational principles in physical systems
Evolutionary systems in time and space
Position
Starting point (x0, t0)
Time
Target (xT , T)
Which is the (good) physical evolution?
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 2 / 49
3. Introduction
Variational principles in physical systems
Evolutionary systems in time and space
Variational methods ⇔ calculus of variations
Calculus of variations
Minimum principle (Pontryagin)
Hamilton−Jacobi−Bellman equation
Dynamic programming (Bellman)
Fermat principle in geometrical optics (1657)
Maupertuis principle in mechanics (1740)
... Euler-Lagrange-Jacobi principle of least action (1755-1840)
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 3 / 49
4. Introduction
Breakthrough in traffic monitoring
Traffic monitoring from GPS enabled devices
Floating car data (probe vehicles)
Cheaper (no dedicated infrastructure)
Increasing number (dense situations)
Accurate
Scientific challenge ⇒ data assimilation
[Mobile Millenium, 2008]
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 4 / 49
7. Macroscopic traffic flow models First order model
LWR model
Traffic state:
density of vehicles ρ(t, x) at time t and location x
flow speed v (mean spatial velocity of vehicles)
x x + ∆x
ρ(x, t)∆x
Q(x, t)∆t Q(x + ∆x, t)∆t
Scalar one dimensional conservation law
∂tρ + ∂x(ρv) = 0 Conservation of vehicles,
v = I(ρ, x) Fundamental diagram.
(1)
[Lighthill and Whitham, 1955], [Richards, 1956]
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 7 / 49
8. Macroscopic traffic flow models First order model
Fundamental diagram (FD)
Flow-density fundamental diagram F : ρ → ρI(ρ)
Empirical function with
ρmax the maximal or jam density,
ρc the critical density
Flux is increasing for ρ ≤ ρc: free-flow phase
Flux is decreasing for ρ ≥ ρc: congestion phase
0
Flow, F
ρmax
Density, ρ
0
Flow, F
ρmax
Density, ρ
0
Flow, F
ρmax
Density, ρ
[Garavello and Piccoli, 2006]
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 8 / 49
9. Macroscopic traffic flow models First order model
Kinematic waves theory
Conservation law
∂tρ + ∂xρ (∂ρF) = −∂xF
Characteristics= curves such that
˙x(t) = ∂ρF
along such curve, density evolves such that
˙ρ(t) = −∂xF
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 9 / 49
10. Macroscopic traffic flow models Second order models
Motivation for higher order models
Experimental evidences
fundamental diagram: multi-valued in congested case
[S. Fan, U. Illinois], NGSIM dataset
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 10 / 49
11. Macroscopic traffic flow models Second order models
Motivation for higher order models
Experimental evidences
fundamental diagram: multi-valued in congested case
phenomena not accounted for: bounded acceleration, capacity drop...
Need for models able to integrate measurements of different traffic
quantities (acceleration, fuel consumption, noise)
First order models: “mass” conservation but what about conservation
of momentum or energy?
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 11 / 49
12. Macroscopic traffic flow models Second order models
GSOM family
Generic Second Order Models (GSOM) family
∂tρ + ∂x(ρv) = 0 Conservation of vehicles,
∂t(ρI) + ∂x(ρvI) = ρϕ(I) Dynamics of the driver attribute I,
v = I(ρ, I) Fundamental diagram,
(2)
Specific driver attribute I
the driver aggressiveness,
the driver origin / destination,
the vehicle class,
...
Flow-density fundamental diagram
F : (ρ, I) → ρI(ρ, I).
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 12 / 49
13. Macroscopic traffic flow models Second order models
Kinematic waves or 1-waves:
similar to the seminal LWR model
density variations at speed ν = ∂ρI(ρ, I)
driver attribute I is continuous
Contact discontinuities or 2-waves:
variations of driver attribute I at speed ν = I(ρ, I)
the flow speed v is constant.
[Lebacque et al., 2007]
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 13 / 49
14. Macroscopic traffic flow models Second order models
Examples of GSOM models
LWR model= a GSOM model with no specific driver attribute
The LWR model with bounded acceleration [Lebacque, 2002-2003],
[Leclercq, 2007] = a GSOM model with driver attribute the speed of
vehicles.
The ARZ model (for Aw, Rascle and Zhang) with driver attribute
I = v − Ve(ρ) and
I(ρ, I) = I + Ve(ρ)
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 14 / 49
15. Macroscopic traffic flow models Second order models
Examples of GSOM models
(continued)
Multi-commodity models (multi-class, multi-lanes)
[Jin and Zhang, 2004],
[Bagnerini and Rascle, 2003],
[Herty, Kirchner, Moutari and Rascle, 2008],
[Klar, Greenberg and Rascle, 2003].
The Colombo 1-phase model with no driver attribute in fluid situation
and driver attribute I a non-trivial scalar in congested situation.
The stochastic GSOM model of [Khoshyaran and Lebacque, 2009]
with driver attribute I a random variable such that I = I(N, t, ω).
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 15 / 49
16. Variational principles in traffic
Outline
1 Macroscopic traffic flow models
2 Variational principles in traffic
LWR model
GSOM family
3 Numerical method
4 Conclusion
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 16 / 49
17. Variational principles in traffic LWR model
Key surface
Three-dimensional representation of traffic flow
Eulerian (x, t), Lagrangian (n, t), T-coordinates (x, n)
See [Makigami et al, 1971], [Laval and Leclercq, 2013]
Moskowitz surface
[Leclercq, Th´eorie du trafic, ENTPE]
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 17 / 49
18. Variational principles in traffic LWR model
LWR in Eulerian (x, t)
Cumulative vehicles count (CVC) or Moskowitz surface N(x, t)
f = ∂tN and ρ = −∂xN
If density ρ satisfies the scalar (LWR) conservation law
∂tρ + ∂xF(ρ) = 0
Then N satisfies the first order Hamilton-Jacobi equation
∂tN − F(−∂xN) = 0 (3)
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 18 / 49
19. Variational principles in traffic LWR model
LWR in Eulerian (x, t)
Legendre-Fenchel transform with F concave (relative capacity)
M(q) = sup
ρ
[F(ρ) − ρq]
M(q)
u
w
Density ρ
q
q
Flow F
w u
q
Transform M
−wρmax
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 19 / 49
20. Variational principles in traffic LWR model
LWR in Eulerian (x, t)
(continued)
Lax-Hopf formula (representation formula) [Daganzo, 2006]
N(T, xT ) = min
u(.),(t0,x0)
T
t0
M(u(τ))dτ + N(t0, x0),
˙X = u
u ∈ U
X(t0) = x0, X(T ) = xT
(t0, x0) ∈ J
(4) Time
Space
J
(T, xT )˙X(τ)
(t0, x0)
Viability theory [Claudel and Bayen, 2010]
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 20 / 49
21. Variational principles in traffic LWR model
LWR in Eulerian (x, t)
(Historical note)
Dynamic programming [Daganzo, 2006] for triangular FD
(u and w free and congested speeds)
Flow, F
w
u
0 ρmax
Density, ρ
u
x
w
t
Time
Space
(t, x)
Minimum principle [Newell, 1993]
N(t, x) = min N t −
x − xu
u
, xu ,
N t −
x − xw
w
, xw + ρmax(xw − x) ,
(5)
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 21 / 49
22. Variational principles in traffic LWR model
LWR in Lagrangian (n, t)
Consider X(t, n) the location of vehicle n at time t ≥ 0
v = ∂tX and r = −∂nX
If the spacing r := 1/ρ satisfies the LWR model (Lagrangian coord.)
∂tr + ∂nV(r) = 0
with the speed-spacing FD V : r → I (1/r) ,
Then X satisfies the first order Hamilton-Jacobi equation
∂tX − V(−∂nX) = 0. (6)
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 22 / 49
23. Variational principles in traffic LWR model
LWR in Lagrangian (n, t)
(continued)
Legendre-Fenchel transform with V concave
M(u) = sup
r
[V(r) − ru] .
Lax-Hopf formula
X(T, nT ) = min
u(.),(t0,n0)
T
t0
M(u(τ))dτ + X(t0, n0),
˙N = u
u ∈ U
N(t0) = n0, N(T) = nT
(t0, n0) ∈ J
(7)
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 23 / 49
24. Variational principles in traffic LWR model
LWR in Lagrangian (n, t)
(continued)
Dynamic programming for triangular FD
1/ρcrit
Speed, V
u
−wρmax
Spacing, r
1/ρmax
−wρmax
n
t
(t, n)
Time
Label
Minimum principle ⇒ car following model [Newell, 2002]
X(t, n) = min X(t0, n) + u(t − t0),
X(t0, n + wρmax(t − t0)) + w(t − t0) .
(8)
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 24 / 49
25. Variational principles in traffic LWR model
Numerical methods for LWR
Dynamic programming [Daganzo, 2006]
Minimization of a cost function over a computational grid
Computational cost proportional to the complexity of the grid
u
w
Position
Time
∆x
∆t
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 25 / 49
26. Variational principles in traffic LWR model
Numerical methods for LWR
Dynamic programming [Daganzo, 2006]
Minimization of a cost function over a computational grid
Computational cost proportional to the complexity of the grid
Exact for piecewise affine (PWA) value conditions and piecewise
affine FD (but not for arbitrary concave FDs)
Possibility to integrate internal boundary conditions but uneasy
Possibility to integrate space/time dependent FDs (space/time
dependent cost)
[Mazar´e et al, 2012]
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 26 / 49
27. Variational principles in traffic LWR model
Numerical methods for LWR
(continued)
Lax-Hopf algorithm [Claudel and Bayen, 2010]
Minimization of closed form partial solutions (grid-free)
Computational cost proportional to the number of initial and
boundary condition blocks
Exact for PWA value conditions and arbitrary concave FDs
Possible integration of internal boundary conditions
Integration of space-time varying fundamental diagrams: to be done
[Mazar´e et al, 2012]
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 27 / 49
28. Variational principles in traffic LWR model
Examples of data assimilation
Eulerian coordi-
nates (x, t) [Mazar´e et al, 2012]
Lagrangian coordinates (n, t)
[Han et al, 2012]
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 28 / 49
29. Variational principles in traffic GSOM family
GSOM in Eulerian (x, t)
From [Li and Zhang, 2013], system of coupled scalar conservation
laws
∂tρ + ∂xf(ρ, s) = 0 Conservation of vehicles,
∂ts + ∂xg(ρ, s) = 0 Dynamics around the equilibrium.
(9)
GSOM family for s = ρI and ϕ = 0
Variational representations for cumulative quantities
Nρ :=
+∞
x
ρ(y, t)dy and Ns :=
+∞
x
s(y, t)dy,
if characteristics system (coupled ODEs) is satisfied...
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 29 / 49
30. Variational principles in traffic GSOM family
GSOM in Lagrangian (n, t)
From [Lebacque and Khoshyaran, 2013], GSOM in Lagrangian
∂tr + ∂N v = 0 Conservation of vehicles,
∂tI = ϕ(N, I, t) Dynamics of I,
v = W(N, r, t) := V(r, I(N, t)) Fundamental diagram.
(10)
Position X(N, t) :=
t
−∞
v(N, τ)dτ satisfies the HJ equation
∂tX − W(N, −∂N X, t) = 0, (11)
And I(N, t) solves the ODE
∂tI(N, t) = ϕ(N, I, t),
I(N, 0) = i0(N), for any N.
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 30 / 49
31. Variational principles in traffic GSOM family
GSOM in Lagrangian (n, t)
(continued)
Legendre-Fenchel transform of W according to r
M(N, c, t) = sup
r∈R
{W(N, r, t) − cr}
M(N, p, t)
pq
W(N, q, t)
W(N, r, t)
q r
p
p
u
c
Transform M
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 31 / 49
32. Variational principles in traffic GSOM family
GSOM in Lagrangian (n, t)
(continued)
Lax-Hopf formula
X(NT , T) = min
u(.),(N0,t0)
T
t0
M(N, u, t)dt + ξ(N0, t0),
˙N = u
u ∈ U
N(t0) = N0, N(T) = NT
(N0, t0) ∈ J
(12)
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 32 / 49
33. Variational principles in traffic GSOM family
GSOM in Lagrangian (n, t)
(continued)
Optimal trajectories = characteristics
˙N = ∂rW(N, r, t),
˙r = −∂N W(N, r, t),
(13)
System of ODEs to solve
Difficulty: not straight lines in the general case
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 33 / 49
34. Numerical method
Outline
1 Macroscopic traffic flow models
2 Variational principles in traffic
3 Numerical method
Methodology
Elementary blocks
Numerical example
4 Conclusion
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 34 / 49
35. Numerical method Methodology
General ideas
First key element: Lax-Hopf formula
Computations only for the characteristics
X(NT , T) = min
(N0,r0,t0)
T
t0
M(N, ∂rW(N, r, t), t)dt + ξ(N0, t0),
˙N(t) = ∂rW(N, r, t)
˙r(t) = −∂N W(N, r, t)
N(t0) = N0, r(t0) = r0, N(T) = NT
(N0, r0, t0) ∈ K
(14)
K is the set of initial/boundary values
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 35 / 49
36. Numerical method Methodology
General ideas
(continued)
Second key element: inf-morphism prop. [Aubin et al, 2011]
Consider a union of sets (initial and boundary conditions)
K =
l
Kl,
then the global minimum is
X(NT , T) = min
l
Xl(NT , T), (15)
with Xl partial solution to sub-problem Kl.
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 36 / 49
37. Numerical method Elementary blocks
Assumptions
Piecewise affine value conditions
the initial condition: positions of vehicles at time t = t0,
the “upstream” boundary condition: trajectory of the first vehicle
N = N0 traveling on the section,
and internal boundary conditions: cumulative vehicles counts at fixed
location X = x0.
Finite horizon problems (N, t) ∈ [N0, Nmax] × [t0, tmax]
No relaxation ϕ = 0
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 37 / 49
38. Numerical method Elementary blocks
Initial conditions
Discretize the set of N into [np, np+1] of length ∆n
Assume that ∆n small enough such that
Simplified dynamic
ϕ(N, I, t) = ϕp(I, t), for any N ∈ [np, np+1].
Initial data are piecewise constant
I(N, t0) = I0,p,
r(N, t0) = r0,p.
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 38 / 49
39. Numerical method Elementary blocks
Sub-algorithm for initial block [np, np+1] × {t0}
(i) Initialize X to +∞
(ii) Number of characteristics to compute
(iii) Compute N(t) of each characteristic while t ≤ tmax and N ≤ Nmax
(iv) Calculate the (exact) solution Xp all along each characteristic
(v) Compute the exact value at any point within the characteristics fan
(simple translation)
(vi) In a rarefaction interpolate the value of X at each point within the
influence domain.
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 39 / 49
40. Numerical method Elementary blocks
PWA initial conditions
Domain of influence of the initial condition
Couples for initial conditions (N, r0(N))
r0,p
0
I0,p
N0
N
np np+1 Nmax
t
tmax
2
1
t0
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 40 / 49
41. Numerical method Elementary blocks
Upstream boundary conditions
Domain of influence of the upstream boundary condition
Couples for initial conditions (N0, r0(t))
N0
t0 N
Nmax
t
tmax
2 1
0
r0,q
tq+1
tq
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 41 / 49
42. Numerical method Elementary blocks
Internal boundary conditions
Domain of influence of the internal boundary condition
Triplet for initial conditions (N(t), r0(t), v0(t))
r0,p
1
0
2
np np+1N0
N
Nmax
t
tmax
t0
r0,p
2
0
1
np np+1N0
N
Nmax
t
tmax
t0
Under-critical case Over-critical case
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 42 / 49
43. Numerical method Numerical example
Fundamental Diagram and Driver Attribute
0 20 40 60 80 100 120 140 160 180 200
−5
0
5
10
15
20
25
30
35
Headway r (m)
SpeedW(m/s)
Fundamental diagram W(N,r,t)
I(N,t)=1
I(N,t)=2
I(N,t)=3
0 5 10 15 20 25 30
1
1.5
2
2.5
3
Label N
Initial conditions I(N,t
0
)
DriverattributeI
0
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 43 / 49
44. Numerical method Numerical example
Initial and Boundaries Conditions
0 5 10 15 20 25 30
15
20
25
30
35
40
45
50
55
60
Label N
Initial conditions r(N,t
0
)Headwayr
0
(m)
0 5 10 15 20 25 30
−800
−700
−600
−500
−400
−300
−200
−100
0
Label N
Initial positions X(N,t
0
)
PositionX(m)
0 50 100 150 200 250 300
10
20
30
40
50
60
70
80
90
Time t (s)
Headwayr
0
(m)
Headway r(N0
,t)
0 50 100 150 200 250 300
0
1000
2000
3000
4000
5000
Time t (s)
Position X(N
0
,t)
PositionX
0
(m)
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 44 / 49
45. Numerical method Numerical example
Numerical result
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 45 / 49
47. Conclusion
High interest of variational theory in trafic
Semi-explicit computational algorithms
Data assimilation
Difficulty when Hamiltonian depends on time / space / vehicle
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 47 / 49
48. Conclusion
High interest of variational theory in trafic
Semi-explicit computational algorithms
Data assimilation
Difficulty when Hamiltonian depends on time / space / vehicle
Open questions:
Extend the algorithm for non-zero dynamics ϕ(I) = 0
Confront the algorithm with real data (NGSIM/MOCoPo datasets)
“Simple” formula for time/space dependent Hamiltonians?
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 47 / 49
49. Conclusion
The End
Thanks for your attention
guillaume.costeseque@cermics.enpc.fr
guillaume.costeseque@ifsttar.fr
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 48 / 49
50. Complements
Some references
G. Costeseque, J.P. Lebacque, A variational formulation for higher
order macroscopic traffic flow models: numerical investigation,
Working paper, (2013).
C.F. Daganzo, On the variational theory of traffic flow:
well-posedness, duality and applications, Networks and Heterogeneous
Media, AIMS, 1 (2006), pp. 601-619.
J.A. Laval, L. Leclercq, The Hamilton-Jacobi partial differential
equation and the three representations of traffic flow, Transportation
Research Part B, 52 (2013), pp. 17-30.
J.P. Lebacque, M.M. Khoshyaran, A variationnal formulation for
higher order macroscopic traffic flow model of the GSOM family,
Procedia-Social and Behavioral Sciences, 80 (2013), pp. 370-394.
G. Costeseque (Universit´e ParisEst) Variational principles: numerics Marne-la-Vall´ee, October 2013 49 / 49