TY - GEN
T1 - SAPA
T2 - 7th International Conference on Big Data and Artificial Intelligence and Software Engineering, ICBASE 2026
AU - Ma, Jingxiang
AU - Liu, Ping
AU - Ma, Hongbin
AU - Jin, Ying
N1 - Publisher Copyright:
© 2026 IEEE.
PY - 2026
Y1 - 2026
N2 - Edge-intelligent sensor networks require limited sensing, computing, or communication resources to be allocated over many interacting sensing units under a fixed-sum constraint. The principal challenge is that the desired sensing pattern changes within an episode: early decisions emphasize high-risk nodes, middle decisions maintain connected coverage, and late decisions preserve reserve capacity, while the regime is unobserved. Existing score-ranking, ROI-based, and fixed-decoder policies often encode a single preference field and have limited capacity to switch sensing patterns under the nonnegative fixed-sum constraint. Structure-Adaptive Pattern-Guided Resource Allocation (SAPA) constructs focus, support, protection, and reserve patterns, then uses cue-conditioned gates and residual controls to mix them on the resource simplex. On a controlled 224-cell edge-sensing benchmark with 100k-step, three-seed training, SAPA obtains stable cumulative gain (13.23±0.04), compared with 6.97±0.05 for the strongest learned baseline, while also achieving the highest support capture among the compared methods.
AB - Edge-intelligent sensor networks require limited sensing, computing, or communication resources to be allocated over many interacting sensing units under a fixed-sum constraint. The principal challenge is that the desired sensing pattern changes within an episode: early decisions emphasize high-risk nodes, middle decisions maintain connected coverage, and late decisions preserve reserve capacity, while the regime is unobserved. Existing score-ranking, ROI-based, and fixed-decoder policies often encode a single preference field and have limited capacity to switch sensing patterns under the nonnegative fixed-sum constraint. Structure-Adaptive Pattern-Guided Resource Allocation (SAPA) constructs focus, support, protection, and reserve patterns, then uses cue-conditioned gates and residual controls to mix them on the resource simplex. On a controlled 224-cell edge-sensing benchmark with 100k-step, three-seed training, SAPA obtains stable cumulative gain (13.23±0.04), compared with 6.97±0.05 for the strongest learned baseline, while also achieving the highest support capture among the compared methods.
KW - edge intelligence
KW - graph reinforcement learning
KW - latent-regime allocation
KW - sensing resource allocation
KW - sensor networks
KW - simplex-constrained decoder
UR - https://www.scopus.com/pages/publications/105047021069
U2 - 10.1109/ICBASE70763.2026.11619516
DO - 10.1109/ICBASE70763.2026.11619516
M3 - Conference contribution
AN - SCOPUS:105047021069
T3 - 2026 7th International Conference on Big Data and Artificial Intelligence and Software Engineering, ICBASE 2026
SP - 633
EP - 637
BT - 2026 7th International Conference on Big Data and Artificial Intelligence and Software Engineering, ICBASE 2026
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 12 June 2026 through 14 June 2026
ER -