Joint Optimization of Communication Latency and Platoon Control Based on Uplink RSMA for Future V2X Networks
Bibliographic record
Abstract
As an effective solution to address road congestion and improve traffic efficiency, vehicle platooning has received a lot of attention in recent years. However, vehicle-to-vehicle (V2V) communication latency can largely impact on the performance of vehicle platooning, which has not been well investigated. Rate-splitting multiple access (RSMA), as one of the promising technologies for 6 G, holds great potential for application in vehicle platooning to reduce the communication latency and thereby enhance platoon control performance. Motivated by the above considerations, platoon control and communication latency are jointly considered in this paper. We first introduce the communication latency into the vehicle dynamics model, and then derive a distributed model predictive control (DMPC)-based platoon control model. To reduce the communication latency, uplink RSMA is introduced for inter-platoon V2V communication. Since the latency minimization problem is non-convex and challenging to solve directly, we first employ a bisection method to give a latency upper bound and transform the initial problem into a non-convex feasibility problems in each iteration. Subsequently, through theoretical derivation, the bandwidth allocation factor is expressed in terms of transmission power, which reduces the number of optimization variables and transforms the problem into a convex problem. Then we can obtain the optimal solution by solving a convex problem in each iteration. Finally, the simulation results demonstrate that the proposed RSMA significantly outperforms traditional frequency division multiple access (FDMA) and non-orthogonal multiple access (NOMA), and can significantly reduce communication latency, enhance platoon control safety, improve driving comfort, and lower the performance requirement on vehicle maximum torque.
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.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| 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".