Harnessing Embodied Agents: Runtime Governance for Policy-Constrained Execution

Xue Qin; Simin Luan; John See; Zeyd Boukhers; Cong Yang; Zhijun Li

Home/Archive/arXiv

arXiv · 2604.07833

Harnessing Embodied Agents: Runtime Governance for Policy-Constrained Execution

Xue Qin·Simin Luan·John See·Zeyd Boukhers·Cong Yang·Zhijun Li

View original source ↗Read source document ↗Export metadata ↓

Abstract

Embodied Agents are evolving from passive reasoning systems into active executors that interact with tools, robots, and physical environments. Once an agent gains execution authority, the central challenge shifts from how to make it act to how to keep its actions governable at runtime. Existing approaches embed safety, recovery, and decision constraints inside the agent loop, making execution control difficult to standardize, audit, and adapt across environments. We propose a runtime governance framework for policy-constrained execution that separates agent cognition from execution oversight. Governance is externalized into a dedicated runtime layer performing policy checking, capability admission, execution monitoring, rollback, and human override. We formalize the control boundary among a persistent Embodied Agent, modular Capability Packages, and the governance layer, and define a policy-constrained execution pipeline evaluated under controlled simulation. Over 1000 randomized trials, the framework achieves 96.2%+/-2.7% interception of unauthorized actions, reduces unsafe continuation from 100% to 22.2%+/-3.1% under runtime drift, and attains 90.7%+/-3.0% recovery success with full policy compliance. Comparison with five baselines, including AutoRT-style constitution filtering and RoboGuard-style two-stage guardrails, shows that pre-execution filtering is equally effective across governance-aware methods, while only the proposed framework provides continuous runtime detection (RVDR = 61.3% vs. 0%) and structured recovery (all p<0.001). A sensitivity sweep across the full detection range confirms a genuine detection-continuation trade-off. This work argues future embodied systems should be designed for governable execution.

Explore related subjects

cs.RO

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Xue Qin, Simin Luan, John See, Zeyd Boukhers, Cong Yang, Zhijun Li. 2026-06-10. Harnessing Embodied Agents: Runtime Governance for Policy-Constrained Execution. https://arxiv.org/abs/2604.07833

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

HybridFlow: A 2-NFE Generative Policy for Real-Time Robotic Manipulation

Generative policies for robotic manipulation must balance action accuracy with inference latency. We present HybridFlow, a three-stage policy inference procedure requiring two network function evaluations (2-NFE). A Global Jump uses the MeanFlow average velocity to generate a coarse action trajectory; a parameter-free ReNoise interpolation constructs a state at a nonzero refinement time; and a Local Refine queries the instantaneous-velocity limit of the same network at that time. This construction reuses a unified model without distillation. Our analysis characterizes interval-composition errors and the attenuation of endpoint error under ReNoise interpolation. Controlled RoboMimic ablations support the MeanFlow proposal and intermediate-state construction, achieving 95% average success with reused noise and 95.5% with fresh noise, versus 78% for one-step MeanFlow. Across five real-robot settings with all policies running on the same Jetson AGX Thor, HybridFlow improves normalized task performance over 16-step Diffusion Policy by 13-68 points with approximately eightfold lower action-generation latency. Additional experiments demonstrate its compatibility as an action expert in a vision-language-action framework. Project page: https://hybridflow-anonymous.pages.dev/

cs.RO↗

arXiv2026

SCRAMPPI: Contingency-Constrained Planning using Hamilton-Jacobi Reachability

Autonomous robots commonly aim to achieve a nominal objective while minimizing a cost. Without contingency preparation, this can leave them vulnerable to mission failure. This is formalized as a trajectory optimization problem over the nominal cost with a contingency constraint: from each checked state along the nominal plan, an admissible contingency maneuver must exist that reaches a designated recovery target within a prescribed contingency horizon. Existing methods either optimize contingency trajectories alongside the nominal plan or evaluate this constraint through computationally expensive nested sampling-based searches. Instead, we introduce SCRAMPPI, which represents this requirement as a reach-avoid problem and leverages Hamilton--Jacobi (HJ) reachability analysis to evaluate contingency feasibility. By either computing a reach-avoid value function offline or updating it only as the environment is revealed, and integrating it with model predictive path integral (MPPI) control via resampling-based rollouts, SCRAMPPI provides contingency-feasibility evaluations while still planning in 15-20 hz. Finally, we present simulated and hardware experiments demonstrating real-time nominal planning and execution of contingency maneuvers in mobile-robot navigation, alongside a five-dimensional friction-limited recovery simulation.

cs.RO↗

arXiv2026

Scenario MPC with STL Specifications and Pareto-Based Feasibility Repair

Temporal logic is a formal language for reasoning about system behaviors over time. Signal temporal logic (STL), in particular, has been used to encode spatio-temporal requirements for control synthesis in multi-agent systems, often under the assumption that agents are cooperative and their dynamics are known. However, real-world multi-agent applications, such as autonomous driving, typically involve stochastic and uncontrollable agents. Recent work explored robust control with worst-case or probabilistic formulations, but remains limited in that it either (1) certifies strict satisfaction of STL constraints without addressing feasibility recovery, or (2) relaxes infeasible constraints with ego-centric objectives. In this paper, we propose a model predictive control (MPC) framework that treats feasibility repair as a Pareto optimization problem to explicitly characterize tradeoffs among agent objectives. We further provide a probabilistic certificate on STL violation rate to formally quantify uncertainty under stochastic and uncontrollable agents. The proposed framework is evaluated on two autonomous driving scenarios. Results show that the framework recovers feasible control with demonstrated safe behaviors.

cs.RO↗