Determining E-Bike Drivers’ Decision-Making Mechanisms during Signal Change Interval Using the Hidden Markov Driving Model
Bibliographic record
Abstract
Rapidly increasing e-bike use in China has resulted in new traffic problems including rising accident rates at intersections related to e-bike drivers’ decision-making during multiple signal phases. Traditional one-step decision models (such as GHM) lack randomness and cannot adequately model e-bike drivers’ complex behavior. Therefore, this study used a Hidden Markov Driving Model (HMDM) to analyze e-bike drivers’ decision-making process based on high-resolution trajectory data. Video data were collected at three intersections in Shanghai and processed for use in the HMDM model. Five decision types (pass, stop, stop-pass, pass-stop, and multiple) composed of speed and acceleration/deceleration information were defined and used to analyze the impact of flashing green signals on e-bike drivers’ behavior and decision-making processes. Approximately 40% of drivers made multiple decisions during the flashing green and yellow signal phases, in contrast to the traditional GHM model assumption that drivers only make one decision. Distance from stop-line had the most obvious influence on the number of decisions. The use of flashing green signals nearly eliminated the dilemma zone for e-bike drivers but enlarged the option zone, inducing more stop/pass decisions. HMDM can be applied to improve the accuracy of traffic simulation, the fine design of traffic signals, the stability analysis of traffic control schemes, and so on.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 source (direct Gemma or distilled Codex), 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".