An Improved Single-Lane Cellular Automaton Model considering Driver’s Radical Feature
Bibliographic record
Abstract
Traffic flow models are of vital significance to study the traffic system and reproduce typical traffic phenomena. In the process of establishing traffic flow models, human factors need to be considered particularly to enhance the performance of the models. Accordingly, a series of car-following models and cellular automaton models were proposed based on comprehensive consideration of various driving behaviors. Based on the comfortable driving (CD) model, this paper innovatively proposed an improved cellular automaton model incorporating impaired driver’s radical feature (RF). The impaired driver’s radical feature was added to the model with respect to three aspects, that is, desired speed, car-following behavior, and braking behavior. Empirical data obtained from a highway segment was used to initialize impaired driver’s radical feature distribution and calibrate the proposed model. Then, numerical simulations validated that the proposed improved model can well reproduce the traffic phenomena, as shown by the fundamental diagram and space-time diagram. Also, in low-density state, it can be found that the RF model is superior to the CD model in simulating the speed difference characteristics, where the average speed difference of adjacent vehicles for RF model is more consistent with reality. The result also discussed the potential impact of impaired drivers on rear-end collisions. It should be noted that this study is an early stage work to evaluate the existence of impaired driving behavior.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".