🤖 Robotics arXiv Digest

2026-09-03
30 papers · 7 research areas
Generated by Claude

Research Landscape

Today's 30-paper batch is dominated by a debate about where capability in learned robot policies actually comes from: raw scale, or the right structural priors. MINERVA makes the sharpest claim — a 0.54M-parameter policy reaches 95.1% success on LIBERO, within 2.4 points of LeRobot π0.5 using 7,700× fewer parameters, and its task-ID permutation probe suggests the benchmark's language conditioning mostly selects among memorized tasks rather than testing grounding. That skepticism about scale is echoed structurally rather than contradicted by GIFT and Adaptive Vision-Language Grasping: both get their gains not from bigger backbones but from injecting explicit priors — geometry, affordance, and goal structure in GIFT's case, decoupled kinematic/force-closure grasp physics separated from foundation-model task understanding in AdaRoboVLG's. WISE extends the same instinct to post-training itself, scheduling world-model imagination only where it's useful rather than running it continuously, cutting GPU cost ~80% while improving both π0 and π0.5. The survey Toward Unified Robot Learning ties this together explicitly, arguing that representation learning, VLA models, and world models are developed in silos and that generalization failures come from that lack of integration as much as from any single component's limits.

A parallel theme is training-free structure injection as an alternative to fine-tuning, showing up across navigation and spatial reasoning. GraFT supplies 3D scene-graph structure to frozen multimodal LLMs and beats fine-tuned spatial specialists on VSI-Bench (up to 65% improvement) without any training. Air-Ground Collaborative VLN and Revisiting Topological Graphs for VLN-CE both decompose a hard closed-loop problem — the former across two agents (a UAV's global bird's-eye view and a UGV's local view), the latter across abstraction levels (a macro topological action space over frontier nodes plus a training-free low-level controller) — specifically because flat end-to-end RL or IL proved too sample-inefficient or brittle. Notably, the air-ground paper cites a prior CARLA-Air finding that naive semantic communication between agents actively hurt performance, reinforcing that looser, more structured interfaces (a shared map, a topological graph) are winning out over tighter coupling or larger joint models.

A third thread, quieter but present across several papers, is a turn toward physical grounding and formal safety guarantees as learned components get closer to deployment. FWBC-VLA adds sensorless contact-force awareness directly into VLA action decoding for loco-manipulation; the multi-vine soft robot and passive gripper design papers tackle physical realism from the hardware side. Meanwhile Rethinking World Models for Safety-Critical Embodied Systems directly argues that predictive accuracy in a world model doesn't imply safe decision-making, proposing a risk-and-consequence-centered reorganization; Predictive Zonotope Reduction makes runtime uncertainty monitoring state-adaptive rather than fixed to cut false positives; and Virtual Testing of Automated Driving Systems imports NASA's simulation-credibility framework because validation-only accreditation doesn't scale to multi-tool ADS toolchains. Taken together, the batch suggests a field increasingly comfortable with what learned models can do semantically, and now focused on making sure that competence is physically grounded, efficiently earned, and formally trustworthy.

Papers by Research Area

VLA & Foundation Models for Manipulation

Structuring, shrinking, and post-training vision-language-action policies.

  • #5 — GIFT: Guided Intermediate Feature Training via Action-Orien…
  • #9 — Adaptive Vision-Language Grasping via Composable Foundation…
  • #19 — FWBC-VLA: Force-Aware Whole-Body Compensation for Contact-R…
  • #25 — MINERVA: How Small Can a Manipulation Policy Be and Still S…
  • #28 — WISE: World-model-guided Imagination Scheduling for Efficie…
  • #15 — Toward Unified Robot Learning: Bridging Representation, Vis…

Autonomous Driving

End-to-end driving policies, dataset introspection, and simulation credibility.

  • #7 — A Low-Cost, Open Platform for End-to-End Autonomous Driving…
  • #10 — Continuous Actions from Discrete Minds: Latent-Aligned Plan…
  • #23 — Virtual Testing of Automated Driving Systems through Credib…
  • #30 — Understanding Autonomous Driving Datasets by Describing Dif…

Navigation, Perception & Spatial Reasoning

Path planning, vision-language navigation, and structured spatial representations.

  • #2 — Local Path Planning and Obstacle Avoidance for an Omnicopte…
  • #3 — Air-Ground Collaborative Vision-and-Language Navigation via…
  • #16 — Revisiting Topological Graphs for Macro Action based Closed…
  • #17 — GraFT: A Training-Free Framework for Spatial Reasoning in M…
  • #8 — Corner Cases: Headland Coverage Path Planning for Autonomou…
  • #24 — RoughSense: Lightweight Terrain-Induced Rover Vibration Pre…
  • #13 — MulDP: Multimodal Diffusion Policy for Autonomous Quadruped…
  • #18 — A hybrid pipeline for dynamic ontology-based semantic mappi…

Multi-Robot & Human-Robot Collaboration

Coordinating formations, cranes, and human operators alongside robots.

  • #6 — Formation Matrix and Energy-based Control of Multi-Agent Sy…
  • #4 — Programming and execution of skill-based human-robot-crane…
  • #26 — Toward an~Integrated Cognitive--Ergonomic Architecture for~…

Hardware & Mechanical Design

Soft robot architectures and computational design of physical end-effectors.

  • #1 — A Multi-Vine Soft Robot Enabling Accessible Working Channel…
  • #22 — Robot Aware Computational Design of Object Specific Passive…

Industrial & Agricultural Vision Perception

Applied recognition, segmentation, and localization pipelines for real deployments.

  • #12 — Catalogue Photography as a Cold Start: Toward Deployable Ca…
  • #14 — Automated Weld Seam Recognition and 3D Mapping for Robotic…
  • #29 — DropClick: Semi-Automated One-Click Segmentation for Agricu…
  • #20 — A comparative study on the accuracy & repeatability of mobi…

Safety, Control & Learning Theory

Uncertainty-aware reward learning, runtime monitoring, and risk-informed world models.

  • #11 — Subspace Inference Enables Efficient Active Reward Learning…
  • #21 — Rethinking World Models for Safety-Critical Embodied Systems
  • #27 — Predictive Zonotope Reduction: Precise Runtime Monitoring u…

Papers

VLA & Foundation Models for Manipulation (6 papers)
5
h=0
2026-09-03 cs.RO Top author: Yu-Peng Zheng (h=0)
Yupeng Zheng, Xiang Li, Songen Gu, Yuhang Zheng, Shuai Tian
Core Contributions
  • Names and targets an 'action-sufficiency gap': VLA and world-model backbones inherit rich but control-irrelevant visual features from pretraining, so GIFT adds training-time constraints (geometry alignment, affordance prediction, goal-region reconstruction) rather than just more data or parameters.
  • Applied across three different action formulations — a VLA policy, a direct-action world-action model, and an inverse-dynamics world-action model — without changing any of their native action heads, arguing the fix is backbone-agnostic.
  • Gains are largest precisely where geometry matters most: on zero-shot LIBERO-Plus transfer, the direct-action world model jumps 12.6 points (to 72.6%), notably more than the VLA variant's 4.6-point gain, suggesting predictive world models benefit more from explicit structure than policies that already see raw actions.
  • On RoboCasa the pattern holds — up to 12.6-point improvements — with the paper specifically flagging articulated-object tasks and high-precision manipulation under visual/spatial perturbation as where the structural supervision pays off most.
Show abstract

Vision-language pre-training and predictive world modeling provide robot policies with rich semantic and dynamic visual features, but their native action and visual-prediction objectives may omit critical physical and task structure while retaining control-irrelevant visual redundancy. We call this mismatch between visual richness and control utility the action-sufficiency gap. We investigate whether this gap can be bridged by guiding intermediate features to preserve three control-relevant structure in robotic manipulation: geometry governing motion feasibility, affordance encoding instruction-relevant entities, and goals grounding instructions in task-relevant regions. To this end, we present GIFT (Guided Intermediate Feature Training), an architecture-flexible framework for learning intermediate features that translates these structures into training-time constraints through geometry alignment, affordance prediction, and goal-region reconstruction. We instantiate GIFT in a Vision-Language-Action (VLA) policy, a direct-action World-Action Model (WAM), and an inverse-dynamics WAM while retaining each model's action formulation. Under zero-shot transfer to LIBERO-Plus, GIFT-VLA, GIFT-WAM-Fast, and GIFT-WAM-IDM outperform StarVLA-OFT, Fast-WAM, and Fast-WAM-IDM by 4.6, 12.6, and 5.2 points, reaching 79.6%, 72.6%, and 87.8%, respectively. On RoboCasa, the three GIFT variants reach 61.4%, 83.6%, and 82.3%, outperforming their counterparts by 12.6, 9.0, and 8.4 points, respectively. Together, these results establish learning functionally structured intermediate features as a reusable principle across model-specific action formulations, with especially large gains on articulated-object tasks and high-precision real-world manipulation under unseen visual and spatial perturbations. Project page: https://openphoenix-team.github.io/GIFT-pages.

9
h=0
2026-09-03 cs.RO, cs.AI, cs.CV Top author: Si-Xu Yan (h=0)
Sixu Yan, Shikang Wang, Binhua Huang, Xuanlai Tang, Guohua Fan
Core Contributions
  • Deliberately decouples grasp physics from task semantics: a foundation-model-free base policy handles kinematic feasibility and force-closure stability, while separate foundation-model modules supply spatial, cognitive, and temporal priors — the opposite of end-to-end VLG methods that fuse both into one network.
  • This separation means new task understanding can come from swapping in better foundation models later without retraining the underlying grasp policy, addressing a practical maintenance problem in deployed VLG systems.
  • Demonstrated to generalize across different robotic hands via explicit kinematic mapping, rather than being tied to a specific gripper morphology the way many learned grasp policies are.
  • Claims the composable priors can combine to enable functional grasping in cluttered, dynamic scenes without degrading raw grasp-synthesis performance — the key evidence that decoupling doesn't cost accuracy.
Show abstract

This paper proposes AdaRoboVLG, a task-adaptive Vision-Language-Grasp (VLG) framework that supports generalizable grasp synthesis across different robotic hands. Unlike existing VLG methods that tightly couple foundation models with end-to-end grasp policies, AdaRoboVLG learns an efficient generalizable base policy that generates and evaluates physically feasible grasp candidates through explicit kinematic mapping and force-closure-based stability estimation, while offloading task-dependent understanding to specialized foundation-model modules. These modules provide composable priors that are integrated into the grasp synthesis process, enabling contextually adaptive grasp synthesis without retraining the underlying grasp policy. Through extensive simulation and real-world experiments, we demonstrate that (i) the base policy exhibits efficient learning and strong cross-hand generalization, (ii) the framework effectively incorporates spatial, cognitive, and temporal priors to address three representative grasping challenges without compromising grasp synthesis performance compared to state-of-the-art methods, and (iii) these priors can operate jointly to enable functional grasping in cluttered and dynamic environments. These results indicate that decoupling physical grasp synthesis from task-dependent understanding provides a scalable paradigm for robotic grasping, allowing future advances in foundation models to be directly translated into improved grasp capabilities without redesigning or retraining the underlying grasp policy. Supplementary videos are available at https://adarobovlg.github.io/

19
h=0
2026-09-03 cs.RO, cs.AI Top author: Yu-Tian Zhang (h=0)
Yutian Zhang, Siyuan Ma, Liwen Yang, Yang Li, Ce Hao
Core Contributions
  • Identifies a gap between semantic action generation and physical execution: VLA models produce task-level actions but can't interpret the physical forces those actions induce, while whole-body controllers stabilize the robot but can't tell task-relevant contact forces apart from external disturbances.
  • Introduces HSR-Force, a sensorless residual-torque estimator, avoiding the hardware cost and integration effort of retrofitting force/torque sensors — particularly relevant for wheeled-legged platforms not originally designed for sensorized contact.
  • Encodes estimated contact strength and its temporal change as tokens fed directly into the VLA action expert during decoding, letting the policy perceive contact onset, sustained loading, and release as part of its action generation rather than as a separate downstream correction.
  • Fine-tuned on a purpose-built WL&Arm Dataset of over 5,000 episodes and validated on genuinely contact-rich real-world tasks — whiteboard wiping and opening a door with a door closer — rather than simulation-only contact benchmarks.
Show abstract

Contact-rich loco-manipulation requires a bridge between semantic action generation and physical interaction control. Existing Vision-language-action (VLA) models generate task-level actions from visual and linguistic observations, but cannot interpret the physical interactions induced by those actions. While the whole-body control (WBC) policy can stabilize the robot, it cannot distinguish task-relevant interaction forces from forces induced by external disturbances during manipulation. Although force/torque sensors provide direct measurements of physical interactions, retrofitting them entails additional hardware costs and substantial integration effort, particularly for platforms not designed with sensor integration in mind. To address this problem, we propose FWBC-VLA, a force-aware framework that bridges task-level VLA action generation and low-level whole-body compensation control for wheeled-legged robots. First, we introduce HSR-Force, a sensorless residual-torque estimator for inferring contact strength and its temporal variation. These contact estimates are then encoded as tokens and injected into the VLA action expert during action decoding, enabling the policy to perceive contact onset, sustained loading, and release. For loco-manipulation tasks, all parameters of the pretrained VLA backbone are fine-tuned on our WL\&Arm Dataset, which comprises more than 5,000 episodes. Moreover, the robot's proprioceptive state, the Jacobian-derived body-frame force estimate, and the estimated contact state are jointly fed into a compensation generator to produce corrective actions. The manipulation-centric actions are subsequently combined with the corrective actions and passed to the WBC policy for execution. Real-world experiments on whiteboard wiping and door opening with a door closer demonstrate the effectiveness of our FWBC-VLA in contact-rich loco-manipulation.

25
h=0
2026-09-03 cs.RO Top author: Kohei Sendai (h=0)
Kohei Sendai, Tatsuya Matsushima, Yusuke Iwasawa
Core Contributions
  • Directly challenges the field's drift toward billion-parameter VLA models by asking what capacity LIBERO actually requires — and finds a 0.54M-parameter policy hits 95.1% average success, just 2.4 points below LeRobot π0.5 while using 7,700x fewer parameters.
  • Maps out a capacity floor precisely: performance saturates near 1M parameters and collapses below 0.25M, giving a concrete number for 'how much capacity does this benchmark need' rather than a vague 'smaller models can work too.'
  • A task-ID permutation probe delivers an uncomfortable benchmark critique: shuffling only the task-ID-to-task mapping collapses success to near chance, suggesting LIBERO's instruction conditioning largely selects among memorized tasks rather than requiring genuine language grounding.
  • Flow matching provides no measurable advantage over plain L1 regression across three seeds, while regression runs up to 3.8x faster on GPU — a direct challenge to the assumption that generative action heads are necessary for strong LIBERO performance.
  • The 0.54M model replans in 5–9ms per chunk on a laptop CPU alone (113x faster than SmolVLA, 1,400x faster than π0.5), while LIBERO-Plus perturbations still crater performance to 46–56% — showing the compact policy solves the benchmark's task structure but not necessarily robust visual generalization.
Show abstract

Vision-language-action (VLA) models with billions of parameters now dominate the LIBERO manipulation benchmark, but the model capacity actually required by the benchmark remains unclear. We introduce MINERVA (MINimal Efficient Robotic Vision-Action policy), a family of deliberately compact visuomotor policies designed to measure this task-specific capacity floor. A 0.54M-parameter policy achieves 95.1% average success over 2,000 rollouts on the four standard LIBERO suites, only 2.4 points below the reported LeRobot $π_{0.5}$ result despite using 7,700$\times$ fewer parameters. Performance saturates near 1M parameters and collapses below 0.25M. Across broad architectural, training, and inference sweeps, only action-chunk length and vision capacity consistently exceed a $\pm$1-point training-seed band. Flow matching provides no detectable advantage over direct L1 regression across three seeds, while regression is up to 3.8$\times$ faster on GPU. A task-ID permutation probe shows that standard LIBERO instruction conditioning primarily selects among memorized tasks: changing only the task-ID mapping reduces success to near chance. The same recipe achieves 94.6% success across 89 LIBERO-90 tasks, while LIBERO-Plus perturbations reduce performance to 46--56%, with near-zero robustness to photometric shifts. The 0.54M policy replans every control step in 5--9 ms per chunk on a laptop CPU, 113$\times$ faster than SmolVLA and 1,400$\times$ faster than $π_{0.5}$, without a GPU. These results establish a first empirical estimate of LIBERO's task-specific capacity floor and motivate capacity-aware design and distillation for deployment-efficient robot policies.

28
h=0
2026-09-03 cs.RO Top author: Chen-Hao Zhang (h=0)
Chenhao Zhang, Hanyu Zhao, Hang Cheng, Tengfei Pan, Long Zeng
Core Contributions
  • Argues effective world-model-guided post-training needs more than an accurate predictor: imagination has to be scheduled at the right moments, bounded to reliable horizons, and turned into trustworthy supervision — otherwise extended rollouts just accumulate prediction error into noisy training signal.
  • Selectively triggers imagined rollouts only at interaction-relevant states rather than continuously, explicitly targeting the observation that imagination's value varies a lot across a manipulation task's execution stages.
  • Evaluated on both π0 and π0.5 backbones and shows consistent gains across diverse manipulation tasks while cutting GPU compute time by roughly 80% versus full imagination — a substantial efficiency claim that also generalizes across two different base policies.
  • Real-world evaluations reportedly show gains in robustness and generalization under distribution shift, suggesting the scheduled, bounded imagination transfers beyond the specific conditions it was tuned on in simulation.
Show abstract

Post-training VLA policies typically rely on supervised fine-tuning with costly expert demonstrations or reinforcement learning with expensive and potentially unstable real-world exploration. World models offer a promising alternative by evaluating candidate behaviors through imagined futures, yet effective post-training requires more than accurate prediction: imagination must be scheduled where it is useful, bounded within reliable horizons, and translated into trustworthy policy supervision. In robotic manipulation, the value of imagination varies substantially across execution stages, while extended rollouts can accumulate prediction errors and introduce unreliable learning signals. We introduce WISE (World-model-guided Imagination Scheduling for Efficient Post-training of Vision-Language-Action Models), a unified framework that coordinates when and how world-model imagination is used during policy refinement. WISE selectively invokes imagination at interaction-relevant states, performs bounded multi-view rollouts, evaluates candidate futures using progress and completion signals, and uses their relative outcomes to refine actions generated from real interaction contexts. Extensive experiments with both $π_0$ and $π_{0.5}$ demonstrate consistent improvements across diverse manipulation tasks while reducing GPU computation time by approximately 80% compared with full imagination. Real-world evaluations further show substantial gains in robustness and generalization under diverse real-world distribution shifts.

15
h=0
2026-09-03 cs.RO Top author: Shaunak A. Mehta (h=0)
Shaunak A. Mehta, Ananya Hazarika, Haochen Zhang, Fan Yang, Ryo Moriyama
Core Contributions
  • Argues the field's three major learning paradigms — representation learning, VLA models, world models — are developed in silos, and that generalization and long-horizon planning failures stem from this lack of integration rather than from weaknesses within any single paradigm alone.
  • Organizes existing work along three explicit axes (understanding, acting, reasoning) with a taxonomy spanning environment representation, policy learning, and predictive modeling choices — a structural lens rather than a simple method-by-method survey.
  • Calls out uncertainty quantification, out-of-distribution generalization, cross-embodiment transfer, long-context understanding, and long-horizon planning as the concrete open problems that integration is meant to solve.
  • Its call for 'unified, physically grounded, probabilistic robot learning' echoes concerns raised independently elsewhere in today's batch (e.g., GIFT's action-sufficiency gap, the safety-critical world-model critique), suggesting convergent thinking across otherwise separate subfields.
Show abstract

For robots to operate reliably in real-world environments, they need to perceive their surroundings, act, and reason about the consequences of those actions. Rapid progress in the domains of representation learning, VLA models, and world models has significantly enhanced the capabilities of robot learning systems, enabling robots to work in increasingly complex environments. However, these paradigms are typically developed in isolation, resulting in fragmented systems that struggle with generalization, long-horizon temporal reasoning and planning, and deployment in unstructured environments. In this survey, we present a unified perspective on robot learning by organizing the existing methods along three complementary axes: understanding through representation learning, acting through VLA models, and reasoning through world models. We introduce a structured taxonomy that captures key design choices in environment representation, policy learning, and predictive modeling, and summarize the recent progress in these domains. Beyond classifying the existing works, we analyze how these components interact, discuss common limitations, and highlight emerging trends towards more integrated systems. Through this lens, we identify the challenges in the domain of robot learning, including uncertainty quantification, out-of-distribution generalization, cross-embodiment transfer, long-context understanding, and long-horizon planning. We argue that these challenges arise not only from limitations within individual components but also from the lack of integration across perception, action, and reasoning. Building on this analysis, we outline future directions towards unified, physically grounded, and probabilistic robot learning to develop robust robotic systems that maintain consistent internal representations and support decision making over extended interactions in real-world environments.

Autonomous Driving (4 papers)
7
h=0
2026-09-03 cs.LG, cs.AI, cs.RO Top author: Gustavo Claudio Karl Couto (h=0)
Gustavo Claudio Karl Couto, Eric Aislan Antonelo, Gabriel George Zipperer
Core Contributions
  • Rather than another simulator-only benchmark, this pairs a physical miniature Ackermann car and printed track with a matching Webots digital twin, explicitly built to connect sim-based methods to real closed-loop execution.
  • A command-conditioned behavior-cloning baseline reaches 6.1cm mean cross-track error on the physical vehicle, close to the 4.7cm from human demonstrations — a meaningful sim-to-real reality check for a deliberately compact policy.
  • Camera field-of-view turns out to be a dominant factor in the digital twin: widening from 58° to 120° cuts cross-track error from 35.6cm to 3.3cm, a result easy to overlook when tuning policy architecture instead of sensor FOV.
  • Combining synthetic twin-generated data with a learned sim-to-real image translator and real demonstrations was the only configuration that completed all four track routes in closed loop — neither the compact baseline nor real-data-only training matched it, isolating synthetic augmentation as the deciding factor.
Show abstract

This paper presents a low-cost, open experimental platform for research in end-to-end autonomous driving with miniature Ackermann vehicles. The platform combines a physical vehicle, a printed urban track, data collection tools, trajectory registration, and a Webots digital twin, enabling controlled experiments that connect simulation-based autonomous-driving methods to real-world execution. As a first baseline, we implement command-conditioned behavior cloning, in which a neural policy receives an on-board camera image and a high-level navigation command and outputs steering and speed. The system is evaluated both on the physical vehicle and in simulation. In real closed-loop experiments, the learned policy follows lanes and executes commanded turns, reaching a mean cross-track error of 6.1 cm with respect to the reference route, close to the 4.7 cm observed in human demonstrations. In the digital twin, camera field of view has a strong effect on performance, reducing the mean cross-track error from 35.6 to 3.3 cm when widened from 58 to 120 degrees. Using the digital twin to generate synthetic driving data and a learned sim-to-real image translator to reduce the appearance gap, we further show that a higher-capacity policy trained on this synthetic data combined with real demonstrations is the only configuration that completes all four track routes in closed loop, whereas the compact baseline and the same network trained on real data alone complete fewer. These results establish the open platform as a practical testbed for sim-to-real studies and provide an initial command-conditioned imitation-learning baseline; we release it to support reproducible research.

10
h=0
2026-09-03 cs.CV, cs.RO Top author: Ruo-Yu Yao (h=0)
Ruoyu Yao, Yusen Xie, Qingzhao Liu, Pei Liu, Zewei Yang
Core Contributions
  • Identifies discrete VQ-VAE codebook lookups — standard in many action-tokenized VLA driving models — as a source of quantization error, and instead repurposes the continuous VQ-VAE latent space itself as the action target, skipping the lookup step entirely.
  • A frozen decoder converts continuous predicted latents straight into trajectories, which also eliminates the autoregressive, token-by-token generation that makes many VLA action decoders slow.
  • On nuScenes open-loop evaluation, long-horizon L2 error drops 15.52% versus state-of-the-art VLA baselines — a sizable margin attributable specifically to removing quantization error rather than architectural scale.
  • Closed-loop testing in NVIDIA's AlpaSim shows a 33.34 percentage-point success-rate jump with lower inference latency, suggesting the latent-alignment trick improves both accuracy and speed rather than trading one for the other.
Show abstract

Bridging the gap between the discrete reasoning of Vision-Language Models and the continuous, physics-constrained nature of autonomous driving remains a significant challenge. In this work, we introduce LaPla, a unified Vision-Language-Action (VLA) framework featuring latent-aligned planning to seamlessly ground semantic understanding in precise motion execution. We first design an action tokenizer based on a residual vector-quantized variational autoencoder (VQ-VAE), capturing vehicle kinematics and encoding trajectory features into a structured latent space. Rather than discrete codebook lookups that inevitably introduce quantization errors, LaPla repurposes this representation as a physical prior to bridge the modality gap between high-dimensional semantics and the raw action space. Specifically, given multimodal inputs integrating multi-view images, historical actions, and textual instructions, LaPla incorporates concurrent action queries to causally attend to the multimodal context in a single forward pass, projecting hidden states directly into the pretrained VQ-VAE latent space. The frozen decoder then translates these continuous latents into actions, effectively eliminating quantization errors and ensuring physically plausible trajectories while bypassing time-consuming autoregressive generation. Extensive experiments on the nuScenes benchmark demonstrate that LaPla achieves competitive open-loop performance, reducing long-horizon L2 error by 15.52% compared to state-of-the-art VLA methods. Closed-loop evaluations on the NVIDIA AlpaSim simulator further confirm its superior capability in ensuring smooth driving progress, improving the success rate by 33.34 percentage points with significantly reduced inference latency.

23
h=0
2026-09-03 cs.RO, cs.SE Top author: Riccardo Dona (h=0)
Riccardo Dona, Espedito Rusciano, Biagio Ciuffo
Core Contributions
  • Points out that current virtual-testing accreditation for automated driving systems leans on validation-only practices that scale poorly once simulation toolchains involve multiple interacting tools — a structural problem, not just an accuracy problem.
  • Imports NASA's STD-7009 credibility framework from other safety-critical domains rather than inventing a bespoke ADS-specific scheme, explicitly linking credibility requirements to how simulation outputs will actually be used in a safety decision.
  • Extends traditional verification & validation with a full lifecycle view — toolchain management, modeling assumptions, sensitivity analysis — rather than treating V&V as a final acceptance gate.
  • Proposes proportional credibility thresholds so the bar differs depending on whether simulation is exploratory, partial decision support, or a full substitute for physical testing — avoiding a one-size-fits-all credibility requirement.
Show abstract

Simulation is increasingly used to support safety-related decision-making in road transport, particularly for the assessment and approval of automated driving systems (ADS). The complexity of ADS behavior and size of their operational design domains make exclusive reliance on physical testing impractical, leading to extensive use of virtual testing (VT) during the approval phase. This shift raises critical questions regarding the credibility of modelling and simulation (M&S) results used to support road safety decisions. Current VT accreditation approaches in the ADS domain typically rely on validation-only practices, which have been shown to scale poorly when applied to complex, multi-tool simulation environments. To address this limitation, this paper proposes a risk-based framework for assessing the credibility of simulation toolchains used in ADS safety evaluation, drawing inspiration from established practices in other safety-critical domains, notably NASA's STD-7009 for models and simulations. The framework extends traditional verification and validation (V&V) by explicitly linking credibility requirements to the intended use of simulation outputs and to the safety criticality of the decisions they support within the approval process. It provides a lifecycle-oriented assessment scheme integrating toolchain management, modelling assumptions and limitations, verification, validation, and sensitivity analysis. Credibility acceptance thresholds are defined proportionally, allowing differentiated requirements depending on whether simulation is used for exploratory safety analysis, partial decision support, or as a substitute for physical testing. While demonstrated for ADS, the proposed approach is directly applicable to road safety and simulation studies where VT plays a central role in safety assessment and regulatory decision-making.

30
h=0
2026-09-03 cs.CV, cs.CL, cs.LG, cs.NE, cs.RO Top author: Julian Truetsch (h=0)
Julian Truetsch, Felix Hauser, Christoph Stiller, Frank Bieder
Core Contributions
  • Applies 'set difference captioning' — producing a natural-language hypothesis describing how one image subset differs from another — to autonomous driving specifically, rather than relying on metadata, predefined labels, or manual inspection that don't scale to large fleets.
  • Adapts the general two-stage set-difference-captioning method to be object-centric, working on patches derived from object detection rather than whole images, which lets differences be attributed to specific object instances or categories instead of vague scene-level statements.
  • Introduces AD-Diff Bench specifically to evaluate this setting in-domain, alongside low-concentration experiments that stress-test whether the approach can still surface differences when they're sparse and subtle — the realistic case for domain-shift detection rather than dramatic, obvious dataset splits.
  • Restricts experiments to open-weight models specifically for reproducibility and ease of deployment, a practical choice aimed at making the dataset-introspection tool usable by teams without proprietary API access.
Show abstract

Understanding the composition of large-scale autonomous driving datasets is essential for safety, robustness, and reliable operation across domains. For example, domain shift between locations could lead to the operating environment being misaligned with the training data, resulting in potentially dangerous performance degradation. Yet, existing data analysis pipelines largely rely on metadata, predefined labels, or manual inspection, which provide limited semantic insight or do not scale. This paper studies set difference captioning: given two subsets of images, the goal is to produce a natural-language hypothesis describing differences between the target and reference set. Building on a two-stage formulation, we adapt the method to autonomous driving by focusing on object-centric patches derived from object detection, which simplifies aggregation and enables attribution of differences to specific object instances or categories. To evaluate this setting in-domain, we introduce a new benchmark, AD-Diff Bench. Low-concentration experiments assess the suitability of set-difference-captioning approaches to sparse, real-world differences. We restrict our experiments to open-weight models to support reproducibility and ease of deployment. The proposed benchmark and analysis provide a step towards practical, human-interpretable dataset introspection for autonomous driving datasets. Our implementation and benchmark dataset are available at https://github.com/KIT-MRT/AD-Diff

Navigation, Perception & Spatial Reasoning (8 papers)
2
h=18
2026-09-03 cs.RO Top author: Marija Popovic (h=18)
Mikolaj Helinski, Spilios Theodoulis, Mahmoud Hamandi, Abdullah Mohamed Ali, Anthony Tzes
Core Contributions
  • Extends the classic 2D Dynamic Window Approach to a full 6-DOF search (6D-DWA), letting an omnidirectional multirotor decouple heading from translation when dodging obstacles — something planar DWA formulations can't express.
  • A sphere-based approximation of vehicle geometry plus adaptive velocity sampling keeps the 6D search tractable enough to close the loop within a fixed 0.2s control cycle, sidestepping the need for RRT*-style global replanning at control rate.
  • The 'Agile Mode' dynamically reweights goal-progress, clearance, and heading terms only when reacting to unknown obstacles, trading tracking smoothness for reactivity exactly when needed rather than at all times.
  • Reported numbers are mixed but informative: <0.1m cross-track error and 13° heading error on dense waypoint tracking, but only 41.4% success avoiding a centered unknown obstacle versus 79.3% for an off-center one — exposing where local reactive planning still breaks down in highly constrained geometries.
Show abstract

Autonomous unmanned aerial vehicles (UAVs) increasingly operate in cluttered environments where global planners such as RRT* are not directly deployable at control rates. This paper presents a real-time local planning and obstacle avoidance module for an omnidirectional multirotor (omnicopter) by extending the Dynamic Window Approach to six degrees of freedom (6D-DWA). Our method achieves real-time feasibility through (i) local-map voxelisation, (ii) a compact sphere-based approximation of the vehicle geometry, and (iii) adaptive velocity sampling in the 6D search space. To improve reactivity to unknown obstacles, we introduce a context-aware "Agile Mode" that adjusts scoring weights online to trade-off between goal progress, clearance, and heading/facing constraints during evasive manoeuvres. We evaluate our approach in simulation across computational stress tests, dense-waypoint path tracking, and static/unknown obstacle scenarios. Our planner runs consistently within a 0.2s control loop, tracks waypoint-dense global paths with < 0.1m average cross-track error and 13deg average heading error, and avoids collisions in static environments. For unknown obstacle avoidance, Agile Mode achieves 79.3% success for an off-centre obstacle and 41.4% for a centred obstacle, highlighting both the effectiveness of adaptive weighting and remaining limitations in highly constrained geometries.

3
h=4
2026-09-03 cs.RO, cs.AI Top author: Taowen Wang (h=4)
Shuning Zhang, Liang Li, Yunheng Wang, Tao Wang, Yihang Kang
Core Contributions
  • Prior CARLA-Air evaluation found that five state-of-the-art VLA models showed no stable cooperative behavior between air and ground agents — naive semantic communication or tight bidirectional coupling actually hurt performance — motivating a deliberately looser interface here.
  • The fix is a shared bird's-eye map rather than shared embeddings or policies: the UAV renders the UGV's pose and the VLM-anchored goal as markers with distance labels, giving the ground vehicle global context its first-person camera can't see.
  • Splitting the pipeline into VLM-based semantic reasoning and deterministic geometric execution (rather than end-to-end learning) is what makes the collaboration interface expressible at all — a training-free approach applied to a two-agent setting.
  • On 100 CARLA-Air episodes, joint success hits 77.0%, a +27.0-point collaboration gain over the weaker solo agent and +24.0 points over the strongest published single-agent baseline, showing the map-sharing interface — not extra training — drives the improvement.
Show abstract

Air-ground collaborative Vision-and-Language Navigation (VLN) pairs an unmanned aerial vehicle (UAV) with a global bird's-eye view and an unmanned ground vehicle (UGV) with a local first-person view, yet the setting remains largely unexplored: existing training-free methods solve single-agent tasks but offer no collaboration mechanism, and a recent CARLA-Air evaluation found no stable cooperative behavior across five state-of-the-art VLA models; naive semantic communication or bidirectional coupling even degrades performance. We establish AGC-VLN (Air-Ground Collaborative VLN), the first training-free baseline for air-ground collaborative VLN. The key insight is that training-free methods decompose navigation into VLM-based semantic reasoning and deterministic geometric execution, exposing a collaboration interface: the UAV's global view, over which it renders the UGV's reported pose and the VLM-anchored target as CAR/GOAL markers with distance labels, yielding a shared bird's-eye map. From this map, the UGV acquires global spatial context its first-person view cannot provide, plans a road-following path with a frozen VLM, and executes it under closed-loop control; in parallel, the UAV runs 3D-SPF, a spatial-search upgrade of SPF that localizes the target in the downward view and flies toward it. On 100 closed-loop episodes in CARLA-Air's Town10HD scene, AGC-VLN reaches a 77.0% joint success rate, a collaboration gain of +27.0% over the weaker individual agent (the UAV, 50.0%), and exceeds the strongest published single-agent baseline (Travel UAV, 53.0%) by 24.0 points, stemming from the complementarity of the UAV's global view and the UGV's road-following execution. Project page: https://github.com/ZSN2024/AGC-VLN.

16
h=0
2026-09-03 cs.RO Top author: Shu-Hao Ye (h=0)
Shuhao Ye, Sitong Mao, Yuxiang Cui, Yufei Wei, Xuan Yu
Core Contributions
  • Diagnoses why closed-loop RL struggles in VLN-CE: applying RL directly to micro (low-level) action spaces is too sample-inefficient due to reward sparsity, while imitation learning suffers distribution shift and ambiguous expert actions after any deviation.
  • Resolves this by reformulating navigation as a Hierarchical MDP over a topological graph, so the RL policy operates on a macro action space of frontier nodes while a training-free low-level controller handles state transitions — compressing the effective decision horizon dramatically.
  • Proposes an action-aware value head specifically to handle the fact that the macro action space (available frontier nodes) changes dynamically at each step, which standard PPO value functions aren't built for.
  • Achieves state-of-the-art results on both R2R-CE and RxR-CE, evidence that decoupling planning from control — rather than end-to-end RL over raw actions — is what makes closed-loop RL tractable for this task.
Show abstract

Vision-Language Navigation in Continuous Environments (VLN-CE) requires an agent to follow natural language instructions through unseen environments. Existing imitation learning (IL) pipelines struggle in this closed-loop setting: behavior cloning suffers from distribution shift, and DAgger's expert actions become ambiguous upon trajectory deviation. While Reinforcement Learning (RL) offers a natural paradigm to address this, directly applying RL to micro action spaces is sample-inefficient due to reward sparsity. To overcome this bottleneck, we reformulate VLN-CE as a Hierarchical Markov Decision Process (MDP), explicitly decoupling high-level planning from low-level control. By abstracting the environment into a topological graph, our high-level policy operates on a macro action space of frontier nodes, with a training-free low-level controller acting as its state transition, which significantly compresses the decision horizon and makes closed-loop RL tractable. To support RL optimization on the macro MDP, we propose an action-aware value head to effectively evaluate state values under the dynamic frontier action space, powering a graph-based PPO. Extensive experiments demonstrate the effectiveness of our architecture. Finally, our model achieves state-of-the-art performance on the R2R-CE and RxR-CE benchmarks.

17
h=0
2026-09-03 cs.CV, cs.AI, cs.RO Top author: Jun-Qing Du (h=0)
Junqing Du, Fernando Ropero, Erkin Turkoz, Yanfeng Zhang, Lu Liu
Core Contributions
  • Avoids the usual fixes for MLLM spatial-reasoning failures — large-scale spatial fine-tuning or bolting on dedicated 3D encoders — both of which lock the solution to specific supervision and backbones; GraFT instead injects structure via a compact 3D scene graph at inference time.
  • Splits spatial reasoning into three distinct mechanisms matched to distinct failure modes: symbolic tools for exact geometry, BEV rendering for allocentric layout, and task-relevant egocentric frames for fine-grained appearance grounding — rather than one generic fix for all spatial errors.
  • On ScanQA, CIDEr improves 27% over the same-backbone baseline purely from this training-free structural injection, with no additional supervision.
  • On VSI-Bench, frozen MLLMs improve up to 65% and surpass both proprietary systems and fine-tuned spatial-specialist models — a notable result given GraFT does no training at all.
Show abstract

3D spatial reasoning underpins understanding and acting in the physical world, yet it remains unreliable in current multimodal large language models (MLLMs). These models falter at precise geometric measurement, at transforming between egocentric and allocentric viewpoints, and at grounding fine-grained appearance. The most common remedies fine-tune the model on large-scale curated spatial-reasoning datasets or attach dedicated encoders for 3D geometry, which typically couples the solution to costly supervision and a specific backbone. We instead introduce GraFT, a training-free framework that supplies the missing 3D structure through a compact, easily maintained 3D scene graph (3DSG). From this 3DSG, GraFT provides three spatial reasoning capabilities: (1) deterministic geometry through symbolic tools, (2) allocentric layout through a bird's-eye-view (BEV) rendering, and (3) visual-attribute grounding through task-relevant egocentric frames. On ScanQA, GraFT improves every metric over the same-backbone baseline, raising CIDEr by 27%. On VSI-Bench, GraFT improves frozen MLLMs by up to 65%, surpassing every proprietary and general-purpose open-source baseline, and several prominent fine-tuned spatial models.

8
h=0
2026-09-03 cs.RO Top author: Riikka Soitinaho (h=0)
Riikka Soitinaho, Timo Oksanen
Core Contributions
  • Targets a specific failure mode of nested-polygon headland coverage: full corner coverage normally forces reversing maneuvers that existing smooth-turn methods don't handle, so the method instead reshapes the polygon corners themselves to accommodate a reversing turn.
  • Evaluated against two other methods on gap, overlap, and boundary-crossing metrics using real polygonal field maps rather than synthetic geometries, grounding the comparison in actual farm layouts.
  • Improvements concentrate at the geometric extremes — corners near 90° and those at 240° or more — rather than uniformly, indicating the method is solving a targeted geometric edge case rather than a general coverage improvement.
Show abstract

This paper presents a new method for headland coverage path planning for arable fields. Several earlier approaches suggest covering the headland with nested polygons and smooth turns, however, covering the field corners entirely requires manoeuvres with reversing. In the new method, the polygon corners are modified to allow a reversing turn. A comparison to two other methods considering gap, overlap, and crossing the field boundary shows an improvement in the coverage result especially in field corners of around 90 degrees, and 240 degrees and above. Applicability of the new method is shown with several examples of real polygonal field maps.

24
h=0
2026-09-03 cs.RO Top author: Gabriel Manuel Garcia (h=0)
Gabriel Manuel Garcia, Stephanie Aravecchia, Miguel Angel Olivares-Mendez
Core Contributions
  • Targets a specifically resource-constrained setting — underground/space environments with limited communication, compute, and power — where heavier vibration-prediction models aren't viable.
  • Uses RANSAC on local SLAM point-cloud patches to get an initial geometry-based vibration estimate, then corrects it online with Recursive Least Squares against actual IMU-measured vibration, combining a lightweight prior with lightweight online adaptation rather than a single heavier learned model.
  • Tested across three genuinely different terrain domains — lunar analogue, outdoor field, and underground mine — giving some evidence of cross-domain robustness rather than single-environment tuning.
  • The correction step means the system adapts its geometric prediction to how the specific rover actually responds to terrain, rather than assuming a fixed vibration model transfers across different rover platforms.
Show abstract

Autonomous navigation in space requires reliable terrain assessment for safe operations, especially in underground environments with limited communication, computing resources, and power budget. This paper presents a lightweight method for real-time vibration-aware traversability mapping using a Light Detecting And Ranging (LiDAR) point cloud and Inertial Measurement Unit (IMU) measurements. An initial vibration proxy is estimated from terrain geometry by applying Random sample consensus (RANSAC) to local point-cloud patches produced by a Simultaneous Localisation And Mapping (SLAM) algorithm. In parallel, the IMU provides local observations of the vibration experienced by the rover during traversal. The point-cloud-based prediction is then corrected online using Recursive Least Squares, allowing the system to adapt the geometric estimate to the measured rover response. The approach is evaluated in a lunar analogue environment, an outdoor field, and an underground mine.

13
h=0
2026-09-03 cs.RO Top author: Kang-Mai Hu (h=0)
Kangmai Hu, Yueqi Zhang, Peng Zhai, Xiaoyi Wei, Jiabin Hu
Core Contributions
  • Targets a gap most quadruped parkour work sidesteps: high-level autonomous navigation planning, not just low-level agile locomotion that still relies on a human joystick operator for direction.
  • Fuses visual perception with proprioception and goal information inside a diffusion policy specifically to get temporally coherent, anticipatory velocity commands — addressing the long-horizon anticipation problem that reactive controllers handle poorly on parkour terrain.
  • Introduces QPND, the first Quadruped Parkour Navigation Dataset, addressing the likely reason autonomous parkour navigation has been underexplored: no existing multimodal dataset tightly couples navigation behavior with complex terrain traversal.
  • Validated in both simulation and real-world tests, tying perception-action coupling directly to terrain traversal success rather than reporting simulation numbers alone.
Show abstract

Quadruped robots have demonstrated impressive agility in parkour locomotion across complex terrains. However, most systems still rely on human intervention for high-level planning, and autonomous parkour navigation remains underexplored. The key challenges include fine-grained velocity regulation, long-horizon anticipatory behaviors, and tight coupling between perception and embodied execution. To address these challenges, we propose a Multimodal Diffusion Policy (MulDP) that integrates visual perception with robot proprioception and goal information to generate temporally coherent and anticipatory navigation velocity commands, tightly coupling perception with embodied control to enable robust autonomous navigation. To support the training of MulDP, we construct the first Quadruped Parkour Navigation Dataset (QPND), a multimodal dataset that encompasses diverse navigation behaviors and complex terrains. Extensive simulation and real-world experiments demonstrate that MulDP enables robust long-horizon autonomous navigation and effective traversal across complex terrains.

18
h=0
2026-09-03 cs.RO Top author: Konstantinos Dimitropoulos (h=0)
Konstantinos Dimitropoulos, Ioannis Hatzilygeroudis
Core Contributions
  • Combines an externally calibrated camera using homography projection (rather than robot-mounted sensors alone) with object detection, persistent tracking, and ontology-driven updates to build a semantic world model that stays current as the scene changes.
  • Uses ontologies rather than looser knowledge graphs or scene graphs specifically for their hierarchical structure and dynamic-update support, arguing this better sustains a continuously changing semantic map than flatter graph representations.
  • Adds linear regression correction on top of geometric estimates to compensate for real-world coordinate errors — a pragmatic calibration step layered onto the semantic pipeline rather than assuming perfect geometric mapping.
  • Positions itself as a hybrid of classical SLAM-based geometric mapping and modern prior-knowledge-driven semantic fusion, rather than replacing one with the other.
Show abstract

Semantic mapping plays a crucial role in the ability of a robot to interact with objects, operate and navigate a complex environment. The most common pipeline for semantic mapping consists of geometric mapping and localization (SLAM), perception, semantic fusion and semantic representation. However, more recent works also integrate a form of prior knowledge in their application, most notably knowledge graphs or semantic scene graphs, to improve contextual understanding of the environment. In this paper, we present a hybrid pipeline for semantic mapping. Our system incorporates an external calibrated camera using homography projection for geometric mapping and localization, combined with object detection, persistent object tracking and ontology driven semantic updates to build a dynamic semantic world model. Linear regression models are also used for correction of the estimated values of real world coordinates. The system continuously updates object instances, spatial properties and semantic relations based on real time sensory data. Ontologies are selected as form of knowledge representation due to their hierarchical structure, semantic expressiveness and support for dynamic world modelling.

Multi-Robot & Human-Robot Collaboration (3 papers)
6
h=0
2026-09-03 eess.SY, cs.RO Top author: Martín Crespo (h=0)
Martín Crespo, Sergio Junco, Matías Nacusse
Core Contributions
  • Recasts multi-agent formation control as a network of virtual spring-damper modules whose de-energized (rest) configuration is the desired formation, borrowing bond-graph energy modeling rather than the usual error-feedback consensus formulation.
  • Introduces a 'formation matrix' that graph-theoretically encodes both inter-agent distances and relative velocities, giving a single object that connects the bond-graph's energy-exchange structure to the IDA-PBC control-by-interconnection scheme.
  • This port-Hamiltonian framing lets the authors derive both leader-following and position-based formation controllers with accompanying closed-loop stability proofs, rather than relying on simulation-only validation as many formation-control papers do.
  • Validated only numerically across scenarios; no physical multi-robot deployment is reported, so real-world robustness (communication delay, actuator limits) is untested.
Show abstract

This paper presents an energy-based controller for a multiagent robotic system designed to achieve and maintain a specific formation while moving on a plane and avoiding collisions between agents. The controller emulates a network of elementary spring-damper modules connecting pairs of agents. This network, with its de-energized states representing the desired formation, determines the system's dynamics, which is fully encapsulated by a bond graph model. The modeling is further enhanced through the introduction of a formation matrix, using a graph-theoretic approach, that describes both the distances and relative velocities among the agents of the arrangement. This matrix mathematically represents the interconnection and energy-exchange structure of the bond graph, allowing us to put it in correspondence with the control-by-interconnection CbI-scheme of the IDA-PBC theory, facilitating the solution of the formation control problem within the port-Hamiltonian system framework. Furthermore, the paper presents leader-following and position-based formation control systems based on the CbI scheme, including a stability analysis of the corresponding closed-loop systems. The theoretical findings are validated through numerical simulations across various scenarios.

4
h=2
2026-09-03 cs.RO Top author: Tapio Heikkilä (h=2)
Taneli Lohi, Markku Suomalainen, Roope Mellanen, Tapio Heikkilä
Core Contributions
  • Frames overhead-crane-plus-manipulator collaboration as composable, CAD-model-grounded 'skills' rather than fixed motion programs, so the same skill library can be re-parametrized across varying heavy-object insertion tasks.
  • Uses a modified Behavior Tree with purely event-based communication for execution control, avoiding the polling overhead and rigidity of traditional state-machine task sequencing.
  • The three-way human-crane-manipulator loop — a human steering the crane while the manipulator guides insertion — targets a genuinely under-automated niche: heavy-object handling in variable-batch manufacturing and logistics.
  • Demonstrated only on a single insertion test case, so the generality of the skill-monitor abstraction across other heavy-payload tasks remains to be shown.
Show abstract

Highly varying production sets increasing challenges for robotic manufacturing and indoor logistics. New capabilities for agility, flexibility, and robustness are needed. Robot skills, integrating motions, tool operations, and sensor perceptions consistently provide an execution mechanism for a versatile set of tasks with varying parameters. In this paper, easy-to-use CAD-model based programming and execution system for parametrized skills and skill monitors is showcased. The execution control structure is dynamic and parametrized, based on a modified Behavior Tree, where only event based communication is used. A human-robot-crane collaborative skill is shown as a test example, where a human instructs an overhead crane and a manipulator in inserting a heavy object supported by the crane, and guided by the manipulator, into the goal.

26
h=0
2026-09-03 cs.RO Top author: Antoine Lénat (h=0)
Antoine Lenat, Olivier Cheminat, Damien Chablat, Camilo Charron
Core Contributions
  • Synthesizes a single architecture from four established but rarely combined cognitive models — SOAR, ACT-R, LIDA, and COCOM — rather than adopting any one wholesale, aiming to cover different aspects of human cognition that no single model captures alone.
  • Explicitly grounds the cognitive-model synthesis in Human Factors Ergonomics principles, targeting decision-making, skill acquisition, and adaptive behavior together rather than treating HMI design as a pure interface/usability problem.
  • Positions industrial robotics — where operator expertise, normative procedure, and real-time feedback all matter simultaneously — as the empirical grounding domain, rather than a generic or purely theoretical HMI setting.
  • Presented as a theoretical/conceptual architecture without reported empirical validation against real operators, so its practical benefit over ad hoc HMI design remains to be demonstrated.
Show abstract

This paper presents an integrated approach to modeling human competencies by combining the theoretical foundations of cognitive architectures with principles from Human Factors Ergonomics (HFE). Through a comparative analysis of established cognitive models-SOAR, ACT-R, LIDA, and COCOM-we synthesize a tailored architecture designed to address the complexities of human-machine interaction (HMI) in dynamic environments. By contextualizing this model within ergonomic frameworks, we elucidate the mechanisms underlying decision-making, skill acquisition, and adaptive behavior, bridging the gap between cognitive theory and applied system design. Our framework is empirically grounded in industrial robotics applications, where operator expertise, normative knowledge, and real-time feedback loops are critical. The proposed architecture not only enhances the cognitive alignment of HMI systems but also provides a scalable methodology for designing intelligent, human-centered interfaces in high-stakes environments. This work advances both the theoretical understanding of human competencies and the practical implementation of adaptive, ergonomically optimized systems.

Hardware & Mechanical Design (2 papers)
1
h=59
2026-09-03 cs.RO Top author: K. Althoefer (h=59)
Reza Kashef, Cem Suulker, Mohammad Sheikh Sofla, Kaspar Althoefer
Core Contributions
  • Instead of embedding a working channel inside a single vine body — which caps tool size and limits access to the tip — the design couples two independently actuated vine robots to an externally mounted channel, decoupling steering from payload delivery.
  • Because each vine can grow and steer independently, the pair can execute nearly 90-degree turns during active growth, a sharpness that single-vine steering mechanisms struggle to match in tight anatomical curves like the sigmoid colon.
  • The soft-mounting-tip coupling means the external channel never constrains vine eversion, so tool diameter is no longer traded off against steering agility — a real bottleneck in prior integrated-channel vine robots.
  • Developed under the ERC Synergy EndoTheranostics program, the architecture is aimed squarely at delivering micro-surgical tools mid-growth, positioning it for minimally invasive procedures beyond simple inspection.
Show abstract

Soft eversion robots, also known as vine robots, have attracted growing interest for navigation and inspection tasks, including minimally invasive medical applications [1]. A vine robot consists of a thin, flexible, inextensible tube folded inward that everts and grows forward when pressurized. This tip-growth enables navigation with minimal friction, making vine robots well suited for complex environments such as the human colon [2]. While their inherent softness allows passive conforma- tion to curved pathways in confined spaces, navigation performance strongly depends on environmental inter- actions, including contact angle and the length of un- constrained deployed material [3], [4]. Sharp directional changes, such as those in the sigmoid colon, often limit passive growth and necessitate active steering. Existing solutions include distributed artificial muscles [5] or dedicated tip-based steering mechanisms [6]. In addition, many applications require payload delivery, such as sensors and tools [7], [8]. Within the ERC Synergy project EndoTheranostics, this motivates the development of vine robots capable of delivering micro- surgical tools during growth. Prior work has integrated working channels within the vine body [8], [9], but these approaches constrain tool size, introduce friction, and limit access to the environment to the robot tip. In this work, we propose a multi-vine architecture in which two vine robots are coupled to an externally integrated working channel via soft mounting tips [10]. Independent vine actuation enables active tip steering while advancing the working channel without embed- ding it within the vine bodies Figure 1. Experiments demonstrate sharp steering of nearly 90 degrees during growth, highlighting the potential of this architecture for versatile medical and non-medical applications.

22
h=0
2026-09-03 cs.RO Top author: Abdullah Yahya Abdullah Omaisan (h=0)
Abdullah Yahya Abdullah Omaisan, Ibrahim Sheikh Mohamed
Core Contributions
  • Chains together stages usually treated as separate problems — grasp selection, tool geometry, motion planning, structural design — into one pipeline where every exported gripper design is traceably bound to the source mesh, object pose, robot flange, and contact set via a single design identifier.
  • Combines uncertainty-aware wrench screening with constrained 3D SIMP topology optimization and directional fused-deposition finite-element screening, tailoring the passive (unactuated) gripper's internal structure to the specific print process rather than a generic manufacturing assumption.
  • Proves three formal properties of the numerical pipeline — nodal load preservation, monotonic compliance sensitivity under SIMP interpolation, and voxel-domain containment — grounding the optimization in verifiable guarantees rather than just empirical FEA results.
  • A deliberately enlarged pose-stress test (±3mm, ±5°) differentiates designs by retaining only 29–134 of 160 simulated trials, and topologies retain 92.0–97.6% of the FE domain — but the authors are explicit that without coupon-calibrated instrumented testing, all four designs remain at 'digital-screening' status, not operational release.
Show abstract

This paper presents an end-to-end computational pipeline that converts a selected object mesh, a measured object state, and a selected six-axis robot into an object-specific, unactuated, additively manufacturable gripper. The method couples exact-mesh RGB-D/ICP pose registration, deterministic surface-contact sampling, uncertainty-aware wrench screening, selection among six passive capture mechanisms, object-conformal surface synthesis, full-orientation robot inverse kinematics, a swept-volume-aware manufacturing domain, directional fused-deposition finite-element screening, and constrained three-dimensional SIMP topology optimization. Unlike workflows that treat grasp selection, tool geometry, motion, and structural design as separate problems, every exported design is bound to the source mesh, object pose, robot flange, contact set, and insertion hypothesis by a traceable design identifier. We derive the implemented registration, contact, fit-tolerance, finite-element, and density-optimization equations and prove three properties of the numerical construction: nodal load preservation, monotonic compliance sensitivity under SIMP interpolation, and voxel-domain containment after topology post-processing. Four archived object-specific attempts - a rabbit, camera flange, 3DBenchy, and faceted bust - meet the nominal fit, uncertain-wrench, runtime-sweep, and baseline/post-topology FEA gates. A deliberately enlarged +/-3 mm, +/-5 degree pose stress check differentiates the designs, retaining 29-134 of 160 simulated trials. Their reconstructed topologies retain 92.0-97.6% of the FE domain because functional regions are protected. Archived robot photographs show the corresponding printed assemblies qualitatively, while nominal material properties and absent coupon-calibrated, instrumented tests keep all four at digital-screening status rather than operational release.

Industrial & Agricultural Vision Perception (4 papers)
12
h=0
2026-09-03 cs.CV, cs.AI, cs.RO Top author: Abilash Philip Madavath (h=0)
Abilash Philip Madavath, Chandra Yuvesh Aubeeluck, Augustin Raju, Nicolas Pyschny, Felix Hackelöer
Core Contributions
  • Confronts a genuine cold-start problem — zero labeled field imagery, only manufacturer catalogue photos — and explicitly measures how much catalogue-based separability actually survives the shift to real factory-floor photographs, rather than assuming catalogue performance generalizes.
  • Finds frozen off-the-shelf feature extractors fail to separate head shape and tooth profile even on catalogue images, ruling out the simplest 'just use a pretrained backbone' approach for this task.
  • Metric learning nails near-perfect unsupervised clustering on catalogue images (adjusted Rand index 0.94–0.97) but less than half of that separability survives to field photos — a concrete, quantified domain-gap number rather than a qualitative caveat.
  • The biggest transfer gains came from unglamorous fixes — grayscale conversion (+0.22) and constraining retrieval via Hungarian assignment against the known order sheet (+0.11) — outperforming increases in model scale or representational complexity.
Show abstract

Verifying that manufactured batches of milling tools or carbide rotary burrs conform to production order sheets remains a largely manual and error-prone quality assurance task. Automating this process with computer vision faces a critical cold-start constraint since no labelled imagery is available, leaving manufacturer catalogue photography as the sole source of supervision. We investigate how far catalogue supervision can support an industrial recognition pipeline under domain shift, explicitly measuring the gap between catalogue separability and performance on held-out field photographs. Our findings reveal three key insights. First, off-the-shelf frozen feature extractors do not reliably separate the two task attributes, head shape and tooth profile, motivating targeted representation learning. Second, metric learning produces near-perfect unsupervised cluster discovery on catalogue images (adjusted Rand index 0.94--0.97), but less than half of this gain transfers to field photographs. Third, the largest transfer gains do not come from model scale or representation complexity, but from simple changes that reduce domain sensitivity: converting images to grayscale (+0.22) and constraining retrieval using the known order sheet via Hungarian assignment (+0.11). We therefore treat catalogue photography as a useful cold start rather than a deployment-ready training domain, and provide empirical baselines and an evaluation protocol for catalogue-to-field transfer in precision tool manufacturing.

14
h=0
2026-09-03 cs.RO Top author: Augustin Raju (h=0)
Augustin Raju, Abilash Madavath, Chandra Yuvesh Aubeeluck, Nicolas Pyschny, Felix Hackelöer
Core Contributions
  • Positions itself explicitly as a coarse pre-scan stage, not a replacement for high-precision laser/structured-light scanning — the goal is to cut down what those slower, data-heavy sensors need to cover.
  • Combines multi-viewpoint photogrammetric reconstruction with semantic segmentation to localize weld seams, then projects the 2D segmentation results back onto the 3D reconstructed model rather than segmenting a pre-existing 3D scan.
  • The pipeline is framed around reducing total scan time and irrelevant data volume for large workpieces, a practical throughput concern for automated grinding/finishing/inspection lines rather than a pure accuracy benchmark.
Show abstract

Accurate identification of weld seam geometries is essential for automated robotic post processing operations such as grinding, finishing, and inspection. For large workpieces, complete surface scanning using high precision laser scanners or structured light sensors can be time consuming and often generates substantial amount of data that are not relevant. This paper presents an experimental vision based pipeline for the approximate localization of weld seams. This serves as a preliminary stage before high precision measurement. The proposed approach aims to reduce the overall scanning effort and data acquisition efficiency. The proposed method includes capturing images of the workpiece from multiple viewpoints, identifying weld seams from the images using semantic segmentation, reconstructing the workpiece using photogrammetry, and projection of identified weld seams into the reconstructed model.

29
h=0
2026-09-03 cs.CV, cs.RO Top author: Patrick Zimmer (h=0)
Patrick Zimmer, Michael Halstead, Chris McCool
Core Contributions
  • Targets the labeling bottleneck in agricultural robotics vision directly: instead of requiring one click per object, DropClick is explicitly designed to tolerate missing clicks, reducing annotator effort below even standard one-click methods.
  • Trains from just 5 images on SB20/BUP20 yet reaches 70.0 and 72.6 mIoU respectively — comparable to or better than other one-click methods that presumably use more supervision, isolating the value of the click-guided pseudo-labeling approach itself.
  • Robustness to missing input is the headline result: with 50% of clicks dropped, mIoU only falls to 68.9 and 71.3 — a small degradation given half the annotation signal is gone.
  • Validated as more than a labeling shortcut by feeding its pseudo-labels into a semi-supervised Mask2Former training pipeline, where partial-click DropClick output matches full-click performance (70.1 vs 70.7 AP50 on SB20, no difference on BUP20) while saving 31.9–46.3% of total annotation input.
Show abstract

Labelling vision datasets, especially for segmentation tasks, is a laborious and costly process that stymies novel developments in agricultural robotics. In this paper, we present DropClick, a click-guided segmentation tool that simplifies the annotation process. Our system utilises single-click inputs on objects to generate pseudo-labels, which can replace manual annotations. DropClick stands out as it is a semi-automated approach and does not require a click for every object in the scene. It can therefore further reduce the required amount of user input drastically. We evaluate our method on two challenging agricultural robotic datasets, SB20 and BUP20 for plant and fruit segmentation, respectively. DropClick is first trained on a small subset of just 5 images from the original training data. This DropClick model can then be deployed as a one-click segmentation system and achieves comparable or higher performance than other one-click methods achieving an mIoU of 70.0 and 72.6 points, for SB20 and BUP20 respectively. DropClick then excels at maintaining high performance when clicks are not given (e.g. dropped); when 50% of the clicks are missing it still maintains an mIoU of 68.9 and 71.3 points, for SB20 and BUP20 respectively. We validate DropClick as a pseudo-labelling approach by taking its outputs to train a Mask2Former instance-based segmentation model in a semi-supervised manner. In this process, partially removing user input from DropClick yields similar high performance when compared to providing all clicks, at 70.1 vs 70.7 points AP50 for SB20 and no difference for BUP20 at 77.0 for both models; at the same time saving 46.3% of total input for SB20 and 31.9% for BUP20.

20
h=0
2026-09-03 cs.RO Top author: SeyedMohammadAmin Nabi Pour (h=0)
SeyedMohammadAmin Nabi Pour, S. Gareth Pierce, Randika Vithanage, Ehsan Mohseni, David Carswell
Core Contributions
  • Runs five commercial mobile platforms (KUKA KMP-1500, KUKA KMR, MiR250, Boston Dynamics Spot, Clearpath Husky) through one common, externally referenced laser-tracker protocol (~6-micron ground truth) — a level of cross-platform, apples-to-apples comparison rarely done outside vendor claims.
  • Static positioning accuracy spans nearly an order of magnitude across platforms — 8.2mm median for the KMP-1500 versus 63.5mm for Spot — and the wheel-odometry-only Husky couldn't even be calibrated under the protocol, directly tying calibratability to localization method (LiDAR SLAM vs. visual/wheel odometry).
  • Reframes the result as a design input rather than a pass/fail verdict: no platform's base alone meets the 0.2–1.0mm aerospace NDE tolerance, so the paper quantifies exactly how much supplementary sensing each platform needs (roughly 10x for the best, nearly 100x for the worst) to close that gap.
  • Dynamic cross-track error tracked the same platform ranking as static accuracy (6.9mm to 112.1mm) and was shown insensitive to temporal alignment choices, strengthening confidence that the ranking reflects genuine localization capability rather than measurement artifacts.
Show abstract

Mobile robotic platforms offer a flexible alternative to fixed manipulators for non-destructive evaluation (NDE) of large aerospace structures, but their base-positioning accuracy and how that accuracy should inform deployment have not been assessed under a common, externally referenced protocol. This work presents a laser tracker-based evaluation workflow (ground truth approximately 6 micrometers) that measures the static and segmented trajectory positioning accuracy of five commercial mobile platforms (KUKA KMP-1500, KUKA KMR, MiR250, Boston Dynamics Spot, Clearpath Husky) under a common protocol. A coupled multi-corner calibration recovers the laser-to-robot transformation and reflector offsets; ordinary least squares over all poses is used, with robust estimation retained only as a blunder check. Static positioning accuracy ranged from a median of 8.2 mm (KMP-1500) to 63.5 mm (Spot), with the wheel-odometry-only Husky uncalibratable. Dynamic path following was characterised by cross-track error; the component was insensitive to temporal alignment, which ranged from 6.9 mm (KMP-1500) to 112.1 mm (Spot). Both accuracy and calibratability tracked localisation capability, from the newest LiDAR SLAM platform to map-free visual odometry. No configuration meets the 0.2 to 1.0 mm aerospace NDE tolerance from the base alone; the results are framed as a design input that sizes the supplementary sensing each platform requires: roughly one order of magnitude for the best platform and nearly two for the worst, providing a reproducible basis for platform selection rather than a feasibility claim.

Safety, Control & Learning Theory (3 papers)
11
h=0
2026-09-03 cs.LG, cs.AI, cs.RO Top author: Yu-Tai Zhou (h=0)
Yutai Zhou, Erdem Bıyık
Core Contributions
  • Reframes active preference-based reward learning as sequential Bayesian filtering rather than full posterior inference over the entire reward network, making uncertainty quantification for RLHF-style active learning tractable at neural-network scale.
  • The trick is running an extended Kalman filter within a low-dimensional parameter subspace instead of the full parameter space — a much cheaper approximation than the ensemble or MCMC methods typically used for reward-model uncertainty.
  • On D4RL and V-D4RL, PreferenceEKF beats other Bayesian deep learning baselines on sample efficiency, runtime, scalability, and calibration simultaneously, rather than trading one for another as many uncertainty methods do.
  • The resulting reward models translate into competitive downstream offline RL policies, evidence that the cheaper subspace approximation doesn't just estimate uncertainty well but actually produces usable reward signal.
Show abstract

Reinforcement learning from human feedback (RLHF) has emerged as a powerful yet sample-inefficient approach for learning reward models from human preferences, making active learning a critical component in synthesizing informative preference queries. However, effective uncertainty quantification required for active learning remains a key challenge for large neural network reward models. In this paper, we introduce PreferenceEKF, a sample-efficient approach that tracks reward model uncertainty by framing active preference learning as a sequential Bayesian filtering problem. Instead of relying on computationally prohibitive posterior inference over the full neural network parameter space, our method performs sequential inference via an extended Kalman filter within a low-dimensional parameter subspace, continuously updating the reward model posterior as new preference queries arrive. Our approach enables scalable sampling of neural network parameters to efficiently compute acquisition functions for active reward learning. Experiments on the D4RL and V-D4RL benchmarks demonstrate that our approach achieves better sample efficiency, runtime, scalability, and calibration compared to other Bayesian deep learning approaches, and the learned reward models lead to competitive offline reinforcement learning policy performance. This highlights the potential of scalable Bayesian methods for preference-based reward modeling in RLHF. Our code is available at https://github.com/yutaizhou/bnn_pref.

21
h=0
2026-09-03 cs.AI, cs.RO Top author: Kai-Lang Ma (h=0)
Kailang Ma, Heye Huang, Inhi Kim, Kitae Jang
Core Contributions
  • Directly challenges the assumption that better predictive likelihood or visual fidelity in world models translates into safer decisions, naming three specific structural mismatches: likelihood vs. risk, prediction vs. intervention, and finite-horizon prediction vs. accumulated consequences.
  • Proposes the Risk-Informed World Model (RIWM) as a decision-centric reorganization around consequences, intervention, epistemic uncertainty, and recoverability — a conceptual shift away from 'predict the most likely future' toward 'identify which futures matter.'
  • Explicitly distinguishes physical, social, and operational consequence types, arguing safety-critical world models need different treatment for each rather than a single generic risk score.
  • As a perspective/position paper rather than an empirical one, it lays out open challenges (validating counterfactual reasoning, maintaining revisable safety memories, knowing when evidence is sufficient to act) without yet demonstrating RIWM on a concrete system — a research agenda rather than a result.
Show abstract

World models have progressed from compact latent dynamics to generative, controllable, and interactive simulators of embodied environments. However, high predictive likelihood and visual fidelity do not necessarily ensure that a model preserves the evidence required for safe decision-making. This perspective identifies three structural mismatches in current world modeling: likelihood versus risk, prediction versus intervention, and finite-horizon prediction versus accumulated consequences. We propose the Risk-Informed World Model (RIWM) as a decision-centric research direction for safety-critical embodied systems. RIWM organizes world modeling around consequences, intervention, epistemic uncertainty, and recoverability, and integrates four interdependent capabilities: decision-relevant representation, counterfactual reasoning, safety-critical episodic memory, and runtime safety assurance. It distinguishes physical, social, and operational consequences while using epistemic uncertainty to qualify the evidence supporting action. We further discuss open challenges in identifying consequential futures, validating counterfactual reasoning, maintaining revisable safety memories, translating learned consequences into executable constraints, and determining when evidence is sufficient to act. This perspective argues that future world models should move beyond predicting likely futures toward identifying which futures matter, revising judgments through experience, and recognizing when to act, revise, sense, defer, or abstain.

27
h=0
2026-09-03 cs.RO, cs.LO, eess.SY Top author: Vladimir Krsmanovic (h=0)
Vladimir Krsmanovic, Florian Kohn, Bernd Finkbeiner, Milan Simovic
Core Contributions
  • Notices that existing zonotope-based runtime monitors apply the same fixed order-reduction method throughout a run, even though the best reduction choice actually depends on the current state — and treats reducer selection itself as an optimal control problem.
  • Solves that selection problem with beam-search model predictive control, then distills the result into a small neural policy — trading a expensive but accurate optimizer for a fast learned approximation that keeps most of the benefit.
  • This distillation step is what makes the approach deployable: it runs on a Raspberry Pi 5 monitoring a 5-DOF MuJoCo arm with ISO-5725-modeled sensor uncertainty, rather than requiring a full onboard optimizer.
  • Reports significantly lower false-positive rates versus static reduction strategies, directly addressing a practical cost of overly conservative runtime monitors: unnecessary safety interventions triggered by loose uncertainty bounds.
Show abstract

Robots operating in physical environments make control decisions based on uncertain sensor measurements, which can lead to unsafe or suboptimal actions. Runtime monitors that check their behavior against safety specifications must represent this uncertainty soundly. Zonotopes are a widely used representation, but continuously incorporating new measurements grows their order unboundedly, so monitors must periodically apply an over-approximating reduction. The choice of the reduction method substantially affects the zonotope's precision, yet existing approaches typically utilize a fixed method throughout the run, even though the optimal choice depends on the current state. This paper presents a Predictive Zonotope Reduction (PZR) approach, which frames reducer selection as an optimal control problem and solves it using beam-search model predictive control. Policy distillation into a small neural policy further provides substantially higher execution speed than model predictive control while maintaining improved performance, enabling uncertainty-aware runtime monitoring on resource-constrained real-time systems. We implement our approach in the RLola runtime monitoring framework and evaluate it on a 5-degree-of-freedom robotic arm simulated in MuJoCo, with sensor uncertainty modeled according to ISO 5725. Experiments on a Raspberry Pi 5 show that dynamic reduction significantly lowers false-positive rates in monitoring compared with static reduction strategies.