arXiv AI By Zoe Li

CoreSense: Traceable Failure Recall and Conflict-Aware Belief Gating for Auditable Robot Decisions

Read the original on arXiv AI →

CoreSense is a robot‑system integration architecture that traces episodic evidence and uses a conflict‑aware belief gate to decide whether to proceed, re‑observe, abstain, or escalates. The gate evaluates scope, provenance, time, contradiction, and support before making a recommendation. Evaluation on public robot datasets, simulations, and a live cloud deployment shows that belief gating can eliminate protocol‑defined unsafe proceeds while maintaining auditability.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Oct 12

RESCUE: Is This Alarm Worth Acting On? Counterfactual Evaluation of VLA Runtime Monitors

The paper introduces RESCUE, a counterfactual framework that evaluates whether runtime monitors for robot policies generate alarms that lead to useful interventions. By restoring simulator and policy states at checkpoints, RESCUE compares alternative actions to identify the latest checkpoint that satisfies a recovery criterion and measures whether acting on alarms reduces expected task‑completion cost. Experiments on OpenVLA‑OFT and π0.5 over LIBERO‑Spatial and LIBERO‑Plus show that recoverability depends on the state–intervention pair, and that even an ideal detector can only tolerate a 2.0–3.3% false‑alarm rate before unnecessary resets outweigh early failure stops.

By David Ahmedt-Aristizabal, Abdelwahed Khamis, Mohammad Ali Armin, Lars Petersson
arXiv AI
Oct 9

IndustrialVLA-Bench: A Traceable Multi-Axis Evaluation of Open Robot Policy Models

IndustrialVLA-Bench evaluates six released vision‑language‑action (VLA) and world‑action (WAM) robot policy models using a unified reporting schema. It measures clean capability on LIBERO, non‑language robustness on LIBERO‑Plus, instruction sensitivity on LIBERO‑Para, and observed execution cost, aggregating results across three random seeds. The benchmark also reports inference latency, peak memory, runtime mode, and evidence status for each system, enabling traceable comparisons without claiming one paradigm is universally superior.

By Yiqi Wang, Zhifeng Rao, Jiaqi Zhang, Xiaoyang Li, Zhangkai Wu, Yiqun Duan, Mingkai Zheng, Fei Wang, Shan You, Taotao Cai
arXiv AI
Oct 9

Traceable World State: A Provenance-Aware State Representation and Deterministic Replay Framework for Robotic Systems

Traceable World State (TWS) is a middleware‑neutral semantic representation that records robotic world states with provenance, including entities, relations, observations, confidence, and revision metadata. TWS snapshots are immutable, support deterministic replay through ordered updates, and use a SHA‑256 hash chain for tamper‑evident logging. Evaluation on Python 3.10‑3.14, BEHAVIOR‑1K tasks, and simulated NVIDIA Unitree G1 trajectories shows TWS passes 38 tests, validates complete state lifecycles, achieves exact terminal‑state replay, and detects all injected corruptions with only a 1.72% storage overhead over plain JSONL.

By Zoe Li