PACE: Proactive Adaptive Constrained Edge-Decision for Safe and Generalizable Online Decision-Making
preprint
OA: closed
CC-BY-4.0
Abstract
Edge computing requires safe, efficient, and generalizable online decision-making, yet existing methods suffer from reactive constraint handling, fragmented scheduling frameworks, and poor generalization. We propose PACE, a unified framework shifting from reactive remediation to proactive anticipation. PACE integrates a Proactive Constrained Policy Optimizer with preemptive penalty and constraint-aware intrinsic rewards, a Nested Index Scheduler with closed-form policies for preemptive and non-preemptive AoI minimization, and a Generalizable Multi-Objective Offloading Network with histogram encoding and masking for single-policy generalization. Experiments on safe locomotion, MEC scheduling, and multi-objective offloading show PACE achieves highest returns with strict constraint satisfaction, reduces AoI by up to 61.84%, and attains near-optimal Pareto performance within 0.3% of the upper bound using a single policy.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2026) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.
Source provenance
- europepmc
- last seen: 2026-05-20T01:45:00.602351+00:00
- unpaywall
- last seen: 2026-05-22T02:00:06.705733+00:00
License: CC-BY-4.0