Sense Once, Serve Many: Common-Trace Factorized Constrained PPO for Online Sensing-Session Consolidation in Multi-Tenant ISAC Networks

arXiv 2608.29256 ↗First posted 29 Aug 2026cs.NI cs.LGcited by 0

On the map: Deep reinforcement learning methods → RL for energy, networks and operations

Abstract (arXiv)

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.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in RL for energy, networks and operations, one of 15 directions in Deep reinforcement learning methods. Builds on 16 of its 21 references that are in the map. First posted on arXiv 29 Aug 2026.

Builds on

16 of 21 references.

References · 16

2017Proximal Policy Optimization Algorithmscited by 15,215
2015Trust Region Policy Optimizationcited by 2,580
2015High-Dimensional Continuous Control Using Generalized Advantage Estimationcited by 2,026
2017Deep Setscited by 1,421
2017Constrained Policy Optimizationcited by 983
2017Counterfactual Multi-Agent Policy Gradientscited by 751
2020Responsive Safety in Reinforcement Learning by PID Lagrangian Methodscited by 316
2021Integrated Sensing and Communications: Towards Dual-functional Wireless Networks for 6G and Beyondcited by 91
2018Variance Reduction for Policy Gradient with Action-Dependent Factorized Baselinescited by 68
2020Counterfactual Credit Assignment in Model-Free Reinforcement Learningcited by 64
2019Joint Radar and Communication Design: Applications, State-of-the-art, and the Road Aheadcited by 19
2022Sensing as a Service in 6G Perceptive Networks: A Unified Framework for ISAC Resource Allocationcited by 7

4 more

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way