Metraipolis › archive › dc_7997af840205
Sense Once, Serve Many: Common-Trace Factorized Constrained PPO for Online Sensing-Session Consolidation in Multi-Tenant ISAC Networks — arXiv:2608.29256
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.29256
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T08:39:49.251Z
- SHA-256 of the archived text
dd1a929667cbae152dfb4f2e294457336098b8ddf698c3cea0d98f9c6d53fd6e- Stable URL of this page
https://metraipolis.com/documento/dc_7997af840205
How to cite
Sense Once, Serve Many: Common-Trace Factorized Constrained PPO for Online Sensing-Session Consolidation in Multi-Tenant ISAC Networks — arXiv:2608.29256 — arXiv (en), https://arxiv.org/abs/2608.29256 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7997af840205 (Metraipolis archive dc_7997af840205, sha256 dd1a929667cbae152dfb4f2e294457336098b8ddf698c3cea0d98f9c6d53fd6e)
BibTeX
@misc{dc7997af840205,
title = {Sense Once, Serve Many: Common-Trace Factorized Constrained PPO for Online Sensing-Session Consolidation in Multi-Tenant ISAC Networks — arXiv:2608.29256},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.29256},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7997af840205; sha256 dd1a929667cbae152dfb4f2e294457336098b8ddf698c3cea0d98f9c6d53fd6e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.29256. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Integrated sensing and communication (ISAC) networks can serve compatible requests through shared sensing sessions, but consolidation couples admission, reuse, profile selection, sensing service-level agreements (SLAs), communication quality of service (QoS), and future commitments. We formulate this problem as a constrained Markov decision process and propose Common-Trace Factorized Constrained Proximal Policy Optimization (CT-PPO). During training, stochastic policy replicas share the same primitive workload trace; leave-one-out discounted Monte Carlo return contrasts provide reward credit to applicable actor factors, while constraint credit remains factor/prefix-specific. Across five training seeds and matched workloads, CT-PPO achieves the highest mean macro return, exceeding matched Joint-Credit PPO (JC-PPO) by 0.934 (95% confidence interval [0.702, 1.164]) and SLA-Aware Greedy by 1.847; versus JC-PPO, it reduces sensing-resource cost by 6.277 and raises accepted requests per created session by 0.0806. A four-way ablation shows that the factorized surrogate alone yields no detectable macro-return gain, whereas adding common-trace reward credit produces the dominant improvement. Without retraining, CT-PPO retains a return advantage at low, nominal, and high arrival loads, with the strongest gain under clustered arrivals. Deployment uses public observations and hard masks; CT-PPO's extra parameters are training-side, its actor footprint matches JC-PPO, and actor-only CPU latency is effectively unchanged. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-01 in cs.LG). Categorie arXiv: Networking and Internet Architecture (cs.NI) ; Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2608.29256 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-17T08:13:26.903Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).