🤖 Robotics arXiv Digest

August 26, 2026
30 papers 7 research areas Generated by Claude

Research Landscape

World models and VLA policies remain the field's center of gravity, but today's seven-paper cluster is notable for how many different levers each one pulls. GaussianDream++ compresses geometric supervision into 20 training-only tokens and nearly doubles real-robot success from 29.2% to 52.5%; R³ asks whether free-form language reasoning — not structured traces — can steer low-level policies, and finds it does; MA-VLA attacks multi-arm coordination with an Arm Shuffle training scheme that forces role-agnostic instruction following; ConfAL-WM shows world-model errors concentrate in specific spatiotemporal regions and builds active learning around that concentration; Zero-WAM replaces language task-specification with human video as the natural in-context prompt for manipulation; and UCAG-P unifies robot arms, humanoids, and human hands under one camera-observable action schema, reaching 98.3% on LIBERO from a single checkpoint across four benchmark suites. RA-VLA closes the loop with training-free test-time adaptation via behavior-aligned retrieval. Taken together, the batch reads less like a single algorithmic trend and more like the field methodically working through every remaining weak point in the VLA/world-model recipe — geometry, reasoning, coordination, data efficiency, task specification, embodiment, and adaptation — one paper at a time.

A striking one-day cluster targets robot and UAV security specifically through state-estimation manipulation rather than direct control hijacking. Trust-Aware Sequential Decision Making studies multi-robot routing under localization spoofing and proves that undetected adversaries break rollout's cost-improvement guarantee — a rare case connecting an attack directly to a formal planning-theoretic property. Phantom Navigator and SonicNudge both demonstrate precise, covert UAV redirection, but via different attack surfaces: Phantom Navigator combines offline reachability analysis with closed-loop LiDAR-camera spoofing to redirect drones to a chosen location, while SonicNudge shows that a small ultrasonic perturbation to the gyroscope alone — routed through estimator-controller coupling — can shift a hovering drone's position without ever spoofing GNSS or optical flow directly. Read together, these three papers argue that as robots increasingly rely on learned trust and state estimation rather than hard-coded rules, the attack surface has moved from "can you fake the position sensor" to "can you fake what the estimator believes," a subtler and harder-to-detect target.

A separate cluster of four papers steps back from perception and control to interrogate the structure of interaction and behavior itself. PhaseShift shows a single pooled traffic-behavior backbone beats per-intersection models at four of five real Florida sites, with local models specifically losing to a simple calibrated IDM baseline at the highest-flow sites — evidence that shared structure matters most exactly where individual sites have the least data. Choose Your Game Wisely empirically tests the temporal assumptions baked into game-theoretic driving models across six real-world datasets and finds temporal precedence doesn't reliably predict a measurable behavioral response, arguing against any single universal interaction formulation. Gating Before Commitment is unusually candid about its own mechanism, showing through ablation that a simple geometric divergence rule — not the full learned gating model — does most of the safety-critical work in preventing post-interaction planning failures. Alongside DESCENT's extension of motion forecasting to airport surface movement, the throughline is a field increasingly willing to test whether its modeling abstractions (games, learned gates, per-site models) actually match what real interaction data shows, rather than assuming they do.

Papers by Research Area

VLA & World Models for Manipulation

Geometric grounding, language reasoning, multi-arm coordination, active learning, in-context video prompting, and cross-embodiment unification for VLA policies.

7 papers

  • #3 GaussianDream++: Efficient 3D Gaussian World Modeling for Ro…
  • #8 $R^3$: Training Robots to Reason in Natural Language via Rei…
  • #17 MA-VLA: Multi-Arm Vision-Language-Action Model for Collabora…
  • #18 ConfAL-WM: Confidence-Guided Active Learning for Action-Cond…
  • #19 Zero-WAM: In-Context World-Action Modeling from Human Videos…
  • #22 One Policy, Many Embodiments: Unified Camera-Centric Action…
  • #27 RA-VLA: Retrieval-Augmented VLA for Test-Time Adaptation

Navigation, Localization & Traversability

Multi-floor exploration, social navigation memory, vegetation-aware traversal, hybrid waypoint execution, and degradation-resilient odometry.

5 papers

  • #2 RAEM: Robust Autonomous Exploration for Multi-Floor Environm…
  • #10 Advantage-Driven Explicit Memory for Social Navigation
  • #11 When Obstacles Bend: Modeling Vegetation Deformation in the…
  • #20 EgoNav: Bridging Learned Waypoints and Geometry-Aware Local…
  • #25 SUPER ODOMETRY 2.0: Resilient Odometry via Hierarchical Adap…

Autonomous Driving & Traffic Interaction Modeling

Cross-intersection generalization, empirical tests of game-theoretic interaction assumptions, airport surface forecasting, and intent-divergence gating.

4 papers

  • #13 PhaseShift: Topology-Aware Data Harmonization and Model Cons…
  • #16 Choose Your Game Wisely: Measuring Game-Theoretic Structures…
  • #29 DESCENT: Directed Edge Scene Encoding for Airport Surface Mo…
  • #30 Gating Before Commitment: Anticipating Intent Divergence to…

Robot & UAV Security: Spoofing and Trust

Adversarial localization spoofing in multi-robot routing and precise, covert UAV redirection via sensor and estimator attacks.

3 papers

  • #9 Trust-Aware Sequential Decision Making and Rollout Planning…
  • #26 Phantom Navigator: Stealthy and Precise Unmanned Aerial Vehi…
  • #28 SonicNudge: Controlled Displacement of Hovering UAVs via Est…

Manipulation: Grasping, Packing & Bimanual Control

Low-resolution packing perception, physics-simulator MPC for bimanual coordination, and fast Lie-group generative grasping.

3 papers

  • #4 Low-Resolution Perception for Robotic Packing
  • #14 PRISM: Projection-Integrated Sampling-Based MPC with Bayesia…
  • #21 Fast Generative Grasping via Lie Group-Constrained MeanFlow

Control & Motion Planning for Aerial and Humanoid Systems

Whole-body compliance, viability-theoretic multirotor safety, and anytime tensor motion planning with completeness guarantees.

3 papers

  • #7 LAC: Linear and Angular Compliance for Humanoid Whole-body C…
  • #15 Towards safe and optimal flight: Viability Kernel MPC for Fu…
  • #23 Anytime Global Tensor Motion Planning

Perception, Simulation & Industrial Robotics

Native visual reasoning benchmarks, mixed-reality fleet simulation, industrial thermal modeling, UAV inspection segmentation, and GNSS self-supervision.

5 papers

  • #1 VBVR-Pro: A Scalable and Verifiable Suite for Native Visual…
  • #5 VirTooS: A ROS 2 - Unity Virtualization Toolkit for Fleet Ma…
  • #6 Transient multimode heat transfer of an industrial automated…
  • #12 Saliency-Depth Conditioning for Zero-Shot Segmentation of Co…
  • #24 Opportunities of Self Supervised Learning for GNSS: Evaluati…

Papers by Category

VLA & World Models for Manipulation

7 papers
#3
h=35

GaussianDream++: Efficient 3D Gaussian World Modeling for Robotic Manipulation

2026-08-26cs.RODing Zhao (h=35)
Yuqing Jiang, Zijian Zhang, Weitao Zhou, Jiawei Wang, Junjie He
Core Contributions
  • Extends GaussianDream's finding that training-time 3D Gaussian reconstruction/prediction helps VLA policies, but replaces its dense VGGT/TGE prefix — which conflates state, dynamics, and action-conditioning — with two compact token types (World State and World Prediction Tokens) inserted directly into the backbone.
  • A training-only World Representation Head decodes these tokens into current and future Gaussian scenes, with static-dynamic factorization that isolates residual motion to interaction-relevant regions instead of modeling the whole scene uniformly.
  • At inference, the head, renderer, and auxiliary objectives are all removed, leaving just 20 world tokens — geometric supervision that costs nothing at deployment.
  • Reaches 98.6% on LIBERO and 87.8% on LIBERO-Plus with clear gains under camera and layout shifts, and nearly doubles real-robot success from 29.2% to 52.5% over a reproduced π0.5 baseline while keeping closed-loop control efficient.
Show abstract

Vision-Language-Action (VLA) policies have advanced language-conditioned robotic manipulation, yet action-imitation objectives provide only weak supervision for metric 3D structure and short-horizon physical evolution. Geometry-enhanced policies mainly improve current-scene grounding, whereas predictive policies often model future dynamics in RGB or latent spaces and may incur substantial deployment cost. GaussianDream demonstrates that training-time current Gaussian reconstruction and future Gaussian prediction provide effective 3D supervision, but its dense VGGT/TGE-based prefix jointly carries state, dynamics, and action-conditioning information. We present \textbf{\methodname}, a compact, policy-native extension that inserts \textbf{World State Tokens} and \textbf{World Prediction Tokens} directly into the VLA backbone. A training-only \textbf{World Representation Head} decodes these tokens into a Current World and coupled Future Prediction over shared Gaussian primitives, while static--dynamic factorization preserves persistent structure and focuses residual motion on interaction-relevant regions. At inference, the head, renderer, auxiliary objectives, and VGGT/TGE pathway are removed, leaving only 20 world tokens without online Gaussian decoding or rollout. \method achieves \textbf{98.6\%} on LIBERO and \textbf{87.8\%} on LIBERO-Plus, with clear gains under Camera and Layout shifts. Real-robot experiments further improve average success from 29.2\% to 52.5\% over reproduced $π_{0.5}$ while maintaining efficient closed-loop control.

#8
h=26

$R^3$: Training Robots to Reason in Natural Language via Reinforcement Learning

2026-08-26cs.RO cs.AI cs.CL cs.LGZackory Erickson (h=26)
Lehong Wu, Yuxiao Qu, Zheyuan Hu, Ivan Zhang, Limin Wei
Core Contributions
  • Tests whether letting a VLM reason in free-form natural language — the mechanism that helps LLMs on hard problems via extra test-time compute — actually improves low-level robotic manipulation, rather than assuming language reasoning transfers automatically from language tasks to control.
  • Unlike prior robotic-reasoning work that mostly uses structured reasoning traces as auxiliary supervision, R³ trains the reasoning itself to be the test-time guidance signal, via mid-training on expert reasoning traces followed by single-step rubric-based RL from offline action data.
  • Evaluated on Language Table and simulated bimanual grocery packing, two testbeds chosen to stress long-horizon manipulation requiring progress tracking, object-relation reasoning, and mistake recovery.
  • Outperforms instruction-only imitation learning baselines on both benchmarks, with analysis suggesting free-form reasoning functions as a genuine test-time compute mechanism for steering low-level policies rather than just producing plausible-looking explanations.
Show abstract

Reasoning in language allows foundation models to spend more test-time compute on hard problems, such as those requiring decomposition, constraint tracking, and prediction of future consequences. Whether this mechanism can improve robotic manipulation remains unclear, where long-horizon tasks require tracking partial progress, reasoning about object relations, recovering from mistakes, and steering noisy low-level policies. In this paper, we study whether VLMs can be trained to reason directly in natural language to guide low-level manipulation policies. We introduce $R^3$, a simple post-training recipe that turns off-the-shelf VLMs into robotic reasoners: it first mid-trains a VLM on expert-generated reasoning traces to initialize the desired reasoning style, then improves the reasoner with single-step rubric-based RL from offline action data. Unlike prior robotic reasoning methods that mostly use structured traces as auxiliary supervision, $R^3$ trains free-form language reasoning to produce test-time guidance for action. We instantiate $R^3$ on Language Table and simulated bimanual grocery packing, two controlled testbeds for studying robotic reasoning and long-horizon manipulation. $R^3$ improves exploration and generalization across unseen tasks and significantly outperforms instruction-only imitation learning baselines on both benchmarks. Our analyses suggest that free-form language reasoning can function as a test-time compute mechanism for steering low-level policies. Our project page is available at https://robotic-reasoner.github.io/.

#17
h=11

MA-VLA: Multi-Arm Vision-Language-Action Model for Collaboration and Compositional Generalization

2026-08-26cs.ROHuchuan Lu (h=11)
Zaibin Zhang, Junlan Xiao, Zhongbo Zhang, Yifan Wang, Li Kang
Core Contributions
  • Most multi-arm VLA models represent language as one global instruction with no explicit mechanism for assigning different behaviors to different arms — MA-VLA instead decomposes cooperative behavior into mid-level atomic prompts allocated per arm.
  • Introduces Arm Shuffle, a training-time permutation of observation, state, and assigned atomic prompts across arms, forcing role-agnostic instruction following instead of the model memorizing which arm always does which sub-task — this is what enables generalizing to unseen coordination patterns.
  • Constructs a benchmark where test-time collaboration patterns are deliberately absent from the training set, specifically to measure this "multi-arm compositional generalization" rather than in-distribution multi-arm performance.
  • Reports that prior state-of-the-art VLAs largely fail on these unseen collaboration patterns in both simulation and real-world evaluation, while MA-VLA consistently succeeds — a sharp contrast isolating the value of the atomic-prompt-assignment design.
Show abstract

Multi-arm collaboration is becoming a core capability in embodied manipulation. Recent vision-language-action (VLA) models integrate perception, language, and control, but most represent language as a single global instruction and do not provide an explicit mechanism for assigning and composing arm-specific behaviors. This design limits transfer to collaboration patterns that differ from those observed during training. We present MA-VLA, a unified framework for multi-arm collaboration via atomic action assignment. MA-VLA decomposes cooperative behavior into mid-level atomic prompts and allocates them to individual arms, enabling explicit subgoal specification and compositional reuse across tasks. To reduce reliance on fixed execution roles, we introduce Arm Shuffle, a training-time permutation of the observation, state, and assigned atomic prompts for each arm. This permutation enforces role-agnostic instruction following and supports recomposition into unseen coordination patterns, which we term multi-arm compositional generalization. We also construct a benchmark in which test-time collaboration patterns are absent in training set. Across simulation and real-world evaluations, prior state-of-the-art VLAs largely fail under these unseen collaborations, while MA-VLA consistently succeeds. These results indicate that structured, per-arm atomic action assignment offers a practical route to scalable generalization in multi-arm embodied systems. Code, models, and data are available at https://github.com/zhangzaibin/future-robots

#18
h=10

ConfAL-WM: Confidence-Guided Active Learning for Action-Conditioned World Models

2026-08-26cs.RO cs.AISen Cui (h=10)
Xiang Liu, Sen Cui, Changshui Zhang
Core Contributions
  • Notes that action-conditioned world model errors concentrate in specific spatiotemporal regions (robot arms, manipulated objects, contact areas, occluded objects) rather than spreading uniformly, and builds active learning around exploiting that concentration.
  • Attaches a lightweight confidence probe to UNet decoder features of EVAC to predict dense confidence maps in latent space, aggregated into task-, frame-, and patch-level scores usable for both data selection and training-weight decisions.
  • The pipeline is staged: retrain the confidence probe, warm up EVAC with a small target-domain subset, task-level prescreening to allocate sampling budget, then selected-data retraining with optional frame/patch weighting.
  • On RoboTwin2.0, confidence-guided selection improves post-training efficiency, and dense frame/patch weighting further improves prediction quality and trajectory consistency compared with scalar reward-, progress-, and judge-based scoring baselines.
Show abstract

Action-conditioned world models have become an important foundation for embodied prediction, planning, and synthetic data generation, but their errors under new task and scene distributions are often concentrated in localized spatiotemporal regions such as robot arms, manipulated objects, contact areas, and occluded objects. This paper presents ConfAL-WM, a confidence-guided active learning framework for post-training embodied world models. Built upon EVAC, we attach a lightweight confidence probe to UNet decoder features and predict dense confidence maps in the latent space. These maps are aggregated into task-, frame-, and patch-level scores, enabling both efficient data selection and localized training enhancement. Our pipeline first retrains the confidence probe and warms up EVAC with a small subset of target-domain data, then performs task-level prescreening to allocate sampling budgets, and finally applies selected-data retraining with optional frame or patch weighted data enhancement. Experiments on RoboTwin2.0 show that confidence-guided selection improves post-training efficiency, while dense frame and patch weighting further enhances prediction quality and embodied trajectory consistency compared with scalar reward, progress, and judge-based scoring baselines. A quick visual overview of this work is available at https://ConfAL-WM.github.io.

#19
h=9

Zero-WAM: In-Context World-Action Modeling from Human Videos for Open-Ended Task Generalization

2026-08-26cs.RO cs.CVShuai Yang (h=9)
Jiaming Zhou, Qihang Zhang, Gangwei Xu, Cunxin Fan, Yujie Zhao
Core Contributions
  • Brings LLM-style in-context learning to robotic manipulation by arguing the natural task specification for manipulation isn't language but a human video, since video carries rich visual cues about intended task evolution that text can't.
  • Builds an automatic pipeline converting task-sampled robot trajectories into semantically matched human videos, producing HumanGen — 74.2K human-robot in-context pairs across 8.6K tasks — to address the scarcity of paired human-robot task-rich data.
  • Trains with an in-context future chunk prediction objective designed to suppress shortcuts the model could learn from seen tasks, forcing it to draw task information from the video prompt rather than memorizing training-task patterns.
  • On seven unseen RoboTwin 2.0 tasks, achieves 47.0% average success, a 29.5-point absolute improvement over the strongest video-action baseline, and generalizes in real-world tests to multi-object scenes, long-horizon manipulation, and fine-grained insertion.
Show abstract

Zero-shot cross-task generalization, where a policy must execute manipulation tasks never seen during training, remains a central challenge in robot learning. In large language models, a novel task can be performed simply by specifying it in the context, without any parameter update. This form of in-context learning (ICL) turns generalization into a problem of task specification. To achieve cross-task generalization, we bring this paradigm to robotic manipulation, and argue that the natural task specification for manipulation is a human video: unlike language, it provides rich visual cues about the intended task evolution. We present Zero-WAM, a causal video-action model that executes unseen tasks by following in-context human video guidance. To address the scarcity of task-rich paired human-robot data, we propose an automatic pipeline that converts task-sampled robot trajectories into semantically matched human videos, yielding HumanGen, a dataset of 74.2K human-robot ICL pairs across 8.6K tasks. For model training, we further introduce an in-context future chunk prediction (IFP) objective that suppresses shortcuts learned from seen tasks and forces the policy to draw task information from the video prompt. On seven unseen tasks in RoboTwin 2.0 simulation, Zero-WAM achieves a 47.0% average success rate, an absolute improvement of 29.5 percentage points over the strongest video-action baseline. In real-world evaluations, it follows human video guidance to generalize to unseen task configurations involving multi-object scenes, long-horizon manipulation, and fine-grained insertion.

#22
h=7

One Policy, Many Embodiments: Unified Camera-Centric Action Geometry Pre-training for Heterogeneous Embodied Manipulation

2026-08-26cs.ROHangjun Ye (h=7)
Xiaomi Embodied Intelligence Team, University of Macau, :, Shaoqing Xu, Fang Li
Core Contributions
  • Existing approaches to VLA heterogeneity (different robots, cameras, action spaces) rely on explicit action retargeting, human-to-robot video synthesis, or dataset-specific adapter branches — all of which prevent truly joint policy learning; UCAG-P instead aligns everything into one shared camera-observable geometric action space upfront.
  • Represents manipulation as camera-observable anchor motion in image and camera-frame coordinates rather than robot-specific commands, treating robot arms, humanoids, and human hands as different embodiments of the same underlying action schema.
  • A geometry-conditioned action translator combines this predicted motion with target-embodiment kinematics to produce executable controls — decoupling "what motion should happen" from "how this specific robot executes it."
  • Trained on 4.03K hours of robot/simulation data plus 2.34K hours of human demonstrations, one checkpoint reaches 98.3% on LIBERO, 88.7%/89.2% on RoboTwin Easy/Hard, 82.0% zero-shot on LIBERO-Plus, and 62.0% on RoboCasa GR-1 without benchmark-specific fine-tuning.
Show abstract

Scaling generalist vision-language-action (VLA) policies is severely bottlenecked by the inherent heterogeneity of embodied data, which spans diverse robot morphologies, camera configurations, and low-level action spaces. Existing paradigms typically address this mismatch through explicit action retargeting, human-to-robot video synthesis, or dataset-specific adaptation branches, fundamentally hindering the joint learning of a unified policy. We introduce UCAG-P, a camera-centric unified action formulation that structurally aligns heterogeneous embodied datasets into a shared geometric action space. Rather than treating robot-specific commands as the shared policy target, UCAG-P represents manipulation through camera-observable anchor motion in image and camera-frame coordinates, treating robot arms, humanoids, and human hands as different embodiments of a common action schema. A geometry-conditioned action translator combines predicted motion with target-embodiment kinematics to produce executable controls. The resulting decoupled architecture allows a shared VLA policy to learn transferable manipulation geometry while retaining embodiment-specific controllability. UCAG-P is trained on 4.03K hours of robot and simulation data and 2.34K hours of human demonstrations. A single checkpoint reaches 98.3% on LIBERO, 88.7% and 89.2% on RoboTwin Easy and Hard, 82.0% zero-shot on LIBERO-Plus, and 62.0% on RoboCasa GR-1, without benchmark-specific fine-tuning.

#27
h=6

RA-VLA: Retrieval-Augmented VLA for Test-Time Adaptation

2026-08-26cs.ROSanghwan Jang (h=6)
Sanghwan Jang, Minjin Jeon, Minsoo Kim, Seongjin Choi, Dongha Kim
Core Contributions
  • In-Context Imitation Learning offers training-free adaptation for VLAs but existing frameworks hit an "adaptation bottleneck" that the paper attributes specifically to shallow retrieval mechanisms and the policy's behavioral inertia toward its pretrained priors.
  • Combines behavior-aligned context retrieval — not just superficial similarity matching — with a grounded execution pipeline that enforces faithful adherence to the retrieved functional cues, directly targeting both identified failure causes.
  • Because it's retrieval-augmented and training-free, RA-VLA adapts to novel task distributions without gradient updates, preserving inference efficiency compared to methods requiring test-time fine-tuning.
  • Achieves superior success rates and computational efficiency on the LIBERO benchmark and a real-world UR5e environment, positioning retrieval quality — not more training data — as the lever for VLA adaptation robustness.
Show abstract

Vision-Language-Action (VLA) models provide a versatile foundation for general robotic manipulation, yet they exhibit significant brittleness when confronted with novel task distributions. While In-Context Imitation Learning (ICIL) offers a training-free alternative, existing frameworks suffer from an adaptation bottleneck that hinders the effective translation of expert context to executable actions. This failure originates from superficial retrieval mechanisms and an inherent behavioral inertia that anchors the policy to its pre-trained priors. To address these limitations, we present RA-VLA, a retrieval-augmented VLA framework that integrates behavior-aligned context retrieval with a grounded execution pipeline. By enforcing faithful adherence to functional cues within a scalable architecture, RA-VLA facilitates seamless task adaptation while preserving inference efficiency. Our empirical evaluations across the LIBERO benchmark and a real-world UR5e environment demonstrate that RA-VLA achieves superior success rates and computational efficiency, establishing a robust framework for training-free robotic adaptation.

Navigation, Localization & Traversability

5 papers
#2
h=38

RAEM: Robust Autonomous Exploration for Multi-Floor Environments with a Quadruped Robot

2026-08-26cs.ROKwang-Ting Cheng (h=38)
Zikang Yuan, Yuan Ren, Yian Wang, Yixue Wang, Enze Fang
Core Contributions
  • Replaces the planar traversability maps most ground-robot exploration relies on with a hybrid local-global representation, since planar maps can't express overlapping structure or cross-floor connectivity in multi-floor buildings.
  • Uses a local tomography map plus an explicitly categorized local 3D grid for online terrain analysis, then incrementally builds an elevation-aware global topological graph — avoiding the overhead of maintaining one global tomography map during frequent replanning.
  • Adds a staircase center-alignment strategy to reduce abrupt yaw changes while climbing, and a dual path-searching mechanism specifically to recover guidance when the global topology becomes locally disconnected.
  • Demonstrated on continuous exploration of a real five-floor stairwell, a scale of multi-floor autonomous exploration not commonly shown end-to-end on hardware.
Show abstract

In this paper, we propose RAEM, a robust autonomous exploration framework for quadruped robots operating in multi-floor environments. Most existing ground-robot exploration approaches rely on planar traversability representations, which cannot adequately represent the overlapping structures and cross-floor connectivity of multi-floor buildings. Although tomography-based representations provide effective traversability modeling for multi-floor navigation, maintaining a global tomography map incurs substantial computational overhead for online exploration with frequent replanning. Moreover, sparse and fragmented LiDAR observations in stairwells can degrade local traversability estimation, leading to irregular viewpoint placement and temporary topological disconnections. To address these challenges, RAEM adopts a hybrid local-global traversability representation, in which a local tomography map and an explicitly categorized local 3D grid map are used for online terrain analysis and connectivity evaluation, while an elevation-aware global topological graph is incrementally constructed from these local spatial representations for efficient cross-floor exploration planning. We further introduce a staircase center alignment strategy to reduce abrupt yaw variations during climbing and a dual path searching mechanism to recover guidance paths when the global topology is locally disconnected. Extensive simulation and real-world experiments demonstrate robust and computationally stable autonomous exploration across multi-floor structures, including continuous exploration of a five-floor stairwell.

#10
h=21

Advantage-Driven Explicit Memory for Social Navigation

2026-08-26cs.ROT. Silander (h=21)
Yeonsoo Park, Mattia Racca, Guillaume Bono, Steeven Janny, Gianluca Monaci
Core Contributions
  • Argues that storing all agent behavior purely in policy network parameters overloads representation learning, and instead gives the navigation policy an explicit, non-parametric memory that indexes prior steps leading to critical events.
  • Uses the RL agent's own advantage signal to decide what's worth remembering — targeting rare, high-cost failures like human collisions specifically, rather than storing generic experience uniformly.
  • Because the agent can add real deployment data to this explicit memory during testing, it gets a form of continual learning that partially closes the sim-to-real gap by grounding some decisions in real observed data.
  • Integrated into a recurrent PPO architecture using hidden states for memory retrieval, and shown to be robust to out-of-distribution social behavior when trained with a mix of photorealistic rendering and non-visual crowd simulation.
Show abstract

Robot policies are predominantly learned with classical parametric variants of imitation learning or RL, where training stores the agent's behavior exclusively in the policy's network parameters, putting a heavy burden on the representation learning algorithm. We propose a new navigation agent equipped with non-parametric memory which explicitly indexes prior steps leading to critical events. The advantages are twofold: first, it allows the policy to outsource some of its behavior into an explicit memory; second, it encourages a form of continual learning by allowing an agent to collect data from its testing episodes during deployment and therefore to better generalize to OOD situations. In the context of social navigation, we show that this improves the agent's capability to retain sparse, high-cost failures, such as human collisions. If the policy is trained in simulation, this also naturally addresses the sim-to-real gap, partially, by basing some of the decision making on real data. We integrate the explicit memory into a recurrent PPO architecture and use hidden states for memory retrieval to capture continuous spatiotemporal dynamics. The goal of exploiting rare, high-impact events is achieved by leveraging the RL agent's advantage signals. We train our agent in simulation with a combination of photorealistic rendering and non-visual crowd simulation and show that the agent is robust with respect to OOD social behavior.

#11
h=17

When Obstacles Bend: Modeling Vegetation Deformation in the context of Field Robotics

2026-08-26cs.ROR. Aufrère (h=17)
Muhammad Hsaeeb Zaar Khizar, Tom Montagnon, Roland Lenain, Romuald Aufrère, Johann Laconte
Core Contributions
  • Challenges the standard robot-centric definition of traversability (measuring how a specific platform responds to vegetation) by instead characterizing vegetation through its own intrinsic mechanical properties, independent of any one robot.
  • This matters because platform-centric traversability metrics don't transfer across robots — a metric built for one platform's dynamics has to be rebuilt for the next; intrinsic characterization is meant to be reusable.
  • Combines deformation measurements with contact force data to estimate underlying mechanical parameters and reconstruct how vegetation responds to interaction, rather than only recording binary pass/fail traversal outcomes.
  • Enables vegetation-aware navigation grounded in the environment's actual physical properties, relevant to agriculture and environmental monitoring where robots must interact with — not just avoid — plants.
Show abstract

Autonomous robots operating in natural environments must often interact with vegetation rather than simply avoid it. In this context, traversability is typically defined from the robot's perspective, by measuring how a specific platform responds when moving through the environment. While practical, this viewpoint entangles the assessment of the environment with the robot's own dynamics, making the resulting characterization difficult to transfer across different platforms. More importantly, it does not directly reflect the properties of the vegetation itself, which are the true source of interaction and potential damage in applications such as agriculture and environmental monitoring. To address this limitation, we propose to characterize vegetation through its intrinsic mechanical properties, independently of any specific robot. By combining deformation measurements with contact force data, we estimate the underlying mechanical parameters and reconstruct the vegetation's response to interaction. This enables vegetation-aware navigation based on intrinsic environmental properties rather than platform-dependent metrics.

#20
h=9

EgoNav: Bridging Learned Waypoints and Geometry-Aware Local Control for Robust Indoor Navigation

2026-08-26cs.ROShiqi Zhao (h=9)
Jing Wang, Shiqi Zhao, Hairong Qu, Peng Yin
Core Contributions
  • Learned waypoint predictors for image-goal navigation are attractive because they only need geotagged images and visual matching, but can propose targets that violate geometry or drift from the global path — EgoNav keeps the learned predictor's intuition while adding a geometric safety layer around it.
  • Generates candidate waypoints from semantically segmented traversable regions and scores them alongside the learned waypoint on geometric safety, directional coherence, and fidelity to the learned prior, rather than trusting or discarding the learned waypoint outright.
  • An adaptive local path planner executes the refined waypoint with parameters modulated by the refinement outcome, addressing that prior systems either lack a local collision-avoidance planner or use fixed parameters that fail in confined spaces.
  • Outperforms contemporary baselines in both success rate and path efficiency in Habitat-sim and on a physical humanoid robot, showing the hybrid learned+geometric approach transfers from simulation to real hardware.
Show abstract

Image-goal navigation using lightweight topological maps is a practical paradigm for indoor robot deployment: the map requires only geotagged images, and localization relies on visual matching rather than precise pose estimation. However, learned waypoint predictors can produce targets that violate geometric constraints or deviate from the global path. Executing these waypoints safely further requires a local planner capable of collision avoidance, yet existing systems either lack one or rely on fixed parameters that cannot adapt to confined spaces. To address these limitations while retaining the navigational intuition of the learned predictor, we present EgoNav, a hierarchical system that implements this idea by generating candidates from semantically segmented traversable regions and scoring them alongside the learned waypoint for geometric safety, directional coherence, and fidelity to the learned prior. An adaptive local path planner then executes the refined waypoint with parameters modulated based on the refinement outcome. Experiments in Habitat-sim and on a physical humanoid robot show that EgoNav consistently outperforms contemporary baselines in both success rate and path efficiency.

#25
h=7

SUPER ODOMETRY 2.0: Resilient Odometry via Hierarchical Adaptation

2026-08-26cs.ROShibo Zhao (h=7)
Shibo Zhao, Sifan Zhou, Yuchen Zhang, Ji Zhang, Chen Wang
Core Contributions
  • Builds a hierarchical sensor-fusion framework with four adaptive modules (feature selection, state-direction selection, engine selection, and a new learning-based inertial odometry) that adjust dynamically to environmental degradation, rather than using a fixed fusion strategy.
  • Elevates IMU to equal importance with camera and LiDAR in the fusion framework specifically so it can serve as a reliable fallback when exteroceptive sensors fail — under smoke, sandstorms, snow, or low light.
  • The learning-based inertial odometry component is trained on over 100 hours of heterogeneous robotic platform data, aiming to capture comprehensive motion dynamics rather than platform-specific patterns.
  • Validated across 200 kilometers and 800 operational hours on aerial, wheeled, and legged robots under diverse sensor configurations and degraded conditions — an unusually large real-world validation scale for an odometry system.
Show abstract

Resilient and robust odometry is crucial for autonomous systems operating in complex and dynamic environments. Existing odometry systems often struggle with severe sensory degradations and extreme conditions such as smoke, sandstorms, snow, or low-light conditions, threatening both the safety and functionality of robots. To address these challenges, we present Super Odometry, a sensor fusion framework that dynamically adapts to varying levels of environmental degradation. Super Odometry employs a hierarchical structure to integrate four core modules from lower-level to higher-level adaptability including adaptive feature selection, adaptive state direction selection, adaptive engine selection, and a novel learning- based inertial odometry. The inertial odometry, trained on over 100 hours of heterogeneous robotic platforms, captures comprehensive motion dynamics. Super Odometry elevates the inertial measurement unit (IMU) to equal importance with camera and LiDAR within the sensor fusion framework, providing a reliable fallback when exteroceptive sensors fail. Super Odometry has been validated across 200 kilometers and 800 operational hours on a fleet of aerial, wheeled, and legged robots, under diverse sensor configurations, environmental degradation, and aggressive motion profiles. It marks an important step towards safe and long-term robotic autonomy in all-degraded environments.

Autonomous Driving & Traffic Interaction Modeling

4 papers
#13
h=15

PhaseShift: Topology-Aware Data Harmonization and Model Consolidation Across Signalized Intersections

2026-08-26cs.AI cs.ROA. Rangarajan (h=15)
Yash Ranjan, Artur Kumik, Rahul Sengupta, Anand Rangarajan, Sanjay Ranka
Core Contributions
  • Most learned traffic-behavior models are trained per-intersection, creating siloed models that can't share evidence across sites — PhaseShift instead harmonizes heterogeneous roadside trajectories into one shared actor-centric representation and trains a single reusable backbone.
  • Strips out site-specific conventions (ego-relative coordinates, normalized signal context, variable-cardinality interaction tokens) while preserving behaviorally relevant topology, so the same backbone works pooled, zero-shot at a new intersection, or with light adaptation.
  • On five Florida intersections across two regions, one pooled model beats per-site trained models at 10s prediction across all five sites (median 36.8%/22.0% reduction in minADE/minFDE), and cross-site leave-one-out deployment beats local training at four of five sites.
  • Local per-site models fall behind a simple calibrated IDM baseline at the two highest-flow sites after long rollouts, while pretrained-backbone regimes don't — pooled training appears specifically valuable at the hardest, highest-traffic sites.
Show abstract

Learned traffic-behavior models are commonly trained separately for each intersection, creating model portfolios that cannot share evidence across sites. We present PhaseShift, a topology-aware framework that harmonizes heterogeneous roadside trajectories into a shared actor-centric representation and trains one reusable backbone. Ego-relative coordinates, trajectory-induced movement paths, normalized signal context, and variable-cardinality interaction tokens remove site conventions while preserving behaviorally relevant topology. The backbone supports pooled operation, zero-shot at a held-out intersection, and low-data adaptation. We evaluate five intersections in two Florida regions on balanced field data, 100k training windows and equal-sized test sets per site under a replay-conditioned, best-of-sampled-trajectory protocol. At 10s, one pooled model lowers both minADE and minFDE relative to trained local models at all five sites, with median reductions of 36.8% and 22.0%. Leave-one-intersection-out deployment, including one cross-region fold, beats local training on both 10-s metrics at four of five sites, although short-horizon performance is less uniform. Fine-tuning with 1,000 target update windows improves on zero-shot at three sites and is the strongest regime at one. At site 7, every cross-site mixture sharply lowers long-horizon error under a fixed 100k-window budget; test-likelihood gains argue against a best-of-sample dispersion-only explanation. Local models fall behind calibrated IDM at the two highest-flow sites after long autoregressive rollouts; pretrained-backbone regimes do not. Within this five-site evaluation, PhaseShift demonstrates consolidation across heterogeneous physical control settings while identifying sites that still require adaptation. The protocol measures conditional single-vehicle generation under replayed context, not closed-loop traffic simulation.

#16
h=11

Choose Your Game Wisely: Measuring Game-Theoretic Structures in Real-World Vehicle Interactions

2026-08-26cs.AI cs.ROHanyang Zhuang (h=11)
Yueyuan Li, Rongcheng Nie, Weijie Xi, Mingyang Jiang, Songan Zhang
Core Contributions
  • Points out that game-theoretic models of vehicle interaction (simultaneous, sequential, asymmetric) make specific temporal assumptions that have never been systematically checked against real driving data — this paper builds a measurement framework to check them.
  • Develops a trajectory-based framework that identifies interaction events and quantifies when behavioral change starts, how it's temporally organized, how vehicles respond after onset, and how stable the ordering of who-reacts-to-whom is — verified using actual behavioral deviations rather than assumed roles.
  • Evaluated across six real-world datasets (INTERACTION, highD, inD, rounD, Waymo Open Motion, nuPlan) spanning diverse geometries and interaction types, giving unusually broad empirical coverage for a measurement study.
  • Finds concurrent and sequential behavioral changes both occur substantially and stable ordering is more common than alternating ordering, but temporal precedence doesn't necessarily imply a measurable behavioral response — arguing different game-theoretic formulations are complementary, not universal.
Show abstract

Game-theoretic models provide principled frameworks for modeling vehicle interactions, but their underlying temporal assumptions have not been systematically examined against real-world driving behavior. In particular, it remains unclear how simultaneous, sequential, and asymmetric interaction structures can be measured from vehicle trajectories. This paper develops a trajectory-based interaction measurement framework to identify interaction events and quantify behavioral change onset, temporal organization, post-onset response dynamics, and ordering stability. The framework uses behavioral deviations to verify candidate interactions. We evaluate the framework on six real-world trajectory datasets, including INTERACTION, highD, inD, rounD, Waymo Open Motion, and nuPlan, covering diverse road geometries, traffic environments, and interaction types. The results show that concurrent and sequential behavioral changes both constitute substantial proportions of observed following, merging, and conflicting interactions. Among sequential interactions, stable ordering is more prevalent than alternating ordering, indicating that persistent asymmetric roles are a common interaction structure. Importantly, temporal precedence does not necessarily coincide with a measurable behavioral response, indicating that temporal ordering alone may not be sufficient to characterize behavioral dependence. These findings show that real-world interactions exhibit concurrent, sequential, and persistently ordered temporal structures. Different game-theoretic formulations are therefore better regarded as complementary modeling abstractions for different interaction regimes rather than as a universal structure governing all vehicle interactions.

#29
h=5

DESCENT: Directed Edge Scene Encoding for Airport Surface Movement Prediction

2026-08-26cs.RODavid Schinagl (h=5)
Alexander Prutsch, David Schinagl, Horst Possegger
Core Contributions
  • Motion forecasting is well-studied for road driving but underexplored for airport surface movements, which have heterogeneous vehicle dynamics and much stricter topological constraints than open roads — DESCENT is built specifically for that gap.
  • Introduces a Potential Reachable Set (PRS) context-sampling mechanism that adaptively collects airfield environment context across different operational phases, paired with a detection-transformer-based decoder for trajectory forecasting.
  • Evaluated on the Amelia-10 benchmark with significant improvement over state-of-the-art baselines, with gains specifically pronounced in safety-critical scenarios, credited to the domain-aware sampling providing critical long-horizon context.
  • Positions airport ground-operation safety automation as a distinct forecasting problem from road driving, relevant as commercial air traffic density increases and ground-collision risk becomes a bigger operational concern.
Show abstract

Advanced automation is a key technology for enhancing the safety of ground operations amidst the increasing density of commercial air traffic. While motion forecasting is a well-studied task in autonomous driving, its application to airport surface movements remains underexplored. To enable efficient and accurate prediction in this domain, we propose DESCENT, a transformer-based architecture designed to handle heterogeneous dynamics and strict topological constraints. Our approach features a Potential Reachable Set (PRS) context sampling mechanism that adaptively collects airfield environment context across diverse operational phases. Combined with a detection transformer-based decoder, DESCENT generates accurate trajectory forecasts. Extensive evaluations on the Amelia-10 benchmark demonstrate significant performance improvements over state-of-the-art baselines. These gains are especially pronounced in safety-critical scenarios, where our domain-aware sampling provides critical long-horizon context necessary for safe navigation.

#30
h=4

Gating Before Commitment: Anticipating Intent Divergence to Prevent Post-Interaction Decision Failures in Autonomous Driving

2026-08-26cs.RO cs.AICong Xu (h=4)
Cong Xu, Ravi Sankar
Core Contributions
  • Targets intent misinterpretation during vehicle interactions as a specific, recurring cause of planning failures, inserting a gating decision layer upstream of the corridor-envelope planner that reads structured intent descriptors and computes a smoothed intent-geometry divergence score before the plan is committed.
  • Tested on a replayed off-road-departure case and four crash clips under a frozen, disclosed implementation — an unusually transparent evaluation setup — where gating is the only layer among those tested that actually repairs the plan, firing 72ms after drift onset but 161ms before corridor exit.
  • The first calibration produced nine false triggers in 5.9 minutes, traced to scoring uncertainty as a half-conflict; a preregistered redesign treating uncertainty as abstention cuts this to 0.341 per minute — a concrete before/after fix for a diagnosed failure mode.
  • Two ablations bound what the model contributes: it detects fastest on 4 of 5 failures under deployed eligibility, while at equal false-positive rates the underlying geometric rule alone more than triples detection on in-domain tracks — the paper is candid that gating, not the full learned model, does most of the safety-critical work.
Show abstract

Intent misinterpretation during vehicle interactions causes recurring planning failures. We study a decision layer in which a language-guided intent module reads structured descriptors, computes a smoothed intent-geometry divergence score, and gates the planned maneuver before commitment, upstream of a corridor envelope. On a replayed off-road departure and four crash clips under a frozen, disclosed implementation, gating is the only layer that repairs the plan: on the main case it fires 72 ms after the drift onset but 161 ms before the corridor exit, keeping the trajectory in the corridor in all ten replays. The first calibration draws nine false triggers in 5.9 minutes, each from scoring uncertainty as half a conflict; a preregistered redesign treating uncertainty as abstention cuts this to 0.341 per minute. Two ablations bound the model's contribution: the full score detects fastest on four of five failures under the deployed eligibility, three of five against the unvetoed rule (000871 by one cycle; 000228 by a pre-onset fire on an uncertain stretch that five clips cannot classify as signal or coincidence; dropping the confidence term costs two detections), while on in-domain tracks at equal false positives the geometric rule more than triples its detection. The evidence supports the gating mechanism; the model's demonstrated roles are the fastest detection on these failures and an uncertainty veto on the geometric rule.

Robot & UAV Security: Spoofing and Trust

3 papers
#9
h=24

Trust-Aware Sequential Decision Making and Rollout Planning for Resilient Multi-Robot Systems

2026-08-26cs.MA cs.RONathaniel D. Bastian (h=24)
Roee M. Francos, Daniel Garces, Orhan Eren Akgün, Nathaniel D. Bastian, Stephanie Gil
Core Contributions
  • Studies multi-robot routing under a threat model existing planners ignore: agents whose reported localization is spoofed, breaking the assumption that agents execute what the planner anticipates.
  • Introduces a distance-constrained spoofing model for monitor-aware adversaries and a tiered bipartite matching attack strategy that maximizes assignment influence while staying under detection thresholds — a realistic adaptive adversary rather than worst-case unconstrained spoofing.
  • Defends with a trust-aware monitor combining probabilistic localization trust (calibrated on real GPS spoofing data) with behavioral evidence from task execution, removing detected adversaries from subsequent planning.
  • Shows undetected adversaries specifically break rollout's expected cost-improvement guarantee by violating planner-execution consistency, and that trust-aware removal restores this property — validated on real GPS spoofing data and San Francisco taxi demand.
Show abstract

Sequential decision-making in multi-robot systems typically assumes that planning information is reliable and that agents execute the actions anticipated by the planner. Compromised agents can violate both assumptions, creating a mismatch between the planning model and physical execution. We study this problem in online multi-robot routing under localization spoofing. We introduce a distance-constrained spoofing model for monitor-aware adversaries, together with a tiered bipartite matching strategy that maximizes assignment influence while limiting spoofing magnitude. To mitigate such attacks, we develop a trust-aware monitor that combines probabilistic localization trust, calibrated using real GPS spoofing data, with behavioral evidence from task execution to classify agents and remove detected adversaries from subsequent planning. We further show that undetected adversaries can cause rollout to lose its expected cost-improvement behavior by violating planner-execution consistency. Trust-aware removal restores this consistency after detection, enabling stable routing and recovery of rollout's empirical advantage over the base policy. Experiments using real GPS spoofing datasets and San Francisco taxicab demand demonstrate effective detection and resilient routing across varying spoofing capabilities, adversarial fleet sizes, adaptive attacks, monitoring configurations, and rollout horizons.

#26
h=6

Phantom Navigator: Stealthy and Precise Unmanned Aerial Vehicle Redirection with Real-Time Tracking and GPS Spoofing

2026-08-26cs.RO eess.SYMiroslav Pajic (h=6)
Haocheng Meng, Shaocheng Luo, Songqiao Xie, Miroslav Pajic
Core Contributions
  • Points out that existing UAV redirection attacks are unreliable, imprecise, or overt: physical capture is costly and single-shot, network hijacking needs deep access to encrypted channels, and sensor spoofing alone lacks accuracy — Phantom Navigator combines offline reachability analysis with online closed-loop execution to fix all three.
  • Offline pre-redirection reachability analysis estimates achievable redirect ranges before the attack starts, while an online closed-loop stealthy execution layer adjusts in real time to hit the designated location covertly.
  • Built as a real physical attack platform with LiDAR-camera detection, tracking, and spoofing, performing real-time identification, pose estimation, and targeted spoofing signal computation — demonstrated in real-world case studies, not just simulation.
  • Published as a security/red-team study to establish that precise, covert, targeted UAV redirection via sensor spoofing is practically achievable, relevant for anyone designing counter-UAV or GPS-denial-resilient navigation.
Show abstract

Redirecting unmanned aerial vehicles (UAVs) from their intended mission trajectories has been an active area of research. However, existing UAV redirection attacks lack reliability, precision, and covertness for a targeted diversion. They primarily rely on physical capture, communication hijacking, or sensor spoofing. Yet, physical interception is costly, offers only a single opportunity for success, and poses a high risk of collateral damage; network-based attacks demand deep technical expertise and access to encrypted communication channels; and sensor spoofing techniques typically fall short in achieving the accuracy and robustness required to steer a UAV toward a specified target. Consequently, we propose Phantom Navigator, a UAV redirection attack to mislead drones to a designated spoofing target, covertly and precisely. Our approach combines offline pre-redirection reachability analysis, which provides high-fidelity estimates of achievable redirect ranges, with an online closed-loop, stealthy execution layer that ensures successful redirection in practice. Based on this approach, we build a physical attack platform equipped with a LiDAR--camera detection, tracking, and spoofing stack that performs real-time identification, pose estimation, and computation of targeted spoofing signals to covertly and accurately redirect victim UAVs to a designated location. We demonstrate the effectiveness of our redirection methodology and the attack implementation in real-world case studies.

#28
h=6

SonicNudge: Controlled Displacement of Hovering UAVs via Estimator-Controller Coupling

2026-08-26eess.SY cs.ROMiroslav Pajic (h=6)
Shaocheng Luo, Ashir Raza, Haocheng Meng, David Hunt, Miroslav Pajic
Core Contributions
  • Prior UAV displacement attacks spoof sensors that directly report position or motion (GNSS, optical flow) — SonicNudge instead targets the gyroscope, showing low-level inertial errors alone can be converted into controlled displacement of a hovering drone.
  • Exploits estimator-controller coupling: an ultrasonic-resonance gyroscope perturbation persists as an attitude-estimation bias, which the flight controller then converts into a shifted hover point — an indirect attack path through the state estimator rather than a direct position spoof.
  • Specifically relevant to precision-dependent UAV tasks (perimeter denial, inspection, docking, landing alignment, close-proximity operation) where meter-scale position errors are operationally meaningful even though the attack looks like ordinary sensor noise.
  • Validated in a PX4-style flight stack across 81 simulation runs plus 10+ physical experiments, arguing UAV security needs to look beyond direct navigation spoofing toward low-level estimator-controller coupling.
Show abstract

UAV displacement attacks have traditionally relied on spoofing sensors that directly report position or translational motion, such as GNSS and optical flow. In this work, we introduce SonicNudge, a new attack primitive that instead targets the gyroscope and shows that low-level inertial errors can be transformed into controlled displacement of hovering or slow-moving UAVs. The attack exploits estimator--controller coupling: a small gyroscope perturbation by ultrasonic resonance can persist as an attitude-estimation bias, and the flight controller can convert this biased estimate into a shifted hover point. This behavior is especially relevant to UAV tasks that require hovering, station-keeping, slow approach, or precise final alignment, such as perimeter denial, inspection, docking, landing alignment, and close-proximity operation, where meter-scale position errors can be operationally meaningful. We analyze this attack primitive in a PX4-style flight stack and validate it through 81 simulation runs and more than 10 indoor/outdoor physical experiments, showing that displacement is governed by estimator weighting, bias observability, and closed-loop position correction. Our study suggests that UAV and vehicle-system security should look beyond direct navigation spoofing and pay closer attention to low-level inertial errors and estimator--controller coupling as a subtle but important attack surface.

Manipulation: Grasping, Packing & Bimanual Control

3 papers
#4
h=32

Low-Resolution Perception for Robotic Packing

2026-08-26cs.ROA. Zanchettin (h=32)
Giuseppe Fabio Preziosa, Federico Vignoni, Chiara Castellano, Marco Faroni, Andrea Maria Zanchettin
Core Contributions
  • Targets scalable packing perception using cheap, low-resolution depth sensors rather than assuming high-cost, high-resolution sensing is required.
  • Couples next-view selection to reconstruction cues and grasp evidence to a per-object stability estimate, so the system jointly decides what to look at next and when it's confident enough to grasp, instead of treating viewing and grasping as separate stages.
  • The Next Best View strategy explicitly avoids redundant views while preserving task-relevant geometry — important at low resolution where every view carries less information.
  • Validated with an ablation of the NBV utility function specifically under very low resolution, plus a full end-to-end policy comparison, isolating how much benefit comes from the view-selection strategy itself.
Show abstract

This work tackles the problem of scalable perception for robotic packing with low-cost, low-resolution depth sensing. We propose a framework where reconstruction cues drive next-view selection and grasp evidence updates a per-object stability estimate, jointly deciding what to acquire next and when to grasp. During the reconstruction, a low-resolution Next Best View (NBV) strategy explicitly avoids redundant views while preserving task-relevant geometry. We validate the approach in two steps: (i) an ablation study of the utility function under very low resolution, and (ii) a full end-to-end evaluation across policies, showing how low-resolution perception is a practical, scalable option for robotic packing.

#14
h=13

PRISM: Projection-Integrated Sampling-Based MPC with Bayesian Cost Tuning for Bimanual Manipulation

2026-08-26cs.ROKarl Kruusamäe (h=13)
Alinjar Dan, Iryna Hurova, Karl Kruusamäe, Arun Kumar Singh
Core Contributions
  • Uses a GPU-accelerated physics simulator as an online world model inside a sampling-based MPC loop for bimanual manipulation, rather than a simplified analytic dynamics model, letting the controller reason about genuinely contact-rich dual-arm interaction during planning.
  • The core contribution decouples trajectory exploration from feasibility: sampled joint-velocity trajectories are projected via a QP onto the feasible set (position/velocity/acceleration/jerk bounds) before rollout, rather than rejecting infeasible samples after the fact.
  • A custom ADMM/Bregman-splitting QP solver exploits joint-wise separability and reusable matrix factorizations to make this per-step projection fast enough for real-time execution, while Bayesian optimization tunes task-cost weights offline.
  • Shows improved robustness and success over sampling-based baselines on challenging PerAct² variants and demonstrates sim-to-real transfer on dual UR5e arms while keeping near-real-time execution.
Show abstract

Bimanual manipulation in cluttered, contact-rich environments remains challenging because it requires coordinated motion generation, interaction-aware planning, and reliable execution under tight kinematic constraints. We present PRISM, a projection-integrated sampling-based Model Predictive Control (MPC) framework that uses a GPU-accelerated physics simulator as an online world model for complex dual-arm manipulation. The main algorithmic contribution is a QP-guided control sampling strategy that decouples trajectory exploration from kinematic feasibility. At each MPC step, sampled joint-velocity trajectories are projected onto the set of motions satisfying joint position, velocity, acceleration, and jerk bounds, together with an initial-velocity boundary condition, before rollout evaluation. This enables broad yet feasible exploration of coordinated bimanual behaviors. To support efficient online execution, we derive a custom ADMM/Bregman-splitting QP solver that exploits joint-wise separability and reusable matrix factorizations. We further use Bayesian optimization to tune task-cost weights offline, reducing manual parameter selection. We evaluate PRISM on challenging variants of PerAct$^{2}$ tasks, including obstacle-constrained ball transport, tray transport, cube handover, and box lifting. Experiments show improved robustness and task success relative to representative sampling-based baselines, while maintaining real-time or near-real-time execution. We also demonstrate successful sim-to-real transfer on dual UR5e manipulators, highlighting the practical potential of physics-based online planning for contact-rich bimanual manipulation. Project details, including code and supplementary videos, are available at \href{https://sites.google.com/view/prismbimanual}{\texttt{https://sites.google.com/view/prismbimanual}}.

#21
h=8

Fast Generative Grasping via Lie Group-Constrained MeanFlow

2026-08-26cs.RORuiqi Ni (h=8)
S. Talha Bukhari, Yi Wei, Ruiqi Ni, Zachary Kingston, Aniket Bera
Core Contributions
  • Grasp synthesis is inherently multimodal, and diffusion/flow-based generative grasping models capture that well but need many sampling steps, conflicting with time-critical robot operation — this paper builds a MeanFlow formulation on the product Lie group SO(3)×R³ to cut steps without losing multimodality.
  • Couples a purely algebraic semigroup consistency condition with Riemannian Conditional Flow Matching on the Lie group, anchoring the average velocity to the true data distribution — specific to the rotation+translation structure of grasp poses rather than a generic Euclidean adaptation.
  • Samples reliable grasps in ≤5 network evaluations, matching state-of-the-art diffusion/flow grasping performance on ACRONYM at millisecond-scale latency — up to 39x faster inference.
  • Transfers directly to real-world grasping without additional training or domain adaptation, and specifically demonstrates robustness under observation noise.
Show abstract

Grasp synthesis is a core task in robotic manipulation, for which the solution typically forms a multimodal distribution rather than a point estimate. Generative robotic grasping aims to learn this distribution with deep generative models such as diffusion and flow-based approaches. The iterative nature of such generative models makes them flexible and generalizable; however, multi-step sampling impedes the time-critical operation required in robotics. We devise an approach to fast generative grasping based on MeanFlow on the product Lie group $\mathcal{G} = \mathrm{SO}(3) \times \mathbb{R}^3$. The training objective couples a purely algebraic semigroup consistency condition with Riemannian Conditional Flow Matching on $\mathcal{G}$ that anchors the average velocity to the data distribution. The resulting Lie Group-constrained MeanFlow formulation samples reliable grasps in $\leq 5$ network evaluations, matching the grasp generation performance of state-of-the-art diffusion and flow-based models on the ACRONYM dataset at millisecond-scale inference latency (up to $39\times$ speed-up). We further demonstrate that the approach directly translates to real-world robotic grasping without additional training or domain adaptation, exhibiting robust grasp synthesis under observation noise.

Control & Motion Planning for Aerial and Humanoid Systems

3 papers
#7
h=28

LAC: Linear and Angular Compliance for Humanoid Whole-body Control

2026-08-26cs.ROM. Hayashibe (h=28)
Yang Liu, Zhongkai Gu, Wei Zhu, Mitsuhiro Hayashibe
Core Contributions
  • Most humanoid controllers either reject external forces as disturbances or allow compliance only in limited body links while ignoring angular effects — LAC instead delivers commanded linear and angular compliance simultaneously across the whole upper body.
  • Synthesizes training data by sampling force/couple events on contact frames drawn from human interaction data, using a virtual admittance at each contact link under commanded stiffness.
  • Trains a single policy via teacher-student RL to track these compliant motions under external wrenches, rather than training separate controllers per contact scenario.
  • Demonstrates monotonic stiffness modulation across the full commanded range in both simulation and real hardware, and shows applicability to teleoperated loco-manipulation tasks needing adjustable, predictable compliance.
Show abstract

Real-world humanoid tasks involve physical interaction with objects and humans, yet current controllers either reject external forces as disturbances or restrict compliance to limited body links while ignoring angular effects. We present LAC, a general whole-body controller that simultaneously realizes commanded Linear and Angular Compliance for wrenches applied to the upper body. First, we synthesize whole-body compliant responses into a large-scale augmented dataset. Sampled force and couple events are imposed on contact frames extracted from human interaction data. At each contact link, the external force and a virtual torque from the passively yielding kinematic chain drive a virtual admittance under the commanded stiffness. Subsequently, teacher-student reinforcement learning trains a single policy to track the compliant motions under external wrenches. Finally, extensive simulation and real-world experiments demonstrate whole-body compliant responses to wrenches across the upper body, monotonic modulation over the full range of both stiffness commands, and applicability to teleoperated loco-manipulation tasks. Project website: https://lac-humanoid.github.io/

#15
h=12

Towards safe and optimal flight: Viability Kernel MPC for Fully Actuated Multirotor

2026-08-26cs.RO eess.SYGiulia Michieletto (h=12)
Massimiliano Bertoni, Alberto Piccina, Gianni Lunardi, Elias Fontanari, Andrea Del Prete
Core Contributions
  • Combines viability theory with data-driven methods inside an MPC framework to generate safe pose trajectories for fully actuated multirotors, aiming for formal safety guarantees rather than only empirical obstacle-avoidance performance.
  • Enforces obstacle avoidance through dynamically computed axis-aligned bounding boxes rather than exhaustive offline reachability analysis, trading some conservatism for tractable real-time computation.
  • Targets fully actuated platforms specifically (validated on a tilted hexarotor), where extra actuation authority changes what safe trajectories look like compared to standard underactuated quadrotors.
  • Demonstrates real-time computational performance in cluttered simulated environments, positioning the method for industrial aerial robotics where both safety guarantees and computational efficiency are hard requirements simultaneously.
Show abstract

Industrial aerial robotics demands safety guarantees for navigation in unstructured environments while optimizing performance and computational efficiency. This paper presents a method for generating safe pose trajectories for fully actuated multirotors within a Model Predictive Control (MPC) framework, leveraging both viability theory and data-driven methods. Obstacle avoidance is enforced through dynamically computed axis-aligned bounding boxes, providing formal safety guarantees without exhaustive offline reachability analysis. Numerical simulations on a fully actuated tilted hexarotor validate the approach, demonstrating successful navigation in cluttered environments with real-time computational performance.

#23
h=7

Anytime Global Tensor Motion Planning

2026-08-26cs.ROA. T. Le (h=7)
Sai Coumar, An T. Le, Zachary Kingston
Core Contributions
  • Generalizes Global Tensor Motion Planning so adjacent-layer edges in its layered multipartite graph can be realized by any black-box local planner (interpolation, splines, sampling-based planning, trajectory optimization, generative sampling), rather than being tied to one edge-construction method.
  • Provides two anytime policies: random-restart GTMP, proven to cover every homotopy class almost surely at a fixed budget, and AO-GTMP, an informed-expansion variant with growing budgets that converges to the optimal-cost solution.
  • Proves that adding more samples per layer reduces per-layer miss probability exponentially, while a stronger local planner only reduces the required layer count sublinearly — telling practitioners where to spend budget for the biggest reliability gain.
  • Matches state-of-the-art performance on manipulation benchmarks and, on 2D navigation, returns batches of topologically diverse solutions where informed baselines concentrate on just one or two homotopy classes.
Show abstract

Global Tensor Motion Planning (GTMP) solves motion planning with batched tensor operations over a layered multipartite graph. We generalize GTMP so that adjacent-layer edges are realized by any black-box local planner (e.g., linear interpolation, splines, sampling-based planning, trajectory optimization, or generative sampling). We provide two anytime policies on top of this generalization: Anytime GTMP with random restarts at a fixed budget, which covers every homotopy class almost surely, and AO-GTMP with informed expansion with growing budgets, which converges to the optimal cost. We prove that a single sampled graph covers every endpoint-fixed homotopy class admitting a \(δ\)-clear representative of bounded length. We also prove that additional samples per layer reduce the per-layer miss probability exponentially, whereas stronger local planners reduce the required layer count only sublinearly. On manipulation benchmarks the method matches state-of-the-art performance, and on 2D navigation it returns batches of topologically diverse solutions, while the informed baselines concentrate on one or two classes.

Perception, Simulation & Industrial Robotics

5 papers
#1
h=111

VBVR-Pro: A Scalable and Verifiable Suite for Native Visual Reasoning

2026-08-26cs.CV cs.AI cs.LG cs.MM cs.ROPhilip H. S. Torr (h=111)
Junxiang Xu, Ruisi Wang, Fanyi Pu, Maijunxian Wang, Ran Ji
Core Contributions
  • Frames visual generation itself as the reasoning medium — images/videos aren't just outputs or inputs to be understood but the substrate the model reasons within — rather than treating vision as a preprocessing step feeding a language-based reasoner.
  • Turns visual reasoning into a controlled task space of 300 procedurally generated tasks with deterministic, task-specific reward scorers, addressing a documented failure mode where VLM-as-judge evaluation is unreliable for grounded tasks.
  • Shows strong transfer beyond its own suite to seven external benchmarks (RISE-Video, MME-CoF-Pro, BabyVision, etc.), evidence the learned reasoning isn't overfit to the 300 procedural training tasks.
  • Systematically compares 30+ image, video, and interleaved generators and finds video generation wins specifically on tasks needing persistent spatiotemporal state tracking, while interleaved generation is a compute-efficient alternative.
Show abstract

Native visual reasoning treats visual generation as the medium of reasoning itself: visual states (i.e. images and videos) are not merely inputs to be understood or outputs to be rendered, but first-class substrates for problem solving beyond language. Yet progress remains bottlenecked by the lack of scalable training tasks, reliable feedback, and controlled comparisons across generative substrates. In this work, we introduce VBVR-Pro, a closed-loop testbed that makes native visual reasoning through generation trainable, verifiable, optimizable, and experimentally controllable. 1) Task scaling. VBVR-Pro turns visual reasoning into a controlled task space of 300 procedurally generated tasks. Models trained on VBVR-Pro show strong transfer beyond the proposed suite across seven external visual reasoning benchmarks such as RISE-Video, MME-CoF-Pro, and BabyVision. 2) Verifiable rewards. VBVR-Pro provides verifiable reward scorers for task-grounded evaluation. Through a systematic study of leading MLLMs as judges, we identify recurring failure modes of the prevalent VLM-as-a-judge paradigm. In contrast, the proposed scorers are grounded in deterministic, task-specific rules, achieve fine-grained alignment with human judgments. Importantly, they serve as reliable reward signals for large-scale multi-task reinforcement learning and demonstrate stronger post-RL performance across visual reasoning tasks. 3) Mechanism study. VBVR-Pro enables controlled modality studies across more than 30 image, video, and interleaved generators. Our analysis shows that video generation remains strongest for tasks requiring persistent spatiotemporal state tracking, while interleaved generation provides a compute-efficient alternative. Critically, ablations and probing suggest the presence of vision-native trajectories that are crucial to visual reasoning. We release all data, models, scorers, and code.

#5
h=29

VirTooS: A ROS 2 - Unity Virtualization Toolkit for Fleet Management of Autonomous Mobile Robots

2026-08-26cs.ROG. Notarstefano (h=29)
Andrea Drudi, Lorenzo Pichierri, Andrea Testa, Giuseppe Notarstefano
Core Contributions
  • Combines ROS 2 with Unity to give fleet-management researchers a mixed-reality environment where real and virtual robots and sensors (e.g., LiDAR) interact seamlessly, rather than requiring an all-simulation or all-hardware setup.
  • Built on the ChoiRbot framework with tailored routines for distributed robotics experiments, aimed specifically at multi-robot task-assignment problems rather than single-robot simulation.
  • Ships as a containerized suite for easy deployment across machines and will be open-sourced, lowering the barrier for other groups to run mixed-reality fleet experiments without rebuilding the toolkit.
  • Demonstrated on a motivating task-assignment example showing real and virtual robots interacting, evidence the mixed-reality bridge works for coordination tasks and not just visualization.
Show abstract

In this paper, we present VirTooS, a Python/C# toolkit designed to implement fleet-management tasks on teams of Autonomous Mobile Robots (AMRs). VirTooS leverages the Robot Operating System (ROS) 2 and Unity game engine to provide realistic, scalable virtual experiments in a mixed-reality environment. The toolbox allows users to easily generate and customize virtual scenarios for realistic simulations. Virtual and real sensors as, e.g., LiDARs, can be exploited to map and safely navigate in the mixed-reality environment. To enable distributed robotics experiments, we propose a set of tailored routines leveraging the ChoiRbot framework. As a motivating example, we show a set of experiments for task assignment problems in a virtual environment, allowing seamless interaction among real and virtual robots. Moreover, the package comes with a containerized suite to easily deploy it on different machines. The source code will be made publicly available on GitHub.

#6
h=29

Transient multimode heat transfer of an industrial automated tape laying process under rapidly changing conditions

2026-08-26cs.ROA. Mueller (h=29)
Bernhard Rameder, Hubert Gattringer, Andreas Müller, Ronald Naderer
Core Contributions
  • Builds a transient heat-transfer model for automated tape laying that solves the full heat-conduction equation with coupled advection, conduction, convection, and radiation, rather than relying on the simplified steady-state or 1.5D models common in composite manufacturing.
  • Introduces an analytical view-factor approach accounting for finite emitter and tape widths, correcting a systematic radiative-flux overestimation baked into standard 1.5D simplifications.
  • Represents the tape substrate with a two-node model that resolves the physical phase shift between the heated surface and the monitored surface — a distinction simpler models collapse.
  • Validated on an industrial ATL line with only 1.08% NRMSE deviation under rapid velocity and current modulation, supporting real-time thermal state estimation for in-situ consolidation quality control.
Show abstract

This work presents a transient heat-transfer model of an industrial automated tape laying (ATL) process designed to overcome the limitations of conventional thermal models in composite manufacturing. The model solves the heat-conduction equation with coupled advection, conduction, convection, and radiation. A key innovation is the implementation of an analytical view factor approach that accounts for finite emitter and tape widths, thereby correcting systematic overestimations of radiative heat flux inherent in 1.5D simplifications. Furthermore, a local convection assessment incorporates mixed convection effects characterized by the Richardson number, ensuring accuracy across a wide range of process speeds. The ATL system is represented by two interacting subsystems: the moving tape substrate and the infrared heat sources. The tape is discretized using a two-node model that resolves the physical phase shift between the heated and monitored surfaces. Numerical stability under high dynamics is ensured by a monolithic solution strategy using a high-order implicit integration scheme. Model predictions were validated on an industrial ATL line, demonstrating an overall deviation of only 1.08% (NRMSE) under rapid velocity and current modulations. This framework provides a high-fidelity, physics-based foundation for thermal state estimation, supporting consistent in-situ consolidation and improved part quality.

#12
h=16

Saliency-Depth Conditioning for Zero-Shot Segmentation of Communication-Tower Components in Cluttered UAV Imagery

2026-08-26cs.CV cs.AI cs.ROC. Yeum (h=16)
Ali Lesani, Chul Min Yeum, Su-Min Kang
Core Contributions
  • Targets zero-shot segmentation of communication-tower components specifically because task-specific models are hard to train given how few instance-level annotations exist for this inspection domain.
  • In cluttered UAV imagery, visually similar background structures confuse zero-shot segmenters — the fix is model-agnostic: combine appearance-based saliency with monocular relative depth to build a coarse tower prior that suppresses irrelevant background before segmentation runs.
  • Integrates this conditioning with two backbones (Grounded-SAM and SAM 3), producing SD-Grounded-SAM and SD-SAM 3, with geometric/depth-aware box refinement applied before mask generation for the Grounded-SAM variant.
  • On a new 340-image dataset (TOW-300), SD-SAM 3 achieves the strongest instance segmentation while SD-Grounded-SAM produces fewer false positives, with ablations confirming saliency, depth, and box refinement all contribute independently.
Show abstract

Fine-grained segmentation of communication-tower components in UAV imagery is essential for automated inspection, yet task-specific models are hard to develop due to limited instance-level annotations. Zero-shot segmentation models offer a promising alternative, but in cluttered scenes, visually similar background structures interfere with component localization, causing missed instances and false positives. We propose a model-agnostic saliency-depth foreground-conditioning strategy combining appearance-based saliency with monocular relative depth to construct a coarse tower prior and suppress irrelevant content. We integrate this module with Grounded-SAM and SAM 3, yielding SD-Grounded-SAM and SD-SAM 3. SD-Grounded-SAM further applies geometric and depth-aware box refinement before mask generation, while SD-SAM 3 relies on SAM 3's internal setup. On TOW-300, a dataset of 340 communication-tower UAV images, our strategy improves both baselines: SD-SAM 3 achieves the strongest instance-segmentation performance, while SD-Grounded-SAM produces fewer false positives. Ablations confirm complementary gains from saliency, depth, and box refinement, improving robustness in cluttered scenes.

#24
h=7

Opportunities of Self Supervised Learning for GNSS: Evaluation of a Deep Learning-Enhanced PVT Algorithm

2026-08-26cs.ROBertrand Ekambi (h=7)
Thomas Barbero, Bertrand Ekambi
Core Contributions
  • Targets multipath interference in dense urban GNSS positioning by jointly predicting range corrections and their uncertainty in a supervised objective, rather than only producing a point correction with no confidence estimate.
  • Adds a JEPA-based self-supervised pretraining stage to improve representation quality before the supervised objective, aiming to exploit large amounts of unlabeled GNSS data that would otherwise go unused.
  • Evaluated across diverse driving scenarios, with the largest reported gains specifically in unseen harsh urban conditions — the regime where classical multipath mitigation typically struggles most.
  • Its main claim is that self-supervised pretraining on unlabeled GNSS data measurably improves generalization, relevant to any ground robot or vehicle relying on GNSS for outdoor localization in cities.
Show abstract

This work proposes a Deep Learning Enhanced PVT algorithm to mitigate multipath interference in dense urban areas. A supervised objective jointly predicts range corrections and uncertainty, while a JEPA-based self-supervised pretraining stage improves representation quality. The algorithm is evaluated over diverse driving scenarios, substantially improving PVT accuracy, particularly for unseen harsh urban conditions. These results highlight the potential of unlabelled GNSS data to improve generalization performance.