Follow-the-Leader models can be viewed as a numerical approximation to the Lighthill-Whitham-Richards model for traffic flow
Helge Holden, Nils Henrik Risebro

TL;DR
This paper demonstrates that Follow-the-Leader models serve as a numerical approximation to the Lighthill-Whitham-Richards traffic flow model, providing a convergence proof based on conservation law analysis techniques.
Contribution
It establishes a rigorous connection between FtL models and the LWR model, showing convergence in dense traffic conditions with a novel proof approach.
Findings
FtL models approximate the LWR model in dense traffic
A simple proof of convergence is provided
Techniques from numerical schemes for conservation laws are used
Abstract
We show how to view the standard Follow-the-Leader (FtL) model as a numerical method to compute numerically the solution of the Lighthill--Whitham--Richards (LWR) model for traffic flow. As a result we offer a simple proof that FtL models converge to the LWR model for traffic flow when traffic becomes dense. The proof is based on techniques used in the analysis of numerical schemes for conservation laws, and the equivalence of weak entropy solutions of conservation laws in the Lagrangian and Eulerian formulation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Follow-the-Leader models can be viewed as a numerical approximation to the
Lighthill–Whitham–Richards model for traffic flow
Helge Holden
Department of Mathematical Sciences, NTNU Norwegian University of Science and Technology, NO–7491 Trondheim, Norway
[email protected] https://www.ntnu.edu/employees/holden and
Nils Henrik Risebro
Department of Mathematics, University of Oslo, P.O. Box 1053, Blindern, NO–0316 Oslo, Norway
Abstract.
We show how to view the standard Follow-the-Leader (FtL) model as a numerical method to compute numerically the solution of the Lighthill–Whitham–Richards (LWR) model for traffic flow. As a result we offer a simple proof that FtL models converge to the LWR model for traffic flow when traffic becomes dense. The proof is based on techniques used in the analysis of numerical schemes for conservation laws, and the equivalence of weak entropy solutions of conservation laws in the Lagrangian and Eulerian formulation.
Key words and phrases:
Follow-the-Leader model, Lighthill–Whitham–Richards model, traffic flow, continuum limit.
2010 Mathematics Subject Classification:
Primary: 35L02; Secondary: 35Q35, 82B21
Research was supported by the grant Waves and Nonlinear Phenomena (WaNP) from the Research Council of Norway. The research was done while the authors were at Institut Mittag-Leffler, Stockholm.
1. Introduction
There are two paradigms in the mathematical modeling of traffic flow. One is based on an individual modeling of each vehicle with the dynamics governed by the distance between adjacent vehicles. The other is based on the assumption of dense traffic where the vehicles are represented by a density function, and individual vehicles cannot be identified. The dynamics is governed by a local velocity function depending solely on the density. The first model is denoted the Follow-the-Leader (FtL) model, and the second is called the Lighthill–Whitham–Richards (LWR) model [13, 14] for traffic flow. Further refinements and extensions of these models are available. Intuitively, it is clear that the the FtL model should approach or approximate the LWR model in the case of heavy traffic, and that is what is proved here. This problem has been extensively studied, see [1, 2, 3, 5, 6, 7, 8, 9, 10, 12, 15]. Using numerical methods for scalar conservation laws we show that FtL models appear naturally as a numerical approximation of the LWR model. Thus we offer a short and direct proof that the FtL model converges to the LWR model, and our analysis is based on a careful study of the relationship between weak solutions in Lagrangian and Eulerian variables.
In the LWR model vehicles are described by a density where is the position along the road, and as usual denotes time. Locally, one assumes that the velocity is given by a function that depends on the density only, that is, . If we consider unidirectional traffic on a homogenous road without exits or entries, conservation of vehicles requires that the dynamics is governed by the scalar conservation law
[TABLE]
which constitutes the LWR model. It is often denoted as “traffic hydrodynamics” due to its resemblance with fluid dynamics.
The FtL model can be described as follows. Consider vehicles with length and position on the real axis with dynamics given by
[TABLE]
Here denotes a given velocity function with maximum , perhaps the speed limit. Our proofs are considerably simpler when we have a uniform bound on . Having empty road ahead of the first car would mean that “”. This is the same as imposing , and in this case would not be bounded by a constant independent of time. Therefore we will in this paper assume that we model one of two alternatives:
Periodic case: We are in the periodic case in which for some interval , and
[TABLE]
Non-periodic case: We imagine that there are infinitely many vehicles to the right of , the distance between each of these vehicles is , for a finite, but arbitrary, constant . In this case
[TABLE]
Introduce for , to obtain
[TABLE]
In this paper we analyze the limit of this system of ordinary differential equations when . There are two ways to proceed.
We may analyze this system directly, in what we call the semi-discrete case, see Section 2.1. By using methods from the theory of numerical methods for scalar conservation laws we show that the sequence converges, as and , to a function that satisfies the equation
[TABLE]
where , and with boundary condition
[TABLE]
Note that is the Lagrangian mass coordinate, so that the integer part of measures how many cars there are to the left of .
Equation (1.1) is an example of a hyperbolic conservation law. It is well-known that solutions develop singularities, denoted shocks, in finite time independent of the smoothness of the initial data. Thus one needs to study weak solutions, and design so-called entropy conditions to identify the unique weak physical solution. For a scalar conservation law with initial data , the unique weak entropy solution , which is an integrable function of bounded variation, satisfies the Kružkov entropy condition
[TABLE]
for all real constants , and all non-negative test functions . See [11].
As an alternative approach, see Section 2.2, we may discretize the time derivative by a small positive and write , , we have that
[TABLE]
where . The key observation is that this is an approximation of the hyperbolic conservation law by a monotone scheme, and from the classical result of Crandall–Majda [4], see also [11, Thm. 3.9], we know that this scheme converges, as , , and , to the entropy solution of equation (1.1), namely . Thus in both cases we obtain convergence to the same hyperbolic conservation law in Lagrangian coordinates.
Next we have to transform the result of the two approaches, both in Lagrangian coordinates, to Eulerian coordinates. For smooth solutions this is nothing but a simple exercise in calculus, but for weak entropy solutions this is a deep result due to Wagner [16]. To be specific, we introduce the Eulerian space coordinate , with and . A straightforward (but formal) calculation reveals that the Eulerian functions satisfy
[TABLE]
and hence
[TABLE]
which is nothing but the LWR model. These formal transformations are not valid in general for weak entropy solutions. However, thanks to the fundamental result of Wagner [16], weak entropy solutions in Lagrangian coordinates transform into weak entropy solutions in Eulerian variables. The approach here bears some resemblance to the approach in [12], where the proof is obtained in a grid-less manner, and it does not depend on the use of Crandall–Majda and Wagner.
2. The model
Let us first introduce the FtL model. Consider vehicles moving on a one-dimensional road. Their position is given as a function of time as . For the moment (we shall actually show that this is so below) we assume that . We introduce the “local inverse density” by
[TABLE]
where is the length of each vehicle. The velocity of the vehicle at is assumed to be a function of the distance to the vehicle in front, at . This means that
[TABLE]
Regarding the first vehicle, located at , we either assume that there are infinitely many equally spaced vehicles in front of it, i.e., , or that we are in the periodic setting in an interval , so that the distance from the vehicle at to the vehicle at is , i.e., . We have
[TABLE]
Regarding the velocity function , we assume it to be a decreasing Lipschitz continuous function such that
[TABLE]
The prototypical example is . We define the velocity in Lagrangian variables by . Observe that is globally bounded, Lipschitz continuous and increasing for , with a bounded Lipschitz constant .
Rewriting (2.1) in terms of we get
[TABLE]
and
[TABLE]
Let us also define the Lagrangian grid by . We shall also assume throughout that there is a constant , independent of and , such that
[TABLE]
2.1. The semi-discrete case
In this section we show that the solution of the system (2.4) of ordinary differential equations converges to an entropy solution of (2.20) as , and that “” converges to an entropy solution of (2.12).
Concretely, we define the piecewise constant function
[TABLE]
We shall also use the notation
[TABLE]
for the forward difference. Let
[TABLE]
and let denote the Heaviside function
[TABLE]
Lemma 2.1**.**
Let solve the system (2.4). Then
[TABLE]
for any constant .
Proof.
Throughout we use the notation . We have that
[TABLE]
Now
[TABLE]
since is increasing. This proves (2.8a); estimate (2.8b) is proved similarly. ∎
Now define for and for in the non-periodic case. In the periodic case we define by periodic extension. To save space, we also use the convention that in the non-periodic case, sums over range over all , while in the periodic case, sums range over .
Lemma 2.2**.**
If , then for .
Proof.
From (2.8a) and (2.8b) we have
[TABLE]
Thus if for all , then for any constant . Similarly for any constant if for all . ∎
Lemma 2.3**.**
If is another solution of (2.4) and (2.5) with initial data , then
[TABLE]
for .
Proof.
Adding (2.8a) and (2.8b), and observing that
[TABLE]
we find that
[TABLE]
Set . Choosing in the inequality for and in the inequality for , and adding the two inequalities, give
[TABLE]
where denotes the difference with respect to the first (second) argument. Summing over , multiplying with a non-negative test function , where , and integrating by parts yield
[TABLE]
since taking the sum makes the right-hand side “telescope”. Now we can use Kružkov’s trick, see [11, Sec. 2.4], and choose
[TABLE]
where , and is a standard mollifier, to obtain, as , that
[TABLE]
Choose to be a smooth approximation to the characteristic function of the interval , to get
[TABLE]
The lemma follows by letting and . For details, see [11, Sec. 2.4]. ∎
Lemma 2.4**.**
Assume that and that for some constant independent of . Then there is a sequence , where as , and there exists a function such that converges to in .
Proof.
Lemma 2.2 shows that is bounded independently of ; choosing and using Lemma 2.3 yields the bound on uniformly in and . Choosing in Lemma 2.3 for some gives
[TABLE]
Hence the map is Lipschitz continuous, with a Lipschitz constant independent of . Thus by [11, Thm. A.11], the family is compact in . ∎
Furthermore we assume that as increases, the initial position of the vehicles are such that there is a function such that
[TABLE]
and that this convergence is in . We also assume that , without loss of generality we can then also assume that .
It is now straightforward, starting from the discrete entropy inequality (2.10), to show that any limit of is the unique entropy solution to (2.20) by following a standard Lax–Wendroff argument, see [11, Thm. 3.4]. Thus the whole sequence converges, and the unique entropy solution to (1.1) is the limit
[TABLE]
Introduce the Eulerian spatial coordinate , given by the equations
[TABLE]
and the variable . We can now proceed following the argument of Wagner [16] to obtain that is the unique weak entropy solution to the LWR model
[TABLE]
We can also study the convergence in Eulerian coordinates directly by defining a discrete version of the transformation from Lagrangian to Eulerian coordinates. To define the discrete version of , we need the approximate Eulerian coordinate; . Define
[TABLE]
where solves (2.1). Then
[TABLE]
for . The sequence is uniformly Lipschitz continuous. Hence by the Arzelà–Ascoli theorem, it converges uniformly to a Lipschitz continuous limit satisfying and almost everywhere. Furthermore the map is invertible, with inverse . In the periodic case we set
[TABLE]
Observe that as .
Define
[TABLE]
In the periodic case, we define by periodic continuation, while in the non-periodic case we define
[TABLE]
Next we claim that
[TABLE]
in as . To see this, define , and compute
[TABLE]
We have that
[TABLE]
Since and are both bounded by , and as , the first of these integrals tend to zero. Since uniformly, the integrand tends to zero almost everywhere, and is bounded by . Hence by the dominated convergence theorem, the last integral tends to zero. The same argument applies to . Thus the claim (2.15) is justified.
Summing up, we have shown the following result.
Theorem 2.5**.**
*Assume that the function satisfies (2.3). Let satisfy (2.4), with either periodic boundary conditions; , or for some fixed constant . Assume that the initial positions of the vehicles are such the we can define a bounded function by (2.11), and that (2.6) holds, namely that the initial data are bounded with finite total variation.
(i) The piecewise constant (in space) function defined by (2.7) converges in as to the unique weak entropy solution of (1.1). The function satisfies the LWR model (2.12) in Eulerian variables.
(ii) The function defined by (2.14) converges in as to the unique weak entropy solution of (2.12).*
2.2. Analysis of the Euler scheme for (2.1)
The simplest numerical method to approximate solutions of (2.1) is the forward Euler scheme, viz.,
[TABLE]
where is a (small) positive number.
If we write the Euler scheme (2.16) in the variable, we get
[TABLE]
where , , and . As a (right) boundary condition we use
[TABLE]
For and define the function
[TABLE]
Observe that we can rewrite (2.17) as
[TABLE]
where
[TABLE]
and since is Lipschitz continuous, . Hence if the CFL-condition
[TABLE]
holds, then is a convex combination of and . Thus the scheme (2.17) is monotone. In passing, we note that a consequence is that if for all , then for all . Regarding the position of vehicles, this means that if , then . So from a road safety perspective, the model is rather optimistic.
We are now interested in taking the limit as . We do this by increasing the number of vehicles such that ; furthermore we assume that (2.11) holds. Now the conditions are such that fundamental results of Crandall and Majda [4], see also [11, Thm. 3.9], can be applied. Thus we know that there is a function , with , such that
[TABLE]
with the limit being in , and that is the unique entropy solution to the Cauchy problem
[TABLE]
If we do not have periodic conditions, this is supplemented with the boundary condition
[TABLE]
We remark that since the characteristic speeds of (2.20) are strictly negative, this boundary condition can be enforced strictly.
Note that the convergence of and the bounds , imply the convergence of to some function . We now proceed to show how is related to the solution of the LWR model.
We also define the discrete “Lagrange to Euler” map as follows. Let
[TABLE]
Since solves (2.16), we also have that
[TABLE]
Define , and by bilinear interpolation between these points. For later use we employ the notation for the value of at the edges of the “Lagrangian grid”,
[TABLE]
Observe that coincides with the approximate trajectory of the vehicle starting at calculated by the Euler method (2.16). Since is bounded, we can invoke the Arzelà–Ascoli theorem to establish the convergence
[TABLE]
with the limit being in and , and that
[TABLE]
weakly. We have that the map is invertible for each , we denote the inverse map by , so that . Define and as in (2.13) and as in (2.14).
Note that if and , then
[TABLE]
As before we have that
[TABLE]
in as .
By Wagner’s result [16], we have proved the following theorem.
Theorem 2.6**.**
Assume that the function satisfies (2.3). Let and , let satisfy (2.16), and assume that either we are in the periodic case , or that satisfies the boundary condition (2.2), with . Assume that the initial positions of the vehicles are such the we can define a bounded function by (2.11), and that (2.6) holds.
Define the function by (2.14). Let and satisfy and assume that the CFL-condition (2.19) holds.
*As , converges in to the unique entropy solution of the conservation law (2.12). *
To illustrate the ideas in this paper we show how the method works in a concrete example. We have a periodic road in the interval , and choose to position vehicles in this interval so that
[TABLE]
In Figure 1 we show the Lagrangian grid and the corresponding mapping to Eulerian coordinates for , and .
The vertical lines in the Eulerian coordinates are also the paths followed by the vehicles, and the grid in Eulerian coordinates is the result of applying the map to the rectangular grid depicted in Lagrangian coordinates on the left. In Figure 2, we show the approximate density at and in Eulerian coordinates.
We see that the solution at approximates the ubiquitous “-wave”.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] B. Argall, E. Cheleshkin, J. M. Greenberg, C. Hinde, and P.-J. Lin. A rigorous treatment of a follow-the-leader traffic model with traffic lights present. SIAM J. Appl. Math. 63(19): 149–168, 2002.
- 2[2] A. Aw, A. Klar, T. Materne, and M. Rascle. Derivation of continuum traffic flow models from microscopic follow-the-leader models. SIAM J. Appl. Math. , 63(1): 259–278, 2002.
- 3[3] R. M. Colombo and E. Rossi. On the micro-macro limit in traffic flow. Rend. Sem. Math. Univ. Padova 131:217–235, 2014.
- 4[4] M. G. Crandall and A. Majda. Monotone difference approximations for scalar conservation laws. Math. Comp. , 34:1–21, 1980.
- 5[5] E. Cristiani and S. Sahu. On the micro-to-macro limit for first-order traffic flow models on networks. Networks and Heterogeneous Media 11(3):395–413, 2016. doi:10.3934/nhm.2016002.
- 6[6] M. Di Francesco, S. Fagioli, and M. D. Rosini. Deterministic particle approximation of scalar conservation laws. Preprint, ar Xiv:1605.05883 v 1 , 2016.
- 7[7] M. Di Francesco, S. Fagioli, M. D. Rosini, and G. Russo. A deterministic particle approximation for non-linear conservation laws. In N. Bellomo, P. Degond, E. Tadmor (eds.) Active Particles, Volume 1 , Birkhäuser, 2017, pp. 333–378.
- 8[8] M. Di Francesco and M. D. Rosini. Rigorous derivation of nonlinear scalar conservation laws from follow-the-leader type models via many particle limit. Arch. Ration. Mech. Anal. , 217(3):831–871, 2015.
