Shared Autonomous Taxi System and Utilization of Collected Travel-Time Information
Bibliographic record
Abstract
Shared autonomous taxi systems (SATS) are being regarded as a promising means of improving travel flexibility. Each shared autonomous taxi (SAT) requires very precise traffic information to independently and accurately select its route. In this study, taxis were replaced with ride-sharing autonomous vehicles, and the potential benefits of utilizing collected travel-time information for path finding in the new taxi system examined. Specifically, four categories of available SATs for every taxi request were considered: currently empty, expected-empty, currently sharable, and expected-sharable. Two simulation scenarios—one based on historical traffic information and the other based on real-time traffic information—were developed to examine the performance of information use in a SATS. Interestingly, in the historical traffic information-based scenario, the mean travel time for taxi requests and private vehicle users decreased significantly in the first several simulation days and then remained stable as the number of simulation days increased. Conversely, in the real-time information-based scenario, the mean travel time was constant. As the SAT fleet size increased, the total travel time for taxi requests significantly decreased, and convergence occurred earlier in the historical information-based scenario. The results demonstrate that historical traffic information is better than real-time traffic information for path finding in SATS.
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.001 |
| 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".