🤖 Robotics arXiv Digest

2026-09-15
30 papers 7 research areas
Generated by Claude

Research Landscape

Today's batch is dominated by a single organizing question: what should a robot's predictive model actually predict? ModAR answers empirically — training from scratch, it finds that forecasting future RGB frames, the default assumption behind most video-based world models, gives no consistent benefit, while point tracks, DINO features, and depth maps do, and it matches a video-pretrained baseline at roughly 20x fewer training FLOPs. The World Models for Embodied Intelligence survey supplies the conceptual scaffolding for why: it argues the field should stop scoring world models on visual fidelity and instead ask whether predictions are "Actionable" — whether they measurably improve planning, recovery, or data selection. XPACE puts that argument into practice on a real humanoid, using its own video simulator to synthesize deviation-recovery trajectories that fine-tune the policy, while TEMPO shows that even without touching a VLA's backbone, adding a motion summary and proprioceptive history resolves two specific, previously undiagnosed failure modes (motion ambiguity and state aliasing), lifting one task's success rate from 44% to 74%.

A second thread running through several papers is learning manipulation and navigation from data that isn't robot teleoperation. Rethinking Visual Embodiment Dependence shows that visuomotor policies quietly learn to use the robot's own visible body as a shortcut, and fixes this with a canonical end-effector representation that enables human-to-robot transfer with zero robot demonstrations — the same instinct that drives XPACE's use of action-unlabeled human video and CueNav's cross-platform, zero-shot video planner. Meanwhile, The Robot Data Factory stakes out the opposite pole of the same debate: rather than squeezing more out of clever representations, it argues for scaling "robot experience" itself as continuously-produced infrastructure, complete with scaling laws tying fleet size and sensor rates to compute requirements. Read together with ModAR's efficiency argument, this batch captures a live tension in the field between data-efficient representation learning and brute-force experience scaling as competing paths to generalist robots.

A third, quieter cluster is about making learned or vision-dependent systems trustworthy when perception fails or the world pushes back. Residual Fault Adaptation and ProxiDex both build dexterous-manipulation policies around degraded or indirect signals — a faulted joint, or hand-object proximity instead of occluded vision — while the wrist-pressure wristband proposes recovering hand state from muscle-driven pressure patterns alone. On the formal side, HJ Reachability for Hybrid Systems and the optimized wrench-polytope controller both push safety guarantees and stability analysis into the real-time control loop of legged robots, and ENCP does the analogous thing for navigation, repairing a broken coverage guarantee in conformal prediction so a VLN agent knows when to defer to a human. Taken together, today's papers suggest the field is less focused on chasing new capabilities in isolation and more on making existing capabilities — world models, VLA policies, dexterous hands, navigation agents — robust, efficient, and honest about their own uncertainty.

Papers by Research Area

World Models & VLA Foundation Models

Learning predictive models that connect perception to action, and using them to drive or ground vision-language-action policies.

  • #1 — Modality-Autoregressive World-Action Models
  • #4 — TEMPO: Learning Temporal Context for Dynamic Robot Manipula…
  • #7 — World Models for Embodied Intelligence: From Plausible to C…
  • #18 — Rethinking Visual Embodiment Dependence in Visuomotor Polic…
  • #24 — XPACE: Joint World and Action Modeling from Heterogeneous E…

Dexterous & Contact-Rich Manipulation

Manipulation under partial observability, occlusion, faults, or soft/compliant bodies — built around proximity, pressure, and proprioceptive state rather than clean vision.

  • #5 — Differentiable Mesh State Estimation via Factor Graph Infer…
  • #6 — Beyond Gestures: Estimating Full Hand Pose and Contact Forc…
  • #16 — Residual Fault Adaptation for Dexterous In-Hand Manipulatio…
  • #19 — SWIM: Vision-Language-Grounded Soft Whole-Body Interactive…
  • #27 — ProxiDex: Learning Dynamics-Guided Proximity Policy for Dex…

Navigation, Perception & Uncertainty

Video-conditioned navigation, terrain and trajectory prediction, and calibrated uncertainty for safer autonomous decisions.

  • #3 — Seeing What Matters: Visual Cue Guided Video Planning for G…
  • #21 — Kernel-Based Metrics Learning for Uncertain Opponent Vehicl…
  • #22 — Continual Learning for Traversability Prediction with Uncer…
  • #23 — ENCP: Episode-Normalized Conformal Prediction for Vision-an…
  • #28 — Online Geometric Change Detection via Scene Decomposition

Multi-Robot Coordination & Swarms

Decentralized sensing, fusion, and exploration across teams of robots without relying on centralized infrastructure.

  • #8 — CoAdapt: An LLM-based Framework for Adaptive Collaborative…
  • #14 — Gaussian Processes for Modelling Spatial Fields with Robot…
  • #15 — Exact Fusion and Coordinated Exploration in Multi-Robot Act…

Control Theory, Planning & Safety

Formal safety guarantees, motion planning, and structure-preserving control for contact-rich and hybrid robotic systems.

  • #2 — RobResilience: Implementing and Evaluating a Resilience Fra…
  • #10 — Hamilton-Jacobi Reachability for Hybrid Systems: Unified Go…
  • #11 — Motion planning in high dimensional spaces hybridizing RRT…
  • #20 — Optimized Wrench Polytope Analysis for Real-Time Stability…
  • #30 — Port-Hamiltonian Koopman Operator Synthesis for Mechanical…

Hardware, Simulation & Field Robotics

Physical platforms and simulators pushed into unconventional or industrial-scale real-world settings.

  • #9 — Fingers as Legs: Learning Self-Supported Locomotion and Man…
  • #13 — IL-ACT: Imitation Learning with Adaptive Cartesian Tracking…
  • #17 — LOTUSim-Energy: A Maritime Simulator for Human-Drone Intera…

Robot Learning Infrastructure & Emerging Directions

Data infrastructure, compositional skill learning, artificial-life inspired methods, and the non-algorithmic realities of deployment.

  • #12 — Learning Options for Compositional Motor Control with Adapt…
  • #25 — Machine Zygote: Causal Biparental Heredity Before Learning…
  • #26 — The Robot Data Factory
  • #29 — Overcoming technical adoption barriers for mobile service r…

Papers by Category

World Models & VLA Foundation Models

5 papers
#1
h=95
Modality-Autoregressive World-Action Models
2026-09-15 cs.RO D. Ramanan (h=95)
Adam Hung, Bardienus P. Duisterhof, Deva Ramanan, Jeffrey Ichnowski
Core Contributions
  • ▸ First world-action model to autoregressively denoise multiple future modalities (point tracks, DINO features, depth) in sequence before predicting actions, letting each modality condition on ones already generated rather than predicting everything jointly.
  • ▸ Systematic ablation trained from scratch finds that predicting future RGB frames — the default in most video-based world models — gives no consistent benefit, while point tracks, DINO features and depth all help; challenges the assumption that photorealistic future prediction is necessary.
  • ▸ Matches the video-pretrained Flex-π baseline (75% vs 72% success) while using ~20x fewer training FLOPs and no video pretraining at all, arguing structured modality choice can substitute for expensive pretraining at scale.
  • ▸ Real-world validation on three bimanual tasks shows gains that further improve when human videos are added to training data, suggesting the modality-autoregressive formulation generalizes across embodiments and data sources.
Show abstract

World-action models (WAMs) jointly model future observations and actions, typically predicting the future as RGB images. Other visual modalities such as depth, pretrained visual features, and point tracks can more efficiently capture geometric, semantic, and motion features. However, how best to combine these modalities within WAMs remains an open question. We introduce ModAR, the first WAM to autoregressively denoise multiple future modalities before predicting actions. This allows each prediction to condition on previously generated modalities. We train from scratch to systematically study how training-data mixtures, predicted modalities, and WAM formulations affect performance. In our evaluations, WAMs benefit from predicting point tracks, DINO features, and depth maps, while additionally predicting future RGB does not provide a consistent benefit. We also find that ModAR's sequential generation outperforms existing WAM formulations, with the highest average success rate at all evaluated data scales. We also fine-tune the video-model-initialized WAM Flex-$π$ on the same data; ModAR achieves a slightly higher observed average success rate (75% vs. 72%) while using approximately $20\times$ fewer training FLOPs and no pretraining. On three real-world bimanual tasks, ModAR outperforms baselines and improves with human videos.

#4
h=38
TEMPO: Learning Temporal Context for Dynamic Robot Manipulation
2026-09-15 cs.RO, cs.CV, cs.LG Erik B. Sudderth (h=38)
Zhenyang Feng, Jimin Heo, Erik B. Sudderth, Unnat Jain
Core Contributions
  • ▸ Pinpoints two distinct causes of VLA failure in dynamic tasks — motion ambiguity (a single frame can't reveal scene dynamics) and state aliasing (visually similar frames from different task phases require different actions) — and argues neither is fixed by scaling model size or inference compute.
  • ▸ Augments a frozen pretrained VLA with two lightweight temporal signals (a motion summary from a frozen video foundation model, and compact proprioceptive history) rather than retraining the backbone, keeping deployment overhead minimal.
  • ▸ Bottle Handover success jumps from 44% to 74%, and TEMPO is reported as the only tested method that actually resolves state aliasing rather than just improving average performance.
  • ▸ Releases TEMPO-Bench, 50k+ annotated frames for motion-aware perception evaluation, giving the field a shared benchmark to isolate these two failure modes going forward.
Show abstract

Vision-language-action (VLA) models have achieved impressive performance in quasi-static manipulation, but struggle in dynamic manipulation tasks because they operate on a single observation at inference time. We identify two representational failures that underlie this limitation. The first is motion ambiguity, where a single observation does not include scene dynamics and therefore cannot anticipate the future state of moving objects. The second is state aliasing, where visually similar observations from different points in a task require different actions. We argue that these failures persist regardless of model scale and inference latency, showing that the bottleneck is missing temporal context rather than model capacity. Based on this insight, we propose TEMPO, which augments a pretrained VLA with two temporal inputs: a motion summary extracted from a frozen video foundation model to resolve motion ambiguity and a compact proprioceptive history to resolve state aliasing. TEMPO requires no modification to the backbone and adds minimal compute overhead at training or deployment. Across four dynamic manipulation tasks, it improves Bottle Handover success from 44% to 74% and is the only method that solves state aliasing. Probing and ablation studies confirm that each temporal signal independently addresses its corresponding failure. We further release TEMPO-Bench, a benchmark of over 50k annotated frames for evaluating motion-aware robot perception in both regression and multiple-choice formats. Project Website: https://tempo-robot.github.io/

#7
h=29
World Models for Embodied Intelligence: From Plausible to Controllable to Actionable
2026-09-15 cs.RO, cs.AI Zongqing Lu (h=29)
Nanjie Yao, Hao Wang, Chong Cheng, Zhikang Chen, Wenzhe Li
Core Contributions
  • ▸ Proposes a three-tier capability hierarchy (Plausible → Controllable → Actionable) to reframe how world models should be evaluated — arguing visual fidelity is the wrong metric and the real question is whether predictions measurably improve downstream planning, learning, recovery, or verification.
  • ▸ Introduces a 3×4 matrix crossing geometry/physics/action-grounding against improvement loops (data, reward, policy, model itself), giving a structured way to place any given world-model paper — including others in this batch, like ModAR or XPACE — within a common framework.
  • ▸ Surveys world models across manipulation, navigation, locomotion, and autonomous driving under one lens rather than domain-siloed reviews, explicitly naming unresolved challenges: long-horizon consistency, uncertainty calibration, causal intervention testing, and cross-embodiment transfer.
  • ▸ Functions as a conceptual companion to this batch's applied world-model papers — its “Actionable” tier criteria map directly onto what ModAR and XPACE claim to demonstrate empirically.
Show abstract

World models connect perception and decision-making in embodied intelligence by maintaining hidden state, anticipating consequences, comparing interventions, and adapting when execution departs from expectations. Although progress is often measured by visual fidelity, their value lies in improving behavior. Before reaching for a cup, a person anticipates its weight and resistance to grasping, shaping the hand before contact. Such anticipation is coarse and rarely pictorial, yet it guides action. This raises a central question: which predictive capabilities improve behavior? Existing surveys, organized by architecture, output modality, or application domain, leave this question implicit. We introduce three progressively stronger capability levels: Plausible models preserve task-relevant temporal, geometric, or physical structure; Controllable models additionally predict how interventions alter that structure; and Actionable models translate predictions into measurable gains in planning, action, learning, evaluation, verification, recovery, or data selection. We complement this hierarchy with a 3 x 4 matrix crossing geometry, physics, and action grounding with improvement loops centered on data, rewards, policies, and the model itself. Using this framework, we survey manipulation, navigation, locomotion, autonomous driving, and general embodied learning, tracing technical progressions, clarifying capability requirements, and examining datasets, benchmarks, and evaluation protocols. We identify challenges in long-horizon consistency, uncertainty calibration, causal intervention testing, latency, verification and recovery, and cross-embodiment transfer. This perspective shifts evaluation from visual plausibility toward whether predictions capture task-relevant state, reflect intervention effects, and improve the closed-loop behavior of embodied agents.

#18
h=16
Rethinking Visual Embodiment Dependence in Visuomotor Policies
2026-09-15 cs.RO Hongjie Fang (h=16)
Hongjie Fang, Yuxuan Lu, Chenxi Wang, Haoxiang Qin, Shirun Tang
Core Contributions
  • ▸ Names and studies a specific failure mode — visual embodiment dependence (VED) — where visuomotor policies learn to use the robot's own visible body as a shortcut to infer task progress rather than genuinely understanding the scene, demonstrated via deliberate cue-conflict interventions.
  • ▸ Rather than removing embodiment cues entirely (shown to be insufficient on its own), proposes a canonical end-effector representation (CER) in 3D point clouds that preserves control-relevant geometry while abstracting away robot-specific morphology.
  • ▸ CER's editable form enables configuration-decorrelation augmentation, which fixes a second-order problem the authors discover: CER itself can become a new shortcut if robot configuration decouples from task progress.
  • ▸ Substantially improves human-to-robot policy transfer without any robot demonstrations, directly relevant to the batch's broader theme (see XPACE) of learning manipulation from human video rather than costly teleoperated robot data.
Show abstract

Visuomotor policies observe both the task scene and the acting embodiment, allowing embodiment-specific visual cues to influence action prediction. We study this phenomenon as visual embodiment dependence (VED) and show, through cue-conflict interventions across representative policies, that visible robot configuration can become a shortcut to task progress. Rather than eliminating VED, we argue that it should be structured around embodiment information that supports control and generalization. We realize this through embodiment canonicalization in 3D point clouds, replacing the original embodiment with a canonical end-effector representation (CER) that preserves control-relevant geometry while abstracting embodiment-specific morphology. Its editable form further enables configuration-decorrelation augmentation for unfamiliar robot configurations. Experiments show that embodiment canonicalization substantially improves human-to-robot policy transfer without robot demonstrations, while simply removing the embodiment is insufficient without preserving control-relevant geometry. We further find that CER itself can become a configuration shortcut when robot configuration becomes decoupled from task progress; configuration-decorrelation augmentation mitigates this failure mode and restores robust recovery without sacrificing performance on seen configurations. Together, these results show that robust visuomotor learning benefits from structuring, rather than removing, visual embodiment information. Project website: https://tonyfang.net/ved

#24
h=12
XPACE: Joint World and Action Modeling from Heterogeneous Experience
2026-09-15 cs.RO Yi-Xiao Ge (h=12)
Jiacheng Wei, Jerry Bai, Xiaoyu Yue, Zidong Wang, Xiaoyang Guo
Core Contributions
  • ▸ Unifies a world-action model (predicting actions and future video jointly) and a world simulator (predicting visual consequences of prescribed actions) in one architecture with a shared video backbone, rather than training them as separate systems.
  • ▸ Uses action-unlabeled video to learn general visual dynamics and action-labeled human+robot demonstrations to jointly learn video and action prediction — directly extending the batch's human-video-transfer theme (see also embodiment canonicalization above) to a humanoid platform.
  • ▸ A coarse-to-fine curriculum progressively shifts emphasis toward robot control while retaining human experience, letting the policy learn behaviors absent from robot demonstrations entirely.
  • ▸ Goes beyond passive learning from recorded data: the model's own simulator generates synthetic deviation-recovery trajectories around expert demonstrations, and fine-tuning on filtered recovery examples improves real-world task completion on XPENG's IRON humanoid.
Show abstract

A general-purpose robot needs to draw on diverse experience, choose actions, and anticipate how those actions will change the world. We introduce XPACE, a unified embodied world model that serves as both a world action model, jointly predicting executable robot actions and future video, and a world simulator, predicting the visual consequences of prescribed actions. Our key insight is that video prediction can both connect heterogeneous experience to action learning and generate new experience for policy improvement. With a shared video backbone between the policy and simulator, we use action-unlabeled video to learn visual dynamics and action-labeled human and robot demonstrations to jointly learn video and action prediction. Building on this architecture, a coarse-to-fine training curriculum progressively emphasizes robot control while retaining human experience, allowing the policy to learn behaviors beyond those covered by robot demonstrations. Beyond learning from recorded experience, XPACE uses its simulator to create additional recovery supervision for the policy. Specifically, we adapt the simulator to its own generated context, synthesize deviation-recovery trajectories around expert demonstrations, and fine-tune the policy on filtered recovery examples. Experiments on XPENG's IRON humanoid robot show that heterogeneous training improves robustness and enables transfer of human-observed skills to tasks absent from robot demonstrations, while recovery data generated by the model's own simulator further improves real-world task completion. Together, these results demonstrate how joint world and action modeling connects learning from heterogeneous experience with simulation-driven policy self-improvement.

Dexterous & Contact-Rich Manipulation

5 papers
#5
h=34
Differentiable Mesh State Estimation via Factor Graph Inference for Deformable Object Reconstruction
2026-09-15 cs.RO, cs.CV Tucker Hermans (h=34)
Lidia Al-Zogbi, Fangjie Li, Samuel Tobin, James Ferguson, Nithesh Kumar
Core Contributions
  • ▸ Casts deformable-object state estimation as factor-graph inference over a tetrahedral mesh, fusing physics priors, noisy sensor measurements and temporal smoothness in one nonlinear least-squares problem solved via Levenberg-Marquardt, rather than treating perception and physics simulation as separate stages.
  • ▸ Directly updates a physically-grounded mesh representation (not a point cloud or implicit field), keeping the estimate compatible with downstream physics-based planning or simulation.
  • ▸ Validated on ex vivo central-airway obstruction experiments — a medical/surgical deformable-tissue setting distinct from the more common cloth or box manipulation benchmarks used to test deformable-object methods.
  • ▸ Shows reliable reconstruction under both rigid motion and deformation, suggesting the factor-graph formulation is robust to mixed motion regimes rather than tuned to one.
Show abstract

Estimating deformable object states remains a fundamental challenge in robotics and simulation. We propose a novel factor graph-based framework for probabilistic mesh state estimation of deformable objects. The method directly updates a tetrahedral mesh, a rich and physically-grounded representation of an environment, by combining physics priors, noisy sensor measurements, and temporal smoothness constraints within a unified probabilistic formulation. The estimation problem is posed as a nonlinear least-squares optimization and solved using Levenberg-Marquardt. Ex vivo central-airway obstruction experiments and simulations on deforming cube models demonstrate reliable and accurate reconstruction under both rigid motion and deformation, highlighting the potential of this probabilistic approach for principled, measurement-driven mesh state estimation in deformable object reconstruction.

#6
h=31
Beyond Gestures: Estimating Full Hand Pose and Contact Forces from Wrist-Worn Pressure Sensor Array
2026-09-15 cs.HC, cs.RO Richard A. Newcombe (h=31)
Svetoslav Kolev, Lingni Ma, Michael Goesele, Renzo De Nardi, Jakob Engel
Core Contributions
  • ▸ Recovers full hand pose and per-finger contact force from a single wrist-worn capacitive pressure array — no glove, no electrical skin contact, no vision — by exploiting the insight that muscle contraction and tendon displacement produce distinguishable wrist pressure patterns.
  • ▸ Positions the device as one node in a “constellation” of everyday wearables (e.g., paired with an egocentric camera), explicitly designed to take over when the hand is visually occluded rather than replace vision entirely.
  • ▸ Achieves 4.6° mean finger-joint error on isolated motion, and per-finger contact-force estimation improves from R²=0.57 to R²=0.75 when fused with an external pose signal, quantifying how much complementary pose information helps.
  • ▸ Targets a specific downstream use — high-fidelity tactile demonstrations for robot learning — positioning it as a cheap data-collection tool rather than just an HCI gadget.
Show abstract

Capturing hand motion and interaction forces is critical for interactive computing, VR, and high-fidelity tactile demonstrations for robot learning. We introduce a wrist-worn pressure-sensing wristband that recovers continuous full-hand pose and distributed contact force on a single wearable. The system consists of flexible capacitive sensor arrays around the wrist, which require no electrical skin contact, and a recurrent network that maps the resulting pressure signal to hand state. Our key insight is that muscle contraction and tendon displacement produce pressure patterns, which correlate strongly with hand pose and interaction force. To validate this, we collect synchronized recordings of wrist pressure, optical motion-capture hand pose, and tactile-glove interaction force, covering isolated finger motion, fingertip-force stress tests, and natural hand-object manipulation. On isolated single-user motion the wristband attains $4.6^\circ$ mean finger-joint MAE, and across four users manipulating everyday objects it estimates per-finger contact force at $R^2=0.57$, which an external pose signal brings up to $0.75$. We see the wristband as one node in a constellation of everyday wearables -- e.g. paired with an egocentric camera -- adding the contact force that vision cannot observe and taking over when the hand is occluded.

#16
h=16
Residual Fault Adaptation for Dexterous In-Hand Manipulation Under Runtime Joint Faults
2026-09-15 cs.RO Guijun Ma (h=16)
Linan Deng, Xing Liu, Lin Hong, Feng Hua, Guijun Ma
Core Contributions
  • ▸ Addresses a specific and under-studied failure mode in dexterous manipulation: a runtime joint fault that silently disrupts contact configuration mid-task, rather than the more commonly studied problem of adapting to novel objects or grasps.
  • ▸ Trains a recurrent residual policy on top of a frozen, healthy “teacher” policy, inferring corrective actions purely from proprioceptive and command-response history — the deployed controller receives no explicit fault label or diagnostic signal.
  • ▸ Fault-injection domain randomization with adaptive sampling concentrates training on fault modes where recent performance is worst, an active-curriculum approach rather than uniform fault sampling.
  • ▸ Validated with real, software-injected faults on hardware, showing zero-shot deployment of a policy trained purely in simulation with domain-randomized faults.
Show abstract

Dexterous in-hand manipulation requires coordinated control of multiple actuated joints, and a runtime joint fault can abruptly disrupt the contact configuration required for successful manipulation. In this work, we propose residual fault adaptation (RFA), a teacher-anchored framework for compensating for hidden command-channel faults. RFA retains a frozen healthy teacher to provide nominal behavior and trains a recurrent residual policy to infer corrective actions from proprioceptive and command-response history. During training, fault-injection domain randomization (FIDR) varies the fault mode, affected joint, severity, and onset time, while adaptive sampling increases the frequency of fault modes associated with lower recent performance. A frozen Direct FIDR policy provides a distributional reference only on fault-active training samples and is absent from deployment. The deployed controller receives neither fault labels nor controller-switching signals. Simulation experiments on the dexterous hand indicate that RFA can improve manipulation performance relative to the healthy policy under a fixed mixed-fault protocol. Real-robot experiments with software-injected faults further demonstrate zero-shot deployment of the learned adaptation policy.

#19
h=14
SWIM: Vision-Language-Grounded Soft Whole-Body Interactive Manipulation
2026-09-15 cs.RO Senthilnath Jayavelu (h=14)
Tingcong Liu, Aye Phyu Phyu Aung, Junjie Xiong, Siyi Ma, Bo An
Core Contributions
  • ▸ Targets soft/continuum robots, where distributed body deformation makes translating language instructions into whole-body actuation fundamentally harder than for rigid-link manipulators with discrete joints.
  • ▸ SWIM-VLA combines a diffusion action head with “Visual Soft Proprioception,” which supervises predicted body-anchor positions using simulation ground truth — explicitly keeping body-geometry awareness in the learned representation despite limited real demonstrations.
  • ▸ Exploits the soft robot's intrinsic mechanical compliance for local contact adaptation without additional online policy queries, offloading part of the control problem to the body itself rather than the policy.
  • ▸ On hardware, SWIM (100%/80%/75% across three tasks) substantially outperforms direct online deployment of the same policy checkpoint without the virtual-rollout refinement (75%/40%/25%), quantifying how much the iterative rollout step actually contributes.
Show abstract

Soft and continuum robots enable manipulation through distributed body deformation and contact, yet translating language and visual context into executable whole-body actuation remains a fundamental challenge. We present SWIM, a framework that maps an initial RGB observation and a language instruction to a complete actuation-command sequence. Its vision-language-action (VLA) policy, SWIM-VLA, combines a diffusion action head with Visual Soft Proprioception (VSP) through a shared representation of RGB observations, language instructions, and tendon states. The diffusion head models conditional distributions of expert command chunks, while VSP supervises ordered body-anchor predictions using simulation ground truth, encouraging the representation to retain body geometry when learning from limited demonstrations. Embodied mechanical intelligence supports physical execution of command sequences generated through iterative virtual rollout from evolving simulated observations, with intrinsic compliance providing local contact adaptation without online policy queries. We evaluate SWIM on packing, reaching, and grasping on a planar tendon-driven soft robot, with grasping targets anchored. In simulation, SWIM-VLA achieves success rates of 100\%, 96\%, and 88\%, respectively, outperforming an adapted OpenVLA-OFT baseline and controlled ablations. On hardware, SWIM achieves success rates of 100\%, 80\%, and 75\%, compared with 75\%, 40\%, and 25\% for direct online deployment of the same policy checkpoint.

#27
h=12
ProxiDex: Learning Dynamics-Guided Proximity Policy for Dexterous Manipulation
2026-09-15 cs.RO, cs.AI Yuchuang Tong (h=12)
Yushan Bai, Boyu Zheng, Zhiyang Mao, Hongzheng Sun, Yuchuang Tong
Core Contributions
  • ▸ Treats hand-object proximity, not raw vision or tactile signals, as the core interaction state for dexterous manipulation — converting reconstructed interaction point clouds into geometric proximity cues that work across different tactile hardware without calibration.
  • ▸ Learns action-conditioned proximity dynamics with a coupled forward-inverse design: predicting future observation latents from actions, then decoding proximity variation from the resulting latent change, rather than treating proximity as a static observed feature.
  • ▸ Adaptively reweights proximity tokens across different phases of a manipulation task and uses dynamics-consistency supervision to stabilize action generation specifically when visual feedback is unreliable (e.g., occluded by the hand itself).
  • ▸ Demonstrates improved success and robustness over baselines on standard objects, unseen objects, and under physical perturbation — testing generalization along three separate axes rather than just in-distribution performance.
Show abstract

Multi-finger dexterous manipulation relies on stable hand-object interactions, yet these interactions are partially observable in practice. Visual observations are often occluded by the hand, tactile sensors introduce hardware-specific modalities and calibration burdens, and existing policies rarely model how these cues evolve under actions, making them brittle under contact uncertainty. To address these, we present ProxiDex, a dynamics-guided proximity policy framework that treats hand-object proximity as an interaction state for dexterous manipulation. ProxiDex reconstructs interaction point clouds and converts geometric distances into proximity cues, forming a hardware-agnostic contact representation that provides immersive feedback during VR teleoperation. Built on this representation, ProxiDex learns action-conditioned proximity dynamics with a coupled forward-inverse design: future observation latents are predicted from actions, while proximity variations are decoded from latent changes. Leveraging these dynamics, ProxiDex adaptively reweights proximity tokens across manipulation phases and uses dynamics-consistency supervision to guide policy inference, stabilizing action generation under unreliable visual feedback. Simulation and real-world experiments demonstrate improved success rates and robustness over representative baselines across standard, unseen objects, and perturbation scenarios. Additional visualizations are available at https://proxidex.github.io/.

Navigation, Perception & Uncertainty

5 papers
#3
h=53
Seeing What Matters: Visual Cue Guided Video Planning for Generalizable Robot Navigation
2026-09-15 cs.RO, cs.AI, cs.CV, cs.LG A. Lilienthal (h=53)
Hojin Lee, Sizhe Lester Li, Maximilian Hilger, Susie Lu, Achim J. Lilienthal
Core Contributions
  • ▸ Combines a bird's-eye-view map (global context) with a partial egocentric view of the robot's own body (embodiment context) as explicit visual cues fed into a video-based navigation planner, rather than relying on the video model to infer geometry implicitly from reconstruction.
  • ▸ An Inverse-Dynamics Model translates dense optical-flow fields extracted from the predicted video plan directly into robot actions, sidestepping the usual waypoint-extraction-via-scene-reconstruction step.
  • ▸ BEV-cue guidance nearly doubles maze-navigation success versus video planning without the cue; the body-aware embodiment view raises success in narrow-passage navigation to 70% where comparison methods largely fail.
  • ▸ Demonstrates the same trained video planner deployed zero-shot across different robot platforms and for semantic-conditioned navigation, arguing the cue-based approach generalizes across embodiments rather than needing per-robot retraining.
Show abstract

Generative video models can serve as a promising backbone for robot navigation by predicting future observations as video plans. Recent approaches often condition video planning on short-horizon guidance and recover geometric waypoints through scene reconstruction, leaving longer-horizon planning and precise video-to-action translation less explored. We present CueNav, a video model-based navigation framework combining visual cue guided video planning with an embodiment-specific Inverse-Dynamics Model (IDM). As visual cues, we use a Bird's-Eye View (BEV) map to convey global task context and retain part of the robot body in the egocentric observation to expose embodiment context. These cues guide the video planner, while the IDM translates dense flow fields extracted from the video plan into robot actions. With the visual cue encoding global task context, CueNav achieves nearly 2x higher success in maze navigation than planning without the cue. The body-aware view with the IDM enables precise navigation with 70% success in a narrow passage where comparison methods largely fail to complete the task. We further demonstrate zero-shot semantic-conditioned navigation and deployment of the same video planner across different robot platforms. Our results show that visual cue-guided video planning with embodiment-specific action grounding paves the way toward a generalizable navigation framework for longer-horizon planning and embodiment-aware control. Additional results and code are available on our project website: https://cuenav.github.io.

#21
h=13
Kernel-Based Metrics Learning for Uncertain Opponent Vehicle Trajectory Prediction in Autonomous Racing
2026-09-15 cs.RO, cs.AI, cs.LG Cheolhyeon Kwon (h=13)
Hojin Lee, Youngim Nam, Sanghun Lee, Cheolhyeon Kwon
Core Contributions
  • ▸ Proposes heterogeneous kernel metrics for Deep Kernel Learning that align similar opponent driving policies and separate dissimilar ones in an unsupervised way, addressing the core difficulty in autonomous racing that opponents' driving policies are unknown and diverse.
  • ▸ Produces trajectory predictions with associated uncertainty estimates rather than point predictions alone, which is what actually enables a downstream overtaking decision to be made safely.
  • ▸ Validated on a real 1/10th-scale racecar platform rather than only in simulation, and reported as computationally efficient enough for onboard racing hardware where latency budgets are extremely tight.
  • ▸ Demonstrates improved prediction accuracy translating into safer overtaking maneuvers against opponents, connecting the learning contribution to an actual racing outcome rather than a prediction-only metric.
Show abstract

Autonomous racing confronts significant challenges in safely overtaking Opponent Vehicles (OVs) that exhibit uncertain trajectories, stemming from unknown driving policies. To address these challenges, this study proposes heterogeneous kernel metrics for Deep Kernel Learning (DKL), designed to robustly capture the diverse driving policies of OVs, and carry out precise trajectory predictions along with the associated uncertainties. A key virtue of the proposed kernel metrics lies in their ability to align similar driving policies and disjoin dissimilar ones in an unsupervised manner, given the observed interactions between the Ego Vehicle (EV) and OVs. The efficacy of the proposed method is substantiated through experimental studies on a 1/10th scale racecar platform, demonstrating improved prediction accuracy and thereby safely overtaking against OVs. Furthermore, our method is computationally efficient for onboard computing units, affirming its viability in fast-paced racing environments. The video and source code can be found at https://github.com/HMCL-UNIST/OpponentPredictionWithKMDKL.git.

#22
h=13
Continual Learning for Traversability Prediction with Uncertainty-Aware Adaptation
2026-09-15 cs.RO, cs.AI, cs.LG Cheolhyeon Kwon (h=13)
Hojin Lee, Yunho Lee, Daniel A Duecker, Cheolhyeon Kwon
Core Contributions
  • ▸ Tackles catastrophic forgetting specifically in terrain traversability prediction: models that adapt to new terrain types tend to lose accuracy on previously learned terrains, a problem rarely addressed in traversability work that mostly focuses on single-domain generalization.
  • ▸ Uses a generative experience-recall model to retain prior experience without storing past raw data — relevant for onboard memory-constrained robots that can't keep growing datasets.
  • ▸ Explicitly incorporates the recall model's own generation uncertainty into the adaptation process, so the robot down-weights unreliable “remembered” experience rather than treating recalled samples as ground truth.
  • ▸ Validated on a real skid-steering robot across a sequence of diverse real-world environments, demonstrating the forgetting-mitigation claim outside of a synthetic benchmark.
Show abstract

Traversability prediction is a critical component of autonomous navigation in unstructured environments, where complex and uncertain robot-terrain interactions pose significant challenges such as traction loss and dynamic instability. Despite recent progress in learning-based traversability prediction, these methods often fail to adapt to novel terrains. Even when adaptation is achieved, retaining experience from previously trained environments remains a challenge, a problem known as catastrophic forgetting. To address this challenge, we propose a continual learning framework for traversability prediction that incrementally adapts to new terrains using a generative experience recall model. A key virtue of the proposed framework is two folds: i) retain prior experience without storing past data; and ii) incorporate the uncertainty of the generated samples from the recall model, enabling uncertainty-aware adaptation. Real-world experiments with a skid-steering robot validate the effectiveness of the proposed framework, demonstrating its ability to adapt across a series of diverse environments while mitigating catastrophic forgetting.

#23
h=12
ENCP: Episode-Normalized Conformal Prediction for Vision-and-Language Navigation
2026-09-15 cs.LG, cs.AI, cs.RO Muhamad Risqi U. Saputra (h=12)
Vicky Feliren, A. Taufiq Asyhari, Muhamad Risqi U. Saputra
Core Contributions
  • ▸ Identifies that standard conformal prediction's coverage guarantee breaks down for vision-and-language navigation because episodes are variable-length and steps within an episode are dependent — a calibration assumption violation that's easy to overlook when applying CP off-the-shelf.
  • ▸ Proposes Episode-Normalized Conformal Prediction, which rescales the nonconformity score by the policy's residual confidence and calibrates a single maximum score per episode, preserving a formal per-step coverage guarantee (≥ 1-α) despite within-episode dependence.
  • ▸ Validated across four different VLN policies and three different nonconformity scores on both R2R and REVERIE, showing the method isn't tuned to one specific policy/score combination.
  • ▸ Meets all reported empirical step-coverage targets on seen-to-unseen evaluation, directly enabling a practical downstream use: deciding when a VLN agent should defer to a human or stronger model rather than proceeding uncertainly.
Show abstract

Uncertainty estimation for Vision-Language-Navigation (VLN) models is a critical task since it can help identify ambiguous and unreliable predictions, enabling agents to make safer navigation decisions. As one of the most advanced uncertainty estimation frameworks, conformal prediction (CP) offers a promising approach for uncertainty estimation in VLN. However, given that VLN agent requires a sequence of steps, standard calibration in conformal prediction fails to provide coverage guarantee it promises over a dependent, variable-length VLN episode. To this end, we propose Episode-Normalized Conformal Prediction (ENCP), which rescales a nonconformity score by the policy's residual confidence and calibrates one maximum score per episode. Under exchangeable calibration and test episodes, this construction covers the ground truth at every step with probability at least $1 - α$, while allowing dependence among steps within an episode. Across four VLN policies and three nonconformity scores on R2R and REVERIE dataset, ENCP meets all reported empirical step-coverage targets on the seen-to-unseen evaluation. These results demonstrate that ENCP can provide model-agnostic uncertainty estimates, which might be useful for determining when a VLN agent should defer to a more capable predictor, including human assistance.

#28
h=11
Online Geometric Change Detection via Scene Decomposition
2026-09-15 cs.RO Philip R. Osteen (h=11)
David Thorne, Samuel Jia Cong Chua, Nakul Joshi, Aiden Wong, Christa S. Robison
Core Contributions
  • ▸ Introduces the first submap-based approach to geometric change detection, spatially decomposing a mapped environment into scenes so changes are found by comparing local dense submaps rather than expensive whole-map comparisons across sessions.
  • ▸ Explicitly designed for single-session online detection (e.g., a fallen tree or an opened door mid-mission), not just after-the-fact multi-session comparison, which is what most prior geometric change detection work targets.
  • ▸ Solves the practical sub-problems this decomposition creates — selecting non-redundant scenes, generating representative submaps, comparing submaps with differing fields of view, and reconstructing the map in real time from detected changes.
  • ▸ Validated on real data collected at the Army Research Laboratory's Graces Quarters facility as well as open-source multi-session datasets, connecting a lab algorithm to field-collected data from an actual research facility.
Show abstract

Autonomous robots are increasingly deployed on long duration single- and multi-session missions in dynamic environments, where the ability to identify environmental changes such as fallen trees or opened doors provides important contextual information for online planning. We propose a framework called Change Detection via Scene Decomposition (CDSD) for accurate online geometric change detection using LiDAR or RGB-D sensors. Recent advances in geometric SLAM have made it possible to generate dense, tightly aligned maps without post processing, but comparing global maps across entire sessions is computationally expensive and does not allow for single-session online change detection. CDSD instead spatially decomposes mapped environments into unique scenes where changes can be found efficiently by comparing dense, local subsets of the global map called submaps. As the first submap-based approach for geometric change detection, we identify and address the following core challenges: 1) identifying appropriate scenes for change detection that require minimal redundant information; 2) generating dense and representative submaps for each scene; 3) detecting changes between submaps with differing fields of view; and 4) processing detected changes for real-time map reconstruction. Results demonstrate our algorithm on custom datasets collected at the Army Research Laboratory facility in Graces Quarters, Maryland, and on open-source multi-session change detection datasets.

Multi-Robot Coordination & Swarms

3 papers
#8
h=27
CoAdapt: An LLM-based Framework for Adaptive Collaborative Perception in IIoT Robotic Swarms
2026-09-15 cs.AI, cs.RO S. Elayoubi (h=27)
Houssam Hajj Hassan, Antonia Maria Masucci, Lynda Zitoune, Salah-Eddine Elayoubi
Core Contributions
  • ▸ Uses an LLM as a runtime fusion controller for multi-robot collaborative perception — deciding which robots' LiDAR observations to fuse and which fusion algorithm to apply based on natural-language descriptions of the current scene and network state, requiring no task-specific training.
  • ▸ Targets a real industrial gap: existing collaborative perception methods assume static participation, but IIoT swarms have robots whose positions and bandwidth constantly shift and whose marginal contribution to perception quality varies at runtime.
  • ▸ Reports a 38% reduction in communication cost on the OPV2V benchmark across 25 scenarios while keeping detection precision comparable to static baselines — a concrete bandwidth/accuracy trade-off number.
  • ▸ Generalizes to unseen swarm topologies without retraining, since the LLM reasons over structured scene descriptions rather than a topology-specific learned policy.
Show abstract

Industrial IoT environments increasingly deploy autonomous mobile robots for tasks such as material handling, product assembly, or infrastructure inspection. In such deployments, collaborative perception enables robots to share LiDAR observations and collectively construct a richer model of their environment than an individual agent could produce alone. However, industrial environments are dynamic spaces where robot positions shift continuously, network bandwidth fluctuates, and the marginal contribution of robots to perception quality varies at runtime. Existing collaborative perception approaches are designed for static participation assumptions and cannot adapt to these dynamics without sacrificing either detection precision or communication efficiency. This paper presents CoAdapt, an adaptive collaborative perception framework for IIoT robotic swarms in which a Large Language Model (LLM) serves as a runtime fusion controller, jointly deciding which robots participate in the fusion process and which fusion algorithm to apply based on the current spatial configuration and network state. The LLM reasons over structured natural language descriptions of the scene derived from raw LiDAR point clouds, requiring no taskspecific training and generalizing to unseen swarm topologies. Evaluated on the OPV2V benchmark across 25 scenarios, our approach achieves a 38% reduction in communication cost while maintaining detection precision comparable to static baseline approaches.

#14
h=21
Gaussian Processes for Modelling Spatial Fields with Robot Swarms
2026-09-15 cs.RO G. Francesca (h=21)
Guillermo Legarda Herranz, Gianpiero Francesca, Mauro Birattari
Core Contributions
  • ▸ Removes the standard assumption that swarm robots have access to an external positioning system, instead having each robot jointly infer the spatial field (e.g., temperature, wind, elevation) and its own frame of reference relative to peers using only local sensing and communication.
  • ▸ Introduces location-unaware Gaussian process regression (LU-GPR), an online algorithm where local frame estimates converge to a shared reference frame as more local sensing/communication accumulates, rather than assuming synchronization from the start.
  • ▸ Combines individual robots' local estimates into a global model via a product-of-experts formulation, and shows the approach scales well with swarm size and tolerates limited communication range.
  • ▸ Demonstrated on a real-world use case — estimating the flow of an evacuating crowd — showing applicability beyond the more common environmental-monitoring benchmark tasks.
Show abstract

Robot swarms, by virtue of their decentralised architecture, are a natural tool for scalable, robust modelling of spatial fields, such as water temperature, wind velocity, or terrain elevation. However, existing methods rely on external positioning systems that allow each robot to determine its own position in space. Here, we introduce location-unaware Gaussian process regression (LU-GPR) as a solution to the modelling of spatial fields in the absence of such positioning systems. LU-GPR allows each robot to infer the posterior mean and variance of the field in space, while simultaneously agreeing on a common frame of reference with its peers, using only local sensing and communication. We propose an online algorithm that allows each robot to consistently infer local estimates as its local frame of reference converges to the common one. By means of a product of experts model, each robot also combines the estimates of its peers with its own to obtain a global model. Our results show that LU-GPR scales well with the number of robots and is robust to limited communication ranges. We also demonstrate how it can be used in real-world monitoring scenarios to estimate the flow of an evacuating crowd.

#15
h=18
Exact Fusion and Coordinated Exploration in Multi-Robot Active Inference
2026-09-15 cs.RO, cs.MA Seyede Fatemeh Ghoreishi (h=18)
Peng Wu, Mohsen Imani, Amidu Kamara, Md Tamzeed Islam, Seyede Fatemeh Ghoreishi
Core Contributions
  • ▸ Identifies and formally corrects a double-counting error in multi-robot active inference: the shared prior gets counted n times when fusing n robots' local posteriors, and every robot scores its plan against that same over-counted belief when planning — degrading coordinated exploration.
  • ▸ Fixes both errors by adding evidence increments (realized at fusion, expected at planning) to the shared natural parameter, and proves the correction is exact for Gaussian beliefs and for Dirichlet beliefs under the novelty approximation of discrete active inference.
  • ▸ Shows the corrected expected increment gives each subsequent robot its true conditional information gain, so corrected gains sum exactly to the joint gain — and that sequential commitment retains the classical 1/2 greedy submodular guarantee.
  • ▸ Experiments on cooperative RockSample, foraging, and field monitoring show fusion correction alone leaves exploration redundancy unchanged, but adding anticipated evidence removes it — isolating which piece of the fix actually matters empirically.
Show abstract

Robot teams that learn a common environment model exchange belief summaries and plan by the expected information gain of their actions. Under conjugate exponential-family beliefs the shared belief is counted once per robot at two points: at fusion, the product of local posteriors counts the common prior $n$ times, and at planning, every robot scores its plan under the same belief and the team converges on the same unknown. Both errors are removed by adding evidence increments to the shared natural parameter, realized increments at fusion and expected increments at planning. The expected increment of a committed teammate gives the next robot its conditional gain; corrected gains sum to the joint gain, the redundancy removed equals the total correlation of the planned observation streams, and sequential commitment keeps the $1/2$ greedy guarantee. The expected increment is exact for Gaussian beliefs with fixed sampling paths and for Dirichlet beliefs under the novelty approximation of discrete active inference, whose team objective has a closed concave form within an explicit bound of the exact mutual information, and fails for finite hypothesis classes, where a short exact enumeration replaces it. Experiments on cooperative RockSample, foraging, and field monitoring show that fusion correction leaves exploration redundancy unchanged, anticipated evidence removes it, and sequential commitment recovers most of the value of centralized joint planning at cost linear in the team size.

Control Theory, Planning & Safety

5 papers
#2
h=78
RobResilience: Implementing and Evaluating a Resilience Framework for Cyber-Physical Embodied Systems
2026-09-15 cs.CR, cs.RO, eess.SY Mauro Conti (h=78)
Gysella Imrell, Emanuele Miotto, Mahya Mohammadi Kashani, Mauro Conti, Alberto Giaretta
Core Contributions
  • ▸ Introduces a runtime resilience framework that separates “safe but degraded” operation from “catastrophic hazard” during an active cyberattack — addressing a documented failure mode where systems freeze indecisively (“graceful failure paralysis”) instead of assessing whether a threat is survivable.
  • ▸ Formalizes three runtime predicates (tolerable disruption δ, tolerable degradation γ, mitigation feasibility μ) computed from IDS confidence scores, giving a lightweight decision procedure instead of a black-box anomaly detector.
  • ▸ Validated in a Webots simulation with a PR2/ROS2 stack across eight attack scenarios systematically covering every combination of the predicate state space, rather than a handful of ad hoc attack demos.
  • ▸ Confirms the implementation's runtime behavior matches the theoretical predicate definitions, bridging formal cyber-physical security theory and an actual ROS2 deployment.
Show abstract

In embodied cyber-physical systems, active cyberattacks pose an immediate threat not just to data, but to physical integrity and human safety. While existing security approaches excel at detection, they lack the runtime mechanisms to determine whether a disruption is tolerable or if performance degradation remains within safe operational bounds. This gap leaves autonomous systems vulnerable to graceful failure paralysis, where they cannot distinguish between a safe, degraded state and a catastrophic hazard during an ongoing attack. This paper presents RobResilience, an implementation of a formal resilience framework for embodied cyber-physical systems in a Webots simulation environment, using a PR2 robot and ROS2. The framework evaluates three predicates at runtime: tolerable disruption ($δ$), tolerable degradation ($γ$), and mitigation feasibility ($μ$), over a compromised device set derived from IDS confidence scores. When resilience is lost, the framework triggers available mitigation strategies. We evaluate our implementation through eight attack scenarios that systematically cover all possible combinations of the predicate state space, varying attack targets, degradation rates, and mitigation availability. Results confirm that the runtime behaviour of the implementation is consistent with the theoretical definitions.

#10
h=24
Hamilton-Jacobi Reachability for Hybrid Systems: Unified Goal-Driven Control with Safety Guarantees
2026-09-15 cs.RO, eess.SY Somil Bansal (h=24)
Javier Borquez, Shuang Peng, Somil Bansal
Core Contributions
  • ▸ Extends classical Hamilton-Jacobi reachability — previously limited to continuous-time systems — to hybrid dynamical systems with discrete mode switches, which is the regime most contact-rich robot tasks (legged locomotion, manipulation) actually live in.
  • ▸ Defines a generalized value function over joint discrete+continuous state that yields formally verified safe sets even under control constraints and model uncertainty, rather than empirically-tuned safety margins.
  • ▸ Introduces hybrid backward reach-avoid tubes — a first for hybrid HJ reachability — enabling controllers that guarantee both safety and goal-reaching simultaneously, not just collision avoidance.
  • ▸ Validated on a real quadrupedal robot in hybrid mode-planning scenarios, showing the formal framework survives contact with actual contact-rich hardware, not just simulation.
Show abstract

Hybrid dynamical systems provide a powerful modeling framework for robotic systems, particularly in contact-rich environments. However, ensuring safety and performance in such systems remains challenging due to the intricate coupling between continuous dynamics and discrete mode transitions. In this work, we extend classical Hamilton-Jacobi (HJ) reachability analysis, a formal verification method for continuous-time nonlinear systems, to hybrid dynamical systems. Our framework characterizes safe sets for hybrid systems through a generalized value function defined over both discrete and continuous states while accounting for control constraints and model uncertainty. We additionally provide a numerical algorithm to compute this value function. Building on these safe sets, we propose two different mechanisms to integrate performance objectives. First, we introduce a hybrid least-restrictive safety filter that intervenes on both the discrete and continuous components of a nominal controller only when necessary to avoid unsafe states, thereby preserving nominal behavior whenever possible. Second, we formulate and compute hybrid backward reach-avoid tubes, enabling the simultaneous enforcement of safety and goal-reaching behavior, an extension not previously addressed within hybrid HJ reachability. This enables the synthesis of continuous and discrete control policies that guarantee both safety and task completion. We validate our framework through simulation studies and real-world experiments on a quadrupedal robot, demonstrating its effectiveness in hybrid mode planning and safety-critical applications.

#11
h=24
Motion planning in high dimensional spaces hybridizing RRT and HAR via position-direction decoupling
2026-09-15 cs.RO F. Cazals (h=24)
Frederic Cazals, Nelson Feyeux
Core Contributions
  • ▸ Decouples the “point being extended” from the “direction of extension” in sampling-based planning, showing that RRT and Hit-and-Run random walks are special cases of one generic algorithm once this decoupling is made explicit — a unifying theoretical contribution, not just a new heuristic.
  • ▸ Adds a sparse-move strategy that moves only a fraction p_r of robots per step in multi-robot planning, which helps both RRT and the new HAR-based method (HARF) handle cluttered, high-DOF scenes.
  • ▸ Solves instances with up to 64 robots and 384 degrees of freedom within seconds on a standard laptop — including molecular systems modeled as independent SE(3) “robots,” an unusual cross-domain test of the planner's generality.
  • ▸ HARF is reported up to two orders of magnitude faster than classical RRT on hard cluttered instances (and still 2.4x faster on typical instances at matched p_r), a substantial constant-factor win on a well-studied problem.
Show abstract

The exploration of high-dimensional spaces remains a challenging problem, in particular in the presence of narrow passages and small clearances. We propose novel sampling-based path-planning methods for high-dimensional spaces combining Rapidly-exploring Random Trees (RRT) and Hit-and-Run (HAR) random walks by decoupling the point being extended from the direction of extension. We also show that RRT and HAR appear as special cases of a generic algorithm coupling the biases used for the point and direction extension, respectively. We further study a sparse-move strategy in which only a fraction p_r of the robots is moved at each step, helping both RRT and the proposed HAR algorithms handle cluttered instances. Tests are presented for two families of models: classical piano mover problems in 3D, and complex molecular systems involving tens of rigid domains moving relatively to one another -- the latter viewed as independent robots exploring the motion space SE(3)N . Within seconds on a standard laptop, our algorithms solve instances with up to 64 robots and 384 degrees of freedom. We conclude by suggesting one of our methods, HARF, as the method of choice for complex multi-robot planning problems, being up to two orders of magnitude faster than the classical RRT moving all robots at each step--when it succeeds at all, and still up to 2.4 fold faster on most instances when both use their best p_r.

#20
h=13
Optimized Wrench Polytope Analysis for Real-Time Stability Control of Legged Robots in Complex Multi-Contact Configurations
2026-09-15 cs.RO G. Heppner (h=13)
Friedrich Graaf, Elias Birkefeld, Christian Eichmann, Elias Hofele, Tristan Schnell
Core Contributions
  • ▸ Speeds up computation of the full actuatable wrench polytope — used to certify stability under arbitrary multi-contact configurations — enough to run inside a real control loop at 49 Hz, rather than as an offline stability check.
  • ▸ Targets terrain that is specifically hard for legged robots (slopes, caves, scaffolding) where multi-contact stability analysis, not just gait control, determines whether the robot can proceed at all.
  • ▸ Validated both extensively in simulation and by deployment on real walking-robot hardware, closing the loop from algorithmic speedup to an actual onboard controller.
  • ▸ Claims stability in complex contact scenarios the authors state are not achievable by any other existing controller — a strong claim worth scrutinizing against future comparisons, but notable if it holds.
Show abstract

Legged robots offer a variety of automation applications in real-world scenarios. But areas that are difficult to traverse, like slopes, caves, or scaffolding, still pose a great challenge for traversal. To tackle this problem, we propose an optimized algorithm for evaluating the full actuatable wrench polytope for arbitrary contact scenarios. With our improved analysis algorithm, the torques for each joint of the robot can be calculated within a control frequency of 49 Hz. The achieved speedup allows for deployment within a regular control loop for actuating robot poses for different contact scenarios. We evaluated our stability controller extensively in simulation scenarios and validated its applicability by deploying it on actual walking robot hardware. The proposed controller achieved stability in very complex scenarios that are currently not achievable by any other controller.

#30
h=10
Port-Hamiltonian Koopman Operator Synthesis for Mechanical Systems
2026-09-15 cs.RO, eess.SY J. Keshavan (h=10)
Rajpal Singh, Aditya Singh, Jishnu Keshavan
Core Contributions
  • ▸ Addresses a specific failure of standard data-driven Koopman models: they can violate the energetic structure of the real mechanical system, producing predictions with artificial energy growth that diverges under recursive (long-horizon) propagation.
  • ▸ Builds the Koopman lifting on generalized-momentum coordinates so mechanical actuation appears as a known, state-independent port, then uses a structure-constrained neural architecture to jointly learn the lifting functions and a port-Hamiltonian generator — making the learned dynamics passive by construction, not via penalty terms or post-hoc projection.
  • ▸ A Cayley-midpoint discretization preserves the storage-dissipation energy balance exactly in discrete time, and the paper derives analytical stability guarantees for the resulting predictor rather than relying purely on empirical validation.
  • ▸ Shows accuracy and data-efficiency gains over Koopman baselines that increase specifically for higher-dimensional systems, where standard Koopman models are most prone to the energy-drift failure being addressed.
Show abstract

Finite-dimensional Koopman models enable efficient linear prediction and control of nonlinear robotic systems. However, models learned purely from trajectory data may violate the energetic structure of the underlying mechanics, producing predictions that exhibit artificial energy growth and diverge under recursive propagation. This work presents a structure-preserving Koopman framework for Euler-Lagrange systems built on generalized-momentum coordinates. The momentum transformation exposes the mechanical actuation as a known, state-independent port, which is preserved explicitly in the lifted dynamics. A structure-constrained neural architecture is developed to jointly learn the lifting functions and a port-Hamiltonian Koopman generator, rendering the learned dynamics passive by construction rather than through penalty terms or post-hoc projection. A Cayley-midpoint discretization further preserves the corresponding storage-dissipation balance exactly in discrete time. These properties are established analytically by deriving the discrete storage balance and associated stability guarantees of the learned predictor. Simulation and experimental studies demonstrate improved prediction accuracy, data efficiency, and closed-loop tracking over Koopman baselines, with increasing gains for higher-dimensional systems.

Hardware, Simulation & Field Robotics

3 papers
#9
h=26
Fingers as Legs: Learning Self-Supported Locomotion and Manipulation with an Anthropomorphic Hand
2026-09-15 cs.RO, eess.SY Robert K. Katzschmann (h=26)
Amirhossein Kazemipour, Hehui Zheng, Robert Katzschmann
Core Contributions
  • ▸ Trains an anthropomorphic robotic hand to walk on its own fingers — using the same finger design and position controller for locomotion, weight-bearing, and manipulation, with no separate locomotion mechanism bolted on.
  • ▸ A custom RL reward formulation, accounting for the hand's structurally unequal fingers (unlike a quadruped's symmetric legs), lets the hand move faster in simulation than with reward formulations borrowed directly from quadruped locomotion literature.
  • ▸ Hardware demonstrations include untethered crawling, steering, and fall recovery, plus executing keyboard commands blind (no vision) while bearing its own weight — a stress test of whether the sim-trained policy transfers to a genuinely different morphology class.
  • ▸ Positions “reuse the manipulator as the locomotor” as an alternative to bolting wheels or legs onto hands, relevant to mobile manipulator designs that must stay compact and power-self-contained.
Show abstract

A walking robotic hand must use the same fingers to move its body, support its weight, and interact with the environment. We show how an anthropomorphic hand can learn these skills while retaining its finger design and position controller. Onboard power and computation make the platform self-contained. Our reinforcement learning approach accounts for the hand's unequal fingers, with training in a simulator calibrated from hardware measurements. In simulation, the hand moves faster with our reward formulation than with tuned rewards originally designed for quadrupeds. On hardware, task-specific policies enable untethered crawling, steering, and fall recovery. While supporting its own weight, the hand also executes successive keyboard commands without vision and pushes an object to targets using overhead visual feedback. These results demonstrate a compact mobile manipulator that reuses its fingers for locomotion and interaction, without a separate locomotion mechanism.

#13
h=23
IL-ACT: Imitation Learning with Adaptive Cartesian Tracking Control for a 30-ton Excavator
2026-09-15 cs.RO J. Mattila (h=23)
Mehdi Heydari Shahna, Seihun Kim, Soyi Jung, Soohyun Park, Jouni Mattila
Core Contributions
  • ▸ Targets a genuinely industrial platform — a 30-ton-class excavator — where coupled kinematics, actuation lag, and hydraulic uncertainty make standard imitation learning brittle, unlike the tabletop-arm settings most manipulation IL papers use.
  • ▸ Combines a 14-input imitation policy (pretrained on operator demonstrations) with adaptive Cartesian feedback and a stopping-distance governor that corrects commands before they reach the joint-reference generator — a safety-oriented layered correction rather than a single end-to-end policy.
  • ▸ Telemetry-initialized IL-ACT lowers RMSE across all 24 figure-eight/rounded-raster seed comparisons and cuts additional-load spiral RMSE by ~29%, with 27.67% lower mean RMSE than a Teacher+ACT baseline under shared sensor noise.
  • ▸ Notes mixed results from pretrained-weight initialization and a spiral RMSE/max-error tradeoff for the original teacher comparison — an unusually candid acknowledgment that not every design choice was a clean win.
Show abstract

Autonomous excavator control is challenged by coupled kinematics, actuation lag, and uncertainty. We propose imitation learning and adaptive Cartesian tracking (IL-ACT), a novel motion control framework for a 30-ton-class excavator. An anchored, 14-input imitation policy pretrained on operator demonstrations generates nominal joint rates; adaptive Cartesian feedback and gated gain/bias estimation correct these commands before a stopping-distance governor constrains joint-reference generation. Simscape evaluation covers 100 sequential goals and spiral, figure-eight, and rounded-raster tracking, including 88 additional runs across three training seeds, two initializations, and speeds, under hydraulic response and sensing conditions. Compared with Teacher+ACT, IL-ACT completes all goals with shorter duration and lower terminal errors under both response conditions. Telemetry-initialized IL-ACT lowers RMSE in all 24 figure-eight and rounded-raster seed comparisons and lowers additional-load spiral mean RMSE by approximately 29%. Original spiral RMSE also improves over IL-only and PID. Under a shared sensor-noise realization, telemetry-initialized IL-ACT achieves 27.67% lower mean RMSE than Teacher+ACT; enabling estimation reduces mean RMSE by $22.44\%$ relative to the frozen estimator. Pretrained-weight effects remain mixed, and the original teacher comparison exhibits a spiral RMSE--maximum-error tradeoff. Analysis establishes bounded adaptive states and Cartesian feedback, with reference admissibility conditional on governor feasibility.

#17
h=16
LOTUSim-Energy: A Maritime Simulator for Human-Drone Interaction in Autonomous Offshore Operation \& Maintenance
2026-09-15 cs.RO Cédric Buche (h=16)
Juliette Grosset, Marie Dubromel, Hélène Lechêne, Quentin Arzel, Cédric Buche
Core Contributions
  • ▸ Builds a unified maritime simulator spanning air, surface, and subsea domains (UAVs, USVs, AUVs, ROVs) in one distributed architecture with coupled environmental forcing (wind, waves, currents) — most existing simulators handle a single vehicle domain.
  • ▸ Adds energy-aware battery modeling and fault-detection pipelines as first-class modular validation tools, addressing the practical reality that offshore missions are constrained by power budgets, not just navigation accuracy.
  • ▸ Provides both desktop and VR supervision interfaces explicitly for human-drone interaction research, treating human oversight as part of the system rather than an afterthought.
  • ▸ Demonstrated on a realistic multi-domain inspection scenario (monopile/transition-piece structures) evaluating waypoint-following and AIS-referenced tracking under real-time energy monitoring, aimed at de-risking real offshore deployment before it happens.
Show abstract

Offshore maintenance requires operations in the air, the surface, and the subsea domain and include human supervision. This paper presents LOTUSim-Energy, a real-time maritime simulator designed for multi-domain human--drone interaction for offshore operation and maintenance. The plat- form unifies heterogeneous unmanned vehicles (Unmanned Aerial Vehicles: UAVs, Unmanned Surface Vehicles: USVs, Autonomous Underwater Vehicles: AUVs, Remotely Operated Vehicles: ROVs) within a distributed architecture coupling environment forcing (wind, waves, currents) and provides immersive user interfaces for supervision (desktop and virtual reality). A structured offshore task library enables repeatable evaluation of autonomy stacks under realistic metocean disturbances. The simulator supports realistic physics, energy-aware battery modeling, and fault-detection pipelines as modular validation tools. System-level performance is demonstrated on a multi-domain inspection scenario for monopile and transition piece structure, where we evaluate the reliability of integrated waypoint-follower plugin and Automatic Identification System (AIS)-referenced trajectory tracking under real-time energy monitoring. By combining unified environmental physics, heterogeneous vehicle simulation, and immersive supervision, LOTUSim-Energy provides an integration testbed for prototyping and rehearsing offshore human--robot collaboration workflows, as a step toward de-risking sea deployment.

Robot Learning Infrastructure & Emerging Directions

4 papers
#12
h=23
Learning Options for Compositional Motor Control with Adapter Banks
2026-09-15 cs.LG, cs.RO, q-bio.NC M. Mattar (h=23)
Sreejan Kumar, Marcelo Mattar, Lea Duncker
Core Contributions
  • ▸ Translates a neuroscience hypothesis — that motor primitives are low-rank perturbations of a shared recurrent network — into a trainable architecture: a shared recurrent core modulated by a bank of residual adapters selected by a discrete latent code.
  • ▸ Adapters develop emergent low-rank structure without any explicit architectural rank constraint, and different tasks land in distinct subspaces of the shared network — an empirical validation of the neuroscience theory rather than an assumption baked into the model.
  • ▸ A simple high-level policy, trained while the rest of the network stays frozen, sequences these adapters to produce novel out-of-distribution movements not seen during adapter training.
  • ▸ Improves generalization error over a task-input-conditioned multitask baseline by up to an order of magnitude on closed-loop biomechanical control, a substantial jump for compositional generalization.
Show abstract

Learning flexible motor primitives is a hallmark of skilled motor control. Recent neuroscience theory proposes that motor primitives may be implemented as low-rank perturbations of a shared recurrent network, but leaves open how such a system is learned. We translate this principle into a novel architecture for learning motor skills end-to-end: a shared recurrent core modulated by a bank of residual adapters, each selected by a discrete latent code. Trained on closed-loop biomechanical control, the adapters develop emergent low-rank perturbations of the recurrent dynamics despite no architectural rank constraint, placing task representations in disparate subspaces of the shared core network. A simple high-level policy over the learned options, optimized while the whole network is frozen, sequences the low-rank adapters to produce novel out-of-distribution movements. We demonstrate the ability to generalize to novel motor sequences within the closed-loop control setting, improving on the generalization error of a task-input-conditioned multitask baseline by upto order of magnitude.

#25
h=12
Machine Zygote: Causal Biparental Heredity Before Learning in a Germline--Soma Artificial Agent
2026-09-15 cs.NE, cs.RO L. S. Saoud (h=12)
Lyes Saad Saoud
Core Contributions
  • ▸ Poses an unusual, precisely-scoped question for an artificial-life/robotics-adjacent system: can a newborn artificial agent show measurable biparental heredity before any learning occurs, isolated causally rather than just inferred from parent-offspring resemblance?
  • ▸ Runs a preregistered 4×4 diallel breeding design across 640 offspring, finding significant dam and sire dependence for five of six behavioral traits after correction for multiple comparisons — a rigorous quantitative-genetics methodology applied to a simulated germline-soma architecture.
  • ▸ Matched-background intervention experiments (n=60) causally isolate the effect of substituting one parental germline while holding recombination fixed, going beyond correlational evidence.
  • ▸ Notably reports a negative result for its own developmental-dependence hypothesis: a no-dynamics ablation preserves the mean phenotype distribution, meaning recurrent developmental dynamics are not necessary for the heredity effect observed — a rare case in this batch of a paper reporting its own hypothesis wasn't supported.
Show abstract

Artificial ontogeny, developmental encodings, robot reproduction, and inherited controllers are established research directions, yet a narrower question remains: can a newborn artificial agent exhibit measurable biparental heredity before learning, and can that dependence be isolated causally rather than inferred only from parent-offspring resemblance? We introduce Machine Zygote, a computational germline-soma architecture designed to test this question. Two parental germlines are independently mutated and recombined into a zygote that parameterizes development of an initially generic eight-module soma, which is then frozen and evaluated without learning. A preregistered 4 x 4 diallel of 640 offspring shows significant dam and sire dependence for five of six behavioral traits after Holm correction, with parental and interaction components accounting for 36-53 percent of modeled variance across five principal traits. In matched-background interventions (n=60), substituting one parental germline while holding recombination and stochastic background fixed causes phenotype shifts exceeding a same-parent re-mutation control for five of six traits for both parental channels. Recombination also yields excess transgressive offspring for speed and gait frequency. A preregistered developmental-dependence hypothesis is not supported: a quasistatic no-dynamics ablation preserves the mean phenotype distribution while altering parental variance structure. Thus the study supports causal biparental pre-learning heredity in this simulation, but not the stronger claim that recurrent developmental dynamics are necessary. It does not establish physical heredity, biological genetics, or autonomous evolution. The contribution is an intervention-centered framework and reproducible benchmark for separating heredity, development, stochastic variation, and post-birth learning.

#26
h=12
The Robot Data Factory
2026-09-15 cs.RO L. S. Saoud (h=12)
Sami Haddadin, Ivan Laptev, Ian Reid, Dezhen Song, Cesare Stefanini
Core Contributions
  • ▸ Reframes the field's data bottleneck: argues the scientific resource that matters is not raw robot datasets but “robot experience” — perception-action-consequence loops that preserve embodiment, context and outcome, not just observation-action pairs.
  • ▸ Proposes a mission-task-skill-episode-dataset-benchmark-capability hierarchy and a closed Deploy-Measure-Learn-Repeat cycle for continuously generating and validating data, positioning datasets as an ongoing production process rather than a static release.
  • ▸ Derives quantitative scaling laws connecting robot fleet size, sensor rates, storage, tokenization, and training compute to the cluster requirements for Embodied-AI training — an attempt to make data-infrastructure planning as rigorous as compute planning.
  • ▸ Instantiated across three physical training grounds (domestic, environmental, energy applications), directly framing the scale-first counterpoint to this batch's efficiency-first papers like ModAR.
Show abstract

Physical AI requires more than increasingly large robot datasets: intelligent robots acquire knowledge through continuous interaction with the physical world. We argue that the defining scientific resource of Physical AI is therefore not raw robot data alone, but robot experience - physically grounded interaction whose observations, actions, embodiment, context, and outcomes preserve the perception-action-consequence loop. We introduce the Robot Data Factory (RDF), a mission-driven infrastructure and methodology for continuously generating, validating, benchmarking, and reusing such experience. RDF organizes heterogeneous robots and environment-specific training grounds through reproducible missions, skill curricula, synchronized multimodal sensing, external ground truth, an agentic robot network, data pipelines, and living benchmarks. Rather than treating datasets as static end products, RDF implements a closed Deploy-Measure-Learn-Repeat cycle in which validated physical experience supports world models, vision-language-action models, embodied policies, digital twins, and subsequent robot deployment. We further formalize robot experience and its quality, introduce a mission-task-skill-episode-dataset-benchmark-capability hierarchy, and derive quantitative scaling laws and an algorithmic synthesis procedure connecting robot fleet size, sensor rates, storage, learning representations, tokenization, training compute, inference, and latency to Embodied-AI cluster requirements. The framework is instantiated in three complementary physical training grounds for domestic, environmental, and energy applications. RDF thus reframes robot data generation as a continuous scientific production process and provides a pathway toward reproducible, scalable, and eventually federated infrastructure for Physical AI.

#29
h=11
Overcoming technical adoption barriers for mobile service robots in rehabilitation
2026-09-15 cs.RO Christian Sternitzke (h=11)
Christian Sternitzke, Sebastian Blumenthal, Lukas Kleedoerfer, Verena Deserno, Anke Mayfarth
Core Contributions
  • ▸ A rare deployment/adoption-focused paper in this batch: documents how a mobile service robot already approved as a medical device reached higher technology readiness levels through peripheral functions and smaller usability improvements, not new core algorithms.
  • ▸ Argues that many of the improvements pivotal to clinical user acceptance can only be discovered by testing in real clinical/operational settings — they cannot be reliably elicited by asking users beforehand.
  • ▸ Positions this as a structural warning to the field: healthcare service-robot developers should budget significant implementation time for this “downstream development” phase rather than treating a working prototype as near-deployment.
  • ▸ Useful counterweight to the batch's heavy emphasis on algorithmic novelty — a reminder that adoption barriers in real clinical environments are often non-algorithmic.
Show abstract

Many publications on robotic systems in healthcare describe early-stage work on low technology readiness levels. This paper describes how a mobile service robot approved as a medical device reaches higher technology readiness levels by adding peripheral functions and smaller improvements, which are pivotal for user acceptance in clinical environments and which often cannot be elicited by questioning users ex-ante as certain aspects only come in mind from testing the systems in clinical settings or operational environments. Especially developers of service robots in healthcare are advised to plan with such downstream developments, which can take significant implementation time, to obtain user acceptance and achieve widespread adoption of their robotic systems.