اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA Markov Process Inspired Cellular Automata Model of Road Traffic
466
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
To provide a more accurate description of the driving behaviors in vehicle queues, a namely Markov-Gap cellular automata model is proposed in this paper. It views the variation of the gap between two consequent vehicles as a Markov process whose stationary distribution corresponds to the observed distribution of practical gaps. The multiformity of this Markov process provides the model enough flexibility to describe various driving behaviors. Two examples are given to show how to specialize it for different scenarios: usually mentioned flows on freeways and start-up flows at signalized intersections. The agreement between the empirical observations and the simulation results suggests the soundness of this new approach.
قيم البحث
اقرأ أيضاً
We present a new cellular automata model of vehicular traffic in cities by combining ideas borrowed from the Biham-Middleton-Levine (BML) model of city traffic and the Nagel-Schreckenberg (NaSch) model of highway traffic. The model exhibits a dynamic
al phase transition to a completely jammed phase at a critical density which depends on the time periods of the synchronized signals.
Elementary cellular automata (ECA) present iconic examples of complex systems. Though described only by one-dimensional strings of binary cells evolving according to nearest-neighbour update rules, certain ECA rules manifest complex dynamics capable
of universal computation. Yet, the classification of precisely which rules exhibit complex behaviour remains a significant challenge. Here we approach this question using tools from quantum stochastic modelling, where quantum statistical memory -- the memory required to model a stochastic process using a class of quantum machines -- can be used to quantify the structure of a stochastic process. By viewing ECA rules as transformations of stochastic patterns, we ask: Does an ECA generate structure as quantified by the quantum statistical memory, and if so, how quickly? We illustrate how the growth of this measure over time correctly distinguishes simple ECA from complex counterparts. Moreover, it provides a more refined means for quantitatively identifying complex ECAs -- providing a spectrum on which we can rank the complexity of ECA by the rate in which they generate structure.
Different from previous models based on scatter theory and random matrix theory, a new interpretation of the observed log-normal type time-headway distribution of vehicles is presented in this paper. Inspired by the well known Galton Board, this mode
l views drivers velocity adjusting process similar to the dynamics of a particle falling down a board and being deviated at decision points. A new car-following model based on this idea is proposed to reproduce the observed traffic flow phenomena. The agreement between the empirical observations and the simulation results suggests the soundness of this new approach.
City traffic is a dynamic system of enormous complexity. Modeling and predicting city traffic flow remains to be a challenge task and the main difficulties are how to specify the supply and demands and how to parameterize the model. In this paper we
attempt to solve these problems with the help of large amount of floating car data. We propose a coarse-grained cellular automata model that simulates vehicles moving on uniform grids whose size are much larger compared with the microscopic cellular automata model. The car-car interaction in the microscopic model is replaced by the coupling between vehicles and coarse-grained state variables in our model. To parameterize the model, flux-occupancy relations are fitted from the historical data at every grids, which serve as the coarse-grained fundamental diagrams coupling the occupancy and speed. To evaluate the model, we feed it with the historical travel demands and trajectories obtained from the floating car data and use the model to predict road speed one hour into the future. Numerical results show that our model can capture the traffic flow pattern of the entire city and make reasonable predictions. The current work can be considered a prototype for a model-based forecasting system for city traffic.
In this paper, we show that a generalization of the discrete Burgers equation can be obtained by a kind of discrete Cole--Hopf transformation to the discrete diffusion equation corresponding to the correlated random walk, which is also known as a gen
eralization of the well known random walks. By applying the technique called ultradiscretization, we obtain the generalization of the ultradiscrete diffusion equation, the ultradiscrete Cole--Hopf transformation and the ultradiscrete Burgers equation. Moreover, we show that the resulting ultradiscrete Burgers equation yields cellular automata. The relationship of the ultradiscrete Burgers equation to the traffic flow is also discussed.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
