Microscopic modeling of cyclists interactions with pedestrians in shared spaces: a Gaussian process inverse reinforcement learning approach
Bibliographic record
Abstract
This study presents a microsimulation-oriented framework for modeling cyclists' interactions with pedestrians in shared spaces. The objectives of this study are to 1) infer how cyclists in head-on and crossing interactions rationally assess and make guidance decisions of acceleration and yaw rate, and 2) use advanced Artificial Intelligent (AI) techniques to model road-user interactions. The Markov Decision Process modeling framework is used to account for road-user rationality and intelligence. Road user trajectories from three shared spaces in North America are extracted by means of computer-vision algorithms. Inverse Reinforcement Learning (IRL) algorithms are utilized to recover continuous linear and nonlinear Gaussian-Process (GP) reward-functions (RFs). Deep Reinforcement Learning is used to estimate optimal cyclist policies. Results demonstrated that the GP-RF captures the more complex interaction behaviour and accounts for road-user heterogeneity. The GP-RF led to more consistent inferences of road-users behaviour and accurate predictions of their trajectories compared with the linear RF.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| 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".