πŸ€– Robotics arXiv Digest

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

Research Landscape

The largest cluster today sits inside vision-language-action and world-action modeling, but each paper attacks a different piece of the "make it practical" problem rather than chasing raw benchmark score. EmbodiedVAE and LiLa-WAM both target the representation a world-action model reasons over β€” EmbodiedVAE disentangles the robot arm's motion from the background in its VAE latent for a 2dB PSNR gain, while LiLa-WAM keeps its whole reasoning space compact enough to train end-to-end on a single 24GB GPU. PhyAI and CUDA MPC attack the adjacent systems problem of running these models fast: PhyAI unifies onboard, edge, and cloud inference into one runtime (1.40x-4.65x speedups over official pi0, pi0.5, GR00T N1.7, and MiniCPM-Robot implementations), while CUDA MPC shows a GPU-native MPC solver can beat tensor-framework baselines by up to 965x β€” a reminder that a lot of "the model is too slow" problems are really "the deployment stack is generic" problems. Continue-or-Replan (BCP) and Route2Step instead attack timing and progress-tracking: BCP decides per-chunk whether to keep executing or replan (lifting real-robot success from 74% to 92% on one task), and Route2Step separates semantic progress from local execution in VLN so a wrong-progress error stops masquerading as a wrong-action error (R2R-CE SR 48.1%β†’55.3%). ETA pushes furthest in this direction, explicitly rejecting the end-to-end observation-to-action paradigm for a Planner-Interface-World tool-calling loop with auditable memory β€” a bet that inspectability matters as much as raw capability.

A second thread is injecting structure β€” physics, symbolic knowledge, object graphs, geometry β€” so learned components have less to infer from scratch. Neurosymbolic InK pairs updatable symbolic planning with neural low-level control for sample efficiency; GORDON learns rewards from object-relation graphs instead of raw pixels specifically to avoid brittleness to background and robot-arm motion (+35 points over the best learned baseline on long-horizon tasks); Shooting for Contact embeds a differentiable simulator inside a trajectory-optimization program so retargeted motions are dynamically, not just kinematically, feasible before an RL policy ever imitates them; and GraspMeanFlow bakes SE(3) equivariance into a few-step flow so a 24x-plus speedup in sampling doesn't cost pose consistency. POMDPs for Autonomous Science Exploration makes the same trade in a different domain, branching planning on inferred physical hypotheses rather than raw high-dimensional sensor data to keep belief-space planning tractable while preserving the uncertainty quantification pure information-theoretic planners discard.

The remaining papers cluster around hardware and safety-adjacent concerns that rarely make VLA headlines but decide whether any of this reaches deployment: a Forbidden Region Active Constraint framework for ERCP-style surgery that handles breathing-induced tissue deformation at 43 Hz, a 20g vacuum-jammed haptic device for bilateral teleoperation, an active-stiffness controller for continuum robots, and PLS-Calib solving sensor calibration for ground robots that can't perform the free 6-DoF motion classical calibration assumes. The soft-wearable-robotics review's proposed Perception-Cognition-Actuation-Augmentation framework and the new Stanford robot-autonomy textbook both read as signs of a maturing field taking stock β€” one arguing wearables should be designed perception-first rather than actuator-first, the other packaging classical and learned autonomy into a single teachable curriculum.

Papers by Research Area

VLA & World-Action Models

Making vision-language-action and world-action models more efficient, adaptive, and better-supervised β€” latent representations, inference runtimes, and when to replan.

#9 EmbodiedVAE, #13 PhyAI, #15 LiLa-WAM, #16 Continue or Replan? (BCP), #20 ETA, #24 How Should VLAs Use Proprioceptive State?, #27 Track4Action

Motion Generation & Trajectory Optimization

Turning task goals and kinematic references into dynamically feasible, fast-to-sample motion for locomotion, grasping, calligraphy, and manipulator trajectories.

#8 Shooting for Contact (DSMS), #23 Bridging Online/Offline Handwriting, #29 GraspMeanFlow, #30 Accelerating Human-Aware Trajectory Generation

Robot Learning & Planning under Uncertainty

Injecting symbolic, object-level, or hypothesis-level structure into reward and planning to cut the sample cost of long-horizon and uncertain tasks.

#3 Neurosymbolic Reasoning with Incremental Knowledge (InK), #12 GORDON, #19 POMDPs for Autonomous Science Exploration

Navigation, SLAM & Perception

Scaling navigation, mapping, detection, and calibration to unbounded trajectories, restricted-motion platforms, and resource-constrained hardware.

#4 FORTUNE, #6 Route2Step, #7 Lightweight 3D Object Detection (Mamba KD), #11 PLS-Calib, #17 SLAMFormer-∞

Medical & Surgical Robotics

Safety-critical control and world modeling for endoscopic and minimally invasive surgical robots.

#2 CrossScope, #25 Forbidden Region Dynamic Active Constraints

Control & Hardware Systems

Physical platforms and low-level control β€” soft wearables, haptics, continuum robots, MPC solvers, and aerodynamic test infrastructure.

#5 Human Centric Embodied Intelligence (Soft Wearables), #14 CUDA MPC, #18 Shaping Wind-Tunnel Airflow, #26 Wearable Stiffness-Rendering Haptic Device, #28 Active Stiffness Control of a Continuum Robot

HRI, Applications & Foundations

Human-facing robot design, applied deployment, and field-level stocktaking, from child wellbeing assessment to a new robotics textbook.

#1 Designing Social Robots for Inclusive Child Wellbeing Assessment, #10 Principles of Robot Autonomy, #21 AI-Enabled Cloud-Edge Precision Agriculture, #22 Hybrid Reservoir Computing for Sign Language

Papers Grouped by Category

VLA & World-Action Models (7 papers)

#9
h=13
EmbodiedVAE: Disentangled Video VAE for Efficient and Controllable Embodied Manipulation
2026-08-04 cs.RO Tianyu He (h=13)
Jiayi Luo, Hanxin Zhu, Chen Gao, Jiankun Wang, Cong Wang
Core Contributions
  • Identifies that video VAEs used inside embodied world models are borrowed from natural-scene generation and aren't optimized for manipulation, producing latents that are neither compact nor controllable for fine-grained robot action.
  • Uses a dual-encoder, single-decoder design with asymmetric spatio-temporal compression that automatically disentangles the robot arm's motion from the static background, rather than compressing both into one entangled latent.
  • Adds an optimal-transport-based consistency module specifically to preserve temporal coherence of the motion latent, targeting the flicker/inconsistency failure mode that hurts fine-grained control.
  • Reports an average 2dB PSNR improvement in reconstruction quality over state-of-the-art video VAEs at a higher compression rate, while enabling more precise downstream action control.
Show abstract

Latent diffusion models (LDMs) have recently significantly advanced embodied learning in constructing powerful embodied manipulation world models. However, despite the remarkable performance, existing LDMs predominantly rely on Variational Autoencoders (VAEs) optimized for natural scenes while failing to account for the unique characteristics of embodied manipulation scenarios, yielding latent representations that are neither compact nor controllable, thereby hindering efficient training of LDMs and precise robotic control. To solve this problem, we present EmbodiedVAE, a novel video VAE that provides compact yet controllable latent representations tailored for the robotic manipulation world models. Specifically, EmbodiedVAE adopts a dual-encoder, single-decoder architecture with an asymmetric spatio-temporal compression module, which automatically disentangles the robot arm's motion from background environment, resulting in overall compactness while providing explicit embodied latent to support fine-grained action control. To further preserve the temporal consistency of learned robotic motion latent, we introduce an optimal-transport-based consistency module that explicitly enforces motion fidelity and inter-frame coherence. Extensive experiments demonstrate that our proposed EmbodiedVAE achieves superior reconstruction quality with high compression rate, while enabling more precise action control in robotic manipulation scenarios with an average of 2dB PSNR improvement over state-of-the-art video VAEs.

#13
h=8
PhyAI: Real-Time Physical AI at the Edge, Scalable Rollouts in the Cloud
2026-08-04 cs.AI, cs.RO Rongjie Yi (h=8)
Chenghua Wang, Daliang Xu, Dongqi Cai, Duojin Sun, Hao Zhang
Core Contributions
  • Targets a systems problem, not a modeling one: VLA/world-action-model inference is fragmented across separate programs for evaluation, cloud RL rollout, edge serving, and onboard deployment despite sharing the same checkpoint and action semantics.
  • Unifies these into one runtime with shared graph execution, kernels, memory management, and parallel services, while keeping model-specific conditioning/solver/cache logic isolated in adapters β€” added MiniCPM-Robot support the same day it was released.
  • Achieves 1.40x-4.65x speedups over official implementations of pi0, pi0.5, GR00T N1.7, and MiniCPM-Robot, and cuts Cosmos3-Nano-Policy-DROID latency from 2.46s to 1.18s on eight H20 GPUs (2.08x).
  • Introduces a "control-time Roofline" separating inference-bound from environment-bound control, showing pi0.5 on LIBERO is environment-bound while Cosmos3 stays inference-bound β€” a diagnostic for where optimization actually pays off.
Show abstract

Physical AI policies require inference throughout their lifecycle, including model evaluation, cloud reinforcement learning rollout, edge GPU serving, and onboard deployment. Although these settings share the same checkpoint and action semantics, they often rely on separate inference programs. To unify them, we build PhyAI, a Physical AI inference engine with a single runtime that keeps architecture-specific conditioning, solver, cache, and output logic in model adapters while sharing graph execution, kernels, memory management, and parallel services. The same codebase runs vision-language-action (VLA) models and world-action models (WAMs) on single or multiple GPUs across onboard, edge, and cloud deployments. We used the adapter interface to add MiniCPM-Robot on the day of its release. PhyAI achieves 1.40x-4.65x speedups over the official implementations of pi0, pi0.5, GR00T N1.7, and MiniCPM-Robot. On Cosmos3-Nano-Policy-DROID it reduces latency from 2.46 to 1.18 s on eight H20 GPUs (CFG=2, TP=4), a 2.08x speedup. Specialized runtimes remain faster in several configurations, so our goal is one runtime with competitive latency rather than the fastest result in every case. Detailed profiles reveal why different models need different execution policies: on a Hopper-series GPU at batch size one, the pi0.5 action expert accounts for 8.8% of FLOPs but 57.2% of latency; at batch size 32 its share drops to 13.5% and throughput reaches about 100 samples/s. Cosmos3 remains generation-dominated and gains only 14.3% throughput as batch size increases from 1 to 16. We further introduce the control-time Roofline, which distinguishes inference-bound from environment-bound control; the measured pi0.5 points on four LIBERO suites are environment-bound while Cosmos3 stays inference-bound.

#15
h=7
LiLa-WAM: Lightweight Latent Reasoning World-Action Model for Robotic Manipulation
2026-08-04 cs.RO, cs.AI Fugui Fan (h=7)
Fan Yang, Yuting Su, Xiaobo Wang, Yuncheng You, Fugui Fan
Core Contributions
  • Targets training cost, not just inference cost: existing WAMs either burn capacity on visual detail irrelevant to control (pixel-space) or need multi-stage training to build a reasoning space (some latent-space methods).
  • Builds a compact latent reasoning space jointly shaped by future-state prediction and action generation, keeping the model lightweight while staying aligned with control, trainable end-to-end on a single 24GB GPU.
  • Introduces the Visual Transition Token, a language-free task representation encoding each task as a direction in visual feature space, sidestepping reliance on language conditioning for task specification.
  • Achieves 90.48% success across 50 RoboTwin 2.0 tasks with single-GPU training, plus validated results on LIBERO and real-robot tasks.
Show abstract

World-action modeling has emerged as a promising paradigm for robotic control, as it empowers models to go beyond reacting to observations and anticipate how a scene will evolve. However, existing WAMs often incur substantial computational overhead. Pixel-space methods often allocate substantial capacity to visual details that may not be directly relevant to control, while some latent-space methods require multi-stage training to construct the reasoning space. The resulting training cost can make such methods difficult to train under modest computational budgets. In this work, we propose LiLa-WAM, a lightweight world-action model that reasons about the future in a compact latent space and can be trained end-to-end on a single 24GB GPU. Its core design is a compact latent reasoning space jointly shaped by future-state prediction and action generation, which keeps the model lightweight while remaining well aligned with control. For task specification, we further propose the Visual Transition Token (VTT), a language-free task representation that encodes each task as a direction in visual feature space. Experiments on RoboTwin 2.0, LIBERO, and real-robot tasks demonstrate LiLa-WAM's effectiveness, achieving 90.48% success across 50 RoboTwin tasks with single-GPU training.

#16
h=7
Continue or Replan? Bernoulli-Continuation Policy Learning for Adaptive Horizon Execution
2026-08-04 cs.RO, cs.AI, cs.CV, cs.LG Chengtang Yao (h=7)
Weichen Xu, Zhenhua Liu, Lin Luo, Yaobo Liang, Chengtang Yao
Core Contributions
  • Targets a specific inefficiency in chunk-based VLA execution: replanning happens on a fixed periodic schedule regardless of task progress, so a critical manipulation moment can get executed from a stale action chunk.
  • Reformulates execution-horizon selection as a sequence of continue-or-replan decisions with a prefix-sharing ordinal structure, rather than treating candidate horizons as independent classes β€” and keeps the base VLA frozen, adding only a lightweight continuation head.
  • Trains this head with RL from trajectory-level outcomes using a Replanning-Efficiency Reward that jointly rewards success and efficient VLA usage, specifically to stop the policy from collapsing to trivially short horizons.
  • Improves RoboTwin 2.0 success from 89.88% to 93.94% overall (+11.08% on the 13 hardest tasks), transfers to Ο€0.5 (+1.7% LIBERO, +6.8% LIBERO-PRO), and lifts real-robot success from 74%β†’92% and 44%β†’84% on two tasks, with lower overall runtime than fixed-horizon baselines.
Show abstract

Existing chunk-based Vision-Language-Action (VLA) models execute a fixed number of actions (i.e., execution horizon) before replanning, turning replanning into a task-agnostic periodic schedule that is independent of task progress. As a result, when no replanning boundary falls before a critical manipulation stage, it is executed from a stale chunk rather than a freshly replanned one. To address this limitation, we propose Bernoulli-Continuation Policy (BCP), a lightweight, plug-and-play framework for adaptive horizon execution that keeps the base VLA frozen. Given a fixed-length action chunk, its continuation head decomposes execution-horizon selection into a sequence of continue-or-replan decisions, which imposes an ordinal, prefix-sharing inductive bias over candidate horizons rather than treating them as independent classes. Since the optimal horizon for each chunk is not observable, we train this head with reinforcement learning from trajectory-level outcomes and introduce a Replanning-Efficiency Reward that jointly rewards task success and efficient VLA usage. On RoboTwin 2.0 with LingBot-VLA as the base policy, BCP improves the average success rate by +11.08% on 13 low-success tasks and from 89.88% to 93.94% (+4.06%) across all 50 tasks. It generalizes to the Randomized setting (+4.06%) and transfers to Ο€0.5, achieving a better result on LIBERO (+1.7%) and LIBERO-PRO (+6.8%). On a real robot, BCP lifts success from 74% to 92% and from 44% to 84% on two manipulation tasks, with negligible overhead.

#20
h=6
ETA: A New Agentic Paradigm for Embodied Tasks
2026-08-04 cs.RO Hechang Chen (h=6)
Yitong Chen, Zezheng Huai, Sixian Li, Yubang Wang, Haozhe Zhang
Core Contributions
  • Explicitly departs from the dominant end-to-end observation-to-action paradigm, arguing generalization under that approach is capped by training-data coverage and long-horizon execution stays hard to control or inspect.
  • Structures the agent as a Planner that issues one Tool call at a time, an Interface that executes it, and a World that returns results plus a fresh observation β€” a closed loop that lets the agent verify outcomes and adapt mid-task.
  • Turns both successful and failed interactions into reusable experience, aiming at learning from deployment rather than only from pre-collected demonstrations.
  • Releases OpenETA with replaceable planners, composable tools/skills, auditable memory, and replayable trajectories, and shows it can run as a lightweight plugin exposing just observe/mark_point/move_to for coding agents like Codex.
Show abstract

When will robots have their ChatGPT moment? Such a breakthrough requires a general-purpose robot that can handle unfamiliar tasks in unfamiliar environments, remain controllable over long interactions, and learn from experience. Today's embodied systems largely follow an end-to-end observation-to-action path. Despite rapid progress, they remain far from this goal: their generalization depends heavily on the coverage of robot training data, while long task execution remains difficult to control and inspect. To realize this goal, we introduce the Embodied Task Agent (ETA), a new paradigm for extending digital agents into the physical world, and release OpenETA as its open-source implementation. ETA centers the robot around a Planner that chooses one Tool call at a time, an Interface that controls execution, and a World that returns the result and a fresh observation. This loop allows the agent to verify outcomes, adapt its plan, and turn successful and failed interactions into reusable experience. OpenETA provides replaceable Planners, composable Tools and Skills, auditable memory, replayable trajectories, and common interfaces for simulation and real robots. For Codex, OpenETA can operate as a lightweight plugin that exposes only observe, mark_point, and move_to.

#24
h=5
How Should Vision-Language-Action Models Use Proprioceptive State?
2026-08-04 cs.RO Yandong Guo (h=5)
Yiren Zhao, Ziyang Chen, Ziyang Rao, Pengteng Li, He Zhang
Core Contributions
  • Points out that despite proprioceptive state being nearly universal in VLA models, it's wired in incompatible, largely unexamined ways β€” text-serialized, projected into the VLM prefix, or fed to the action expert β€” usually as a single current frame.
  • Runs matched ablations across five representative interfaces (discrete state prompt, VLM prefix, action prefix, state expert, feature modulation) on one fixed flow-matching VLA backbone, isolating interface choice from confounds like different backbones or training data.
  • Separately tests whether state history helps by sweeping history length from 1 to 96 frames, distinguishing genuine benefit from temporal variation versus benefit that's just added conditioning capacity.
  • Evaluates across 45 atomic tasks (three task families) plus 20 composite tasks, converting the results into testable design principles for where and how state should enter future state-aware VLA architectures.
Show abstract

Recent Vision-Language-Action (VLA) models almost universally take robot proprioceptive state as input, yet wire it in incompatible ways -- serialized into text prompts, projected into the vision-language prefix, or fed directly to the action expert -- and almost always as a single current frame. Three questions remain open: (1) whether, and on which tasks, current state actually improves closed-loop control; (2) how much state history helps, and whether its benefit reflects genuine temporal variation rather than added conditioning capacity; and (3) where state should enter the model -- the vision-language backbone or the action-generation module. We answer these questions through controlled experiments on a flow-matching VLA, fixing the backbone, training data, action representation, and evaluation protocol throughout. We implement five representative interfaces -- discrete state prompt, VLM prefix, action prefix, state expert, and feature modulation -- under matched implementation details, and evaluate them on 45 atomic tasks spanning three task families plus 20 composite tasks; we then sweep the state-history length from 1 to 96 frames to examine how historical state information affects model performance. The experiments yield systematic answers to all three questions, distilled into testable design principles for state-aware VLAs.

#27
h=4
Track4Action: Distilling World-Centric 3D Tracker into Vision-Language-Action Policies
2026-08-04 cs.RO Bokai Lin (h=4)
Chenyi Wang, Xinkai Wang, Bokai Lin, Jialin Tian, Fucheng Zhang
Core Contributions
  • Notes that action labels tell a VLA policy what commands to imitate but not how those commands change the 3D world, and fills that missing supervisory signal from a frozen world-centric 3D tracker rather than adding another labeled dataset.
  • Distills a pooled tracker feature from clip transitions into learnable track queries that align with current VLA hidden states via a shared embedding space, gated feature-wise into a flow-matching action head β€” but drops both the clip and the tracker at deployment, adding no extra runtime cost.
  • Improves zero-shot LIBERO-Plus to 82.3%, +7.6 points over an alignment-free variant and +3.0 over LaMP, isolating the benefit to the tracker-alignment supervision rather than architecture changes.
  • Reaches 80.44%/81.48% on clean/randomized RoboTwin 2.0 splits and 67.5% average across four physical bimanual tasks (+25.0 points over the alignment-free variant), showing the privileged 3D-tracker supervision transfers from simulation to real hardware.
Show abstract

Action labels tell a vision-language-action (VLA) policy which robot commands to imitate, but not how those commands change the 3D world. The aligned demonstration clip contains this missing supervision because its K frame transitions record the geometry, motion, visibility, and camera change produced during the corresponding K actions. We introduce Track4Action, a framework that distills this realized transition from a frozen world-centric 3D tracker into a current-observation VLA policy. During training, Track4World encodes the clip into a pooled tracker feature. Learnable track queries infer this feature from current VLA hidden states, match it in a shared space, and condition a flow-matching action head through a feature-wise gate. The tracker feature only defines the alignment target, so neither the clip nor the tracker is used at deployment. Track4Action reaches 82.3% on zero-shot LIBERO-Plus, improving the alignment-free variant by 7.6 points and LaMP by 3.0 points. It obtains 80.44% and 81.48% on the clean and randomized RoboTwin 2.0 splits, and 67.5% average success across four physical bimanual tasks, 25.0 points above the alignment-free variant. The gains support action-aligned 3D tracker features as privileged supervision for tracker-free VLA deployment.

Motion Generation & Trajectory Optimization (4 papers)

#8
h=14
Shooting for Contact: Contact-Implicit Multiple Shooting for Dynamic Motion Retargeting
2026-08-04 cs.RO, eess.SY Vince Kurtz (h=14)
Sergio A. Esteban, Jason H. K. Siu, Derrick Mach, Junheng Li, Vince Kurtz
Core Contributions
  • Addresses a gap between motion retargeting (kinematic similarity) and what RL policies actually need to imitate (dynamically feasible, contact-consistent trajectories under real actuation limits) β€” most retargeting pipelines optimize the wrong objective for downstream RL.
  • Embeds a differentiable simulator directly inside a nonlinear program (contact-implicit multiple shooting) so contact, friction, impacts, self-collision, and joint limits are resolved internally, without prescribing a contact schedule or hand-designed constraints.
  • Accelerates motion-imitation RL training and produces policies with higher success and lower tracking error compared to existing retargeting methods.
  • Demonstrates zero-shot sim-to-real transfer on the Unitree G1 for genuinely contact-rich, dynamic behaviors β€” command-conditioned crawling and a 180-degree jump-turn β€” not just simple locomotion.
Show abstract

Motion retargeting approaches often prioritize kinematic similarity over whole-body dynamics, contact consistency, and actuation limits, yielding references that are difficult for reinforcement learning (RL) policies to reproduce, particularly for contact-rich behaviors. We present a contact-implicit, direct simulation-based multiple shooting (DSMS) framework that transforms kinematically feasible references into dynamically feasible whole-body trajectories. By embedding a differentiable simulator within a nonlinear program, DSMS resolves contact, friction, impacts, self-collision, and joint limits internally while enforcing tracking, actuation, and task constraints without prescribing a contact schedule or introducing explicit contact constraints. Compared with existing retargeting methods, DSMS accelerates motion-imitation RL training and yields policies with high success rates and low tracking error. We further demonstrate zero-shot sim-to-real transfer on the Unitree G1 through command-conditioned contact-rich crawling and a highly dynamic 180-degree jump-turn.

#23
h=5
Bridging Online and Offline Handwriting via Differentiable Physical Rendering
2026-08-04 cs.CV, cs.RO Hae-Gon Jeon (h=5)
Seonmi Park, Seunghyun Shin, Vihaan Misra, Dongmin Shin, Ukcheol Shin
Core Contributions
  • Unifies two historically separate handwriting paradigms β€” online trajectory estimation and offline image synthesis β€” that each capture only half of what's needed (structure/timing vs. fine texture), rather than picking one.
  • Introduces a compact physical brush model as the missing link between stroke kinematics and pixel-level appearance, paired with a differentiable renderer so the whole pipeline is end-to-end trainable despite the gap between motion and pixel domains.
  • Solves the paired-data problem β€” no dataset has aligned trajectory/image pairs β€” by rendering images from predicted strokes rather than requiring such pairs to already exist, then refining with a zero-shot diffusion-based image refiner.
  • Validates on real-world robotic calligraphy, showing the framework transfers from digital handwriting synthesis to physical brush-stroke execution, achieving both structural and visual fidelity.
Show abstract

Realistic handwritten text generation plays an important role in numerous applications, such as font design, biometric authentication, and robotic calligraphy. Existing methods are typically divided into two independent paradigms: online approaches that estimate handwriting trajectories and offline approaches that synthesize realistic handwriting images. While online models capture structural and temporal dynamics, they often lack fine-grained textures, whereas offline models reproduce realistic appearance but discard stroke order. However, unifying online and offline models remains challenging due to the lack of an explicit physical model linking stroke kinematics to pixel-level appearance and the absence of paired trajectory-image datasets. To address these challenges, we propose a compact physical brush model that bridges stroke dynamics and visual appearance, together with a differentiable rendering module that converts stroke trajectories into stylized images. The proposed framework consists of four core modules: 1) a text-to-stroke generator that predicts the target stroke conditioned on the given text and style image, 2) a brush parameter observer that extracts brush model parameters from style references, 3) a differentiable brush renderer that maps a stroke sequence and physical brush parameters into a handwritten image, and 4) a zero-shot image refiner that refines rendered images via diffusion models. Extensive experiments and real-world robotic calligraphy demonstrations validate our approach, achieving both structural and visual fidelity.

#29
h=4
GraspMeanFlow: SE(3)-Equivariant MeanFlow for Few-Step 6-DoF Grasp Generation
2026-08-04 cs.RO Amirhossein Mollaali (h=4)
Jiyong Kwon, Yikun Bai, Amirhossein Mollaali, Guang Lin
Core Contributions
  • Targets the inference-speed bottleneck of SE(3)-equivariant flow-based grasp generation, which needs tens of iterative integration steps per grasp β€” too slow for real-time manipulation despite good pose-consistency properties.
  • Learns the average velocity over a finite time interval via a time-ordered exponential so it reproduces exactly the rigid-body displacement accumulated across that interval, rather than approximating it through many small integration steps.
  • Proves equivariance is retained under few-step sampling by conditioning the field on a pair of times lifted to equivariant vectors, so the speed gain doesn't cost the pose-consistency guarantee that motivated using equivariant flows in the first place.
  • Reaches with a single function evaluation the EMD that an iterative SE(3) flow model needs five steps to approach, and a second variant of the same framework improves grasp success by up to 24.3 points in the few-step regime on ACRONYM.
Show abstract

Recent data-driven methods for synthesizing 6-DoF grasp poses use generative models to learn complex grasp pose distributions and generate diverse candidate poses. In particular, SE(3)-equivariant flow-based models generate grasp poses that transform consistently with object rotations and translations. However, these methods sample by iterative numerical integration, requiring tens of function evaluations per grasp and limiting their use in real-time manipulation. We propose GraspMeanFlow, an SE(3)-equivariant MeanFlow framework for few-step 6-DoF grasp generation. Our method learns the average velocity over a finite time interval, defined through the time-ordered exponential so that it reproduces exactly the rigid-body displacement accumulated over that interval. We prove that a point-cloud-conditioned distribution transported by an equivariant average-velocity flow map remains invariant, so equivariance is retained under few-step sampling. For stable training, we pair a flow-matching boundary term with either of two consistency terms. Experiments on ACRONYM show that a single function evaluation of GraspMeanFlow reaches the EMD that an iterative SE(3) flow model needs five steps to approach, that a second instantiation of the same framework improves grasp success by up to 24.3 points in the few-step regime, and that both generate grasp distributions transforming exactly with the object.

#30
h=4
Accelerating Human-Aware Robot Trajectory Generation via Diffusion and Consistency Distillation
2026-08-04 cs.RO Byeong-Il Ham (h=4)
Byeong-Il Ham, Hyun-Bin Kim, Kyung-Soo Kim
Core Contributions
  • Targets non-redundant manipulators with a fully specified end-effector pose, where collision and self-collision avoidance can't be handled as simple null-space secondary tasks β€” a structurally harder setting than the redundant-arm case most planners assume.
  • Builds a training set of collision- and self-collision-aware trajectories via RRT/RRT*, then trains a diffusion model to generate constraint-satisfying trajectories through guided sampling, rather than solving the constrained optimization online each time.
  • Applies consistency distillation specifically to cut iterative diffusion sampling cost, plus a joint-weighted jerk regularization term in the loss to penalize abrupt joint-acceleration changes for smoother motion.
  • The distilled consistency model generates 150 trajectory candidates in under 100ms while maintaining a high episode success rate, and substantially reduces joint/end-effector jerk when regularization is applied.
Show abstract

This research proposes a constrained motion planning framework for robot manipulators in human-robot interaction (HRI). For a non-redundant manipulator with a fully specified end-effector pose, additional requirements such as collision avoidance and self-collision avoidance are difficult to handle as simple null-space secondary tasks. This limitation makes it challenging to generate feasible joint-space trajectories in HRI environments where safety and kinematic constraints must be considered simultaneously. To address this limitation, collision- and self-collision-aware trajectories are generated using Rapidly-exploring Random Tree (RRT) and RRT* algorithms, and the resulting dataset is used to train a diffusion model that generates constraint-satisfying trajectories through guided sampling. To reduce the inference time required for iterative diffusion sampling, consistency distillation is applied, and a joint-weighted jerk regularization term is incorporated into the loss function to promote smoother trajectories by penalizing abrupt changes in joint acceleration. Simulation results show that the consistency model generates 150 trajectory candidates in less than 100 ms, maintains a high episode success rate, and substantially reduces joint and end-effector jerk when jerk regularization is applied.

Robot Learning & Planning under Uncertainty (3 papers)

#3
h=28
Neurosymbolic Reasoning with Incremental Knowledge for Sample Efficient Hierarchical Reinforcement Learning
2026-08-04 cs.AI, cs.RO A. Easwaran (h=28)
Subrat Prasad Panda, Blaise Genest, Arvind Easwaran
Core Contributions
  • Targets a specific failure of standard HRL: once knowledge is baked into a fixed architecture, it can't be reasoned over as new facts are discovered during exploration, keeping early sparse-reward exploration inefficient.
  • Splits control into symbolic high-level planning (D*-based) over an updatable knowledge representation, plus low-level neural goal-conditioned modules that learn motion primitives via reward shaping β€” letting symbolic knowledge grow incrementally instead of staying static.
  • Introduces Belief World Tree Search specifically to make symbolic planning optimal given prior, incomplete knowledge of the world, rather than assuming full knowledge is available before planning starts.
  • Demonstrates substantially improved sample efficiency on navigation tasks versus fixed-HRL baselines, with code released for reproducibility.
Show abstract

(Flat) Reinforcement Learning (RL) agents face significant challenges in environments with sparse rewards that require long-horizon reasoning. A compelling approach to improve sample efficiency is to incorporate knowledge into learning and decision-making. In standard Hierarchical RL (HRL), knowledge is encoded in a fixed, non-updatable form, such as architectural choices, and remains unchanged throughout learning. With fixed HRL, reasoning with incremental knowledge learned during exploration is impractical before sufficient environmental knowledge is acquired, leading to poor sample efficiency. In this work, we propose neurosymbolic HRL with Incremental Knowledge (InK): symbolic high-level components perform symbolic planning (e.g. using D*) on an updatable representation of current InK, while low-level goal-conditioned neural modules learn motion primitives through experience using reward shaping. Experiments on navigation tasks demonstrate that incorporating InK substantially improves sample efficiency. Additionally, to perform optimal symbolic planning given prior knowledge about the world, we develop Belief World Tree Search. The code is available at https://github.com/CPS-research-group/ink_bwts.

#12
h=9
GORDON: Graph-based Object-centric Rewards for Decomposition of Long-Horizon Manipulation
2026-08-04 cs.RO Giuseppe Averta (h=9)
Andrea Protopapa, Davide Buoso, Francesca Pistilli, Georgia Chalvatzaki, Giuseppe Averta
Core Contributions
  • Learns dense rewards from action-free video demonstrations via object-centric graphs (detected objects + spatial relations) rather than raw pixels, specifically to avoid the brittleness pixel-based reward learning shows to background and robot-motion variation.
  • Uses activity-aware weighted pooling to emphasize task-relevant objects while masking out robot-dominated motion, addressing a common failure where reward embeddings latch onto arm motion instead of task progress.
  • Automatically discovers subtasks from the temporal profile of the learned reward β€” no manual segmentation β€” then trains subtask-specific rewards and policies composed sequentially, turning one long-horizon problem into learnable pieces.
  • Reaches 74.4% average success across long-horizon tasks on MAGICAL and ManiSkill3, roughly +35 points over the best learned baseline and +25 points over an oracle decomposition, showing the automatic decomposition beats even a hand-specified one.
Show abstract

Learning long-horizon manipulation skills with reinforcement learning remains challenging due to the complexity of reward design, the limited guidance of sparse rewards, and the high cost of manual subtask annotation. Visual demonstrations can provide supervision for reward learning, but rewards learned from raw pixels can be brittle and sensitive to visual variation, background appearance, and robot motion. In this work, we propose GORDON, a graph-based object-centric reward learning framework that learns dense rewards from action-free video demonstrations. Each visual scene is represented as a graph of detected objects and spatial relations, and a graph neural network is trained in a self-supervised manner to embed these graphs into a task-aligned latent space. To align the representation with semantic task progress, we introduce an activity-aware weighted pooling mechanism that emphasizes task-relevant objects while masking robot-dominated motion. The dense reward is then computed as distances in the learned latent space of the current state to demonstrated goal configurations, providing a measure of task progress. In long-horizon tasks, the temporal profile of this reward reveals stage-wise object-state transitions, enabling automatic subtask discovery without manual segmentation. Experiments on seven manipulation tasks on MAGICAL and ManiSkill3 benchmarks show that our object-centric reward improves reinforcement learning in short-horizon settings and enables successful policy learning in complex long-horizon tasks through automatic decomposition, achieving an average success rate of 74.4% across the long-horizon tasks (on average approximately +35 p.p. vs. best learned baseline and approximately +25 p.p. vs. oracle).

#19
h=7
POMDPs for Autonomous Science Exploration
2026-08-04 cs.RO Nathan D. Wallace (h=7)
Daniel Guirguis, Nathan Wallace, Hanna Kurniawati, Salah Sukkarieh
Core Contributions
  • Resolves a tension in science-driven autonomous exploration: information-theoretic planners scale to complex sensor data by assuming deterministic observations, sacrificing the principled uncertainty handling POMDPs provide, while full POMDP planning becomes intractable at high dimensionality.
  • Introduces the Science Hypothesis Map POMDP, which branches on inferred physical properties rather than raw sensor data, preserving full sensor information through learned observation models while keeping belief-space planning tractable.
  • On a 50-dimensional-observation RockSample variant, achieves 18.6% higher reward and 32.9% less computation per step than continuous-observation baselines β€” improving on both axes simultaneously rather than trading one for the other.
  • On real Cuprite hyperspectral geologic data, achieves 2.5x higher information gain than the best information-theoretic baseline and reaches 80% of oracle performance from uniform priors alone, via adaptive belief-based replanning.
Show abstract

Autonomous exploration missions require decision-making under sensor uncertainty and computational constraints, yet integrating scientific representations into POMDP planning has remained intractable due to high-dimensional observation spaces. Information-theoretic planners overcome this by assuming deterministic observations, sacrificing the principled uncertainty quantification that POMDPs provide. We introduce the Science Hypothesis Map POMDP (SHM-POMDP), which makes science-driven belief-space planning more tractable by branching on inferred physical properties rather than raw sensor data. This preserves full sensor information through learned observation models while enabling the planner to reason jointly about navigation and scientific properties under uncertainty. On an extended RockSample domain with 50-dimensional observations, SHM-POMDP achieves 18.6% higher rewards and 32.9% reduced computation time per step than continuous-observation baselines. On realistic geologic exploration using Cuprite hyperspectral data, SHM-POMDP achieves 2.5x higher information gain than the best information-theoretic baseline by maintaining beliefs and replanning adaptively -- reaching 80% of oracle performance using only uniform priors. These results demonstrate that integrating hierarchical probabilistic models into belief-space planning enables tractable, principled autonomous science that outperforms both traditional POMDP methods and science-aware information-theoretic approaches.

Navigation, SLAM & Perception (5 papers)

#4
h=22
Flying over The Uncertain Nature (FORTUNE): Intelligent and Humanistic 3D Path Planning for Low-Altitude Collaboration
2026-08-04 cs.RO, cs.DC Minghui Liwang (h=22)
Minghui Liwang, Wenhan Jia, Xinlei Yi, Wenbo Zhu, Yuhan Su
Core Contributions
  • Moves multi-UAV path planning away from the common assumption of static, fully-known points of interest, instead modeling persistent, temporally predictable, and emergent demand types within one unified formulation.
  • Explicitly prices in societal costs (noise exposure, public safety risk) as altitude-dependent terms in the planning objective, rather than treating sensing coverage as the only optimization target.
  • Splits computation into an offline stage (Transformer-based prediction of PoI activation windows plus an enhanced sparrow search algorithm for coordinated flight plans) and a lightweight online refinement stage that absorbs newly emergent demands without breaking global mission coherence.
  • Validated on real-world traffic data plus synthetic scenarios, outperforming state-of-the-art baselines on effectiveness, scalability, and practical applicability.
Show abstract

The proliferation of low-altitude intelligent agents is increasing the demand for timely and socially responsible collaborative sensing in dynamic urban environments. However, jointly addressing heterogeneous spatiotemporal demands, environmental uncertainty, and human-centered operational constraints remains challenging. This paper studies 3D multi-UAV path planning and task assignment under uncertain ground PoI demands. Unlike existing work assuming static and fully known PoIs, we model persistent, temporally predictable, and emergent demands within a unified framework. We further incorporate altitude-dependent societal and environmental costs, including noise exposure and public safety risks, to balance sensing performance with socially compliant operations. To solve the resulting large-scale mixed-integer nonlinear problem, we propose FORTUNE, a hierarchical offline-online framework. Offline, a Transformer predicts Type-II PoI activation windows, while an enhanced sparrow search algorithm generates coordinated flight plans through priority-aware decoding and danger-aware evolution. Online, a lightweight refinement module accommodates emerging Type-III PoIs while preserving global mission coherence. Experiments on real-world traffic data and synthetic scenarios show that FORTUNE consistently outperforms state-of-the-art methods in effectiveness, scalability, and practical applicability.

#6
h=19
From Routes to Steps: Separating Semantic Progress from Local Execution in Vision-and-Language Navigation
2026-08-04 cs.CV, cs.RO Jiarong Lin (h=19)
Xiangyun Huang, Xiangchen Wang, Runfeng Lin, Yihao Xu, Kangyu Huang
Core Contributions
  • Diagnoses an ambiguity in standard VLN training: when an agent deviates from the intended route, a single corrective-action label can't tell whether it misjudged progress or judged progress correctly but executed poorly β€” so it keeps deciding from a wrong progress state.
  • Splits the model into an Instruction Analysis Module that predicts semantic progress and an Action Generation Module that generates local action chunks conditioned on that state, making the two failure modes separately supervisable instead of conflated under one next-action loss.
  • Introduces E-SPA, a step-alignment procedure that manufactures state supervision by matching sub-instructions to portions of route-level demonstrations, avoiding manual temporal labels while still disambiguating progress errors from execution errors.
  • Improves R2R-CE success rate from 48.1% to 55.3% and SPL from 43.3% to 48.2%, using only 11.5K directly action-supervised states alongside 190K state-level corrective samples, with gains confirmed in real-world indoor/outdoor tests.
Show abstract

Vision-and-Language Navigation (VLN) requires an agent to follow a route-level instruction by executing its constituent steps from egocentric visual observations. Existing VLM-based navigators typically supervise both capabilities through next-action prediction alone, making progress-tracking errors difficult to distinguish from execution errors. When an agent deviates from the route, a corrective action label may recover the next movement but does not indicate whether the agent selected the wrong sub-instruction or failed to execute the correct one. Consequently, the agent may continue making decisions from an erroneous progress state. To resolve this ambiguity, we propose Route2Step, a framework that decouples semantic progress tracking from action generation through an explicit step-level interface. The Instruction Analysis Module predicts this state from the global instruction and visual history. Conditioned on the predicted state and recent observations, the Action Generation Module generates local action chunks. To supervise the progress state without manual temporal labels, E-SPA, a step-alignment procedure, associates sub-instructions with their corresponding portions of route-level demonstrations. On R2R-CE, Route2Step improves SR from 48.1% to 55.3% and SPL from 43.3% to 48.2%, using 190K state-level corrective samples while requiring only 11.5K directly action-supervised states. Experiments in real-world indoor and outdoor environments further demonstrate the practical applicability of Route2Step.

#7
h=14
Lightweight 3D Object Detection via Mamba-Based Knowledge Distillation
2026-08-04 cs.RO, cs.CV H. Pham (h=14)
Quoc Cuong Ninh, Huy Xuan Pham, Anh Tung Nguyen, Dinh Hoan Trinh
Core Contributions
  • Targets the accuracy/compute tradeoff in LiDAR detection specifically for embedded deployment, rather than pushing peak accuracy on unconstrained hardware.
  • Uses a multi-branch Mamba (linear-time state-space) teacher backbone instead of a standard transformer teacher, exploiting Mamba's linear-time sequence modeling to keep the distillation source itself efficient.
  • Introduces box-aware, voxel-space feature transfer with a Mamba-based projection module that aligns spatially corresponding voxel features between teacher and student, rather than distilling on final outputs alone.
  • Shows the distilled lightweight student cuts computational load substantially while staying competitive with state-of-the-art detectors on both public and real-world data.
Show abstract

3D object detection using light detection and ranging (LiDAR) sensors requires a balance between accuracy and computational efficiency for onboard perception in autonomous driving and robotic navigation. Many existing LiDAR-based detection methods employ complex architectures to extract features, integrating large amounts of contextual information to enhance accuracy. This often results in significant computational costs, leading to suboptimal performance on resource-constrained embedded devices. In this study, we propose a knowledge distillation framework that transfers object-level voxel representations from a strong teacher model to lightweight student models through selective voxel-space feature alignment. Taking advantage of the linear-time sequence model with selective state spaces (Mamba), we design a multi-branch Mamba teacher backbone and a box-aware feature transfer mechanism that aligns spatially corresponding voxel features between teacher and student networks through a Mamba-based projection module. Experimental results on both a public dataset and real-world data show that our approach significantly reduces computational load while maintaining competitive accuracy compared with state-of-the-art methods.

#11
h=11
PLS-Calib: A Partial Least Squares Framework for Event Camera and Odometry Calibration under Ground Motion Constraints
2026-08-04 cs.RO, cs.CV Changshuo Wang (h=11)
Guangyu Li, Xiao Li, Yujie Wu, Changshuo Wang, Prayag Tiwari
Core Contributions
  • Solves calibration for ground robots specifically, where the standard requirement of exciting all 6-DoF motion for extrinsic calibration is infeasible β€” a constraint most calibration literature sidesteps by assuming free 3D motion.
  • Replaces the CCA-based approach used for restricted-motion calibration, which suffers from ill-conditioned covariance matrices, with Partial Least Squares regression to model latent kinematic correlations between asynchronous, heterogeneous sensor streams, yielding a closed-form solution that avoids the singularities CCA hits.
  • Introduces a polarity-aware event representation to sharpen circular calibration-target detection specifically for event cameras, rather than reusing frame-camera detection heuristics.
  • Validated on both synthetic and real-world data, showing measurable robustness and accuracy gains over state-of-the-art ground-constrained calibration methods.
Show abstract

Accurate extrinsic rotation calibration between sensors is fundamental to the performance of robotic perception systems. However, most existing calibration techniques rely on full 6-DoF motion to excite all degrees of freedom, which is often infeasible for ground-constrained robots with limited motion capabilities. Recent approaches designed for such restricted settings, such as Canonical Correlation Analysis (CCA)-based methods, suffer from ill-conditioned covariance matrices that lead to numerical instability and suboptimal calibration accuracy. To overcome these limitations, we present a novel rotation calibration framework named PLS-Calib that, for the first time, leverages Partial Least Squares (PLS) regression to model the latent kinematic correlations between asynchronous, heterogeneous sensor streams. Specifically, we apply our method to the calibration of an event camera and an odometry onboard a ground robot. To improve event-based pattern detection, we introduce a polarity-aware event representation, which enhances spatiotemporal contrast in circular calibration targets. Our PLS-based formulation yields a closed-form, stable solution that avoids matrix singularities inherent in CCA-based approaches. Extensive experiments on both synthetic and real-world datasets validate the effectiveness of our approach, demonstrating significant improvements in calibration robustness and accuracy over state-of-the-art methods.

#17
h=7
SLAMFormer-∞: Infinite SLAM Transformer for Unbounded Frontend and Backend Processing
2026-08-04 cs.CV, cs.RO Yijun Yuan (h=7)
Zhijian Fang, Weicheng Zheng, Yijun Yuan, Weibang Wang, Zhuoguang Chen
Core Contributions
  • Removes the first-frame-anchored coordinate assumption that bounds most geometric SLAM transformers, instead using memory conditions to define flexible, scalable coordinate systems for input frames β€” enabling genuinely unbounded frontend and backend processing.
  • Keeps frontend computation local and efficient while letting the backend jointly optimize long-range trajectory and scene geometry for global consistency, rather than trading one off for the other.
  • Demonstrates generalization to trajectories exceeding 17km, a scale well beyond what bounded-formulation SLAM transformers typically handle.
  • Reports superior or highly competitive trajectory estimation and reconstruction across large-scale datasets versus existing methods.
Show abstract

We introduce the Infinite SLAM Transformer (SLAMFormer-∞), the first geometric transformer capable of supporting both long-range frontend and backend processing without an explicit distance bound. Instead of relying on a first-frame-anchored formulation, SLAMFormer-∞ employs memory conditions to define flexible coordinate systems and scales for input frames, enabling more expressive structural conditioning. Built upon this formulation, the frontend preserves efficient local computation, while the backend jointly optimizes long-range trajectories and scene geometry in a globally consistent manner. Experimental results demonstrate that SLAMFormer-∞ achieves superior or highly competitive performance in both trajectory estimation and scene reconstruction across large-scale datasets. Notably, SLAMFormer-∞ generalizes to extremely long trajectories, successfully operating on sequences exceeding 17km.

Medical & Surgical Robotics (2 papers)

#2
h=31
CrossScope: A Role-Asymmetric World Model for Joint Dual-Scope Surgical Video Prediction
2026-08-04 cs.CV, cs.RO T. Haidegger (h=31)
Wanhao Liu, Jinsong Lin, Rulin Zhou, Chi Kit Ng, Wenbin Pan
Core Contributions
  • Breaks from standard multi-view fusion, which assumes symmetric information exchange between cameras, by formulating role-asymmetric prediction for Mother-Child ERCP endoscopy, where the two scopes aren't calibrated into a stereo pair and play structurally different roles.
  • Routes cross-view evidence selectively rather than merging both streams uniformly: geometric motion from the Mother scope conditions Child-view prediction, while Child-view appearance only feeds back to the Mother view when a valid pose correspondence exists.
  • Preserves view-specific expert representations while still sharing information, avoiding the case where naive fusion would blur each scope's distinct visual statistics.
  • Establishes a new paired dual-scope benchmark (phantom + real ERCP), since no existing dataset captures this two-endoscope setup, and shows consistent gains over strong surgical video generation baselines across fidelity, structure, localization, and motion metrics.
Show abstract

Visual world models typically learn future dynamics from a single observation stream, limiting their ability to model cooperative systems with multiple independently moving observers. We investigate this challenge in Mother-Child endoscopic retrograde cholangiopancreatography (ERCP), where two flexible scopes provide complementary yet role-dependent views without a calibrated stereo relationship. Unlike conventional multi-view fusion that assumes symmetric information exchange, we formulate role-asymmetric dual-scope future prediction, where cross-view evidence is selectively transferred according to the prediction target and its underlying spatial requirements. We propose CrossScope, a dual-stream surgical world model that preserves view-specific experts while enabling target-specific evidence routing through geometry-guided residual interactions. CrossScope learns two complementary communication directions: geometric motion cues from the Mother view guide Child-view future dynamics, while pose-aligned Child appearance supports Mother-view prediction only when valid spatial correspondence is established. To evaluate this problem, we establish a paired dual-scope benchmark comprising synchronized phantom and real-world ERCP episodes, with evaluations assessing visual fidelity, structural preservation, target localization, and motion consistency. Experiments demonstrate that CrossScope consistently outperforms strong surgical video generation baselines, validating the importance of role-aware evidence routing for multi-observer visual world modeling.

#25
h=5
Forbidden Region Dynamic Active Constraints in Robot-Assisted Minimally Invasive Surgery
2026-08-04 cs.RO F. R. Y. Baena (h=5)
Zejian Cui, Ferdinando Rodriguez y Baena
Core Contributions
  • Targets a specific unsolved gap in clinical translation of Forbidden Region Active Constraints: prior formulations struggle to accommodate dynamic tissue deformation (e.g., from breathing) while staying energetically passive and fast enough for real teleoperation.
  • Uses a depth-sensing camera to update a fine mesh representation of the forbidden region in real time (122,806 polygons in the case study) while maintaining energy dissipation for passivity, running at 43.48 Hz.
  • Validates with in-vitro trajectory-tracking experiments performed by a "virtual" surgeon specifically to quantitatively test whether the safety distance is maintained across all trials, not just qualitatively demonstrated.
  • Shows the fine-mesh approach is more robust and time-efficient than prior FRAC methods using simple geometric active-constraint representations, without sacrificing comparable or lower computational cost.
Show abstract

In robot-assisted surgery, Forbidden Region Active Constraints (FRAC) represent a control strategy that helps maintain task safety by generating anisotropic haptic guidance to surgeons. However, several challenges need to be overcome before FRAC can benefit teleoperative surgery in a clinical setting. These challenges include the ability to allow for dynamic tissue deformation, maintain energetic passivity, and speed of implementation, among others. In this study, we propose the pipeline design for an energy dissipative FRAC strategy, which accommodates the dynamic tissue deformation caused by respiratory movements, by utilizing a depth sensing camera. The proposed FRAC strategy adopts a fine mesh representation, with a total number of 122,806 polygons in the case study presented, while running at 43.48Hz. We designed in vitro trajectory tracking experiments conducted by a "virtual" surgeon to aid quantitative assessment of the method, including its effectiveness in maintaining task safety, which was confirmed by successfully maintaining a pre-defined safety distance across all trials. We also conducted comparative studies to investigate the robustness and time-efficiency of our method against other FRAC methods that rely on simple geometry AC representations. We demonstrate that our method provides a more robust and effective guidance overall, while maintaining comparable, if not lower, time costs.

Control & Hardware Systems (5 papers)

#5
h=19
Human Centric Embodied Intelligence for Soft Wearable Robotics
2026-08-04 cs.RO R. C. Yeow (h=19)
Rainier Natividad, Raye Chen-Hua Yeow
Core Contributions
  • Reframes the central bottleneck in soft wearable robotics: not softer materials or stronger actuators, but integrating sensing, cognition, and the wearer's own physiological/behavioral adaptation into one coupled system users will actually keep wearing.
  • Proposes the Perception-Cognition-Actuation-Augmentation (PCAA) framework, explicitly inverting the field's default actuator-first design order to put perception and cognition first.
  • Synthesizes across a wide span of concerns rarely combined in one review β€” materials, sensing, AI, actuation, HRI, digital twins, clinical translation, manufacturing, and regulation/ethics β€” arguing these are interdependent rather than separable engineering problems.
  • Positions long-term personalization and real-world deployment, not lab demos, as the field's next milestone, aiming to guide future interdisciplinary research rather than report new experimental results.
Show abstract

Soft wearable robots have evolved rapidly from proof-of-concept devices into promising platforms for rehabilitation, occupational assistance, and human augmentation. As the field matures, its central challenge extends beyond the development of softer materials and more capable actuators to the integration of sensing, intelligence, and human adaptation into systems that users can wear comfortably, trust, and benefit from over extended periods. This transition motivates the concept of Human-Centric Embodied Intelligence (HCEI), in which intelligence emerges from the coupled human-robot system through the interaction of morphology, multimodal sensing, adaptive cognition, compliant actuation, and the wearer's own physiological and behavioral adaptation. To organize this perspective, this review introduces the Perception-Cognition-Actuation-Augmentation (PCAA) framework, which positions perception and cognition as the primary drivers of design, shifting development beyond the conventional actuator-first paradigm. Using this framework, the review synthesizes advances in soft materials, wearable sensing, artificial intelligence, actuation, human-robot interaction, digital twins, clinical translation, manufacturing, regulation, and ethics, highlighting how these interdependent components collectively shape long-term personalization and real-world deployment.

#14
h=8
CUDA MPC: A GPU-Native Solver for Model Predictive Control
2026-08-04 cs.RO, cs.DC, eess.SY Melissa Greeff (h=8)
Babak Akbari, Melissa Greeff
Core Contributions
  • Rejects the common pattern of using the GPU merely as a linear-algebra accelerator for MPC; instead co-designs the ADMM algorithm, execution model, and memory layout specifically for CUDA, keeping intermediate variables in on-chip shared memory instead of round-tripping through global memory.
  • Uses a localized atomic-flag protocol that synchronizes only adjacent horizon blocks, minimizing host intervention and kernel-dispatch overhead that dominate typical GPU MPC implementations.
  • Sustains real-time solve rates at horizons one to two orders of magnitude longer than CPU solvers, solving a 100-second-lookahead collision-avoidance parking problem within a 0.1s sampling interval.
  • Is the only evaluated solver that achieves real-time, collision-free coordination for a centralized 10-agent swarm β€” acados and CasADi return no feasible solution there and need 3.5s/4.5s per solve elsewhere β€” and is up to 965x faster than tensor-framework implementations of the same ADMM splitting.
Show abstract

Model Predictive Control (MPC) delivers constraint-aware control, but its reliance on online optimization limits its use on systems with fast dynamics, high-dimensional models, or long horizons. Existing GPU implementations typically treat the device as a linear-algebra accelerator, leaving the optimization loop dependent on repeated kernel launches and high-latency memory transfers. This paper introduces CUDA MPC, a GPU-native MPC framework that co-designs the optimization algorithm, execution model, and memory architecture for CUDA hardware. CUDA MPC pairs a parallel-in-horizon alternating direction method of multipliers (ADMM) splitting with a fused CUDA kernel that runs the entire iterative solve on the device. Intermediate optimization variables stay in low-latency, on-chip shared memory, and a localized atomic-flag protocol synchronizes only adjacent horizon blocks, minimizing host intervention, kernel-dispatch overhead, and global-memory traffic. Across six nonlinear robotics benchmarks spanning increasing state dimension and constraint density, CUDA MPC sustains real-time rates at horizons one to two orders of magnitude longer than CPU solvers: it solves an optimization-based collision-avoidance parking problem with 100 s of lookahead within a 0.1 s sampling interval, and is the only solver evaluated that achieves both real-time execution and collision-free coordination for a centralized 10-agent swarm, where acados and CasADi return no feasible solution and require 3.5 s and 4.5 s per solve. Against tensor-framework implementations of the same ADMM splitting, the fused kernel is up to 965x faster.

#18
h=7
Shaping Wind-Tunnel Airflow for Unmanned Aerial Vehicles using Online Learning
2026-08-04 cs.RO, cs.AI, eess.SY Michael Muehlebach (h=7)
Ghadeer Elmkaiel, Michael Muehlebach
Core Contributions
  • Solves a test-infrastructure problem rather than a robot-control problem: generating precise, tailored airflow profiles in a multi-fan vertical wind tunnel for aerial-robot testing, where model-based control alone is insufficient for such complex airflow fields.
  • Combines a simplified physical model with iterative, measurement-based online learning for sample-efficient convergence, rather than relying purely on data-driven learning or a full physics simulation.
  • Shows versatility across uniform, Gaussian, and parabolic airflow profiles with the same method, and generates a profile custom-designed for passive soaring that measurably improves a soaring robot's flight performance.
  • Demonstrates robustness to a varying number of active fans, indicating the approach adapts to actuator changes without re-tuning from scratch.
Show abstract

The development and testing of advanced aerial robots require experiments in controlled environments with tailored airflow profiles. This paper presents an online learning algorithm for controlling the complex airflow field in a multi-fan vertical wind tunnel. Our method combines a simplified physical model with iterative, measurement-based learning, enabling sample-efficient convergence to desired airflow distributions. We demonstrate the method's versatility by generating complex airflow, such as uniform, Gaussian, and parabolic profiles. Crucially, we show that our algorithm can produce an airflow profile specifically designed for passive soaring, greatly enhancing flight performance of a soaring robot. Variability, practical utility, and robustness of our approach are further highlighted by successful operation with a varying number of fans.

#26
h=5
A Wearable Stiffness-Rendering Haptic Device with a Honeycomb Jamming Mechanism for Bilateral Teleoperation
2026-08-04 cs.RO Thomas M. Kwok (h=5)
Thomas M. Kwok, Bohan Zhang, Wai Tuck Chow
Core Contributions
  • Targets kinesthetic (stiffness) feedback specifically, a harder feedback modality to render than simple vibration, in a device light enough (20g) to be genuinely wearable rather than benchtop.
  • Uses a honeycomb jamming mechanism actuated by vacuum pressure (up to 30 kPa) to vary stiffness from 1.15 to 2.64 N/mm β€” an inherently fail-safe actuation choice, since vacuum failure can't create dangerous forces, unlike some pneumatic or motor-driven haptic designs.
  • Closes the loop with real-time gripper feedback in a bilateral teleoperation framework so operators adjust grip force based on rendered object stiffness rather than visual cues alone.
  • Reports small RMSE and strong correlation in teleoperated motion, stiffness rendering, and force feedback across a three-point flexural characterization test and grasping-task trials.
Show abstract

This paper addresses the challenge of providing kinesthetic feedback in bilateral teleoperation by designing a wearable, lightweight (20 g), and compact haptic device, the HJ-Haptic, utilizing a honeycomb jamming mechanism for object stiffness rendering. The HJ-Haptic device can vary its stiffness, from 1.15 N/mm to 2.64 N/mm, using a 30 kPa vacuum pressure. We demonstrate its implementation in a teleoperation framework, enabling operators to adjust grip force based on a reliable haptic feedback on object stiffness. A three-point flexural test on the honeycomb jamming mechanism and teleoperated object-grasping tasks were conducted to evaluate the device's functionality. Our experiments demonstrated a small RMSE and strong correlations in teleoperated motion, stiffness rendering, and interaction force feedback. The HJ-Haptic effectively adjusts its stiffness in response to real-time gripper feedback, mimicking the sensation of direct object grasping with hands. The device's use of vacuum pressure ensures operator safety by preventing dangerous outcomes in case of gas leakage or material failure.

#28
h=4
Active Stiffness Control of a Supportive Continuum Robot
2026-08-04 cs.RO, eess.SY Farrokh Janabi-Sharifi (h=4)
Rana Danesh, Farrokh Janabi-Sharifi, Farhad Aghili
Core Contributions
  • Addresses a specific limitation of supportive continuum robots: their passive stiffness is fixed by mechanical configuration and can't adapt online to changing payloads or interaction forces, despite the mechanical coupling that gives them load-bearing capability in the first place.
  • Projects the closed-chain dynamics from an existing geometric variable-strain model onto a constraint-consistent motion subspace, so stiffness control and task-space regulation can coexist despite the kinematic constraints from the closed-chain structure.
  • Uses a projected sliding-mode controller for the operative-arm tip with Lyapunov-established closed-loop stability, then layers a virtual Cartesian spring based on position-error feedback for active apparent stiffness β€” one control architecture handling both tracking and stiffness rather than two separate ones.
  • Shows in simulation and experiment that raising commanded stiffness gain reduces load-induced tip deflection and increases directional stiffness, giving a tunable robustness knob under external loading.
Show abstract

Supportive continuum robots (SCRs) enhance the load-bearing capability of an operative continuum robot by mechanically coupling it with a supportive arm. However, their passive stiffness is determined by the mechanical configuration and cannot be adjusted online for varying payloads or interaction forces. Active stiffness control is therefore needed to regulate the load response and maintain positioning accuracy. Meanwhile, the closed-chain structure introduces kinematic constraints that complicate task-space regulation and stiffness control. This paper presents an active task-space stiffness control framework for a tendon-driven SCR. An existing geometric variable strain model describes the closed-chain dynamics, which are projected onto the constraint-consistent motion subspace. A projected sliding mode controller regulates the operative arm tip while preserving the constraints, and closed-loop stability is established through Lyapunov analysis. After position regulation, active apparent stiffness is introduced through a virtual Cartesian spring based on position-error feedback to shape the force-displacement response. The framework is evaluated in simulation and experimentally validated under prescribed external loads and different desired configurations. Results show that increasing the commanded stiffness gain reduces load-induced tip deflection and increases apparent directional stiffness, thereby improving load resistance and positioning robustness under external loading.

HRI, Applications & Foundations (4 papers)

#1
h=45
Designing Social Robots for Inclusive Child Wellbeing Assessment: Insights from Communities Supporting Developmental Language Disorder and Forced Migration
2026-08-04 cs.RO Gustaf GredebΓ€ck (h=45)
Fethiye Irmak Dogan, Yue Lou, Alva Markelius, Emma Geijer-Simpson, Gustaf GredebΓ€ck
Core Contributions
  • Frames wellbeing assessment as a communication-accessibility problem rather than a robotics-capability problem, targeting two populations β€” children with Developmental Language Disorder and forced-migration backgrounds β€” whose needs are usually treated as edge cases rather than a design starting point.
  • Uses design probes plus focus groups with parents and professionals, not children directly, to surface considerations before deployment, avoiding the common HRI pattern of iterating directly on children in sensitive assessment contexts.
  • Identifies population-specific tensions generic child-robot interaction guidelines miss, such as how much a robot should prompt versus wait, and how to preserve a child's agency to decline or redirect a wellbeing probe.
  • Converts findings into concrete ethical and inclusive design recommendations rather than only a taxonomy of themes, positioning the work as guidance for practitioners building future assessment robots.
Show abstract

Assessing children's wellbeing and mental health can be particularly challenging for children experiencing communication barriers, such as children with Developmental Language Disorder (DLD) and children with forced migration backgrounds. During the assessment process, traditional self-report questionnaires place substantial demands on language comprehension and verbal expression. In this context, social robots have emerged as a promising tool for supporting wellbeing assessment without solely relying on self-report questionnaires, yet limited research has examined how such interactions can be designed to be inclusive, appropriate, and ethically acceptable for children with diverse communication needs. To address this gap, we created candidate child-robot interaction activities as design probes and conducted focus groups with parents and professionals supporting children with DLD and children with forced migration backgrounds. Through thematic analysis, we identified considerations relating to robot role and capabilities, interactional dynamics, individual differences, and child agency, alongside population-specific considerations shaped by children's communication needs and lived experiences. Based on these findings, we derive a set of ethical and inclusive design recommendations for robot-mediated wellbeing assessment.

#10
h=12
Principles of Robot Autonomy
2026-08-04 cs.RO, cs.AI, cs.CV, eess.SY Gioele Zardini (h=12)
Daniele Gammelli, Joseph Lorenzetti, Katie Luo, Gioele Zardini, Marco Pavone
Core Contributions
  • A textbook, not a research contribution β€” built from Stanford course material to unify classical robotics and modern "physical AI" methods within a single conceptual framework rather than treating them as separate tracks.
  • Pairs every major topic with hands-on Jupyter notebooks and implementation-driven exercises, explicitly targeting deployment-aware intuition alongside theory.
  • Positioned as a resource for practitioners as much as students, reflecting the authors' framing that autonomy has matured into field-tested tools rather than remaining a purely academic pursuit.
  • Signals where the field's pedagogy is heading: bridging classical model-based autonomy stacks with learned/physical-AI components in one curriculum.
Show abstract

Autonomous robots are moving rapidly from research labs into everyday life - on roads, in the air, in warehouses, and in space. Robot autonomy is no longer solely an academic pursuit, but a collection of mature, field-tested methods and tools that practitioners rely on in real-world deployments. This book offers a clear, unified introduction to the methods that make this possible. Built on decades of teaching at Stanford, the text develops the core elements of modern autonomy stacks within a single conceptual framework, bridging classical robotics and modern physical AI. Every major topic is paired with hands-on Jupyter notebooks and implementation-driven exercises, so readers build practical intuition alongside theoretical understanding. The result is a principled, accessible, and deployment-aware foundation for anyone seeking to design, analyze, or contribute to the next generation of autonomous systems. This is a comprehensive resource for students, engineers, and researchers entering one of today's fastest-growing fields.

#21
h=6
Design and Evaluation of an AI-Enabled Cloud-Edge Architecture for Connected Precision Agriculture Farms
2026-08-04 cs.RO Narsimlu Kemsaram (h=6)
Deckshitha Angadi, Koteshwar Goud Surga, Nagaraju Lakkaraju, Naveena Budda, Vikas Agarwal
Core Contributions
  • Targets the scaling limit of manual crop disease monitoring directly, building a cloud-edge architecture rather than a single-model detector, since manual inspection stops being viable past small farm scale.
  • Integrates IoT sensors, UAV imagery, deep learning, and Azure IoT Hub cloud analytics behind mobile, web, and embedded edge-device interfaces, deploying the same trained model across all three rather than one platform in isolation.
  • Trains a TensorFlow model on public datasets (PlantVillage, Kaggle) targeting three specific tomato diseases β€” early blight, late blight, leaf mold β€” and reports 92-95% detection effectiveness consistently across diverse environments and device platforms.
  • Positions the system as enabling earlier intervention at scale, aiming at sustainable precision agriculture rather than incremental accuracy gains on a fixed benchmark.
Show abstract

Plant diseases cause significant yield losses worldwide, with tomato crops particularly susceptible to early blight, late blight, and leaf mold. Manual monitoring is practical only for small-scale farms and becomes unmanageable at larger scales. To tackle this limitation, an artificial intelligence (AI) enabled cloud-edge architecture is proposed for autonomous crop monitoring. This proposed architecture integrates Internet of Things (IoT) sensors, unmanned aerial vehicles (UAVs), deep learning, Azure IoT Hub-based cloud analytics, and multi-platform (mobile app, web app, and embedded edge device platform) interfaces to enable real-time detection of tomato diseases. For training and validation, we used publicly available datasets, such as PlantVillage and Kaggle. A TensorFlow model trained on a collected dataset is deployed across mobile, web, and edge-device platforms. Experimental results show detection effectiveness around 92-95%, with consistent performance over diverse environments and device platforms. The proposed system improves disease detection effectiveness, lowers dependence on manual inspection, and enables prompt interventions, thereby supporting sustainable, connected precision agriculture farms.

#22
h=5
A Low-Cost Hybrid Reservoir Computing Model for Isolated Sign Language Video Recognition
2026-08-04 cs.RO, cs.AI, cs.CV A. R. Syulistyo (h=5)
Nitin Kumar Singh, Arie Rachmad Syulistyo, Yuichiro Tanaka, Hakaru Tamukoh
Core Contributions
  • Targets edge deployability specifically: deep-learning SLR is accurate but too costly for edge devices, so this work substitutes a reservoir-computing approach whose main advantage is training cost, not raw accuracy ceiling.
  • Combines deep reservoir computing (DRC) and bidirectional reservoir computing (BRC) into a hybrid architecture over MediaPipe-extracted body/hand keypoints, rather than a single RC variant, to capture both temporal depth and bidirectional context.
  • Uses simple ridge regression to map the final reservoir state to class labels, keeping the trainable component minimal compared to deep classifier heads.
  • Reports 61.12%/86.05%/92.56% Top-1/5/10 accuracy on WLASL100 with training time cut to a few seconds versus DL baselines like Bi-GRU β€” a large efficiency gain traded against being competitive rather than state-of-the-art on accuracy.
Show abstract

Sign language recognition (SLR) enhances communication between hearing and hearing-impaired individuals. Although deep learning (DL) has achieved promising performance in SLR, its high computational cost limits deployment on edge devices. To address this challenge, we propose a lightweight reservoir computing (RC)-based approach for SLR. In the proposed method, MediaPipe extracts body and hand keypoints to capture the spatial and temporal dynamics of gestures. These keypoints are then processed by a hybrid reservoir computing (HRC) architecture that combines deep reservoir computing (DRC) and bidirectional reservoir computing (BRC), transforming the input into a high-dimensional dynamic representation. A ridge regression model maps the final HRC state to class labels. This HRC-based SLR method achieved Top-1, Top-5, and Top-10 accuracies of 61.12%, 86.05%, and 92.56%, respectively, on the Word-Level American Sign Language 100 (WLASL100) video dataset, demonstrating competitive performance compared to deep learning-based approaches. Additionally, due to the lightweight nature of RC, the training time was drastically reduced to only a few seconds compared with DL-based methods such as Bi-GRU. This method offers low computational cost, showing its potential for deployment on edge devices.