TSTNet: Temporal Semantic Transformer-Based Computing Power Network for Automatic Driving in the Internet of Vehicles
Bibliographic record
Abstract
Automatic driving systems face critical challenges, including limited computational resources, complex data processing demands, and disruptions caused by high vehicular mobility, all of which hinder real-time decision-making and system accuracy. Existing solutions, such as edge computing and distributed architectures, partially address these issues but often fail to integrate semantic communication and mobility-aware optimizations. To tackle these challenges, we propose a temporal semantic transformer (TSTNet)-based edge computing network architecture (TSTNet) that enhances decision-making accuracy and reduces latency in automatic driving systems. TSTNet overcomes three key challenges in automatic driving. First, it efficiently utilizes limited computational resources by optimizing the processing of large-scale multimodal data through lightweight semantic extractors and attention-based feature integration, significantly reducing computational overhead. Second, it preserves semantic and behavioral continuity by ensuring seamless transitions of vehicle behavior and surrounding scene semantics during mobility and service handovers. This ensures consistent situational awareness even in highly dynamic vehicular environments. Third, TSTNet reduces decision-making latency by leveraging semantic inheritance to minimize redundant computations, enabling real-time performance and improving the reliability of driver-assist systems. Experimental results demonstrate that TSTNet improves task accuracy by over 90% while reducing decision-making latency by over 50% compared to conventional methods. This architecture offers a scalable, efficient, and robust solution to the computational and mobility challenges in automatic driving, enabling enhanced real-time adaptability in complex traffic scenarios.
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.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".