🤖 Robotics arXiv Digest

2026-08-10
30 papers 7 research areas
Generated by Claude

Research Landscape

The largest and most coherent story in today's batch is the maturation of World Action Models and VLA policies from architecture toward deployability. Papers like JEPA-WAM and SLIM-0.5B push on how to represent action-grounded latents efficiently, while HarnessWAM, Rethink Before You Execute (TempoWAM), and the surgical Trajectory Divergence Horizon Decision (TDHD) paper converge, from three different angles, on the same diagnosis: fixed-length open-loop action execution is a fundamental reliability bottleneck. HarnessWAM adds an external agentic task manager for long-horizon deliberation and recovery; TempoWAM adds a lightweight progress monitor that adaptively decides when to replan; TDHD estimates trajectory divergence under perturbation as a real-time confidence signal in real surgical hardware. That three independent groups landed on structurally similar fixes in the same week is a strong signal that the field now treats "when to trust a chunk of predicted actions" as a first-class problem, not an afterthought.

A second theme is infrastructure and evaluation catching up to the pace of model development. XPolicyLab tackles the practical pain of comparing 42 different robot policies across incompatible software stacks, while WorldSimProbe turns a critical eye on the world models these policies increasingly rely on, finding systematic action-realization failures that today's visual-quality and task-success metrics miss entirely — a useful caution for HarnessWAM, JEPA-WAM, and the physics-structured Energy-Structured Latent World Model (ELWM), all of which lean on learned dynamics for planning or deliberation. RynnValue extends this infrastructure push to reward modeling, showing that timestamp-derived temporal distance can outperform expensive preference-labeled supervision at scale (7,000+ hours, ~3M clips) and, notably, that the resulting reward model measurably improves real robot success rates rather than just offline ranking metrics.

Beyond the VLA/WAM cluster, the batch shows learned control methods spreading into domains historically dominated by classical estimation and control: RL-trained collision avoidance for satellites (97.5% success vs. 20-28% for rule-based baselines), physics-informed latent world models for open-world navigation, and Wasserstein-robust covariance correction bolted onto standard EKF/ESKF localization stacks. Meanwhile a steady stream of unglamorous but clinically grounded hardware work continues in parallel — a second-generation closed-loop robotic esophagus (RoSEv2.0) for stent testing, a new contact-rich dataset for robot-assisted bathing, and McKibben-actuator haptic guidance for the torso and shoulder — a reminder that not all of robotics research is chasing generalist foundation models.

Papers by Research Area

VLA & World Action Models (3)

Core architectures that jointly represent perception, language, and action inside a single predictive model.

  • #5 — HarnessWAM: Bridging Prediction and Deliberation in World Action Model…
  • #14 — JEPA-WAM: Learning Vision-Language-Action Policies with Joint-Embeddin…
  • #28 — SLIM-0.5B: Learning Action-Grounded Predictive Latents for Robot Manip…

Adaptive & Reliable Policy Execution (5)

Deployment-time mechanisms that decide when to trust, replan, or slow down a learned policy's actions.

  • #6 — VANE: Reliable Test-Time Training for Vision-Language-Action Models vi…
  • #7 — Trajectory Divergence Horizon Decision for Reliable Dual-Arm Surgical …
  • #15 — SpeedTuning: Speeding Up Policy Execution with Lightweight Reinforceme…
  • #17 — RynnValue: Scaling Robotic Value Foundation Models with Temporal Dista…
  • #18 — Rethink Before You Execute: Adaptive Execution for World Action Models

Robot Learning Infrastructure & World-Model Evaluation (3)

Standards and diagnostics for comparing policies and stress-testing whether learned world models are physically faithful.

  • #10 — XPolicyLab: A Unified Standard and Open Ecosystem for Robot Policy Eva…
  • #11 — WorldSimProbe: Diagnosing Simulator Faithfulness in Action-Conditioned…
  • #12 — Energy-Structured Latent World Models with Neural Time Fields for Phys…

Reinforcement Learning & Optimization for Control (3)

RL and Bayesian optimization applied to manipulation, wearable assistance, and orbital collision avoidance.

  • #9 — Personalized Lower-limb Exoskeleton Assistance via Preference-based Ba…
  • #21 — Satellite Trajectory Optimization via Proximal Policy Optimization for…
  • #29 — Efficient Real-World Online Reinforcement Learning for Robot Manipulat…

Navigation, Localization & Autonomous Driving (6)

Odometry, filtering, cooperative and off-road driving, and constrained trajectory planning.

  • #16 — ROEVO: Robust Organized Edge Feature-based Visual Odometry Using RGB-D…
  • #19 — UnsDrive: Towards Robust End-to-End Autonomous Driving in Unstructured…
  • #22 — DH-VLM: Dual-Horizon Cooperative Latent Reasoning for Autonomous Drivi…
  • #23 — Entanglement-Free Trajectory Planning for Tethered Mobile Robots with …
  • #25 — Hierarchical Fast--Slow ReAct Agent for Zero-Shot Object-Goal Navigati…
  • #26 — WRAP: Wasserstein-Robust Adaptive Plug-in for Robot Localization

Manipulation Perception & Physical Human-Robot Interaction (6)

Part-level and fabric perception for manipulation, plus wearable haptics and contact-rich physical assistance.

  • #3 — Intuitive Directional Sense Presentation to the Torso Using McKibben-B…
  • #4 — Intuitive Hand Positional Guidance Using McKibben-Based Surface Tactil…
  • #8 — High Fidelity Capture, Reconstruction, and Transfer of Human Demonstra…
  • #13 — Robotic Fabric Alignment System for Sewing Using Global Local Weighted…
  • #27 — RoboSeg: Online Part-Level Semantic Reconstruction for Robotic Manipul…
  • #30 — Removing Infrastructure Barriers in Human-Robot Collaboration Through …

Specialized Systems: Medical Robotics, Safety & Telerobotics (4)

Soft robotic medical devices, LLM-based safety verification, and bandwidth-aware teleoperation.

  • #1 — RoSE: A Robotic Soft Esophagus for Endoprosthetic Stent Testing
  • #2 — Nonlinear Model Predictive Control of a Robotic Soft Esophagus
  • #20 — TAMS: Task-Aware Multi-View Adaptive Streaming for Wireless Teleroboti…
  • #24 — Agentic Harnesses: LLM-Driven Verification Layers for Robot Autonomy

Papers by Category

VLA & World Action Models

#5
h=17
HarnessWAM: Bridging Prediction and Deliberation in World Action Models
2026-08-10 cs.RO Guibo Zhu (h=17)
Zhaopeng Gu, Bingke Zhu, Tianxi Lin, Guibo Zhu, Yingying Chen
Core Contributions
  • ▸ Names and directly addresses a specific failure mode of World Action Models — the "prediction-deliberation gap" — where finite-horizon action/dynamics prediction can't support global planning, cross-stage memory, or failure recovery.
  • ▸ Introduces an agentic layer (a VLM-based Task Manager) that sits outside the WAM itself, maintaining an evidence-grounded scene belief and task graph rather than baking deliberation into the policy — a model-external approach that could generalize across different underlying WAMs.
  • ▸ Runs a dual-timescale loop: a lightweight high-frequency progress estimator plus milestone-triggered deliberation, letting the system decide to advance, gather more observations, replan, or recover locally instead of blindly executing.
  • ▸ State-of-the-art 59.6%/69.9% full-task/subtask success on RoboMemArena and 23.7% on RoboCerebra Ideal — notable because RoboCerebra Ideal specifically stresses long-horizon memory, exactly where explicit state maintenance should matter most.
Show abstract

World Action Models (WAMs) jointly learn environmental dynamics and robot actions, introducing priors over physical evolution into embodied control. However, finite-horizon prediction and action generation are insufficient for complex embodied tasks that require global planning, cross-stage state maintenance, execution verification, and failure recovery. We refer to this mismatch as the prediction-deliberation gap of WAMs. To address this gap, we propose HarnessWAM, an agentic framework for WAMs. HarnessWAM employs a vision-language-model-based Task Manager to maintain an evidence-grounded scene belief and a structured task graph. A capability-conditioned executable-space projection further constrains open-ended semantic plans into sequences of atomic skills that satisfy task dependencies, embodiment-state constraints, and the capability boundary of the underlying WAM. During execution, HarnessWAM operates through an event-driven, dual-timescale feedback loop: a lightweight progress estimator continuously provides high-frequency execution evidence, while the Task Manager deliberates at salient milestones by jointly considering the current observation, task state, and interaction history to determine whether to advance the task, acquire additional observations, revise the plan, or initiate local recovery. This mechanism enables the robot to recover its state after a subtask failure and resume execution without discarding previously acquired scene knowledge. HarnessWAM achieves state-of-the-art full-task and subtask success rates of 59.6% and 69.9% on RoboMemArena, and an SR of 23.7% on RoboCerebra Ideal. These results demonstrate that model-external structured state maintenance and closed-loop agentic decision making can effectively extend the local control capabilities of WAMs into embodied task execution that is plannable, verifiable, and recoverable.

#14
h=6
JEPA-WAM: Learning Vision-Language-Action Policies with Joint-Embedding World Modeling
2026-08-10 cs.RO Jing Zhang (h=6)
Yihan Lin, Jiawei He, Shifeng Bao, Chen Zhao, Yang Li
Core Contributions
  • ▸ Builds the world-action model inside a pretrained V-JEPA latent space rather than generating pixels, avoiding the heavy deployment cost of video-generation WAMs while keeping the benefit of explicit future-state prediction.
  • ▸ Uses one shared predictor for both latent transition prediction and action generation, so future-prediction supervision directly shapes the same backbone used for control — unlike prior latent WAMs that separate predictive and action representations.
  • ▸ 79.2% on LIBERO-Plus without large-scale robot-policy pretraining (best in that regime), and 86.3% when instantiated on a pretrained pi-0.5 backbone — showing the JEPA-style transition objective complements, rather than competes with, large VLA pretraining.
Show abstract

Robust robot control benefits from explicitly modeling state transitions, but video-generation world action models (WAMs) introduce substantial deployment cost. Existing latent WAMs avoid explicit future generation, but often compress predictive representations or separate predictive modeling from the representations used for action generation. We introduce JEPA-WAM, a latent WAM built in a pretrained V-JEPA space, which couples latent transition prediction with continuous action generation through a shared predictor. JEPA-WAM predicts a spatially structured joint current-future target that captures task-shared visual temporal structure between current and future observations, while preserving dense patch-level correspondence. Through the shared predictor, transition supervision directly shapes the backbone, from which dedicated representations are extracted for action prediction. The same design can also be instantiated in pretrained VLA policies while preserving their original perception and action pathways. On LIBERO-Plus, JEPA-WAM achieves 79.2%, the best result without large-scale robot-policy pretraining, while its pretrained $π_{0.5}$ instantiation reaches 86.3%, achieving the best overall performance. Experiments on RoboTwin 2.0 and real-world bimanual manipulation further demonstrate strong generalization under visual and spatial shifts.

#28
h=0
SLIM-0.5B: Learning Action-Grounded Predictive Latents for Robot Manipulation
2026-08-10 cs.RO Jingkai Wang (h=0)
Jingkai Wang, Zihan Tang, Gu Zhang, Mingyu Cao, Jiapeng Chen
Core Contributions
  • ▸ Argues most of a large VLA backbone's capacity goes toward open-domain semantic understanding the robot doesn't need, and instead builds a compact 0.5B-parameter policy around action-grounded latents rather than full pixel-level prediction.
  • ▸ Learns representations via self-supervised masked trajectory prediction that combines action reconstruction with future-latent prediction, run through a compact Mixture-of-Transformers backbone, then trained with flow matching for action generation.
  • ▸ Matches or exceeds much larger VLA and world-action-model baselines on simulation and real-world tasks despite far fewer parameters, no extra embodied pretraining, lower latency, and less GPU memory — evidence that representation design, not just scale, still moves the needle for VLA performance.
Show abstract

Vision-language-action policies rely on large multimodal backbones to jointly perform perception, language conditioning, and action generation at every control step. Much of this capacity supports open-domain semantics, whereas continuous robot manipulation primarily requires compact representations of observations, actions, and the transitions induced by actions. Pixel-level world models provide another route, but predicting visual details irrelevant to control can be unnecessarily expensive. We propose SLIM (Self-supervised Latent Interaction Model), a compact 0.5B-parameter latent interaction policy. SLIM learns action-grounded predictive latents that capture both action-conditioned future transitions and the actions that explain observed changes. SLIM learns these representations through self-supervised masked trajectory prediction, combining action reconstruction with future-latent prediction. A compact Mixture-of-Transformers (MoT) backbone models interactions between observation latents and action tokens. The resulting policy is trained with flow matching for language-conditioned action generation. Across simulation benchmarks and real-world evaluation, SLIM matches or exceeds representative large-scale VLA and world-action-model baselines with fewer parameters, no additional embodied pretraining, lower inference latency, and substantially lower GPU memory usage.

Adaptive & Reliable Policy Execution

#6
h=16
VANE: Reliable Test-Time Training for Vision-Language-Action Models via Future Visual Representation Prediction
2026-08-10 cs.RO cs.CV Fangxiang Feng (h=16)
Hongjin Ji, Guoyang Xia, Luoyang Sun, Fangxiang Feng, Lei Ren
Core Contributions
  • ▸ Targets a specific failure mode of test-time training for VLA policies: an online update can corrupt a shared adaptation space by mixing incompatible task corrections before its effect is even known.
  • ▸ Makes adaptation evidence-based and reversible — candidate prompt updates are isolated from the live policy, evaluated against the future visual outcomes they actually produce, and only committed if supported by that evidence.
  • ▸ +3.2 percentage points average success over the TTT baseline on SimplerEnv WidowX, but results on Google Robot are explicitly reported as task- and embodiment-dependent — a useful, candid data point that test-time training isn't a universal free lunch.
Show abstract

Test-time training (TTT) offers a lightweight way to adapt vision--language--action (VLA) policies from unlabeled deployment streams, but it remains difficult to use reliably in closed-loop manipulation. A shared adaptation space can mix incompatible task corrections, while an online update can alter subsequent actions before its consequences are known. We introduce a reliable TTT framework for VLA policies (VANE). VANE conditions prompt adaptation on the current vision--language context and learns from the future visual consequences of executed actions. Candidate updates are isolated from the live policy, evaluated on subsequent observations, and committed only when supported by future evidence, making adaptation selective and reversible. On SimplerEnv WidowX, VANE improves average success by $3.2$ percentage points over the corresponding TTT baseline. Results on Google Robot further show that deployment-time gains remain task- and embodiment-dependent. Together, these results demonstrate a constrained, evidence-based approach to adapting VLA policies during interaction.

#7
h=13
Trajectory Divergence Horizon Decision for Reliable Dual-Arm Surgical Subtask Manipulation
2026-08-10 cs.RO Hongliang Ren (h=13)
Mingwu Su, Guankun Wang, Jinsong Lin, Rulin Zhou, Ziyi Hao
Core Contributions
  • ▸ Reframes "how long to execute before replanning" as an uncertainty-estimation problem: perturbs a flow-matching action generator twice and measures how much the two resulting trajectories diverge, using that divergence as a real-time reliability signal.
  • ▸ Validated on real da Vinci-like hardware, not just simulation, alongside a new 600-demonstration dual-arm surgical dataset spanning needle and tissue manipulation subtasks — a rare real-hardware surgical VLA benchmark.
  • ▸ Tissue manipulation success jumps from 55% to 80% (needle: 55% to 60%) over the latest VLA baselines, with the largest gains concentrated in final manipulation stages — exactly where accumulated open-loop error would otherwise compound.
Show abstract

Surgical robotic systems are increasingly being adopted as clinical workload rises, motivating autonomous solutions for repetitive manipulation subtasks. Learning-based controllers improve generalization compared with rule-based and analytic approaches, but most are trained for individual tasks and remain difficult to reuse across procedures. Vision-Language-Action (VLA) models provide a unified framework that integrates visual perception, language grounding, and action generation, offering a promising path toward more composable surgical autonomy. However, existing VLA policies rely on fixed-length open-loop action sequences, where changing scene conditions can lead to accumulated errors and potential risks in surgical manipulation. To mitigate this issue, we formulate surgical VLA deployment as an adaptive execution-horizon decision problem and propose Trajectory Divergence Horizon Decision (TDHD), a test-time mechanism that estimates step-wise action reliability by measuring the divergence between two flow-matching-generated trajectories under small noise perturbations and truncates execution using a dual-threshold rule to trigger timely replanning. We further establish a real-world da Vinci-like dual-arm benchmark with synchronized multi-view perception and language instructions, and collect 600 teleoperated demonstrations across needle (reach, pick, regrasp) and tissue (reach, lift, resection) manipulation suites. On real hardware with 20 trials per task setting, TDHD consistently improves performance over the latest VLA baselines: success increases from 55\% to 60\% for needle manipulation and from 55\% to 80\% for tissue manipulation, with the largest gains observed in the final manipulation stages. These results highlight the importance of adaptive execution control for reliable deployment of VLA models in surgical robotic manipulation.

#15
h=6
SpeedTuning: Speeding Up Policy Execution with Lightweight Reinforcement Learning
2026-08-10 cs.RO cs.AI Kaylee Burns (h=6)
David D. Yuan, Tony Z. Zhao, Kaylee Burns, Chelsea Finn
Core Contributions
  • ▸ Attacks a rarely-addressed bottleneck: imitation-learned policies inherit the execution speed of whatever human teleoperator collected the demos, with no principled way to speed them up after the fact.
  • ▸ Uses lightweight RL to predict a per-action optimal execution speed as a wrapper around a frozen base policy, avoiding the need to recollect faster demonstrations.
  • ▸ Over 2.4x speed-up while preserving success rate, beating naive fixed-rate linear interpolation, across dynamic/precise tasks like pouring, throwing, and picking — tasks where speed and precision usually trade off against each other.
Show abstract

While learned robotic policies hold promise for advancing generalizable manipulation, their practical deployment is often hindered by suboptimal execution speeds. Imitation learning policies are inherently limited by hardware constraints and the speed of the operator during data collection. In addition, there are no established methods for accelerating policies learned via imitation, and the empirical relationship between execution speed and task success remains underexplored. To address these issues, we introduce SpeedTuning, a reinforcement learning framework specifically designed to enhance the speed of manipulation policies. SpeedTuning learns to predict the optimal execution speed for actions, thereby complementing a base policy without necessitating additional data collection. We provide empirical evidence that SpeedTuning achieves substantial improvements in execution speed, exceeding 2.4x speed-up, while preserving an adequate success rate compared to both the original task policy and straightforward speed-up methods such as linear interpolation at a fixed speed. We evaluate our approach across a diverse set of dynamic and precise tasks, including pouring, throwing, and picking, demonstrating its effectiveness and robustness in enhancing real-world robotic manipulation.

#17
h=3
RynnValue: Scaling Robotic Value Foundation Models with Temporal Distance
2026-08-10 cs.RO cs.CV cs.LG Zhian Su (h=3)
Dongchi Huang, Hongyin Zhang, Bohan Hou, Siteng Huang, Zhian Su
Core Contributions
  • ▸ Replaces the usual reward-model supervision (preferences, hand-labeled progress) with temporal distance — the timestamp-derived cost-to-go to a language-specified goal — requiring no manual annotation, letting the model scale to 7,000+ hours and roughly 3M clips.
  • ▸ Uses random temporal sampling, temporal-order shuffling, and value-isolation attention specifically to stop the model learning shortcuts that ignore whether a task actually failed or regressed.
  • ▸ Beats a fully preference-supervised state-of-the-art model on ranking correlation (Kendall's tau 0.675 vs 0.655) despite using no preference labels, and more than doubles a progress-only baseline (0.292).
  • ▸ Converted to a dense reward, it raises real-world policy success from 52.5% to 72.5% online and 63.8% to 82.5% offline — a rare case of a learned reward model directly improving real-robot policy performance, not just offline ranking metrics.
Show abstract

General-purpose reward models are increasingly the bottleneck for scaling robot learning, yet the recipe for learning value-related capabilities from large-scale heterogeneous corpora remains underexplored. Existing approaches tie supervision to task-internal anchors such as preferences or normalized progress, none of which transfer cleanly across embodiments and data sources. We introduce RynnValue, an open-source value foundation model for robotic manipulation that replaces these anchors with temporal distance, the directed cost-to-go from an observation to the language-specified goal. Because temporal-distance labels can be derived directly from timestamps, RynnValue scales to over 7,000 hours and roughly 3M instruction-conditioned clips without preference or progress annotations. To make temporal-value learning reliable at scale, we combine random temporal sampling, temporal-order shuffling, and value-isolation attention, suppressing shortcuts that would leave predictions insensitive to failures and regressions. Trained without preference labels, RynnValue attains an average Kendall's tau_a of 0.675 on RBM-EVAL-OOD, surpassing the fully preference-supervised state of the art (0.655) and more than doubling a progress-only counterpart (0.292), while generalizing zero-shot to unseen tasks, embodiments, and viewpoints. Converted into dense rewards via potential-based shaping, it raises real-world policy success from 52.5% to 72.5% online and from 63.8% to 82.5% offline. These results establish temporal distance as a scalable supervision target and practical reward interface for generalist robot policies.

#18
h=3
Rethink Before You Execute: Adaptive Execution for World Action Models
2026-08-10 cs.RO Feng Ye (h=3)
Feng Ye, Yiming Zhao, Yong Yu, Hongxu Zhou, Yong Pan
Core Contributions
  • ▸ Directly challenges the standard WAM deployment recipe of executing a fixed-length action-chunk prefix before replanning, arguing chunk reliability varies by task stage and shouldn't be governed by a step counter.
  • ▸ A lightweight Recurrent Progress Monitor estimates task progress online, feeding an Adaptive Execution Protocol calibrated per-task with online adaptation to close the training-deployment gap.
  • ▸ On real robots: 26.9% fewer WAM inferences on easy tasks with no success loss, and +13.3 success points on difficult tasks — the same mechanism cuts compute where the policy is confident and adds caution where it isn't, rather than trading one for the other.
Show abstract

World Action Models (WAMs) jointly predict future actions and the evolution of the environment. At each inference, a WAM generates a chunk of actions and the robot executes a fixed prefix before replanning. We argue that this fixed execution horizon is poorly matched to execution dynamics: the chunk reliability varies across task stages, so when to replan depends on the result of accumulated execution, not on the step counts. We propose TempoWAM (Timing Execution by Monitoring Progress Online), a lightweight plug-and-play execution scheme for WAMs. A Recurrent Progress Monitor first estimates task progress from the current observation, task instruction, remaining actions, and execution history; and an Adaptive Execution Protocol then evaluates whether the chunk is advancing the task to decide if replanning is needed. To bridge the training-deployment gap, the protocol is calibrated by a task-dependent calibration factor with online adaptation. Experiments on LIBERO, RoboTwin, and real-world tasks show that TempoWAM consistently improves the efficiency-success trade-off of WAM execution. On real robots, it reduces WAM inferences by 26.9% on easy tasks while maintaining success, and improves success by 13.3 points on difficult tasks.

Robot Learning Infrastructure & World-Model Evaluation

#10
h=8
XPolicyLab: A Unified Standard and Open Ecosystem for Robot Policy Evaluation and Deployment
2026-08-10 cs.RO Hengkai Tan (h=8)
XPolicyLab Community, Tianxing Chen, Yue Chen, Tian Nian, Zijian Cai
Core Contributions
  • ▸ Tackles the O(N x M) integration tax of connecting N robot policies to M evaluation environments by defining shared observation/action/trajectory schemas and a minimal adapter interface, cutting cost to O(N+M).
  • ▸ Splits inference from environment execution via a dependency-isolated client/server design, letting each policy keep its native (and often conflicting) software stack — a practical answer to the dependency-hell that plagues cross-lab policy comparisons.
  • ▸ Already integrates 42 policies and reports integration effort dropping from 5+ hours to 2 hours with the standard, and to 30 minutes with packaged "agent skills" — a concrete infrastructure win rather than a new algorithm.
Show abstract

Robot policy evaluation and deployment remain fragmented by model-specific software dependencies, data representations, and runtime interfaces, so that connecting N policies to M evaluation environments requires O(NM) separate integrations. We present XPolicyLab, a unified standard and open ecosystem that reduces this cost to O(N+M). XPolicyLab specifies common observation, action, and trajectory schemas together with a minimal adapter interface for observation updates, action prediction, batched execution, and episode reset, while a dependency-isolated client/server architecture separates policy inference from environment execution, so that each side retains its native software stack and may run locally or remotely. The ecosystem integrates 42 robot policies and standardizes their installation, debugging, serving, and evaluation workflows. Across these adapters, model-specific code varies by an order of magnitude while the environment-facing loop stays within a few lines of a fixed reference, confirming that the contract confines heterogeneity to the policy side. In a controlled study, conforming to the standard reduces the integration effort of a representative policy from over five hours to two hours, and packaged agent skills reduce it further to thirty minutes. The same adapters serve RoboTwin, RoboDojo simulation, and standardized real-robot evaluation through one interface. XPolicyLab is released as shared infrastructure for reproducible policy comparison and standardized deployment across simulation and physical platforms. Project website: https://xpolicylab.github.io/.

#11
h=8
WorldSimProbe: Diagnosing Simulator Faithfulness in Action-Conditioned World Models for Embodied Manipulation
2026-08-10 cs.RO cs.AI Huajie Tan (h=8)
Peterson Co, Sicheng Hu, Chunxuan Jiao, Hongyang Cheng, Yulin Luo
Core Contributions
  • ▸ Argues current world-model evaluation (visual quality, task success, rollout responsiveness) never actually verifies actions cause the right motion — proposes an "Observable Simulator Contract" that action-conditioned world models should satisfy as physical simulators.
  • ▸ Builds five controlled diagnostic suites (local control sensitivity, global trajectory variation, source-diverse actions, interaction grounding, dynamics) and runs them across 18,000+ instances and six open-source world models spanning RoboTwin, ManiSkill, and LIBERO.
  • ▸ Finds systematic action-realization degradation and structured grounding/dynamics failures that existing benchmarks miss — a caution flag for other papers in this same batch (HarnessWAM, JEPA-WAM, ELWM) that build planning or control on top of learned world models.
Show abstract

Action-conditioned world models (ACWMs) promise to provide embodied AI with scalable predictive simulators for planning, policy evaluation, and data generation. Realizing this promise requires precise action-conditioned transitions rather than merely plausible outputs. Yet their applicability remains difficult to establish because prevailing evaluations emphasize visual quality, task outcomes, or coarse rollout-level responsiveness without directly testing simulator fidelity. To address this gap, we evaluate ACWMs through the observable capabilities expected of physical simulators. Accordingly, we formalize Observable Simulator Contract, a minimal contract that any action-conditioned physical simulator should satisfy: supplied actions must induce corresponding agent motion, and environment responses must be grounded in that realized motion. To operationalize this contract, we introduce WorldSimProbe, comprising five controlled suites spanning local control sensitivity, global trajectory variation, source-diverse actions, interaction grounding, and dynamics. Suite-specific evaluators assess simulator-relative calibration, dense action-to-motion correspondence, false-interaction grounding, and primitive-level dynamics. We evaluate six open-source ACWMs on more than 18,000 instances across RoboTwin, ManiSkill, and LIBERO. World-SimProbe reveals systematic action-realization degradation across control variation, structured failures in interaction grounding and dynamics, and benchmark signals consistent with human judgments and downstream outcomes. Together, this capability-based framework provides a transparent, and standardized paradigm for diagnosing ACWM simulator fidelity beyond coarse, task-directed evaluation.

#12
h=7
Energy-Structured Latent World Models with Neural Time Fields for Physically Constistent Open-World Motion Planning
2026-08-10 cs.RO cs.AI Bo Ding (h=7)
Yapeng Liu, Yuanzhao Zhai, Bo Ding, Huaimin Wang, Lin Wang
Core Contributions
  • ▸ Bakes physics directly into the latent state — energy and momentum become explicit variables with dissipation/control "ports" enforcing causal transitions — instead of letting a black-box latent model implicitly and unreliably absorb physical laws.
  • ▸ Connects the world model to planning via Physics-Conditioned Neural Time Fields, integrating it into an arrival-time field through the Eikonal equation, yielding a navigation policy that is physically informed rather than purely learned.
  • ▸ Broad, simultaneous gains versus Active Neural Time Fields: motion-prediction NRMSE 0.36 to 0.29, navigation success 81.3% to 89.7%, SPL 0.64 to 0.73, physical collision rate 12.1% to 5.8%, and Eikonal residual 0.083 to 0.031.
Show abstract

Physically consistent motion planning remains a fundamental challenge in embodied AI, as generated trajectories must strictly conform to real-world execution dynamics. While latent world models offer a promising approach by predicting these dynamics, existing methods learn unconstrained future representations where absorbed physics remains implicit. Therefore, they fail to form reusable physical knowledge, which compromises reliability in unpredictable open-world navigation. To address this, we propose a novel Energy-Structured Latent World Model (ELWM). Our key idea is to structure the ELWM latent state to explicitly carry energy and momentum, ensuring strictly causal transitions via dissipation and control ports. Trained on multimodal RGB-D and inertial interaction histories, our model guarantees physically consistent predictions. We further implement this for motion planning by constructing Physics-Conditioned Neural Time Fields (PC-NTF), a key technical cornerstone that integrates ELWM into an arrival time field via the Eikonal equation to yield a physically-informed navigation policy. Across held-out scenes, our evaluation reveals significant improvements. Compared to generic latent models, PC-NTF reduces 0.8-s motion-prediction NRMSE from 0.36 to 0.29. Against Active Neural Time Fields, it improves navigation success from 81.3% to 89.7% and SPL from 0.64 to 0.73, while cutting the physical collision rate from 12.1% to 5.8% and the Eikonal residual from 0.083 to 0.031. Beyond these targeted gains, our results demonstrate that embedding explicit physical structures into latent spaces intrinsically bridges the gap between predictive world models and safe, dynamically feasible motion planning.

Reinforcement Learning & Optimization for Control

#9
h=9
Personalized Lower-limb Exoskeleton Assistance via Preference-based Bayesian Optimization
2026-08-10 cs.RO Zengguang Hou (h=9)
Xiao-Yin Liu, Guotao Li, Weiqun Wang, Zeng-Guang Hou
Core Contributions
  • ▸ Uses preference-based Bayesian optimization to cut the human-in-the-loop tuning burden that makes existing personalization methods fatiguing and slow — converges on six control parameters in just 20 iterations at 90.7% validation accuracy.
  • ▸ Adds a hierarchical torque controller for real-time interaction-torque tracking, coupling offline preference-learned parameters to online task-adaptive torque generation.
  • ▸ Reports physiologically grounded outcomes rather than just task success: 14.5-15.4% lower metabolic rate, 6.3-7.6% lower heart rate, and 6.7-31.5% lower muscle activation versus unassisted walking, validated on both treadmill and outdoor terrain.
Show abstract

A significant challenge in exoskeleton robotics is the need to dynamically adapt control profiles to individual motion preferences, thereby ensuring both efficient and comfortable assistance. Currently, since user experience can serve as a comprehensive metric for evaluating the effectiveness of assistance, user preference-based optimization methods have been widely studied for parameter tuning. However, the existing methods rely heavily on extensive human-robot online interactions and suffer from slow optimization speed, which not only induces user fatigue but also compromises optimization effectiveness. Therefore, this paper aims to explore an efficient preference-based optimization framework for personalized exoskeleton assistance that can learn optimal parameters with minimal interaction. We propose a preference-based Bayesian optimization (PbBO) approach that can improve sample efficiency by leveraging knowledge about the sampling distribution of candidate sets. For optimizing six control parameters, PbBO can converge to user-preferred parameters with 90.7% validation accuracy via 20 iterations. Moreover, the hierarchical controller is designed to generate personalized torque for different tasks and achieve interaction torque tracking in real time. The results of treadmill and outdoor experiments demonstrate that the optimized parameters can reduce metabolic rate by 14.5%-15.4%, heart rate by 6.3%-7.6%, and muscle activation by 6.7%-31.5% compared to unassisted walking.

#21
h=1
Satellite Trajectory Optimization via Proximal Policy Optimization for Space Debris Avoidance
2026-08-10 cs.LG cs.RO Logan Luna (h=1)
Logan Luna, Juan Ortiz Couder, Raul Alejandro Vargas-Acosta
Core Contributions
  • ▸ Applies PPO-trained collision avoidance to satellites rather than terrestrial robots, addressing a distinct scaling problem: conjunction alerts are growing as megaconstellations crowd LEO/GEO and manual/rule-based avoidance can't keep up.
  • ▸ Trains and evaluates in an open-source high-fidelity astrodynamics simulator with real two-body dynamics, third-body perturbations, fuel-dependent thrust, and configurable debris fields — closer to operational realism than typical toy orbital RL environments.
  • ▸ 97.5% collision avoidance success across 1,000 deterministic GEO episodes versus 20.7% for a rule-based baseline and 27.5% for an impulsive delta-v planner, achieved via curriculum learning with shaped survival/miss-distance/delta-v rewards.
Show abstract

Collision avoidance systems are commonly used to avoid fragmentation events occurring in Low-Earth Orbit (LEO) and Geosynchronous Equatorial Orbit (GEO). However, these events have been growing in frequency as orbital congestion worsens with the launch of megaconstellations. Consequently, conjunction alerts and collision risks are becoming increasingly common. Current practices, which are commonly manual or rule-based, have difficulty scaling to these worsening dynamic environments. To address this intensifying situation, we propose a reinforcement-learning policy for autonomous collision avoidance, trained via Proximal Policy Optimization (PPO) along with an open-source, high-fidelity astrodynamics simulator for training and evaluation. In 1,000 deterministic GEO episodes, our agent achieves a 97.5% collision avoidance success rate, outperforming traditional controllers such as a rule-based baseline (20.7% success) and an impulsive delta-v planner baseline (27.5% success). To achieve these results, we designed a simulator to train and evaluate our agent, using real-world and simulated debris. We simulate Newtonian two-body dynamics using Sun/Moon third-body perturbations, fuel-dependent thrust, and configurable debris fields. The agent is trained with curriculum learning and shaped rewards oriented toward encouraging survival, adequate projected miss distance, and delta-v conservation. Finally, our evaluation consisted of a fully deterministic pipeline, including shared seeds, per-episode logs, and telemetry exports. Our work is a publicly available framework at https://purl.org/sat-trajectory-avoidance

#29
h=0
Efficient Real-World Online Reinforcement Learning for Robot Manipulation via Centralized Training and Critic Decomposition
2026-08-10 cs.RO Changhao Li (h=0)
Changhao Li, Yifang Zhang, Heng Zhang, Davide Torielli, Damiano Gasperini
Core Contributions
  • ▸ Combines centralized training with decentralized execution and a hybrid reward architecture so multiple robot actors can share one centralized multi-head critic, addressing the non-stationarity that breaks concurrent multi-agent real-world RL training.
  • ▸ Decomposes the critic into separate task and grasp heads (sparse task reward vs. potential-based grasping reward), then reformulates actor/critic objectives to explicitly handle the discrete gripper's categorical action distribution rather than approximating it as continuous.
  • ▸ Tests domain randomization ranges 5-25x larger than prior work and still improves success from 60% to 80% (tennis ball pick-and-place), 60% to 90% (banana pick-and-place), and 25% to 95% (simulated block relocation) versus a state-of-the-art baseline, plus solves at least one task the baseline never manages.
Show abstract

Real-world online reinforcement learning (RL) provides a promising approach for training robotic manipulation policies directly in the physical world, avoiding the sim-to-real gap and enabling continuous policy refinement through human-in-the-loop interaction. Recent methods have demonstrated sample-efficient learning through human intervention but remain limited to small randomization ranges and encounter challenges with the non-stationarity induced by concurrently training multiple agents. To address these limitations, we introduce a unified framework that combines centralized training with decentralized execution (CTDE) and a Hybrid Reward Architecture (HRA). This enables multiple actors to share a centralized multi-head critic. The critic is decomposed into task and grasp heads, corresponding to the sparse task reward and a potential-based grasping reward, respectively. We accordingly reformulate the critic and actor objectives to exploit the decomposed Q-values while explicitly accounting for the categorical action distribution of the discrete gripper policy. Experimental results demonstrate that the proposed framework substantially improves both sample efficiency and policy performance. We validate our approach on two robotic arms and a simulated humanoid robot across tennis ball and banana pick-and-place, pot reset, and simulated block relocation tasks under dimension-wise domain randomization, approximately 5-25x larger than those considered in prior work. Compared with a state-of-the-art baseline, our method improves the success rate from 60% to 80% on tennis ball pick-and-place, from 60% to 90% on banana pick-and-place, and from 25% to 95% on simulated block relocation, while also successfully accomplishing a task where the baseline consistently fails. Videos and more details are available at our project website: https://hil-harc.github.io/.

Navigation, Localization & Autonomous Driving

#16
h=6
ROEVO: Robust Organized Edge Feature-based Visual Odometry Using RGB-D Cameras
2026-08-10 cs.RO Liang Li (h=6)
Mingrui Liu, Xingxing Zuo, Renlang Huang, Minglei Zhao, Jiming Chen
Core Contributions
  • ▸ Introduces "organized edges" — clusters of connected edge pixels rather than disjoint edge points — as a feature representation that preserves structural and textural context standard edge-based VO discards.
  • ▸ Because edges are organized into sequences, the method associates them across multiple frames to build a co-visibility graph, enabling edge-wise (not pixel-wise) tracking residuals.
  • ▸ Decomposes bundle adjustment into separate fitting and registration steps to preserve edge shape integrity, and open-sources the full system — reported to match or beat state-of-the-art indoor VO while relying purely on edges rather than points or dense photometric cues.
Show abstract

This work presents a visual odometry (VO) system that leverages image edge features. Edges are spatially expressive cues commonly present across diverse environments, offering rich textural and structural information. However, existing edge-based VO methods often fail to fully exploit this potential. To this end, we introduce a novel feature representation termed \textit{organized edges}, which transforms disjoint edge pixels into sequentialized clusters, enabling more effective retention and utilization of the underlying textural and structural information. Another nice property of this formulation is that organized edges can perform edge-level association across multiple frames, enabling the establishment of a co-visibility graph. To achieve precise and efficient pose estimation, we propose a range of particularly designed tracking and joint optimization methods based on the characteristics of organized edges. For tracking, we formulate edge-wise rather than pixel-wise residuals to achieve robust and accurate inter-frame registration. For joint optimization, we introduce a novel shape-preserving edge-fitting method and an organized edge-based Bundle Adjustment (BA) approach, which decomposes the traditional BA problem into fitting and registration to preserve the structural integrity. Based on these novel techniques, we develop a complete VO system that exclusively employs organized edge features, achieving efficient tracking and precise local mapping. Extensive experiments demonstrate its accuracy and robustness in indoor environments, outperforming or achieving comparable performance to state-of-the-art methods. The source code is publicly available at https://github.com/liumingrui814/ROEVO

#19
h=3
UnsDrive: Towards Robust End-to-End Autonomous Driving in Unstructured Scenes
2026-08-10 cs.RO Baiyong Ding (h=3)
Nanxin Zeng, Ruiqi Song, Xiangyu Guo, Baiyong Ding, Yunfeng Ai
Core Contributions
  • ▸ Targets unstructured mining environments specifically, where end-to-end driving stacks tuned for structured urban roads degrade under weak lane structure, terrain occlusion, and large unobserved regions.
  • ▸ Builds an occupancy representation with an explicit "unknown" space category (not just occupied/free) from multi-frame visibility, then conditions a flow-matching trajectory planner directly on that uncertainty map.
  • ▸ Adds an occupancy-trajectory-consistency loss and an uncertainty-aware scorer that specifically penalize trajectories entering unobserved regions — a direct mechanism for "don't drive into what you can't see," the core mining hazard beyond urban driving.
  • ▸ Releases MineLoop, a mining-specific closed-loop simulator, filling the absence of domain-appropriate benchmarks for this environment.
Show abstract

End-to-end planning has shown strong promise for autonomous driving, but most existing methods are designed for structured urban roads and generalize poorly to unstructured mining environments. In such settings, weak road structure, terrain-induced occlusions, degraded visibility, and large unobserved regions make safe planning particularly challenging. To address these challenges, we propose UnsDrive, an end-to-end planner designed for unstructured mining scenes. UnsDrive builds an unknown-aware occupancy representation that explicitly models occupied, free, and unknown space using multi-frame visibility cues, and conditions a flow-matching planner on this representation to generate multimodal future trajectories. To improve safety under partial observability, we further introduce an occupancy trajectory consistency loss and an uncertainty-aware trajectory scorer that penalize trajectories entering non-traversable or unobserved regions. We also present MineLoop, a mining-oriented closed-loop simulator for evaluating autonomous driving under irregular road geometry, degraded visibility, heavy-vehicle interactions, and mining-specific operational constraints. Experiments in both open-loop and closed-loop settings show that UnsDrive consistently outperforms strong baselines in trajectory accuracy, collision avoidance, and long-horizon driving robustness. These results demonstrate the value of explicit unknown-space reasoning for autonomous driving in unstructured mining environments.

#22
h=1
DH-VLM: Dual-Horizon Cooperative Latent Reasoning for Autonomous Driving
2026-08-10 cs.RO Chen Xia (h=1)
Ziyi Song, Chen Xia, Hang Yu, Sheng Zhou, Zhisheng Niu
Core Contributions
  • ▸ Splits cooperative driving reasoning across two horizons: infrastructure aggregates multi-layer hidden states into a global-context latent, while the ego vehicle retains local autonomous decision-making — an asymmetric division of labor rather than full sensor/feature fusion.
  • ▸ Injects infrastructure context into the ego model via an "Infrastructure-Driven Latent Evolution" mechanism operating in latent space, rather than raw sensor sharing — the likely source of the reported communication savings.
  • ▸ 14.6% lower L2 planning error and 26.9% lower collision rate than prior state of the art, while cutting communication cost 57.3% and GPU memory 25.5% versus query-based cooperative baselines, and staying robust even when infrastructure guidance is itself erroneous.
Show abstract

Large-scale language models for autonomous driving enable enhanced global understanding and long-horizon planning. However, when deployed in isolated vehicles, limited sensing range and occlusions restrict reliable decision-making, and the substantial computational and latency overhead makes on-board deployment impractical. Cooperative driving provides a potential solution by leveraging external agents for information exchange, but existing methods remain limited in semantic reasoning capability under practical constraints. To address these challenges, we propose DH-VLM, a dual-horizon cooperative latent reasoning framework that enables asymmetric semantic cooperation between the infrastructure and ego vehicle. The infrastructure aggregates multi-layer hidden states to form a global-reasoning horizon latent guidance, which is integrated into the ego model through an Infrastructure-Driven Latent Evolution mechanism for conditional latent refinement. This enables the ego vehicle to leverage long-range contextual understanding while preserving autonomous decision-making within its local planning horizon. Furthermore, we construct a cooperation-oriented question-answer (QA) dataset covering fundamental scene understanding and ego-personalized comprehension to support counterfactual and safety-aware reasoning. Extensive experiments demonstrate that DH-VLM achieves state-of-the-art planning performance, outperforming the previous state of the art by 14.6% in L2 error and 26.9% in collision rate. Compared with query-based end-to-end cooperative driving methods, our approach reduces the communication cost by 57.3% and GPU memory usage by 25.5%, while maintaining strong robustness against infrastructure guidance errors, providing a practical and robust paradigm for cooperative autonomous driving.

#23
h=0
Entanglement-Free Trajectory Planning for Tethered Mobile Robots with a Slack Tether
2026-08-10 cs.RO Gianpietro Battocletti (h=0)
Gianpietro Battocletti, Dimitris Boskos, Bart De Schutter
Core Contributions
  • ▸ Handles the harder "slack tether" case where the tether's shape depends on its own dynamics and the robot's trajectory, not just obstacle geometry — most prior tethered-robot planners assume a taut or geometry-determined tether.
  • ▸ Builds entanglement-awareness into every planning stage via a three-step pipeline: a topological model of the entanglement-free configuration space, candidate path generation from that model, then a homotopy-constrained trajectory optimization for dynamic feasibility.
  • ▸ Simulation results show the approach avoids entanglement-constraint violations that naive planners incur, directly linking topological reasoning about the tether to safer, more reliable trajectories.
Show abstract

In motion planning algorithms for tethered mobile robots, the entanglement state of the tether is a critical aspect to consider during the planning phase. This is particularly important in case of a slack tether, where the shape of the tether is not determined solely by the geometry of the environment and the location of the obstacles, but also by the dynamics of the tether, by the trajectory followed by the robot, and possibly by exogenous forces. In this scenario, preventing entanglement requires planning a robot trajectory that accounts for the entanglement definition and for the dynamics of the robot and of the tether. In this work, we propose a motion planning algorithm for tethered mobile robots with a slack tether that computes dynamically feasible entanglement-free trajectories to navigate through an environment with static obstacles. By considering the entanglement state during all the stages of the planning pipeline, we are able to compute safer trajectories that avoid entanglement during the motion of the robot. We achieve this through a three-step pipeline, which includes (i) the construction of a topological model of the entanglement-free configuration space of the tethered robot, (ii) the generation of a set of candidate paths using this model, and (iii) the computation of a dynamically feasible entanglement-free trajectory by solving a homotopy-constrained trajectory generation problem. The resulting trajectory can then be executed to lead the robot to its target location, while maintaining the tether in an entanglement-free configuration. We demonstrate the benefits of this algorithm in simulations, where we show how the planning algorithm avoids violations of the entanglement constraints, resulting in safer and more reliable trajectories.

#25
h=0
Hierarchical Fast--Slow ReAct Agent for Zero-Shot Object-Goal Navigation
2026-08-10 cs.RO Zhaochen Lan (h=0)
Zhaochen Lan, Zhi Yang, Yuxiang Fu, Mengxiang Lin
Core Contributions
  • ▸ Critiques the standard value-map approach to zero-shot object navigation for being memoryless — every step is a fresh argmax that discards the evidence behind it, so a room seen minutes earlier is never reconsidered.
  • ▸ Adds a "coordinate-anchored memory" (semantic room-type grid, confirmed object instances, and bounded pose-tagged keyframes) that a deliberative layer reasons over in a bounded reason-retrieve-act loop, waking only at structural events rather than every step.
  • ▸ Reaches 68.75% SR on HM3D v1 val and 47.29% on MP3D val, best among the zero-shot methods compared, and a controlled ablation shows replacing deliberation with pure argmax over far frontiers costs 3.40 SR points (95% CI [1.70, 5.05]) — directly quantifying the value of deliberation over pure reactivity.
Show abstract

Zero-shot object-goal navigation (ZSON) requires a robot to find a named object category in a building it has never entered. The prevailing approach scores frontiers with a vision--language \emph{value map}: every decision is another argmax over the map as it currently stands, and the evidence behind that score is discarded the moment it is taken. Systems that place a large vision--language model inside the perception--action loop typically query it on a fixed schedule from the current view alone; a room the robot walked through minutes earlier is never reconsidered, and a failed call has no defined fallback. We turn what the robot has already seen into the object of deliberation. Our hierarchical fast--slow agent leaves the value-map controller running at every step and writes a \emph{coordinate-anchored memory} as it moves: a semantic grid of room types and confirmed object instances, together with a bounded store of pose-tagged keyframes. A VLM screens each candidate detection before it is written. A deliberative layer reads this memory in a bounded reason--retrieve--act loop. It wakes on structural events the reactive layer computes, reasons first over text, and recalls a first-person view only for candidates that text alone cannot separate. Per-invocation and per-run caps bound its calls, a call-free first tier resolves the most frequent stall, and any failure returns control to the reactive controller. Our system reaches 68.75% SR on HM3D v1 \texttt{val} and 47.29% on MP3D \texttt{val}, the highest success rate among the zero-shot methods compared here. Choosing among far frontiers by argmax instead of deliberating costs 3.40 SR points in a paired comparison over all 2000 HM3D episodes (95\% CI [1.70, 5.05]); deliberating over every frontier does not recover them.

#26
h=0
WRAP: Wasserstein-Robust Adaptive Plug-in for Robot Localization
2026-08-10 cs.RO eess.SY Minhyuk Jang (h=0)
Minhyuk Jang, Astghik Hakobyan, Jungjin Lee, Naira Hovakimyan, Insoon Yang
Core Contributions
  • ▸ Targets covariance miscalibration in EKF/ESKF localization stacks under changing sensing conditions — a subtler, often-ignored failure mode compared to raw position error.
  • ▸ Separates mean adaptation from covariance robustification: a causal module supplies time-varying statistics, then a Wasserstein-robust local update computes least-favorable covariances without touching the underlying propagation model, residual, or retraction, making it a drop-in plug-in rather than a new filter.
  • ▸ On 18 held-out UWB-IMU sequences, reduces mean 3-D position RMSE by 27.4% versus a nominal ESKF (19.8% from mean-adaptation alone), and runs in 0.05ms (UWB) / 2.92ms (GNSS) on a Jetson Orin Nano — fast enough for real embedded deployment.
Show abstract

Robotic localization under changing sensing conditions can suffer from biased errors and miscalibrated covariances. We present WRAP, an adapter-agnostic Wasserstein-robust plug-in for nonlinear extended Kalman filter (EKF) and error-state Kalman filter (ESKF) stacks. A causal module supplies time-varying effective process and measurement statistics; a mean-preserving Wasserstein local update then computes least-favorable covariances and a robust gain without changing the propagation model, residual, or retraction. This separates mean adaptation from covariance robustification and uses distinct radii for propagation and sensing. On 18 UWB--IMU sequences held out from adapter training, adapter-only and WRAP reduce mean 3-D position RMSE by $19.8\%$ and $27.4\%$ relative to the nominal ESKF; an isotropic ablation reaches $19.5\%$, linking the incremental gain to directional process-covariance redistribution. An in-sample GNSS--INS study shows that mean adaptation provides most of the accuracy gain, while DR improves consistency and mitigates over-tightened classical covariance estimates. The robust solve takes 0.05 ms for UWB and 2.92 ms for GNSS on a Jetson Orin Nano.

Manipulation Perception & Physical Human-Robot Interaction

#3
h=21
Intuitive Directional Sense Presentation to the Torso Using McKibben-Based Surface Haptic Sensation in Immersive Space
2026-08-10 cs.HC cs.RO T. Aoyama (h=21)
Kenta Yokoe, Tadayoshi Aoyama, Yuki Funabora, Masaru Takeuchi, Yasuhisa Hasegawa
Core Contributions
  • ▸ Extends fabric-based McKibben actuators from localized haptic cues to whole-body directional guidance without requiring visual attention — relevant for XR settings already saturated with visual information.
  • ▸ Validated through both controlled psychophysics experiments and a downstream teleoperation task (micromanipulation in mixed reality), showing the directional cues transfer from lab conditions to an applied control task.
  • ▸ Targets the "requires practice" weakness of prior haptic guidance methods by leveraging surface-distributed sensation claimed to be perceived intuitively rather than learned through training.
Show abstract

In recent years, systems that utilize immersive space have been developed in various fields. Immersive spaces often contain considerable amounts of visual information; therefore, users often fail to obtain their desired information. Therefore, various methods have been developed to guide users toward haptic sensations. However, many of these methods have limitations in terms of the intuitive perception of haptic sensation and require practice for familiarization with haptic sensation. Fabric actuators are wearable haptic devices that combine fabric and McKibben artificial muscles to provide wearers with surface haptic sensation. These sensations can be provided to a wide area of the body with intuitive perception, instead of only to a part of the body. This paper presents a novel air pressure adjustment method for whole-body motion guidance using surface haptic sensations provided by a wearable fabric actuator. The proposed system can provide users with a directional sense without visual information in an immersive space. The effectiveness of the proposed system was evaluated through subject experiments and statistical data analysis. Finally, a directional sense presentation was conducted for users performing micromanipulations in a mixed-reality space to demonstrate the applicability of the proposed system for teleoperation.

#4
h=21
Intuitive Hand Positional Guidance Using McKibben-Based Surface Tactile Sensations to Shoulder and Elbow
2026-08-10 cs.HC cs.RO T. Aoyama (h=21)
Kenta Yokoe, Yuki Funabora, Tadayoshi Aoyama
Core Contributions
  • ▸ Grounds actuator design in a specific biomechanical model (equilibrium point hypothesis) combined with the Weber-Fechner psychophysical law to set tactile intensity, rather than an arbitrary vibration-mapping scheme.
  • ▸ Targets six discrete arm movements (flexion/extension, ab/adduction, horizontal ab/adduction) with a single wearable actuator, and is benchmarked head-to-head against synthesized-speech and vibrotactile guidance baselines for accuracy and speed.
  • ▸ Removes the upfront training step conventional tactile guidance requires by making the stimulus-to-movement mapping physiologically intuitive rather than arbitrary.
Show abstract

Hand positional guidance with intuitive perception is crucial for enhancing user interaction and task performance in immersive environments. However, conventional hand positional guidance methods, relying on tactile sensations, lack intuitiveness. Consequently, users require instruction on the relationship between the tactile sensation and target position of the guidance before using these methods. Additionally, the user needs training to become familiar with tactile sensations. This study presents a hand positional guidance system with intuitive perception that leverages McKibben-based surface tactile sensations directed to the shoulder and elbow. We developed a wearable fabric actuator that provides McKibben-based surface tactile sensations to induce six specific movements: elbow flexion, extension, shoulder abduction, adduction, horizontal abduction, and horizontal adduction. The effectiveness of the actuator was experimentally validated, demonstrating its high accuracy in intuitively inducing six movements. An algorithm based on the equilibrium point hypothesis and Weber-Fechner law was implemented to regulate the intensity of the tactile sensations for hand positional guidance. Furthermore, the accuracy and speed of the proposed system were compared with that of conventional guidance methods utilizing synthesized speech and vibrotactile guidance.

#8
h=12
High Fidelity Capture, Reconstruction, and Transfer of Human Demonstrations for Robot-Assisted Bathing
2026-08-10 cs.RO cs.GR J. King (h=12)
Arjun S. Lakshmipathy, Jonathan P. King, Ethan Zuo, Rohit Satishkumar, Hongyi Chen
Core Contributions
  • ▸ Uses "contact regions" as the core data representation for transferring human bathing demonstrations to a robot, rather than raw motion trajectories — suited to sustained, contact-rich interaction where force/shape matter more than endpoint pose.
  • ▸ First dataset to synchronize motion, shape, contact, and force during real clinician-performed human-human bathing demonstrations, addressing a specific data gap in contact-rich physical human-robot interaction research.
  • ▸ Demonstrates the pipeline end-to-end on real hardware — an arm-mounted dexterous soft hand bathing a mannequin under both open- and closed-loop control — and commits to public release, notable given how few sustained-contact HRI datasets exist.
Show abstract

Despite the demand for robots in high-value clinical tasks like bathing, contemporary systems still lack the safety and reliability required for complex, sustained physical interaction with humans. A key challenge hindering the development of such systems is that collecting, understanding, and effectively transferring highly dynamic, contact-rich human bathing demonstrations is difficult, even with modern motion and tactile sensing equipment. We present a straightforward, but effective framework for doing so with high fidelity by utilizing contact regions as a key processing primitive. We use our framework to build a dataset of bathing demonstrations performed by trained clinicians on human subjects. We then use this dataset to design and control an arm-mounted dexterous soft hand to perform bathing tasks on a mannequin using open- and closed-loop strategies. Our dataset is the first to provide high quality synchronized motion, shape, contact, and force during sustained, contact-rich human-human interaction, and our transfer strategies demonstrate effective use of these data across multiple levels of the robotics stack. All relevant materials will be publicly released to enable further advancements in physical human-robot interaction (pHRI) research.

#13
h=7
Robotic Fabric Alignment System for Sewing Using Global Local Weighted ICP
2026-08-10 cs.RO Fuyuki Tokuda (h=7)
Wenbo Dong, Dipankar Bhattacharya Member, Kai Tang, Akinari Kobayashi, Fuyuki Tokuda
Core Contributions
  • ▸ Proposes Global Local Weighted ICP, jointly aligning fabric panels at coarse global edges and fine local sewing-line features against CAD reference points, while explicitly discarding unmatched points from self-occluded regions.
  • ▸ Closes the loop from pose estimation to physical manipulation, driving a robot to reposition the top panel into sewing-ready alignment rather than stopping at perception.
  • ▸ Millimeter-level alignment accuracy holds up under both occluded and unoccluded conditions across varied fabric shapes — the occlusion robustness is the harder and more industrially relevant claim.
Show abstract

Accurate fabric alignment is a critical step that must be performed before sewing. This paper presents a novel automated fabric alignment system. The system estimates the poses of top and bottom fabric panels, lying flat and wrinkle-free in arbitrary positions, using a new Global Local Weighted Iterative Closest Point (GLW-ICP) method. The system then manipulates the top panel to achieve precise alignment at both edges and sewing lines. Unlike conventional approaches, GLW-ICP robustly aligns both global edges and local sewing lines by globally aligning fabric edge points and locally aligning sewing line points to their corresponding CAD model points, while removing unmatched points in occluded regions. Real-world experiments with various fabric shapes show that the system consistently achieves millimeter-level alignment accuracy under both occlusion and non-occlusion conditions, demonstrating its effectiveness and suitability for automated fabric alignment in practical scenarios.

#27
h=0
RoboSeg: Online Part-Level Semantic Reconstruction for Robotic Manipulation via a Single Eye-in-Hand Camera
2026-08-10 cs.RO Zhaochen Lan (h=0)
Zhaochen Lan, Mengxiang Lin
Core Contributions
  • ▸ Targets actionable object parts (handles, rims, triggers, tool tips) rather than whole-object categories or generic point clouds — grasp-relevant granularity most manipulation perception pipelines skip.
  • ▸ Combines VLM-driven functional-part discovery with two asynchronous processing streams — high-frequency geometry via TSDF fusion and keyframe-triggered SAM3 semantic segmentation — fused by voxel-level temporal voting, avoiding the need for CAD models or pre-scanned meshes.
  • ▸ 83.4% mean part-IoU, and in a 24-trial physical pilot across four objects and eight tasks, the selected grasp contacts the requested part in every trial with 21/24 task successes — positioned as a semantic layer on top of an existing grasp generator (AnyGrasp) rather than a replacement for one.
Show abstract

Robotic manipulation requires perception systemsthat identify actionable parts such as handles, rims, triggers,and tool tips, not merely object categories or point clouds. This paper presents RoboSeg, a part-level semantic reconstructionsystem that links vision-language model (VLM) functional-partdiscovery, asynchronous online RGB-D semantic reconstruc-tion, and task-oriented grasp generation without requiring CAD models or pre-scanned meshes. RoboSeg queries a VLM onthe initial RGB observation to obtain compact functional part prompts, then scans with two asynchronous streams: a high-frequency geometry thread for RGB-D odometry and truncated signed distance function (TSDF) fusion, and a keyframe-triggered semantic thread for SAM3 part masks. Projectedmasks are fused by voxel-level temporal voting into a persistentpart-labeled point cloud; RoboSeg uses this map to assign AnyGrasp 6-DoF candidates to semantic parts and select grasps consistent with the task-relevant part label. RoboSeg reaches 83.4% mean part intersection-over-union (mIoU) over manually labeled objects; in a 24-trial physical pilot across fourobjects and eight tasks, the selected grasp contacts the requestedpart in all trials and achieves 21/24 combined task successes.These results characterize RoboSeg as a semantic indexing layerfor task-conditioned manipulation, with AnyGrasp retained asthe proposal generator.

#30
h=0
Removing Infrastructure Barriers in Human-Robot Collaboration Through Wireless Reconfigurable Cells
2026-08-10 cs.RO cs.CV cs.HC cs.NI Emma Takács (h=0)
Emma Takács, Mátyás Hajós, Ádám Juniki, Ádám Fischer, Zoltán Komáromi
Core Contributions
  • ▸ Removes the power/data cabling constraint that locks industrial HRC cells into fixed layouts, replacing it with a battery-powered, multi-sensor wireless platform aimed at high-mix, low-volume, frequently reconfigured settings like remanufacturing.
  • ▸ Offloads compute-heavy perception (oriented grasp pose plus hand detection, mAP@50-95 of 97.74 +/- 0.10%) to the network edge over 5G rather than running it on-cell, directly trading local compute for network dependency.
  • ▸ Validated across two countries (Hungary and Norway) and multiple 5G deployment types (public/private, Standalone/Non-Standalone), reporting round-trip times as low as 12ms with compatible pairings — but also surfaces real interoperability gaps across current 5G deployments, a useful cautionary result rather than a purely positive one.
Show abstract

Human-Robot Collaboration (HRC) plays a vital role in dynamic, high mix, low volume industrial scenarios such as remanufacturing, which frequently face workcell rearrangements. Traditional setups are constrained by power and data cabling, restricting modularity and reconfigurations, while the selection of commercial wireless devices suitable for real-time perception and safe collaboration are limited in availability. This paper presents a highly flexible, wireless, 5G-based system that serves as a versatile experimental testbed for applications including remanufacturing, operator training, and user studies. To eliminate infrastructure barriers, the workcell integrates a novel battery-powered, multi-sensor platform prototype. Additionally, to support operator safety and system adaptability across environmental shifts, the system integrates a computer vision module for object detection and pose estimation, further augmented for robust hand recognition. Trained on synthetic and real data, the model reliably detects oriented grasping poses and human hands across varying lighting and background conditions (with an mAP@50-95 of 97.74 +- 0.10% and a mean inference time of 12.5 ms). Offloading these computationally intensive tasks to the edge via 5G, the proposed architecture contributes to resolving the bandwidth-latency trade-off. To demonstrate portability, the system was implemented in both Hungary and Norway, and was evaluated across a combination of public and private, Standalone and Non-Standalone 5G infrastructures. The performed network experiments produced results in round-trip response times down to 12 ms in case of compatible network-device pairings, suitable for safe, adaptive HRC. However, these measurements also revealed practical limitations related to interoperability in current 5G deployments that should be addressed in future works.

Specialized Systems: Medical Robotics, Safety & Telerobotics

#1
h=37
RoSE: A Robotic Soft Esophagus for Endoprosthetic Stent Testing
2026-08-10 cs.RO Leo K. Cheng (h=37)
Dipankar Bhattacharya, Sherine Jesna V. A., Leo K. Cheng, Weiliang Xu
Core Contributions
  • ▸ A physical (not simulated) esophagus phantom lets researchers A/B test real stent hardware against real peristalsis, sidestepping the shortage of randomized clinical trials that leaves stent design guidelines incomplete.
  • ▸ Directly links stent radial force to two competing failure modes: stiffer stent B raises radial force (lowering migration risk) but significantly depresses intra-bolus pressure signatures, especially with higher-viscosity boluses — evidence that a "just make it stiffer" design philosophy can backfire into swallow dysfunction.
  • ▸ Reframes stent selection as a coupled optimization between anti-migration force and preserved swallowing mechanics, rather than a single-axis stiffness tradeoff — more informative than mechanical bench testing or animal models alone.
Show abstract

Soft robotic systems are well suited for developing devices for biomedical applications. A bio-mimicking robotic soft esophagus (RoSE) is developed as an in vitro testing device of endoprosthetic stents for dysphagia management. Endoprosthetic stent placement is an immediate and cost-effective therapy for dysphagia caused by malignant esophageal strictures from esophageal cancer. However, later stage complications, like stent migration, could weaken swallow efficacy in the esophagus. The stent radial force (RF) on the esophageal wall is pivotal in avoiding stent migration. Due to limited randomized controlled trials in patients, stent design and stenting guidelines remain incomplete. To address this knowledge deficit, we investigate RoSE by implanting two stents (A and B) of different radial stiffness characteristics, to measure stent RF and its effect on migration. Endoscopic manometry under peristalsis is also performed to study the impact of stenting and stent dysfunction on intra-bolus pressure signatures (IBPSs) and swallowing efficacy. Each implanted stent undergoes experiments with varied peristalsis velocity, wavelength, and bolus concentrations. The results show that stiffer stent B has a higher RF, whereas stent A maintains a lower RF profile due to lesser stiffness. High RF is necessary to minimize migration under prolonged peristaltic contractions in RoSE. For manometry, stent A slightly increases IBPS, but stiffer stent B significantly decreases IBPS, especially for higher-concentration boluses. If a stiffer stent buckles, it can reduce swallow efficacy and cause recurrent dysphagia. RoSE is therefore an innovative soft robotic platform for testing endoprosthetic stents and addressing clinical challenges in stent evaluation.

#2
h=37
Nonlinear Model Predictive Control of a Robotic Soft Esophagus
2026-08-10 cs.RO Leo K. Cheng (h=37)
Dipankar Bhattacharya, Ryman Hashem, Leo K. Cheng, Weiliang Xu
Core Contributions
  • ▸ Upgrades the open-loop RoSE platform to closed-loop control by adding embedded time-of-flight and pressure sensing, closing the sensing gap that limited the earlier prototype's peristalsis fidelity.
  • ▸ Uses SINDYC (sparse identification of nonlinear dynamics with control) to learn its own predictive dynamics model directly from sensor data, rather than relying on a hand-derived physical model — useful where soft-robot dynamics are hard to derive analytically.
  • ▸ Generates controllable peristaltic waves across multiple amplitudes (5/7.5/10 mm) at fixed speed and wavelength, then reuses the same closed-loop platform for stent-migration testing under varying bolus consistency — turning a research prototype into a repeatable pre-clinical testing instrument.
Show abstract

Strictures caused by esophageal cancer can narrow down the esophageal lumen, leading to dysphagia. Palliation of dysphagia has driven the development of a Robotic Soft Esophagus (RoSE), which provides a novel in vitro platform for esophageal stent testing and food viscosity studies. In RoSE, peristaltic wave generation and control were done in an open-loop manner since the conduit lacked visibility and embedded sensing capability. Hence, in this work, RoSE version 2.0 (RoSEv2.0) is designed with embedded Time Of Flight (TOF) and pressure sensors to measure conduit displacement and air pressure, respectively, for modeling and control. Model Predictive Control (MPC) of RoSEv2.0 is implemented to govern the peristalsis and air pressure profile autonomously. The implemented MPC used Sparse Identification Nonlinear Dynamics with Control (SINDYC) models to estimate the future states of ROSEv2.0. The dynamic models are discovered from the TOF and pressure sensor data. Peristalsis waves of speed 20 mm/s, wavelength 75 mm, and amplitudes 5, 7.5, and 10 mm were successfully generated by the MPC. Additionally, RoSEv2.0 with the MPC was employed to perform stent migration testing with various food bolus consistencies. The major contribution claimed in this paper is the application of SINDYC-based MPC to solve the closed-loop control problem of RoSE for achieving desired peristaltic waves.

#20
h=1
TAMS: Task-Aware Multi-View Adaptive Streaming for Wireless Telerobotic Manipulation
2026-08-10 cs.RO cs.MM Zexin Deng (h=1)
Zexin Deng, Zhenhui Yuan, Lu Tian, Subhash Lakshminarayana, Longhao Zou
Core Contributions
  • ▸ Allocates wireless video bitrate based on inferred manipulation task phase rather than treating all camera views equally, prioritizing whichever view actually matters to the operator at that moment.
  • ▸ Infers task phase from lightweight robot-side signals rather than heavy video analysis, keeping the adaptation decision cheap enough for real-time bandwidth-constrained teleoperation.
  • ▸ Under the most constrained network condition tested, cuts mean task completion time from 68.9s to 43.9s and raises trial success from 48% to 71% versus equal/static bitrate allocation — a reliability gain from smarter bandwidth scheduling alone, no change to the robot policy.
Show abstract

Wireless telerobotic manipulation relies on timely multi-view video feedback, but the available uplink bandwidth is often limited and dynamic. This paper presents Task-Aware Multi-View Adaptive Streaming (TAMS), a system that allocates video bitrate according to the current manipulation phase. TAMS infers task phase from lightweight robot-side signals and prioritizes the camera view most relevant to the operator while preserving baseline visibility for secondary views. Experiments on a six-degree-of-freedom (6-DoF) teleoperation testbed under three constrained network conditions show that TAMS improves primary view Structural Similarity Index (SSIM), reduces task completion time, and increases trial success rate compared with equal and static allocation baselines. Under the most constrained bandwidth condition, TAMS reduces mean completion time from 68.9 s to 43.9 s relative to equal allocation and increases trial success rate from 48% to 71%. Code is available at: https://github.com/Dzxx623/TAMS.

#24
h=0
Agentic Harnesses: LLM-Driven Verification Layers for Robot Autonomy
2026-08-10 cs.RO cs.AI Rohan Bhagra (h=0)
Rohan Bhagra, Mahantesh Halapannavar, Uddhav Bhattarai
Core Contributions
  • ▸ Inserts an LLM-based verification layer between planning and execution specifically to catch actions that are unsafe, ethically misaligned, or adversarially manipulated before they reach the robot's low-level controller.
  • ▸ Uses an LLM-as-a-Judge ensemble combining chain-of-thought reasoning across multiple models with self-consistency-style synthesis, gating plans into three outcomes — approve, reformulate, or escalate to a human — instead of a binary accept/reject.
  • ▸ ~85% precision across the accept/escalate/reject categories and 97% containment of adversarial attacks, with most residual errors clustering at the escalate boundary — the system is conservative in the right direction, pushing uncertain cases to a human rather than silently approving them.
Show abstract

Advances in advanced artificial intelligence tools have sparked research in robot autonomy, but the development of such systems has largely focused on execution rather than verifying the feasibility actions planning models propose. Like general-purpose LLMs, robotics planning models carry risks: biased toward user-specified goals, they may suggest actions misaligned with scientific ethics, they may be unsafe due to an inability to "remember" prior safety risks, or they may be vulnerable to adversarial attacks on the autonomy ecosystem. We propose a LLM-driven verification layer between planning and execution to evaluate action permissibility. Our LLM-as-a-Judge ensemble combines chain-of-thought reasoning across models and synthesizes those expert judge outputs, mirroring a combination of a mixture of experts and self-consistency approach. This layer serves as middleware, gating plans from the server's planning module before they reach the MCP server and therefore the robot's low-level controls: plans are approved, rejected for reformulation, or escalated for human review. With this system, we achieve near 85% precision across accept/escalate/reject categories 97% containment of adversarial attacks, with negligible errors between accepting and rejecting tasks, and errors mostly manifesting at the escalate boundary.