🤖 Robotics arXiv Digest

2026-07-30 · cs.RO
Generated by Claude
28
Papers
6
Research Areas

Research Landscape

Today's batch is dominated by two intertwined threads: latent world models attacking increasingly specific structural blind spots, and a maturing view of VLA policies as necessary-but-insufficient components that need scaffolding rather than more scale. On the world-model side, four papers each target a different failure mode in the same lineage. ODEWorld reformulates prediction as continuous-time ODE integration in latent space to fix both the discrete-time bottleneck and the representation collapse long reported in latent world models, buying arbitrary temporal resolution and even backward prediction. TacWAM attacks a different gap in the same family — visual-only prediction gives no signal for force, deformation, or slip — adding a mechanics-aware tactile branch that supervises training without leaking into the action head, lifting contact-rich success by 37.5 points over the strongest baseline. QQWorld goes a level deeper still, diagnosing that LeWorldModel's existing Epps-Pulley regularizer loses its corrective gradient exactly on isolated tail samples — the rare states that matter most for planning — and replacing it with quantile-quantile matching. One Future, Every Robot extends the idea to a swarm setting with CS-JEPA, asking whether every robot in a fleet can predict the same shared future state from purely local, bandwidth-limited observations. Read together, these four papers make the same argument from different angles: a world model's value lives entirely in what its latent space is forced to represent, and each is chasing a specific blind spot — time, modality, tails, decentralization — rather than simply scaling up.

A second, related cluster treats pretrained VLA policies as necessary but insufficient, wrapping them with correction, transfer, or orchestration machinery instead of retraining end-to-end. Cross-Embodiment Transfer (BARX) shows that end-effector traces and other behavior-aligned representations, layered onto existing VLA training, boost sim-to-real cross-embodiment transfer by 28% — evidence that raw pixel-to-action mappings under-use structure that's cheap to compute. RedFlow and RoboBRIDGE attack the deployment gap from opposite directions: RedFlow mines a VLA's own failure rollouts for action-level corrective supervision (56.7% to 74.7% real-world success, at roughly a tenth of the data cost of on-policy RL), while RoboBRIDGE wraps a frozen VLA in a five-module orchestration layer — Monitor, Perceptor, Planner, Controller, Robot Interface — that catches failures before they cascade rather than trying to eliminate them from the policy itself. World Action Planner goes further still, using a VLM to search over imagined world-model rollouts at inference time rather than trusting a single forward pass. A related current runs through the contact-rich manipulation cluster — FA-RDP's frequency-adaptive diffusion sampling, FasTac's FPGA-accelerated tactile sensing, and SemAnCorr's training-free correspondence transfer — where the fix is again architectural or procedural rather than a bigger model. The throughline across both clusters: the field is increasingly converging on the idea that better robot autonomy means better scaffolding around a policy, not just a bigger policy.

A third theme, more diffuse but recurring across six papers, is safety and recoverability once systems leave the benchmark. PAC-MAN couples control-barrier functions with RL for a humanoid that has to dodge balls using only onboard, imperfect perception, and finds that barrier granularity (joint- vs. link-level) matters far more under realistic sensing than under privileged state. HALO addresses an adjacent but distinct problem for agentic systems: how to admit part of a heterogeneous LLM-agent response — some actions still safe, others gone stale — without either discarding everything or dispatching something unsafe, validated on cold-start PX4/Gazebo flight sessions. LabEvolver and the UAV-triage systems-engineering paper both push toward safer human-robot teaming in high-stakes settings — wet-lab safety-gate intercepts down 60%, and VLM-mediated UAV coordination that measurably reduces operator workload in a seven-participant study. Arm2Air's cross-embodiment skeleton transfer (robot arm to UAV relay placement) and the goal-oriented SemCom demo are smaller in scope but point the same direction: as much effort is going into making deployed systems robust, efficient, and safe as into raw task performance — a sign the field is shifting from benchmark chasing toward deployment engineering.

Papers by Research Area

VLA & Policy Learning Frameworks

Making pretrained VLA policies more transferable, self-correcting, and orchestrable rather than treating them as monolithic end-to-end predictors.

  • #1. Cross-Embodiment Transfer via Behavior-Aligned Repre…
  • #7. RedFlow: Redirect Failure into Action-Level Correcti…
  • #18. RoboBRIDGE: A Modular Framework for Bridging Policie…
  • #24. World Action Planner: Generalizable Decision-Making…

World Models & Predictive Architectures

Predicting the future in a compact latent space — across continuous time, tactile modality, regularized geometry, and decentralized swarms.

  • #2. ODEWorld: A Continuous Predictive Architecture via P…
  • #23. TacWAM: Anchor-Guided World Action Model with Mechan…
  • #26. One Future, Every Robot: Label-Efficient Collective-…
  • #28. QQWorld: Quantile-Quantile Matching for World Model…

Contact-Rich & Dexterous Manipulation

Handling contact, deformation, and hand-object geometry where timing, force, and fine correspondence dominate over coarse pose.

  • #8. Static In, Dynamic Out: Counterfactual Action Augmen…
  • #9. FA-RDP: A Frequency-Adaptive Reactive Diffusion Poli…
  • #10. FasTac: A Curved Multispectral Vision-Based Tactile…
  • #12. SemAnCorr: Semantic Anchored Correspondence for Zero…
  • #13. DexDirect: Direct Kinesthetic Arm Guidance for Effic…
  • #16. UniCross: Unified Cross-Skill Dexterous Manipulation…

Navigation & Perception

Localizing, mapping, and reasoning about traversability from legs, radar, flow fields, and rest-state geometry.

  • #3. Learning Social Robot Navigation By Sensing Human Le…
  • #5. Write-Safe Flow Field Mapping under Ambiguous Onboar…
  • #6. X-NavDP: Generalizing Navigation Diffusion Policy to…
  • #14. RaDiVe: Robust 4D Radar Odometry with Distance-Bound…
  • #25. TEA-AgriVLN: Traversability Estimation Alarm for Agr…
  • #27. Articulated Object Reconstruction from Rest-State Ob…

Embedded & Hardware-Aware Systems

Fitting perception and self-monitoring onto power- and compute-constrained embodied hardware.

  • #4. Filling the Pareto-Optimal Front for Affordance Segm…
  • #22. Machines that know they are aging: a framework for h…

Safety, Autonomy & Field Deployment

Keeping agentic and physical autonomy safe, recoverable, and coordinated once it leaves the simulator.

  • #11. When Robots Exchange Meaning: A Demo of Goal-Oriente…
  • #15. PAC-MAN: Perception-Aware CBF-RL for Whole-Body Safe…
  • #17. LabEvolver: Training-Free Experience Evolution for S…
  • #19. HALO: Heterogeneous Admission through Localized Obli…
  • #20. Arm2Air: Cross-Embodiment Skeleton Transfer for 3D R…
  • #21. A Systems Engineering Framework for Vision-Language-…

Papers Grouped by Category

VLA & Policy Learning Frameworks (4 papers)

#1
h=69
Cross-Embodiment Transfer via Behavior-Aligned Representations
2026-07-30 cs.RO, cs.AI, cs.CV, cs.LG Top author: Dorsa Sadigh (h=69)
Ajay Sridhar, Jensen Gao, Jonathan Yang, Jean Mercat, Suneel Belkhale
Core Contributions
  • Tests a specific hypothesis directly: representations invariant across embodiments but predictive of actions (bounding boxes, language motions, end-effector traces) can unify cross-embodiment data for transfer, rather than assuming scale alone fixes transfer.
  • Builds a dedicated simulation benchmark to isolate transfer quality from confounds of task/embodiment mix, enabling apples-to-apples comparison of representation choices.
  • Finds end-effector traces are the standout representation, and that representations pay off more as the prior dataset grows larger — a scaling interaction not previously isolated.
  • Shows these representations can extract value from action-free data, an important lever for extending beyond costly action-labeled demonstrations.
  • Improves sim-to-real cross-embodiment transfer, lifting task completion progress of real-robot policies pre-trained on simulation data by 28%.
Show abstract

Recent progress in large-scale imitation learning for robot manipulation has been driven by leveraging datasets across a wide range of robot embodiments. However, achieving significant cross-embodiment transfer is often still challenging. In this work, we study the role of using behavior-aligned representations (e.g., object bounding boxes, language motions, end-effector traces of robot motion) in vision-language-action (VLA) models to promote cross-embodiment transfer. We hypothesize that by possessing invariances across embodiments while being predictive of robot actions, these representations can help unify large-scale cross-embodiment data to enhance transfer. To assess our hypothesis, we develop a simulation-based benchmark designed to assess transfer with diverse cross-embodiment data to new embodiments. Using this benchmark, we compare different representations and ways of incorporating them. We identify that end-effector traces can be particularly beneficial for transfer, representations are generally more useful with larger prior datasets, and can be used to benefit from action-free data. We also demonstrate that they can enhance sim-to-real cross-embodiment transfer, improving task completion progress of real robot policies pre-trained on simulation data by 28%. We provide videos of our evaluations at our website: https://ajaysridhar.com/barx/.

#7
h=19
RedFlow: Redirect Failure into Action-Level Corrections for Flow-matching VLA Policy
2026-07-30 cs.RO, cs.AI Top author: Zicong Hong (h=19)
Zhengyang Yan, Junhao Li, Fangqi Zhu, Zijun Wang, Quanxin Shou
Core Contributions
  • Targets a specific inefficiency in offline RL for flow-matching VLA policies: existing methods either discard failure rollouts entirely or use them only at the coarse trajectory level, wasting the most informative signal.
  • Introduces Context-Aware Corrective Matching to identify exactly which actions caused a failure and retrieve successful alternatives from similar contexts as fine-grained corrective targets.
  • Pairs this with an Adaptive Redirection Objective that simultaneously reinforces good actions, suppresses bad ones, and redirects recoverable failures — converting both successes and failures into dense action-level supervision.
  • Improves real-world manipulation success from 56.7% to 74.7% and matches strong on-policy methods (PPO, GRPO, DDPO) while needing roughly an order of magnitude fewer training samples.
  • Demonstrates that failure data, properly decomposed to the action level, is a highly sample-efficient supervision source for correcting deployed VLA policies.
Show abstract

Flow-matching Vision-Language-Action (VLA) policies have shown strong potential for robotic manipulation but often suffer from compounding errors caused by distribution shifts during deployment. While offline reinforcement learning (RL) provides a practical way to improve deployed policies using rollout data, existing methods either ignore failure data or exploit it only at the trajectory level, resulting in low learning efficiency and persistent errors. We propose RedFlow, a fine-grained offline RL framework that redirects failure experiences into action-level corrective supervision for flow-matching VLA policies. RedFlow consists of two key components: (1) a Context-Aware Corrective Matching mechanism that identifies failure-inducing actions and retrieves successful alternatives from similar contexts as corrective targets, and (2) an Adaptive Redirection Objective that jointly reinforces successful actions, suppresses undesirable ones, and redirects recoverable failures toward corrective targets. Experiments on the LIBERO benchmark and three real-world manipulation tasks show that RedFlow consistently outperforms state-of-the-art offline RL baselines, improving the real-world success rate from 56.7% to 74.7%. It also matches strong on-policy methods (PPO, GRPO, and DDPO) while requiring roughly an order of magnitude fewer training samples.

#18
h=6
RoboBRIDGE: A Modular Framework for Bridging Policies to Robust Real-World Robotic Agents
2026-07-30 cs.RO, cs.AI Top author: Minjong Yoo (h=6)
Sihyung Yoon, Minjong Yoo, Sanghyun Ahn, Seojeong Choi, Honguk Woo
Core Contributions
  • Identifies specific deployment gaps left open by pretrained VLA models used as robotic agents: no failure recovery mechanism, inconsistent long-horizon execution, and limited robustness to shifts in observations, tasks, or embodiments.
  • Proposes a general orchestration layer (Monitor, Perceptor, Planner, Controller, Robot Interface) that composes robust agents from off-the-shelf components including pretrained VLAs, instead of retraining or building environment-specific modules for each gap.
  • The Monitor pairs rapid failure detection with hierarchical recovery to catch errors before they cascade, while the Planner triggers replanning and the Perceptor updates scene understanding asynchronously to avoid execution stalls.
  • Within the Controller, primitive skill fine-tuning factors manipulation into domain-invariant primitives with dedicated LoRA adapters, reducing sensitivity to domain shift specifically when a VLA backbone is used.
  • Consistently outperforms both standalone policies and prior augmented VLA deployments across LIBERO, RoboCasa, and real-world case studies spanning multiple robots and VLA backbones.
Show abstract

Vision-Language-Action (VLA) models have attracted growing interest as a scalable approach to robotic manipulation. While these models are effective action predictors, deploying them as robotic agents exposes critical gaps: no mechanism for failure recovery, inconsistent execution over long horizons, and limited robustness to shifts in observations, tasks, or embodiments. We present RoboBRIDGE, a modular framework that provides an orchestration layer over five coordinated modules, namely Monitor, Perceptor, Planner, Controller, and Robot Interface, to compose robust robotic agents from off-the-shelf components, including pretrained VLAs. The Monitor pairs rapid failure detection with hierarchical recovery to correct errors before they cascade. When the environment diverges from the current plan, the Planner triggers replanning while the Perceptor updates scene understanding asynchronously, avoiding execution stalls. Within the Controller, primitive skill fine-tuning factors manipulation into domain-invariant primitives with dedicated LoRA adapters, reducing sensitivity to domain shifts when a VLA is used. Across LIBERO, RoboCasa, and real-world case studies spanning multiple robot platforms and VLA backbones, RoboBRIDGE consistently outperforms both standalone policies and prior augmented VLA deployments.

#24
h=3
World Action Planner: Generalizable Decision-Making with Action-Conditioned World Models
2026-07-30 cs.AI, cs.RO Top author: Xiangcheng Zhang (h=3)
Xiangcheng Zhang, Yilun Du
Core Contributions
  • Targets the generalization failure of imitation-learning policies trained for specific environments by combining VLM reasoning with a physically grounded, multi-task pose-image conditioned world model rather than relying on either alone.
  • Lets the agent propose an initial action plan and then iteratively refine it through optimization and search over imagined world-model rollouts, effectively doing test-time planning instead of committing to a single forward policy pass.
  • Outperforms state-of-the-art end-to-end policy models, including both VLA and other WAM-based approaches, on compositional tasks, new layouts, and zero-shot generalization scenarios.
  • Demonstrates that pairing a reasoning model's high-level plan search with a grounded world model's low-level rollout simulation can outperform scaling either component alone.
Show abstract

Building generalizable agents for diverse applications remains a fundamental challenge. While imitation learning-based policies succeed in specific training environments, they often fail to generalize to novel scenes and tasks. In this work, we propose World Action Planner, a robot planning system that leverages the reasoning capabilities of Vision-Language Models (VLMs) and the physical grounding of a multi-task pose-image conditioned world model. Our system enables an agent to propose initial action plans and iteratively refine them via optimization and search, reasoning over imagined world model rollouts. We demonstrate that our approach achieves superior performance across compositional tasks, new layouts, and zero-shot generalization scenarios, significantly outperforming state-of-the-art end-to-end policy models such as VLAs and WAMs.

World Models & Predictive Architectures (4 papers)

#2
h=55
ODEWorld: A Continuous Predictive Architecture via Physical-Time Flow
2026-07-30 cs.LG, cs.CV, cs.RO Top author: K. Sreenath (h=55)
Dongxiu Liu, Haoyi Niu, Peng Cheng, Yuan Gao, Xirui Kang
Core Contributions
  • Reframes world-model prediction as continuous-time ODE integration (PT-Flow) in a latent velocity field, rather than the standard discrete frame-stepping most world models use.
  • Directly targets the representation collapse failure mode documented in prior latent world-model work by enforcing ODE structure jointly on the representation space and the velocity field.
  • Continuous-time formulation enables arbitrary temporal resolution and even backward prediction — capabilities discrete-time models structurally cannot offer.
  • Demonstrates high-quality image reconstruction even after long-horizon prediction, evidence the collapse problem is substantially mitigated rather than just delayed.
  • Positions the resulting latent trajectories as directly useful for downstream policy learning, validated on both video generation and robotic control, not just visual fidelity.
Show abstract

In the physical world we inhabit, space and time are fundamentally continuous. However, existing machine learning paradigms for world modeling are largely confined to discrete-time prediction, thereby exhibiting significant inefficiency in capturing the dynamics of physical world. We introduce Physical-Time Flow (PT-Flow), a novel approach that learns a continuous latent velocity field operating in physical time. Crucially, the underlying dynamics of sequential data are parameterized by an ordinary differential equation (ODE) embedded in a well-structured representation space. Under this paradigm, the prediction of future can be recast as temporal integration via an ODE solver in the compressed latent space. Building upon PT-Flow, we construct ODEWorld, a continuous-time latent world model that is both efficient and versatile. By extracting time-variant features and enforcing ODE properties on both the dynamical representation space and the latent velocity field, ODEWorld effectively addresses the long-standing representation collapse issue in latent world model literature. This also enables high-quality image reconstruction even after long-horizon prediction. Moreover, its continuous nature allows for arbitrary temporal resolution and even backward prediction, which is impossible for most discrete-time models. Lastly, ODEWorld can provide rich planning-oriented information to facilitate downstream policy learning. Comprehensive experiments demonstrate that ODEWorld successfully reconciles planning-conducive dynamics abstraction with visual realism, excelling in both video generation and robotic control.

#23
h=5
TacWAM: Anchor-Guided World Action Model with Mechanics-Aware Tactile Prediction
2026-07-30 cs.RO Top author: Wei Wu (h=5)
Lei Jin, Yiding Ma, Xin Zhang, Chen Gao, Wei Wu
Core Contributions
  • Notes that World Action Models predicting only visual futures give limited supervision for force, deformation, shear, and slip — exactly the signals contact-rich manipulation depends on.
  • Sets two explicit design constraints for adding tactile prediction: tactile futures must carry genuine physical information, and they must not become a privileged shortcut the action head can exploit instead of learning from vision and history.
  • A Spatially Aligned Fusion Tactile Encoder maps tactile appearance, dense force fields, and deformation flow into a shared latent space with bilateral force/torque reconstruction, while Anchor-Guided Tri-Modal Attention keeps future tactile prediction tokens separate from the tokens the action branch actually reads.
  • Achieves 75.0% average success across four real-world contact-rich tasks (fragile grasping, sustained surface contact, dynamic in-hand manipulation), exceeding the strongest baseline by 37.5 percentage points.
  • Staged ablations show performance consistently degrades when tactile history is removed or future-prediction access is relaxed, isolating that both pieces are doing real work, not just adding parameters.
Show abstract

World Action Models (WAMs) combine future-state prediction with robot action generation, but existing approaches largely rely on visual futures. Visual prediction captures scene structure and object motion, yet provides limited supervision for force, deformation, shear, and slip during contact-rich manipulation. We present TacWAM, a mechanics-aware tactile WAM that addresses this challenge in three steps. First, a Spatially Aligned Fusion (SAF) Tactile Encoder maps tactile appearance, dense force fields, and deformation flow into a shared latent prediction space, with bilateral force and torque reconstruction preserving global contact information. Second, a tactile history encoder provides temporal context so future tactile prediction reflects how force and deformation change beyond the current tactile observation. Third, Anchor-Guided Tri-Modal (AGT) Attention separates current visual and tactile anchors, future prediction tokens, and action tokens, allowing future tactile states to supervise training without being directly read by the action branch. We evaluate TacWAM on four real-world contact-rich manipulation tasks. TacWAM achieves an average success rate of 75.0%, exceeding the strongest evaluated baseline by 37.5 percentage points.

#26
h=2
One Future, Every Robot: Label-Efficient Collective-State Prediction with Decentralized JEPA
2026-07-30 cs.RO Top author: Sergey Muravyov (h=2)
Alan-Barsag Gazzaev, Alexey Garvilov, Sergey Muravyov
Core Contributions
  • Poses a genuinely different question from single-robot world models: can every robot in a swarm predict the same shared future collective state using only local observations and bandwidth-limited messages, with no global pooling or target encoder?
  • Introduces CS-JEPA, a recurrent joint-embedding predictive architecture where each robot outputs one common future token field using only a 16-frame local history and one 64-float recurrent message per directed edge at deployment.
  • Evaluates frozen pretrained representations with ridge probes fit on as few as 6 labeled episodes, directly testing label efficiency rather than assuming abundant labeled swarm data.
  • A prospectively registered five-seed follow-up shows CS-JEPA improving prediction-error and inter-robot-agreement label-budget AUC across in-distribution, ring, mutual-kNN, and unseen-size topologies up to 108 robots, with every seed favoring CS-JEPA.
  • A separate sealed eight-seed follow-up shows CS-JEPA reduces branch-value MSE by 45.5% and improves candidate-score correlation by 0.1291, with gains holding at an unseen swarm size — evidence the representation transfers to planning-relevant value estimation.
Show abstract

Can every robot in a swarm predict the same future collective state from only local observations and bandwidth-limited messages? We formulate this as decentralized shared-state prediction and introduce Collective-State JEPA (CS-JEPA), a recurrent joint-embedding predictive architecture whose output at every robot represents one common future token field. At deployment, each robot uses a 16-frame local history and one 64-float recurrent message per directed edge; there is no global pooling, target encoder, episode clock, or recorded future action. After pretraining without downstream collective labels, frozen representations are evaluated with ridge probes fitted on 6, 12, or 24 globally labeled episodes. Against raw-future reconstruction with the same receiver anchor and deployment capacity but 9,607 additional training-only parameters, a prospectively registered five-seed follow-up improves prediction-error and inter-robot-agreement label-budget AUC on in-distribution, ring, mutual-kNN, and unseen-size families up to 108 robots. Every effect favors CS-JEPA in 5/5 outer seeds. In a separate sealed eight-seed follow-up, matched action-conditioned predictors receive each candidate four-step plan before producing receiver-local predictive representations. CS-JEPA reduces branch-value MSE by 45.5% and improves within-context candidate-score Pearson correlation by 0.1291, with both effects favorable in 8/8 seeds, including at unseen N=32.

#28
h=0
QQWorld: Quantile-Quantile Matching for World Model Regularization
2026-07-30 cs.LG, cs.AI, cs.CV, cs.MM, cs.RO Top author: Zhoushun Yu (h=0)
Zhoushun Yu, Xiaoyu Hu, Xiangyu Xu
Core Contributions
  • Diagnoses a specific failure in LeWorldModel's existing Epps-Pulley regularizer: its corrective gradients rapidly vanish for isolated tail samples, leaving heavy-tailed latent deviations essentially uncorrected despite the objective appearing to regularize the whole distribution.
  • Replaces the EP objective with quantile-quantile matching that directly aligns projected latent samples with rank-matched Gaussian quantiles, keeping corrective gradients active specifically in the tails where EP fails.
  • Introduces cross-batch QQ, enlarging the effective ranking pool with detached samples from previous batches, and explicitly characterizes the resulting bias-variance tradeoff rather than treating it as a free lunch.
  • Improves average planning success rate across four control environments over the LeWM baseline, while also producing measurably better Gaussian alignment and thinner latent tails.
  • Shows the distributional fix translates into a downstream planning benefit, not just a prettier latent histogram — connecting representation-quality diagnostics directly to task performance.
Show abstract

Latent world models enable efficient planning by predicting future states in a compact representation space, but their performance depends critically on the quality of the learned latent distribution. LeWorldModel (LeWM) regularizes its latents toward an isotropic Gaussian using the Epps-Pulley (EP) objective. We show that the corrective gradients of EP rapidly vanish for isolated tail samples, leaving heavy-tailed deviations insufficiently controlled. To address this limitation, we propose QQWorld, which replaces EP with a quantile-quantile matching objective that directly aligns projected latent samples with rank-matched Gaussian quantiles, thereby maintaining effective corrective gradients in the tails. We further develop cross-batch QQ, which enlarges the effective ranking pool using detached samples from previous batches, and characterize its bias-variance trade-off. Across four control environments, QQWorld effectively improves the average planning success rate of LeWM, while consistently yielding better Gaussian alignment and thinner latent tails.

Contact-Rich & Dexterous Manipulation (6 papers)

#8
h=13
Static In, Dynamic Out: Counterfactual Action Augmentation for Moving Object Manipulation
2026-07-30 cs.RO Top author: Shreyas Kousik (h=13)
Woo Chul Shin, Zhenyang Chen, Alfred Cueva, Nadun Ranawaka Arachchige, Yingyan Celine Lin
Core Contributions
  • Addresses a real deployment gap: visuomotor policies trained only on static-object demos break when parts drift on conveyors or objects sway, a scenario most manipulation benchmarks don't test.
  • Factorizes moving-object manipulation into predicting where the object will be and reaching that predicted pose, rather than trying to learn dynamic behavior end-to-end from demonstrations that don't contain it.
  • Uses counterfactual action augmentation — displacing the object to a hypothesized future position and morphing the demonstrated action chunk to preserve hand-object relative pose — turning a static-only dataset into training signal for dynamic goals.
  • Requires no new dynamic demonstrations, only an object-pose predictor supplied at deployment time, making it a lightweight add-on to existing static-object policies.
  • Improves moving-object success across three simulated tasks under five motion patterns and two real-world tasks, without sacrificing performance on the original static-object case.
Show abstract

Visuomotor policies have advanced on manipulation tasks where the target object stays static during execution, but real deployments break this assumption: parts drift on conveyors and fruits sway in the wind. We introduce Static In, Dynamic Out (SIDO), a counterfactual action augmentation that enables a policy trained only on static object demonstrations to adapt to unseen object motion at test time. Our key idea is to factorize moving object manipulation into two sub-problems: predicting where the object will be, and reaching that predicted pose. SIDO displaces the object to a counterfactual future position and morphs the demonstrated action chunk to preserve the hand-object relative pose, yielding a goal-conditioned policy. At deployment an object pose predictor supplies the future position. Across three simulated tasks (Mug, Square, Stack) under five object motion patterns and two real-world tasks (Gantry, Peachtree), SIDO improves moving object success over the baselines while preserving static object performance.

#9
h=11
FA-RDP: A Frequency-Adaptive Reactive Diffusion Policy for Contact-Rich Manipulation
2026-07-30 cs.RO Top author: Jun Lv (h=11)
Lifeng Zhuo, Wendi Chen, Han Xue, Shirun Tang, Jun Lv
Core Contributions
  • Identifies a structural tradeoff in diffusion policies for contact-rich manipulation: low-frequency multi-step sampling preserves pre-contact action multimodality but reacts too slowly to force feedback, while high-frequency sampling reacts fast but collapses distinct pre-contact modes.
  • Resolves this with a shared multi-frequency visual-force Transformer plus a learned multimodality indicator that dynamically switches between multi-step low-frequency sampling before contact and one-step high-frequency sampling once contact narrows the solution space.
  • Introduces Manifold Consistency Distillation to reparameterize the diffusion network onto the robot's action manifold while retaining DDPM-based residual supervision, rather than treating frequency and manifold constraints as separate problems.
  • Achieves the highest success rate among tested methods on three contact-rich tasks while being the only one shown to preserve diverse pre-contact trajectory modes.
  • Suggests adaptive inference frequency, not just better force sensing, is a missing piece for reactive contact-rich diffusion policies.
Show abstract

In contact-rich manipulation, action multimodality and reactivity dominate different stages of a single episode. Before contact, multiple trajectories might be equally valid, making it important to preserve diverse action modes. After contact, geometric constraints and force limits narrow the solution space, while successful execution demands rapid responses to force feedback. However, standard diffusion policies use a fixed inference frequency and sampling steps throughout the episode, forcing a fundamental compromise. To resolve this tradeoff, we present FA-RDP, a frequency-adaptive reactive diffusion policy. A shared multi-frequency visual-force Transformer predicts action chunks at both low and high frequencies, while a learned multimodality indicator dynamically selects multi-step low-frequency sampling before contact and one-step high-frequency sampling as action ambiguity decreases. We further introduce Manifold Consistency Distillation (MCD), which reparameterizes the diffusion network to predict actions on the robot action manifold while retaining DDPM-based residual supervision. Experiments on three contact-rich manipulation tasks show that FA-RDP achieves the highest success rate while preserving diverse pre-contact trajectory modes.

#10
h=11
FasTac: A Curved Multispectral Vision-Based Tactile Sensor for High-Speed High-Precision 3D Shape and Force Perception
2026-07-30 cs.RO Top author: Zhouping Yin (h=11)
Xiaofan Lu, Kaiji Huang, Jiahui Chen, Yuankai Lin, Hua Yang
Core Contributions
  • Targets a combination current curved vision-based tactile sensors haven't achieved together: accurate 3D reconstruction, three-axis force estimation, and high-speed processing in a compact curved form factor.
  • Uses single-image-sensor multispectral photometric stereo for spatially aligned surface-normal estimation, avoiding the misalignment that multi-camera tactile designs introduce.
  • HyperForce applies position-aware dynamic convolution to explicitly model the spatially nonuniform mechanical response of curved elastomers, rather than assuming uniform elastomer behavior as flat-sensor force models typically do.
  • Deploys the full image-to-force pipeline on an FPGA, cutting processing latency from 3.26ms on GPU to 1.09ms — enabling genuinely high-speed contact sensing rather than offline analysis.
  • NIR illumination plus boundary-prior depth reconstruction cuts depth MAE from 0.273mm to 0.0415mm, roughly a 6.6x improvement, with force NMAE around 2.4–2.7%.
Show abstract

Curved tactile fingertips for dexterous manipulation must resolve fine contact geometry, distinguish normal and tangential loads, and capture transient signals. Existing curved vision-based tactile sensors struggle to combine accurate 3D reconstruction, three-axis force estimation, and high-speed processing in a compact form. This article presents FasTac, a curved vision-based tactile sensor integrating multispectral photometric stereo, dynamic-convolution force estimation, and hardware acceleration on a field-programmable gate array (FPGA). Single-image-sensor simultaneous multispectral imaging provides spatially aligned observations for robust surface normal estimation, followed by boundary-prior fast Poisson depth reconstruction. HyperForce uses position-aware dynamic convolution to model the spatially nonuniform mechanical response of curved elastomers and estimate three-axis forces. The complete image-to-normal-force pipeline is deployed on an FPGA. Experiments show that near-infrared (NIR) illumination and the boundary prior decrease depth mean absolute error (MAE) from 0.2730 mm to 0.0415 mm; HyperForce achieves normalized mean absolute error (NMAE) values of 2.74% and 2.39% for normal and shear forces, respectively; and FPGA deployment shortens processing latency from 3.26 ms on the GPU to 1.09 ms.

#12
h=9
SemAnCorr: Semantic Anchored Correspondence for Zero-Shot Manipulation Skill Transfer
2026-07-30 cs.RO Top author: Jeffrey Ichnowski (h=9)
Xiaoxiang Dong, William Baron, Hongyi Chen, Uksang Yoo, Jeffrey Ichnowski
Core Contributions
  • Targets a specific failure of dense-descriptor correspondence methods: nearest-neighbor feature matching produces spatially incoherent correspondences that lose the local geometric frames needed for reliable skill transfer.
  • Introduces a training-free pipeline that selects semantically consistent anchor regions via joint pose-correspondence optimization, then propagates constraints across the object surface with functional maps, rather than relying on raw per-point feature similarity.
  • Requires no training and generalizes across objects sharing functionality but differing in geometry — a harder transfer regime than same-category instance variation.
  • Achieves 90.8% semantic accuracy on a PartNet-Mobility-based correspondence benchmark while improving geometric coherence over recent state-of-the-art baselines.
  • Shows the correspondence gains translate to real outcomes: from a single demonstration, it enables substantially more reliable zero-shot skill transfer to unseen objects than existing correspondence methods.
Show abstract

Transferring manipulation skills across object instances that share functionality but differ in geometry remains a fundamental challenge in robot learning. While recent correspondence methods leverage dense visual descriptors and 3D feature fields, nearest-neighbor feature matching often produces spatially incoherent correspondences that fail to recover the local geometric frames required for reliable skill transfer. We introduce SemAnCorr, a training-free framework that establishes dense correspondence by selecting semantically consistent anchor regions through joint pose-correspondence optimization and propagating these constraints over the object surface using functional maps. We evaluate SemAnCorr on a dense correspondence benchmark built on PartNet-Mobility, achieving 90.8% semantic accuracy in our benchmark evaluation while improving geometric coherence over recent state-of-the-art baselines. Finally, we show that these improvements translate directly into real-world manipulation performance: using a single demonstration, SemAnCorr enables substantially more reliable zero-shot manipulation skill transfer to previously unseen objects than existing correspondence methods.

#13
h=9
DexDirect: Direct Kinesthetic Arm Guidance for Efficient Dexterous Demonstration Collection
2026-07-30 cs.RO Top author: Yuchen Cui (h=9)
Beom Jun Kim, Shiu-Jen Wang, Jonathan Liu, Alvin Zhu, Quanyou Wang
Core Contributions
  • Targets the demonstration-collection bottleneck for dexterous manipulation by offering a middle path between costly high-fidelity interfaces and low-cost, low-precision alternatives.
  • Combines direct kinesthetic guidance of a gravity-compensated 6-DoF arm (operator physically drags it by a handle) with webcam-based retargeting of the operator's other hand onto a 16-joint, 13-DoF dexterous hand — splitting arm and hand control across the two most natural input channels.
  • User studies show DexDirect collects 17.2x more successful demonstrations than a purely vision-based baseline (AnyTeleop) and 3.2x more than a pose-tracking baseline (TeleDex).
  • An adapted NASA-TLX shows DexDirect reduces mental demand, effort, and frustration relative to the baselines, despite modestly raising physical demand — a favorable tradeoff for large-scale data collection.
  • A diffusion policy trained purely on DexDirect demonstrations reaches 90% success on a cube pick-and-place task, evidence the collected data is high enough quality to train competent downstream policies.
Show abstract

Scalable collection of dexterous manipulation demonstrations remains a major bottleneck for robot learning. High-fidelity interfaces often require costly hardware and extensive setup, while low-setup, low cost alternatives tend to provide less precise control and impose greater cognitive workload on operators. We present DexDirect, a direct kinesthetic arm guidance for efficient dexterous demonstration collection. The operator drags a 6-DoF gravity-compensated robot arm directly by a handle, while a single webcam retargets operator's other hand onto a 16 joints 13-DoF dexterous robot hand. User studies suggest DexDirect collects 17.2x and 3.2x more successful demonstrations compared to purely vision (AnyTeleop) and pose-tracking (TeleDex) baselines. An adapted NASA-TLX shows DexDirect greatly reduces mental demand, effort, and frustration, despite raising physical demand. A diffusion policy trained on DexDirect demonstrations reaches a 90% success rate on a cube pick-and-place task.

#16
h=7
UniCross: Unified Cross-Skill Dexterous Manipulation Synthesis
2026-07-30 cs.RO, cs.CV Top author: Julian Ferchow (h=7)
Hui Zhang, Julian Ferchow, Jie Song, Mirko Meboldt
Core Contributions
  • Argues that grasping, relocation, in-hand rotation, and in-hand translation — normally modeled as separate skills with distinct constraints and objectives — are better treated as instances of one shared task formulation.
  • Unifies all four skills under a common state space, action space, and objective structure, preserving the compatibility and continuity needed to chain them into long-horizon manipulation, which skill-specific models break.
  • Distills the unified formulation into a single cross-skill policy rather than a set of specialist policies stitched together at deployment time.
  • The resulting policy generalizes to unseen objects, stays robust to disturbances, and transfers across different hand morphologies — breadth specialist skill models typically don't offer without retraining.
  • Suggests dexterous manipulation's apparent skill diversity may be a surface phenomenon over shared underlying structure, with implications for how future dexterous datasets and benchmarks should be organized.
Show abstract

Many dexterous manipulation tasks require the object to remain securely held throughout the interaction. From the perspective of hand-object relational motion, such manipulation comprises four canonical skills: grasping, relocation, in-hand rotation, and in-hand translation. Human hands flexibly compose these skills to accomplish complex tasks. Existing approaches, however, model these skills separately with skill-specific action constraints, objectives, or even dedicated hand morphologies, which breaks the compatibility and continuity required for long-horizon composition. In this work, we present a unified framework that models all four skills in a single formulation that shares the same state and action spaces and a common objective structure. This formulation enables straightforward distillation of a single cross-skill policy that performs strongly on every skill, generalizes to unseen objects, stays robust to disturbances, and chains skills seamlessly into long-horizon manipulation. The framework also transfers effectively across different hand morphologies.

Navigation & Perception (6 papers)

#3
h=39
Learning Social Robot Navigation By Sensing Human Legs
2026-07-30 cs.RO Top author: A. Garulli (h=39)
Alberto Vaglio, Andrea Garulli, Antonio Giannitrapani, Renato Quartullo, Tommaso Van Der Meer
Core Contributions
  • Departs from the common circle-based pedestrian abstraction and instead learns navigation policy directly from raw leg motion in ground-level 2D LiDAR, the sensing modality most deployed robots actually have.
  • Introduces CALF, combining convolution, attention, and MLP to interpret leg dynamics, trained via deep RL inside a purpose-built lightweight simulator (LegNav) with a novel pedestrian gait model rather than existing crowd-simulation tools.
  • LegNav's JAX implementation trains a deployment-ready policy in under an hour on one consumer GPU — a substantial reduction in the compute typically needed for social-navigation RL.
  • Validated with zero-shot sim-to-real transfer on a TurtleBot 4, producing smooth, socially compliant trajectories with no additional real-world fine-tuning.
  • Suggests sensor-native features (leg motion) may be a better foundation for social navigation policies than hand-designed geometric abstractions like pedestrian circles.
Show abstract

Robots navigating among pedestrians typically sense their surroundings with a 2D LiDAR mounted close to the ground. At that height, the sensor mostly sees moving legs rather than whole people, yet most learning-based navigation methods still treat pedestrians as simple shapes like circles. This paper addresses that gap with CALF (Convolutional Attention for Leg Features), an end-to-end neural architecture that combines convolutional layers, attention, and MLP to interpret leg motion directly from LiDAR scans and produce safe navigation commands. The CALF policy is trained using deep reinforcement learning algorithms within LegNav, a custom lightweight 2D simulator that combines 2D LiDAR ray tracing with a novel pedestrian gait model. The resulting policy is compared against classical and learning-based baselines in terms of navigation performance and social compliance. The approach is validated through real-world experiments via zero-shot deployment on a TurtleBot 4, yielding smooth and socially compliant trajectories. Written in JAX, the LegNav simulator enables the training of a deployment-ready CALF policy in under an hour on a single consumer GPU.

#5
h=25
Write-Safe Flow Field Mapping under Ambiguous Onboard Sensing and Localization Drift
2026-07-30 cs.RO, eess.SY Top author: Q. Zhong (h=25)
Linhao Jin, Qimin Feng, Peter Gunnarson, Qiang Zhong
Core Contributions
  • Identifies a specific failure mode in robot flow mapping: plausible-looking local flow estimates get written into a global map at the wrong location due to localization drift, accumulating into persistent 'ghost' structures.
  • Proposes a map-reference-aware conservative fusion framework that predicts not just the flow patch but a learned write-safety score, attenuating uncertain updates while still allowing initialization when no map reference exists yet.
  • Reduces average ghost contamination by 42% relative to ungated fusion in synthetic jet and crossflow environments, isolating the benefit of the gating mechanism itself.
  • Validated with zero-shot hardware replay using real pressure and optical-flow data from a thruster wake, cutting ghost contamination by 39% while retaining 81% map coverage.
  • Frames map-write safety, not just flow estimation accuracy, as the critical bottleneck for usable flow maps under drift.
Show abstract

Mobile robots can infer local flow structure from onboard sensing, but a locally plausible estimate is not always safe to write into a global map. Similar flow structures may produce ambiguous observations, while localization drift causes predicted patches to be written at incorrect locations. Repeated misregistered updates then accumulate into persistent ghost structures. We address this failure mode with a map-reference-aware conservative fusion framework. The model predicts a local velocity patch and a learned write-safety score that continuously attenuates uncertain map updates while permitting initialization when no reliable map reference is available. Across synthetic jet and crossflow environments, the proposed method reduces average ghost contamination by 42% relative to ungated fusion. A zero-shot hardware replay using real pressure and optical-flow measurements from a thruster wake further reduces ghost contamination by 39% while retaining 81% map coverage. These results show that safe map writing is critical for flow mapping under ambiguous sensing and localization drift.

#6
h=24
X-NavDP: Generalizing Navigation Diffusion Policy to Novel Behavior and Embodiments with Group Q-score Reweighted Matching
2026-07-30 cs.RO Top author: Jiangmiao Pang (h=24)
Tianyu Yang, Yiming Zeng, Wenzhe Cai, Yuqiang Yang, Jiaqi Peng
Core Contributions
  • Identifies why prior RL post-training of navigation diffusion policies stalls: diffusion policies have intractable likelihoods, making standard policy gradients unstable and exploration inefficient.
  • Introduces GQRM, combining a self-bootstrapped exploration strategy with behavior perturbation (to keep the pretrained prior intact) and a group Q-score normalization mechanism for efficient per-trajectory reweighted score matching.
  • Trains across heterogeneous embodiments simultaneously in a distributed online RL setup, directly targeting the generalization gap left by oracle-planner-generated pretraining data.
  • Raises overall cross-embodiment navigation success rate from 61.20% to 84.28% in simulation, and from 10% to 65% on real-world hard cases (dead ends, long-obstacle detours).
  • Suggests the bottleneck for generalizable navigation diffusion policies was the RL fine-tuning method, not the diffusion backbone itself.
Show abstract

Pretraining navigation diffusion policies rely on large-scale expert demonstrations. These data are typically generated by a fully-informed oracle planner suited to a single nominal robot. This limits the policy's generalization to diverse embodiments and challenging scenarios (e.g., escaping dead ends or detouring long obstacles) that demand diverse local reactive behaviors with only onboard local observations. Post-training the policy with reinforcement learning (RL) offers a principled remedy. However, previous RL for diffusion approaches lead to only marginal improvements. This is because the intractable likelihood of diffusion policies renders policy gradients unstable in addition to inefficient policy exploration. To address these challenges, we propose a data-efficient diffusion RL post-training framework - GQRM (Group Q-score Reweighted Matching). Our framework introduces two complementary designs: (i) a self-bootstrapped exploration strategy with behavior perturbation that preserves the pretrained policy prior, and (ii) a group Q-score normalization mechanism that computes per-trajectory values on each state for efficient reweighted score matching. By conducting distributed online RL training across heterogeneous embodiments, the resulting fine-tuned policy, X-NavDP, achieves state-of-the-art cross-embodiment visual navigation performance, improving the overall success rate from 61.20% to 84.28% in simulation and 10% to 65% in real-world hard cases.

#14
h=8
RaDiVe: Robust 4D Radar Odometry with Distance-Bounded NDT and Velocity-Discrepancy Point Uncertainty
2026-07-30 cs.RO Top author: Ayoung Kim (h=8)
Sangwoo Jung, Dongjae Lee, Chiyun Noh, Ayoung Kim
Core Contributions
  • Addresses the core difficulty of 4D radar odometry: sparse, noisy point clouds with limited positional precision make registration-based approaches unreliable compared to lidar.
  • Introduces a distance-bounded Normal Distributions Transform that restricts correspondence search to near-distance voxel pairs, improving both optimization stability and computational efficiency rather than searching the full point cloud.
  • Proposes a velocity-discrepancy point uncertainty model that weights each radar point by how far its measured Doppler velocity deviates from the ego-velocity-predicted value, directly exploiting radar's unique Doppler signal to resolve ambiguity.
  • Adds SDF-based surface point extraction via implicit neural mapping to build a geometrically consistent, noise-filtered local submap, rather than relying on raw noisy point accumulation.
  • Outperforms existing 4D radar odometry baselines by 44.4% in translational ATE and 21.3% in rotational ATE on average across multiple public datasets, while remaining real-time.
Show abstract

Recent advances in 4D radar enable robust perception in adverse weather; however, the inherent sparsity, noise, and limited positional precision of radar point clouds pose significant challenges for registration-based odometry. In this letter, we propose RaDiVe, a 4D radar odometry framework designed to improve the accuracy and robustness of radar point-cloud registration. We introduce a distance-bounded Normal Distributions Transform (NDT), which improves optimization stability and computational efficiency by restricting the correspondence search to near-distance voxel pairs. To mitigate measurement ambiguity, we propose a velocity-discrepancy point uncertainty model that weights each input 4D radar point according to the discrepancy between its measured Doppler radial velocity and the radial velocity predicted from the estimated ego-velocity. Furthermore, we incorporate Signed Distance Function (SDF)-based surface point extraction via implicit neural mapping to construct a geometrically consistent and noise-filtered local submap. Evaluations across multiple public datasets demonstrate that RaDiVe outperforms existing 4D radar odometry baselines by 44.4% in translational Absolute Trajectory Error (ATE) and 21.3% in rotational ATE on average, while maintaining real-time performance.

#25
h=2
TEA-AgriVLN: Traversability Estimation Alarm for Agricultural Vision-and-Language Navigation
2026-07-30 cs.RO Top author: Xin Chen (h=2)
Xiaobei Zhao, Xingqi Lyu, Xin Chen, Xiang Li
Core Contributions
  • Identifies that 'traversability' is far more ambiguous in agricultural scenes than in the indoor scenes most VLN-CE research targets — an unripe cornfield might be traversable for a robotic dog but not a human, unlike a clearly-defined wood floor vs. concrete wall.
  • Introduces a Traversability Estimation Alarm module that estimates traversability directly from the camera image and alarms the decision-maker to rethink when a predicted action conflicts with the traversability map, rather than trusting the base policy's action unconditionally.
  • Integrates cleanly into the existing AgriVLN backbone rather than requiring a new navigation architecture, making it a targeted add-on for a specific failure mode.
  • Improves Success Rate from 0.47 to 0.54 and Navigation Error from 2.91m to 2.70m on the A2A benchmark, state-of-the-art for agricultural VLN-CE.
  • Includes ablations across ground categories and scene classes that explicitly discuss where TEA helps and where it doesn't, rather than only reporting aggregate gains.
Show abstract

Vision-and-Language Navigation in Continuous Environments (VLN-CE) requires an agent to follow a natural language instruction, predicting a sequence of low-level actions to navigate a robot from a starting point to a target location. The A2A benchmark and the AgriVLN method pioneeringly extended VLN-CE from indoor scenes to agricultural scenes, while we observed a challenging distinction: In indoor scenes, whether a zone is traversable tends to be clear to classify, such as wood floors are traversable but concrete walls are not. In agricultural scenes, however, this issue tends to be ambiguous, such as an unripe cornfield might be traversable for a robotic dog but might be non-traversable for a human. To address this issue, we propose the TEA module, which estimates the traversability of the camera image, then alarm the decision-maker for rethinking when the predicted action does not align with the traversability map. We integrate it into the AgriVLN backbone to build our TEA-AgriVLN method. When evaluated on A2A, it improves Success Rate (SR) from 0.47 to 0.54 and Navigation Error (NE) from 2.91 m to 2.70 m, showing the state-of-the-art performance in the agricultural VLN-CE domain.

#27
h=2
Articulated Object Reconstruction from Rest-State Observation
2026-07-30 cs.CV, cs.RO Top author: Jaeah Lee (h=2)
Daeun Lee, Jaeah Lee, Woosung Kim, Haebeom Jung, Jaesik Park
Core Contributions
  • Removes a standing assumption in articulated object reconstruction — that multiple observed articulation states are available — and instead reconstructs geometry and kinematic structure from a single closed rest-state configuration, an inherently ill-posed setting.
  • Uses an explicit mesh as an intermediate representation specifically to cross-verify and fuse noisy outputs from vision-language and segmentation models into spatially consistent part structures, rather than trusting any single model's segmentation.
  • Estimates joint parameters without any observed motion by using a video diffusion model to synthesize articulation hypotheses, then validating them through geometric consistency checks — substituting generative imagination for missing real motion data.
  • Performs competitively against motion-observing reconstruction-based, generation-based, and modular pretrained-model baselines despite operating with strictly less information than those baselines assume.
  • Relevant for building interactive digital twins from single static scans, a much cheaper data-collection requirement than capturing objects through their full range of motion.
Show abstract

Building interactive digital twins requires recovering both 3D geometry and the kinematic structures that govern how objects articulate. Yet existing methods for articulated object reconstruction require explicitly observable motion from multiple articulation states. We introduce a rest-state formulation that reconstructs articulated objects from a single closed configuration, an inherently ill-posed setting where geometry, semantics, and motion priors compensate for the absence of motion cues. Our framework adopts an explicit mesh as an intermediate representation for cross-model verification and fusion, reconciling noisy outputs from vision-language and segmentation models into spatially consistent part structures. To estimate joint parameters without observed motion, we use a video diffusion model to synthesize articulation hypotheses and validate them through geometric consistency. Our approach achieves accurate part decomposition and physically plausible articulation, performing competitively with motion-observing reconstruction-based, generation-based, and modular pretrained-model baselines.

Embedded & Hardware-Aware Systems (2 papers)

#4
h=29
Filling the Pareto-Optimal Front for Affordance Segmentation on Embedded Devices Using RGB-D Cameras
2026-07-30 cs.CV, cs.LG, cs.RO Top author: R. Zunino (h=29)
Edoardo Ragusa, Giovanni Paolo Canuti, Simone Lugani, Rodolfo Zunino, Paolo Gastaldo
Core Contributions
  • Targets a gap in affordance segmentation for wearable robots: depth data is rarely integrated into small, hardware-constrained networks despite its complementary value to RGB.
  • Proposes two distinct routes to the same goal — a reformulated hardware-aware neural architecture search with a new depth-aware search space, and a separate fine-tuning approach with a preprocessing layer that fuses depth into conventional RGB architectures.
  • Explicitly optimizes for the Pareto front between generalization performance and hardware cost, rather than optimizing accuracy alone and hoping it fits the device afterward.
  • Validated on a concrete embedded prototype (Jetson Nano + RealSense RGB-D), including energy profiling showing real-time performance within a smartphone-scale battery budget.
  • Demonstrates effectiveness across a pair of real-world datasets against existing tiny-network baselines that the authors argue fail on critical scenarios under hardware constraints.
Show abstract

While depth sensors have the potential to complement RGB data for affordance segmentation in wearable robots, their usage seems to remain underexplored. The paper proposes two approaches: a reformulated version of hardware-aware neural architecture search, endowed with a newly designed search space to integrate depth (D) information into small-sized deep networks, and a dedicated fine-tuning approach, including a preprocessing layer to merge depth information with RGB data and make it compatible with conventional architectures. In both cases, those methods aim to generate solutions that benefit from modern (portable) hardware accelerators and overcome existing tiny-like approaches, which often fail to tackle critical scenarios due to the severe constraints set by the supporting hardware. Extensive experiments on a pair of real-world datasets demonstrate the effectiveness of the proposed method as compared with existing solutions. The approach presented in the paper generates, in most cases, solutions that identify the Pareto optimal front to balance generalization performance and hardware requirements. The paper also describes the supporting prototype, including a Jetson Nano board and a RealSense RGB-D camera. When considering the energy profile of the device, the overall system can attain real-time performances within an energy budget that is compatible with standard batteries, such as those used in smartphones.

#22
h=5
Machines that know they are aging: a framework for hardware-aware autonomous intelligence
2026-07-30 cs.RO, cs.AI Top author: Cheng Siong Chin (h=5)
Cheng Siong Chin, Jianhua Zhang, Mohan Venkateshkumar
Core Contributions
  • Identifies 'agnostic collapse' — mission failure from accumulated hardware degradation rather than any single component fault — as a blind spot in autonomous systems whose AI typically assumes hardware stays in original condition.
  • Proposes Aging-Aware Autonomous Intelligence (AAAI), integrating hardware health directly into reasoning, planning, and mission execution rather than treating health monitoring as a separate maintenance concern.
  • Built on three pillars: hardware self-awareness via physics-of-failure models across power, sensing, memory, and computation; self-adaptive reasoning that adjusts inference complexity and planning horizon to remaining capability; and survival-centric intelligence that allocates remaining operational life across mission goals.
  • Unifies existing prognostics and lifecycle-management techniques into a closed-loop cognitive architecture rather than proposing new sensing hardware — a software/architecture contribution more than a hardware one.
  • Targets high-stakes, inaccessible deployment settings (space missions, marine robotics, implantable medical devices) where hardware degradation can't simply be fixed by a technician, making graceful degradation mission-critical.
Show abstract

Autonomous systems inevitably age, yet their artificial intelligence typically assumes hardware remains in its original condition. Batteries degrade, sensors drift, processors accumulate timing errors, and memory reliability declines, creating a growing mismatch between assumed and actual capability. This can lead to agnostic collapse, where mission failure arises from accumulated hardware degradation rather than a single component fault. We propose Aging-Aware Autonomous Intelligence (AAAI), a framework that integrates hardware health directly into reasoning, planning, and mission execution. AAAI is built on three pillars: hardware self-awareness, which continuously estimates the health of power, sensing, memory, and computation subsystems using physics-of-failure models; self-adaptive reasoning, which adjusts inference complexity, planning horizon, and task priorities according to remaining hardware capability; and survival-centric intelligence, which allocates remaining operational life across mission objectives through performance optimization, resource conservation, and graceful degradation. We argue that such integration is essential for autonomous systems operating in inaccessible or safety-critical environments, including space missions, marine robotics, and implantable medical devices.

Safety, Autonomy & Field Deployment (6 papers)

#11
h=10
When Robots Exchange Meaning: A Demo of Goal-Oriented Semantic Communications for Collaborative Robotics
2026-07-30 cs.RO Top author: Adnan Aijaz (h=10)
Peizheng Li, Xinyi Lin, Sajida Gufran, Adnan Aijaz
Core Contributions
  • Frames collaborative robotics as a 6G task-oriented use case where communication quality should be judged by mission outcomes, not packet delivery — a reframing of what 'good' wireless robot communication means.
  • Builds an integrated robot-edge testbed spanning ROS 2 on the robot, a Jetson Orin edge node, RTAB-Map mapping, and browser-based mission dashboard, rather than a narrow point solution.
  • Compresses RGB frames into VQ-VAE tokens on-robot via ONNX and reconstructs them on the edge via PyTorch, achieving a 42.67x payload reduction (5400 bytes for an 80x60 token grid) for a 320x240 image.
  • Fuses the reconstructed visual stream with depth, pose, and 3D mapping to produce object-level semantic maps usable by downstream robotic tasks, closing the loop from compression to actionable understanding.
  • Positions the demo as a practical platform for future task-aware 6G networking research at the SemCom/embodied-AI intersection, rather than a one-off proof of concept.
Show abstract

Collaborative robotics is a representative task-oriented 6G use-case, where communication quality should be reflected in mission execution, environment understanding, and closed-loop operation rather than packet delivery alone. This demo paper presents a robot-edge semantic communication (SemCom) testbed integrating robot-side visual compression, edge-side semantic mapping, and dashboard-based mission interaction. A mobile robot equipped with RGB-D sensing and LiDAR runs ROS 2, while a Jetson Orin edge node performs reconstruction, RTAB-Map mapping, semantic object handling, and browserbased visualization. As an initial proof of concept, RGB frames are encoded on the robot into VQ-VAE tokens using an ONNX Runtime encoder and reconstructed on the edge using a PyTorch decoder. A 320 X 240 image is represented by an 80 X 60 token grid with a packed payload of 5400 bytes, corresponding to a 42.67X reduction relative to model-input RGB bytes. The reconstructed visual stream is further associated with depth, pose, and 3D mapping information to generate a semantic map for downstream robotic applications.

#15
h=7
PAC-MAN: Perception-Aware CBF-RL for Whole-Body Safety in Humanoid Dodgeball
2026-07-30 cs.RO, cs.AI Top author: Junheng Li (h=7)
Lizhi Yang, Junheng Li, Aaron D. Ames
Core Contributions
  • Tests humanoid whole-body safety under deployment-realistic sensing rather than privileged simulation state: the deployed policy sees the ball only as segmentation-masked depth from a head camera.
  • Couples control-barrier-function safety guidance at training time (clearance to every body link) with an adversarial motion prior that regularizes the evasive reflexes the policy learns, blending formal safety structure with learned naturalistic motion.
  • Finds that which barrier formulation works best depends on perceptual observability: Joint-CBF is best under accurate ball states but degrades under realistic fixed-camera perception unless paired with a ball-tracking gimbal or privileged runtime filter.
  • Deploys a lightweight Link-CBF policy zero-shot on a real Unitree G1, succeeding on 95% of thrown balls and coming within a few points of a privileged state oracle using only onboard perception.
  • Uses semantic segmentation to dodge different ball types, showing the perception pipeline generalizes beyond a single calibrated object.
Show abstract

We present PAC-MAN, a perception-aware CBF-RL framework that couples control-barrier safety with deployment-realistic onboard sensing for whole-body humanoid dodgeball. The deployed policy sees the ball only as segmentation-masked depth from a head-mounted camera, while training-time CBF guidance represents clearance to every body link, and an adversarial motion prior regularizes the resulting evasive reflexes. We evaluate on a controlled any-link contact benchmark with seeded throws in two regimes: single throws and a deployment loop in which the robot walks back to its station and recovers between throws. On this benchmark, the policy comes within a few points of a privileged state oracle: a fixed onboard camera alone is adequate for evasion. We find that usable barrier structure depends on perceptual observability: Joint-CBF gives the best performance with accurate ball states, degrades under fixed-camera observations when used only as training guidance, and recovers with a ball-tracking gimbal or privileged runtime filter. We therefore deploy a lightweight Link-CBF policy zero-shot on the Unitree G1 in the real world, where it tolerates imperfect perception, succeeds on 95% of throws, and uses semantic segmentation to dodge different balls.

#17
h=7
LabEvolver: Training-Free Experience Evolution for Safe and Grounded Wet-Lab Agents
2026-07-30 cs.RO, cs.AI Top author: Liuzhenghao Lv (h=7)
Jingya Wang, Yuyang Gao, Liuzhenghao Lv, Yonghong Tian, Yuyang Liu
Core Contributions
  • Targets safe autonomous operation in wet-lab settings, where errors have physical and safety consequences beyond a failed simulation episode.
  • Combines a state-grounded inner trial loop (adaptive perception, online planning, safety validation) with an outer evolution loop that distills completed trajectories into reusable skill, strategy, and safety experience — building episodic memory with zero parameter updates.
  • On robotic solution-preparation tasks, reduces pH-regulation completion time by 48.2% and safety-gate intercepts by 60.0%, direct evidence the accumulated experience improves both efficiency and safety over time.
  • Also validated on ALFWorld beyond the wet-lab domain, lifting cumulative success rate within 20 steps from 76.2% (ReAct) to 91.4% over 500 continual tasks, showing the mechanism isn't lab-specific.
  • Positions training-free, experience-driven adaptation as a practical path toward closed-loop automated scientific discovery, rather than requiring costly retraining after every new task.
Show abstract

We introduce LabEvolver, a training-free framework that equips safe and grounded wet-lab agents with episodic memory from execution experience. LabEvolver couples a state-grounded inner trial loop for adaptive perception, online planning, and safety validation with an outer evolution loop that distills completed trajectories into reusable skill, strategy, and safety experience. On robotic solution-preparation tasks, LabEvolver demonstrates real-world feasibility, reducing pH-regulation completion time and safety-gate intercepts by 48.2% and 60.0%, respectively. On ALFWorld, it further improves cumulative success rate within 20 steps from 76.2% with ReAct to 91.4% over 500 continual tasks, showing generality beyond wet-lab settings. These results support learn-by-doing experience evolution as a feasible path toward closed-loop automated scientific discovery.

#19
h=6
HALO: Heterogeneous Admission through Localized Obligations for Safe Agentic Execution
2026-07-30 cs.AI, cs.RO, cs.SE Top author: Hwangnam Kim (h=6)
Taewoo Park, Kyeonghyun Yoo, Kiseok Kim, Seunghyun Yoo, Hwangnam Kim
Core Contributions
  • Addresses a gap in safely handling heterogeneous agentic AI responses (notices, requests, handoffs, actions bundled together): rejecting a whole response discards useful components, but checking components independently can leave a dependent action without its prerequisite still supported.
  • Introduces a runtime protocol that preserves supported components only when their declared prerequisites also remain supported, rechecks each exact action immediately before dispatch, and allows blocked actions to be replaced only by fresh candidates, not stale reuse.
  • Matched all 96 admission expectations and passed all 20 protocol tests in evaluation, a strict correctness bar for a safety-critical runtime layer.
  • In structured-response replay, retained 248/248 supported components (including 128/128 unaffected by unrelated changes) versus 0/248 retained under a naive whole-response accept/reject policy.
  • Across ten cold-start PX4/Gazebo sessions, blocked every tested stale route and completed all fresh recoveries, showing the protocol holds up in a live simulated flight-control setting, not just offline replay.
Show abstract

Recent agentic AI systems may return a heterogeneous response containing notices, requests, handoffs, and actions. Conditions can change before external use, so components from the same response need not remain supported together. Rejecting the whole response discards useful components, whereas checking components independently can leave a dependent without its prerequisite. We present Heterogeneous Admission with Localized Obligations (HALO), a runtime protocol that preserves supported components whose declared prerequisites also remain supported, rechecks each exact action before dispatch, and allows blocked actions to be replaced only by fresh candidates. HALO matched all 96 admission expectations and passed all 20 protocol tests. In structured-response replay, it retained 248/248 supported components, including 128/128 unaffected by unrelated changes, while a whole-response policy retained 0/248. Across ten cold-start PX4/Gazebo sessions, HALO blocked every tested stale route, observed no matching stale setpoint, and completed all fresh recoveries.

#20
h=6
Arm2Air: Cross-Embodiment Skeleton Transfer for 3D Relay Formation
2026-07-30 cs.RO, cs.AI Top author: Hwangnam Kim (h=6)
Dohun Lee, Kyeonghyun Yoo, Seokmin Kim, Byongho Lee, Seungjoo Oh
Core Contributions
  • Transfers obstacle-avoidance structure learned for robot arms to a completely different embodiment and task — UAV relay placement for post-disaster connectivity restoration — via cross-embodiment skeleton transfer.
  • Converts source-domain robot-arm motions from a pretrained Neural MP model into ordered skeletons that pretrain a transformer-based transfer platform, then adapts to the UAV domain with limited target data using Low-Rank Adaptation rather than training a UAV planner from scratch.
  • On nine held-out high-clutter 3D urban maps, reduces median end-to-end planning runtime by 64.9% relative to the fastest conventional planner.
  • On a separate 30-map dense urban holdout's high-obstruction group, increases bottleneck capacity by 32.6%, reduces capacity variance by 74.7%, and reduces relay displacement by 16.9% relative to IMPC-MD.
  • With only three target-domain training maps, cuts relay-position RMSE by 53.6% versus training from scratch while updating only 0.134M parameters versus 1.383M for full fine-tuning.
Show abstract

Unmanned aerial vehicle (UAV) relay networks can restore connectivity after communication infrastructure is damaged. Urban relay placement is difficult because line-of-sight blockage, communication range, altitude, and three-dimensional obstacles must be considered jointly. Arm2Air transfers obstacle-avoidance skeletons from robot arms to UAV relay placement through cross-embodiment transfer. Source-domain robot-arm motions from a pretrained Neural MP model are converted into ordered skeletons that pretrain a transformer-based transfer platform, which is then adapted to the UAV domain using limited target data and Low-Rank Adaptation. On nine held-out high-clutter 3D urban maps, Arm2Air reduced median end-to-end planning runtime by 64.9 percent relative to the fastest conventional planner. On the high-obstruction group of a separate 30-map dense urban holdout, it increased bottleneck capacity by 32.6 percent, reduced capacity variance by 74.7 percent, reduced maximum hop distance by 13.2 percent, reduced hop-distance variance by 75.2 percent, and reduced relay displacement by 16.9 percent relative to IMPC-MD. With only three target-domain training maps, Arm2Air reduced relay-position root mean square error by 53.6 percent relative to training from scratch while updating 0.134 million parameters, compared with 1.383 million for Scratch and Full Fine-tuning.

#21
h=6
A Systems Engineering Framework for Vision-Language-Enabled UAV Triage and Disaster Response
2026-07-30 cs.RO, cs.AI, eess.SY Top author: Karishma Patnaik (h=6)
Swapnil Saha, Bhuvan Rajanasiriyur Jagadeesha, Karishma Patnaik, Neelakshi Majumdar
Core Contributions
  • Argues current VLM applications in disaster response remain limited to advisory roles, leaving human operators to still translate outputs into coordinated action across teams and robotic assets — the actual bottleneck under time pressure.
  • Proposes embedding VLMs as coordination agents rather than decision-support tools, integrating natural language interaction, mission-level task coordination, and communication aligned with the Incident Command System used by real responders.
  • Develops the architecture using Model-Based Systems Engineering with use case and block definition diagrams, implementing a VLM Coordinator Agent, UAV Mission Control, and Task Allocator within an integrated simulation and control environment.
  • A preliminary human-factors evaluation with seven participants shows reduced perceived workload across mental demand, effort, and frustration, plus high ratings for AI trust and communication clarity.
  • Positions the work as a scalable path for human-autonomy teaming in high-stakes response settings, with the systems-engineering methodology intended to generalize beyond this specific UAV use case.
Show abstract

Recent advances in Vision Language Models (VLMs) have created new opportunities for disaster response, where responders must interpret large volumes of sensor data under time pressure. Current VLM applications include social media monitoring for situational awareness, generation of draft action plans, and translation of technical alerts into public-facing messages. While these efforts can accelerate information flow, they remain largely limited to decision-support roles. This study explores the viability of embedding VLMs as coordination agents within the human-UAV loop. The proposed architecture integrates natural language interaction, mission-level task coordination, software-in-the-loop implementation, and communication aligned with the Incident Command System (ICS). The framework was developed using a Model-Based Systems Engineering (MBSE) approach, with use case and block definition diagrams representing system roles, internal structure, and component interactions. Three key elements, the VLM Coordinator Agent, UAV Mission Control, and Task Allocator, were implemented within an integrated simulation and control environment. A preliminary human-factors evaluation with seven participants showed reduced perceived workload across mental demand, effort, and frustration, along with high ratings for AI trust and communication clarity.