Fundamental Diagrams of 1D-Traffic Flow by Optimal Control Models

Details Fundamental Diagrams of 1D-Traffic Flow by Optimal Control Models Fundamental Diagrams of 1D-Traffic Flow by Optimal Control Models

2010-02-10

arxiv.org/abs/1002.2105v1

Mathematics

Optimization and Control

17 pages,

Scientific paper

Traffic on a circular road is described by dynamic programming equations associated to optimal control problems. By solving the equations analytically, we derive the relation between the average car density and the average car flow, known as the fundamental diagram of traffic. First, we present a model based on min-plus algebra, then we extend it to a stochastic dynamic programming model, then to a stochastic game model. The average car flow is derived as the average cost per time unit of optimal control problems, obtained in terms of the average car density. The models presented in this article can also be seen as developed versions of the car-following model. The derivations proposed here can be used to approximate, understand and interprete fundamental diagrams derived from real measurements.

Affiliated with

Also associated with

No associations

Rating

Fundamental Diagrams of 1D-Traffic Flow by Optimal Control Models does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fundamental Diagrams of 1D-Traffic Flow by Optimal Control Models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fundamental Diagrams of 1D-Traffic Flow by Optimal Control Models will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-239140