跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+0已有论文修订
+91新增 AI 导读

arXiv 最近完成扫描:2026-11-22 08:44 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

统计 2026-11-21 13:10 — 2026-11-22 13:10(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-22 08:44最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-22 08:42(北京时间)
版本更新 · v3arXiv:2508.06243

SCAR: State-Space Compression for AI-Based Radio Resource Management of Vehicular Services

Ioan-Sorin Comsa, Purav Shah, Karthik Vaidhyanathan, Deepak Gangadharan, Christof Imhof, Per Bergamin, Aryan Kaushik, Gabriel-Miro Muntean 等 9 位作者

原文摘要

The increasing demand for connected vehicular services poses significant challenges for AI-based network and service management due to the high volume and rapid variability of network state information. Traditional management and control mechanisms struggle to scale when processing fine-grained metrics such as Channel Quality Indicators (CQIs) in dynamic vehicular environments. To address this challenge, we propose SCAR (State-Space Compression for AI-Based Radio Resource Management), an edge-assisted framework that abstracts high-dimensional CQI information into compact representations for AI-based management. SCAR employs machine-learning (ML)-based compression techniques, including clustering and radial basis function (RBF) networks, to reduce the dimensionality of CQI-derived state information while preserving essential features relevant to management decisions. The resulting compressed states are used to train reinforcement learning (RL)-based management policies that dynamically adapt the throughput-fairness trade-off according to service-level fairness objectives defined by the NGMN. Simulation results show that CQI compression improves average NGMN feasible-region occupancy from 56.32% to 88.07% across ten RL algorithms, reaching 97.76% for the best-performing RL configuration, with limited throughput degradation and competitive computational overhead. Furthermore, simulated annealing with stochastic tunneling (SAST)-based clustering reduces state compression distortion by approximately 10% compared with conventional K-means clustering. These results demonstrate SCAR's ability to provide compact state representations for RL-based network and service management while improving service-level fairness in dynamic vehicular systems.

cs.LG · cs.NE · eess.SY