Gated branch neural network for mandatory lane changing suggestion at the on‐ramps of highway
Bibliographic record
Abstract
A gated branch neural network (GBNN) is proposed for modelling mandatory lane changing (MLC) behaviour at the on‐ramps of highways. It provides a core algorithm for an MLC suggestion system for advanced driver assistance systems (ADAS), where the main challenge is the trade‐off between computational speed and prediction accuracy for both non‐merge and merge events. The GBNN algorithm employs a gated branch based on correlation analysis, scaled exponential linear units activation function, and adaptive moment estimation optimiser. The algorithm has been evaluated using the real‐world dataset of U.S. Highway 101 and Interstate 80 from Federal Highway Administration's Next Generation Simulation (NGSIM). Input features are extracted from NGSIM and pre‐processed by standardisation and principal component analysis. TensorFlow framework and Python are used as the development platform. Results show that the proposed GBNN algorithm with the Pearson correlation method has values of 97.7%, 96.3%, and 0.990 for non‐merge accuracy, merge accuracy, and receiver operating characteristic score, respectively. It outperforms other traditional binary classifiers for MLC applications, and is more light‐weight than a convolutional neural network (AlexNet) of deep learning algorithm. Owing to its compact architecture, the GBNN provides high accuracy and efficiency, demonstrating promising usage as an MLC suggestion system in ADAS.
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.001 | 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.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".