Bayesian Predictive Model for Electric Level 4 Connected Automated Vehicle Adoption
Bibliographic record
Abstract
Electric Level 4 connected automated vehicles (CAVs) are now allowed to demonstrate their automation capability in shared mobility robotaxi and microtransit services in geofenced areas in several cities around the world. Private and public sector stake-holders need predictions of their adoption without regulatory constraints for personal mobility and use in shared mobility services. In anticipation of the future presence of CAVs in transportation vehicle fleets, governments are planning necessary regulatory and infrastructure changes. Accompanying this need for forecasts is the acknowledgement that CAV adoption decisions must be made under uncertain states of technology and infrastructure readiness. This paper presents a Bayesian predictive modelling framework for electric Level 4 CAV adoption in the 2030–2035 application context. The inputs to the Bayesian model are obtained from effectiveness estimates of CAV applications that are processed with the Monte Carlo method to account for uncertainties in these estimates. Scenarios of CAV adoption in the 2030–2035 period are analyzed using the Bayesian model, including the quantification of the value of new information obtainable from demonstration studies intended to reduce uncertainties in technology and infrastructure readiness. The results show that in the 2030–2035 application context, the CAVs are likely to be adopted, provided that the trajectory of progress in technology and infrastructure readiness continues, and potential adopters are offered opportunities to learn about Level 4 CAV technological capabilities in a real life service environment. The threshold level of the probability of adoption enhances significantly with high-reliability demonstration results that can reduce uncertainties in adoption decisions. The findings of this research can be used by private and public sector interest groups.
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.004 | 0.011 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.005 | 0.001 |
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".