Task Offloading and Resource Allocation in Vehicular Cooperative Perception With Integrated Sensing, Communication, and Computation
Bibliographic record
Abstract
Vehicular cooperative perception (VCP) facilitates the exchange of sensing data among vehicles through vehicle-to-everything (V2X) communication, significantly increasing the sensing range and precision of individual autonomous vehicles (AVs). However, efficiently managing the sharing and processing of large volumes of sensing data presents challenges due to restricted communication and computation resources. This study introduces an integrated sensing, communication, and computation (ISCC)-based task offloading and resource allocation (ITORA) framework, which optimizes cooperative perception by determining what data to share, which vehicles to involve, and how to process the data effectively. We develop an information value function to evaluate the data quality for each vehicle. Subsequently, we design strategies for sensing task allocation, task offloading, and resource allocation to enable value-driven data selection at a subregion level, facilitating collaborative computing among edge servers and vehicles. Additionally, we formulate an optimization problem aimed at maximizing information value while minimizing delay and energy consumption, subject to constraints on a full region of interest (RoI) coverage, delay, wireless bandwidth, and computational resources. We decompose the mixed-integer nonlinear programming (MINLP) problem into two subproblems, devising a sensing task allocation algorithm and a proximal policy optimization (PPO)-based task offloading and resource allocation (PTORA) algorithm to address them. Comprehensive simulations validate the effectiveness of the proposed PTORA in optimizing information value, reducing task execution delay, and minimizing energy consumption.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".