A New Supervised Triple Deep Learning Strategy for Fault Isolation and Tolerant Cruise Control in Connected Autonomous Vehicles
Bibliographic record
Abstract
Fault-tolerant cruise control technologies are crucial for autonomous vehicles to ensure continuous operation and safety by effectively managing unexpected system failures. This paper introduces a new triple deep learning method for fault isolation and tolerant cruise control in Connected Autonomous Vehicles (CAVs). First, the dynamic model of the CAVs is captured using an auto-encoder via measurable signals. Adaptive thresholds are then derived from the dynamic model to facilitate fault detection. Afterward, for fault isolation, a Bidirectional Long Short-Term Memory (BiDLSTM) network is employed to classify the fault types. Later, three different neural networks, including BiDLSTM, Long Short-Term Memory (LSTM), and fully connected networks are trained to reconstruct the faulty signals. The outputs from these networks are integrated using a fusion method to generate robust reconstructed signals. Subsequently, these signals are forwarded into an adaptive neural network-based controller to mitigate the fault effects. The main contribution is that the proposed dynamic model with adaptive shareholding improves fault isolation with lower false alarm rates. Additionally, the tolerant cruise control provided a robust control structure that can ensure connectivity and continuous operation. Comparative analysis with traditional methods shows that the proposed fault isolation and fault-tolerant method significantly improves efficiency and reliability.
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.001 | 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.001 |
| 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".