πŸ€– Robotics arXiv Digest

Monday, June 29, 2026
πŸ“„ 30 papers πŸ“‚ 7 research areas Generated by Claude

πŸ”­ Research Landscape

Today's 30 papers split cleanly between a learning-heavy mainstream and a classical estimation-and-control backbone, and within the learning crowd the dominant move is to put explicit structure and memory back into otherwise opaque feed-forward policies. Chronos (#9) is the clearest statement of the thesis: it argues that VLA and generative imitation policies relying on the current observation take a 'Markovian shortcut' and elevates full observation history to the policy's latent state. SA-VLA (#26) makes the same complaint one level down, showing that a state-blind action tokenizer maps identical codes to wrong continuous actions, while ZR-0 (#16) injects dense Embodied Chain-of-Thought to align the shared high-level cognition across embodiments, SIR (#4) swaps opaque embeddings for sparsified scene graphs, and SPARK (#8) β€” a training-free neurosymbolic planner β€” more than doubles agentic and VLA baselines on LIBERO-PRO (43.7% vs 18.2%) precisely by spending compute on anchored perception rather than re-querying an LLM each turn. The recurring claim across these papers is that the binding constraint on generalist policies is structure, state, and memory β€” not more parameters or data.

A second strong current is manufacturing or transferring the supervision that policies need, especially across embodiment and sensor gaps. VLK (#10) reconstructs metric-scale scenes with Gaussian Splatting to synthesize vision-language-kinematics tuples no dataset provides; WARP (#7) and X-Morph (#22) both attack the human-to-robot embodiment gap, the former removing the action multi-modality that stops imitation from converging, the latter enforcing physical consistency when retargeting human motion onto quadrupeds and hexapods. STEAM (#19) extracts frame-level advantages from demonstrations with no reward labels, and ConCent (#23) pushes data efficiency to a single demonstration by making contact reproduction the central objective of sim-to-real. The tactile papers form their own version of this theme: Heterogeneous Tactile Transformer (#14) pools data across incompatible sensors toward a touch foundation model, and 'Seeing Touch from Motion' (#29) unifies image and motion-field tactile cues β€” together signaling that touch is following vision and language toward shared, transferable representations.

The third theme is a reminder that the field's estimation and control backbone is very much alive: the day's most-cited authors sit there, not in the VLA crowd. The top-ranked privacy-preserving cooperative localization paper (#1, h=35) recasts multi-robot localization as semidefinite programming over inscribed ellipsoids that exchanges only dual variables, and lateral platoon string stability (#2, h=33) extends a classical safety guarantee to the lateral axis as autonomy goes map-free. Around them sits a dense SLAM/perception cluster β€” closed-loop Gaussian SLAM with geometric feedback (MyGO-Splat #25), spherical multi-camera VIO (#30), test-and-check robust pose-graph optimization (#24), and point-supervised and panoramic tracking (#5, #28). Notably, MyGO-Splat's closed-loop geometry mirrors ReactiveBFM's (#3) closed-loop reactivity for humanoids: 'close the loop' is the day's quiet refrain, whether the feedback is geometric, physical, or cognitive. Taken together, the batch reads as a field converging on reliability β€” pursued through structured policies, cheaper transferable supervision, and feedback-driven estimation alike.

VLA & Embodied Agents

Generalist vision-language-action policies and embodied agents: state-aware tokenization, dense chain-of-thought alignment, neurosymbolic planning, and automated agent-architecture search.

  • #8 Sequential Planning via Anchored Robotic Keypoints
  • #11 Automating the Design of Embodied AgentArchitectures
  • #16 Training Vision-Language-Action Models with Dense Em...
  • #26 SA-VLA: State-aware tokenizer for improving Vision-L...

Robot Learning & Continual Adaptation

Policy representations and learning under change: scene-graph structure, full-history non-Markovian state, self-supervised advantages, cross-morphology motion priors, and lifelong driving.

  • #4 SIR: Structured Image Representations for Explainabl...
  • #9 Chronos: A Physics-Informed Full-History Framework f...
  • #12 Learning from Mistakes: Rollout-Retrieval Lifelong P...
  • #19 STEAM: Self-Supervised Temporal Ensemble Advantage M...
  • #22 X-Morph: Human Motion Priors for Scalable Robot Lear...

Humanoid & Whole-Body Control

Reactive and data-scalable whole-body skills: closed-loop motion planning, human-to-robot retargeting, and synthetic vision-language-kinematics for loco-manipulation.

  • #3 ReactiveBFM: Reactive Closed-Loop Motion Planning To...
  • #7 WARP: Whole-Body Retargeting for Learning from Offli...
  • #10 VLK: Learning Humanoid Loco-Manipulation from Synthe...

Tactile & Contact Manipulation

Contact-rich interaction: a sensor-agnostic tactile foundation model, contact-centric real-to-sim-to-real transfer, and motion-correlation visuo-tactile policies.

  • #14 Heterogeneous Tactile Transformer
  • #23 ConCent: Contact-Centric Real-to-Sim-to-Real Learnin...
  • #29 Seeing Touch from Motion: A Unified Modality-Aware V...

Navigation & Human-Aware Interaction

Embodied navigation and legible assistance: human-routine memory, belief-communicating shared autonomy, world-action VLN, and one-step generative image-goal navigation.

  • #17 HUMEMBR: Learning Human Routines for Predictive Embo...
  • #18 Legible Shared Autonomy: Implicit Communication of R...
  • #21 FutureNav: Unified World-Action Modeling for Vision-...
  • #27 RoamFlow: Reinforcement-Aligned One-Step Action Mean...

SLAM, Tracking & State Estimation

Geometry and estimation: privacy-preserving cooperative localization, point-supervised and panoramic tracking, robust pose-graph optimization, closed-loop Gaussian SLAM, and spherical multi-camera VIO.

  • #1 Privacy-Preserving Decentralized Cooperative Localiz...
  • #5 PS-MOT: Cultivating Instance Awareness from Point Se...
  • #24 TACO: A Test and Check Framework for Robust Pose Gra...
  • #25 MyGO-Splat: Multi-Objective Closed-Loop Geometric Fe...
  • #28 CylindTrack: Depth-Aware Cylindrical Motion Modeling...
  • #30 Sphere-VIO: Fast and Robust Visual-Inertial Odometry...

Control, Aerial & Hardware Systems

Control theory and field platforms: lateral platoon string stability, risk-aware UAV inspection planning, edge LM swarms for drones, Koopman dynamics for tethered space systems, and a compliant soft arm.

  • #2 Lateral String Stability for Vehicle Platoons
  • #6 MOAR Planner: Multi-Objective and Adaptive Risk-Awar...
  • #13 AERIS: Aerial-Edge Role-Driven Intelligence at Runti...
  • #15 Data-Driven Modeling and Control for Tethered Space...
  • #20 Real-Time Compliance and Position Control of a Hyper...
VLA & Embodied Agents
#8 h=11

Sequential Planning via Anchored Robotic Keypoints

2026-06-29 cs.RO πŸ‘€ Zachary Patterson (h=11)
Bryce Grant, Aryeh Rothenberg, Logan Senning, Zonghe Chua, Zach Patterson
Core Contributions
  • A training-free neurosymbolic manipulation system, SPARK reaches 43.7% on six LIBERO-PRO position & task cells β€” more than doubling CaP-Agent0 (18.2%) and VLA baselines.
  • Diagnoses perception as the layer that fails most under position and task changes, so SPARK spends its computation there instead of re-querying an LLM every turn.
  • A single Gemini call composes the plan as a typed program over anchored keypoints, avoiding the restart-from-scratch behavior that makes agentic baselines fragile to minor failures.
  • Evidence that smart, anchored perception plus one-shot planning beats repeated LLM code generation for robustness under distribution shift.
Show abstract
We present Sequential Planning via Anchored Robotic Keypoints, SPARK, a training-free neurosymbolic manipulation system that reaches 43.7% on six LIBERO-PRO position \& task cells, more than doubling CaP-Agent0 and Vision-Language-Action (VLA) baselines. CaP-Agent0, a multi-turn code-generation agent, achieves 18.2% by re-querying an LLM at every turn, but its restart-from-scratch solution proves costly against minor policy failures. Perception is the layer that fails most under position and task changes so SPARK spends its computation there. A single Gemini call composes the plan as a typed behavior tree (BT) of composable primitives, each already containing the low-level control (motion, grasping, depth geometry) a code-generation agent would otherwise regenerate on every trial. The rest of the budget goes to perception: a second Gemini call proposes three alternative text prompts per object, SAM3 evaluates each, and we keep the prompt$\to$label pair with the most confident detection and a recovery loop then retries a failed primitive against freshly detected objects, with no new LLM call. The alternative prompts add +27.7 points on the spatial suite and +10.0 on the object suite, with the recovery loop adding +5.0 overall. SPARK runs the same primitives on three robot families (UR10e, Franka FR3, bimanual Franka) across nine unique tasks at twenty trials each, averaging 68%. Since the detector, planner, and controller modules sit behind the typed plan, they swap independently without training, and each primitive's checkable post-condition traces a failure to the corresponding module or a kinematic limit. Every trial logs a verified, labeled trajectory, so a training-free planner that already beats VLAs can supply the data those policies need without teleoperation. Project page: https://cwru-aism.github.io/spark-page/
#11 h=8

Automating the Design of Embodied AgentArchitectures

2026-06-29 cs.ROcs.AIcs.LG πŸ‘€ G. Zhou (h=8)
Jian Zhou, Sihao Lin, Jin Li, Shuai Fu, Gengze Zhou
Core Contributions
  • Embodied agents are hand-designed compositions of perception, memory, planning, and action; where information is stored and how model calls connect still rests on researcher intuition.
  • Brings Agent Architecture Search β€” proven for text agents β€” to perceptual embodied agents evaluated through simulator rollouts, a transfer not previously tested systematically.
  • Introduces AgentCanvas, a typed-graph runtime that hosts and executes candidate architectures so the design space can be searched rather than guessed.
  • Matters because it automates a costly design step currently bottlenecked by human intuition.
Show abstract
Embodied agents are typically built as hand-designed compositions of perception, memory, planning, and action modules. This modularity exposes a large architectural design space, but current systems still rely on researcher intuition to choose where information is stored, how observations are processed, and how model calls are connected. Agent Architecture Search (AAS) automates such design for text-domain agents, but has not been systematically evaluated on perceptual embodied agents through simulator rollouts. We study this transfer. We introduce AgentCanvas, a typed-graph runtime that hosts embodied executors as editable node-and-wire programs with simulator-aware execution and episode-level logs, and KDLoop, a coding-agent search procedure that cycles through proposal, critique, experiment, and distillation, with triggered reflection after stalls. We evaluate three AAS variants across four embodied executors spanning vision-language navigation, embodied question answering, and language-conditioned manipulation. The resulting 3x4 matrix shows that architecture-level search can produce deployable and directional success-rate gains on embodied tasks, while one apparent high-scoring candidate is rejected as leak-bearing. At the same time, the experiments expose constraints that are muted in text-domain AAS: optimization signals can be masked by rollout noise, search can become trapped in local edit basins, and episode-level credit assignment only partially emerges even when detailed logs are available. These results characterize both the promise and the current limits of automated architecture search for embodied agents.
#16 h=6

Training Vision-Language-Action Models with Dense Embodied Chain-of-Thought Supervision

2026-06-29 cs.ROcs.CV πŸ‘€ Jing Zhang (h=6)
Haoyang Li, Guanlin Li, Youhe Feng, Chen Zhao, Zhuoran Wang
Core Contributions
  • Cross-embodiment transfer fails because low-level state and action spaces differ fundamentally across robots β€” yet the high-level cognitive process is largely shared.
  • ZR-0 is a 2.6B-parameter end-to-end VLA trained with dense Embodied Chain-of-Thought supervision to align cross-embodiment representations inside the vision-language model.
  • Pushes alignment into shared cognition (scene perception, object identification, task planning, sub-task decomposition) rather than shared low-level control.
  • Exploits what actually transfers across platforms, a more principled lever than forcing disparate action spaces to match.
Show abstract
Cross-embodiment transfer in vision-language-action (VLA) models remains challenging because low-level state and action spaces differ fundamentally across robot platforms. We observe that the high-level cognitive process underlying manipulation, including scene perception, object identification, task planning, and sub-task decomposition, is largely shared across embodiments. Based on this observation, we present ZR-0, a 2.6 billion parameter end-to-end VLA model that uses dense Embodied Chain-of-Thought (ECoT) supervision to align cross-embodiment representations within the vision-language model (VLM). ZR-0 adopts a dual-stream architecture: a pre-trained VLM (System 2) generates structured ECoT reasoning during training, while a Diffusion Transformer-based action expert (System 1) produces continuous action chunks via flow matching. The two components are coupled through cross-attention, with an attention mask that restricts the action expert to input prompt features only, enabling ECoT generation to be entirely skipped at inference without any performance loss. ZR-0 is pre-trained on ProcCorpus-60M, a large-scale dataset comprising approximately 60 million frames (approximately 1,000 hours) from over 400K trajectories, with dense ECoT annotations covering 96.8% of all frames. We evaluate ZR-0 on three simulation benchmarks spanning single-arm (LIBERO), bimanual (RoboTwin 2.0), and humanoid (RoboCasa GR-1 Tabletop) embodiments, as well as real-world experiments on the xArm platform, demonstrating strong performance across all settings. Code and model checkpoints are available at https://github.com/RUCKBReasoning/ZR-0.
#26 h=4

SA-VLA: State-aware tokenizer for improving Vision-Language-Action Models' performance

2026-06-29 cs.ROcs.AI πŸ‘€ Yao Mu (h=4)
Tengyue Jiang, Chunpu Xu, Jiayue Kang, Yao Mu
Core Contributions
  • Discrete action tokenizers map each code to a fixed continuous action prototype, ignoring the robot's proprioceptive state β€” so the same token can demand different controls under different configurations.
  • SA-VLA makes tokenization state-aware, conditioning continuous-action recovery on current joint configuration, object pose, and contact conditions.
  • Especially helps manipulation, where decoding a token correctly depends on state, tightening the discrete-to-continuous gap that limits autoregressive VLA accuracy.
  • Matters because the tokenizer, not just the policy, can be a hidden ceiling on VLA action fidelity.
Show abstract
Discrete action tokenization provides a compact interface for autoregressive VLA policies, but accurately recovering continuous robot actions from discrete codes remains challenging. Existing tokenizers typically map each discrete code to a fixed continuous action prototype, ignoring the robot's current proprioceptive state. This limitation is particularly pronounced in manipulation, where the same action token may require different continuous controls under different joint configurations, object poses, and contact conditions. We therefore propose SA-VLA, a state-aware action tokenizer that conditions action decoding on robot state. We study two state-injection mechanisms for VQ-based action tokenization: cross-attention between state and action features, and a lightweight state adapter that predicts action-wise modulation factors for state-conditioned action modulation and reconstruction. The adapter formulation expands the effective support of a finite codebook by allowing each discrete token to represent a family of state-dependent continuous actions, while preserving the efficiency and compatibility of discrete action modeling. Integrated into an LLM-based VLA policy, SA-VLA supports both autoregressive and parallel action-token decoding with minimal changes to the model interface. On 12 RoboTwin manipulation tasks, SA-VLA improves the average success rate from 0.29 to 0.56 over the strongest tokenizer baseline. In zero-shot sim-to-real experiments on three real-world tasks, it further improves average success from 0.15 to 0.33 over the strongest tokenizer baseline. These results demonstrate that state-conditioned action decoding is a simple and effective mechanism for reducing the compression gap in discrete VLA policies.
Robot Learning & Continual Adaptation
#4 h=22

SIR: Structured Image Representations for Explainable Robot Learning

2026-06-29 cs.ROcs.CV πŸ‘€ Rudolf Lioutikov (h=22)
Paul Mattes, Jan Schwab, Jens Bosch, Nils Blank, Maximilian Xiling Li
Core Contributions
  • Learned visual-embedding policies are opaque and easily distracted; SIR inserts Scene Graphs as an interpretable intermediate representation between pixels and actions.
  • Builds a fully connected graph from image-derived features, then learns end-to-end to sparsify it so the structure actually driving behavior becomes explicit and inspectable.
  • Why it matters: explainability and robustness to visual distractors come from architectural structure, not post-hoc saliency β€” a different bet than scaling opaque embeddings.
Show abstract
Existing robot policies based on learned visual embeddings lack explicit structure and are sensitive to visual distractions. Thus, the representations that drive their behaviour are often opaque, making their decision-making process difficult to interpret. To address this, we introduce Structured Image Representations (SIR), a method that leverages Scene Graphs (SGs) as an intermediate representation for robot policy learning. Our approach first constructs a fully connected graph, using image-derived features as initial node representations. Then, a module learns to sparsify this graph end-to-end, creating a task-relevant sub-graph that is passed to the action generation model. This process makes our model intrinsically explainable. Evaluations on RoboCasa show that our sparse graph policies outperform image-based baselines on average with 19.5% vs 14.81% success rate. Most importantly, we show that the learned sparse graphs are a powerful tool for model analysis. By analysing when the model's sub-graph deviates from human expectation, such as by including distractor nodes or omitting key objects, we successfully uncover dataset biases, including spurious correlations and positional biases. https://github.com/intuitive-robots/SIR_Model
#9 h=11

Chronos: A Physics-Informed Full-History Framework for Non-Markovian Long-Horizon Manipulation

2026-06-29 cs.RO πŸ‘€ Zhouping Yin (h=11)
Yulin Zhou, Yimeng Wang, Nengyu Wang, Shaojia Xing, Shiyun Tu
Core Contributions
  • Argues that VLA and generative imitation policies relying on current observations or short windows take a 'Markovian shortcut' that breaks when identical views demand different actions after different histories.
  • Elevates observation history from auxiliary context to the latent state of the policy's dynamics β€” treating the policy as a genuine dynamical system.
  • Physics-informed full-history framework forms one state representation per physical control step for non-Markovian long-horizon manipulation.
  • Matters because long-horizon task success often hinges on what happened earlier, not just what is currently visible.
Show abstract
General-purpose robot policies should be modeled as dynamical systems, yet many VLA and generative imitation policies still rely on present observations or short windows. This Markovian shortcut fails in memory-dependent manipulation: identical observations can demand different actions after different histories. We present Chronos, a physics-informed full-history framework for non-Markovian long-horizon manipulation. The key idea is to elevate observation history from auxiliary context to the latent state of the policy dynamics. At each physical control step, Chronos forms one state-representative token by fusing observation and proprioception, so the token sequence is aligned one-to-one with physical time. A selective state space model propagates this causal historical state, which conditions a multimodal coarse action prior through implicit maximum likelihood estimation (IMLE). This prior is then refined by a second-order Schrodinger-inspired bridge that predicts acceleration fields, yielding smoother and more physically grounded robot motion. Across 16 simulated tasks and 4 real-world experiments, Chronos is evaluated on precision insertion, general manipulation, and memory-dependent long-horizon control. On RMBench, where success requires remembering task phase, Chronos achieves 73.6% average success, outperforming Markovian VLA baseline pi0.5 by +62.4 percentage points, a 6.6x relative gain, while using 10x fewer parameters. It also surpasses the memory VLA Mem-0 by 22.8 points while using over 30x fewer parameters. In real-world dual-arm experiments using a single RGB camera, Chronos achieves 78% average success over four tasks, including 72% on the three memory-dependent tasks, whereas pi0.5 achieves 7% overall and 0% on the memory-dependent subset. These results suggest that history should not be treated as auxiliary context, but as the latent state of the manipulation policy.
#12 h=7

Learning from Mistakes: Rollout-Retrieval Lifelong Policy Learning for Autonomous Driving

2026-06-29 cs.ROcs.AIcs.CVcs.LG πŸ‘€ Jianwei Gong (h=7)
Cheng Gong, Haoyang Wang, Chao Lu, Zirui Li, Jianwei Gong
Core Contributions
  • Most driving policies are trained on expert demos and then lean on generalization, with no explicit mechanism to correct and retain failures exposed in closed-loop scenarios.
  • Reframes policy improvement as lifelong learning: a pretrained policy accumulates corrective knowledge derived from its own rollout mistakes.
  • Rollout-retrieval lets the policy recall relevant past corrections when facing long-tail traffic instead of re-deriving behavior from scratch.
  • Matters for deployment, where the decisive cases are exactly the rare ones absent from the original expert demonstrations.
Show abstract
Autonomous driving policies should be able to improve continually as deployment exposes them to increasingly diverse and long-tail traffic situations. However, most learning-based policies are trained or fine-tuned on expert demonstrations and then rely largely on generalization to handle challenging closed-loop scenarios, lacking an explicit mechanism to correct and retain the mistakes exposed in these scenarios. This paper studies autonomous driving policy improvement from a lifelong learning perspective: Can a pretrained policy improve continually by accumulating corrective knowledge derived from its own mistakes, while retaining previously acquired driving competence? To answer this question, we propose Rollout-Retrieval Lifelong Policy Learning (R$^2$LPL), a policy learning framework that retrieves corrective targets from recoverable policy-induced mistakes and retains the resulting knowledge through lifelong policy learning. R^2LPL addresses a key bottleneck in continual policy improvement: closed-loop mistakes reveal where the policy is weak, but do not directly specify what the policy should learn. By filtering recoverable mistake-related states and retrieving feasible corrective targets, R$^2$LPL turns sparse failure evidence into compact supervised knowledge for stable and sample-efficient policy improvement. We evaluate R$^2$LPL on large-scale closed-loop nuPlan benchmarks. With only a few rollout and continual-learning cycles, R$^2$LPL elevates a learning-based planner with moderate initial performance to state-of-the-art performance across the evaluated benchmarks, especially on the challenging and long-tail Test14-hard split. These results demonstrate the effectiveness of R$^2$LPL in converting recoverable closed-loop mistakes into corrective knowledge for sustained policy improvement.
#19 h=6

STEAM: Self-Supervised Temporal Ensemble Advantage Modeling for Real-World Robot Learning

2026-06-29 cs.RO πŸ‘€ Yu Wang (h=6)
Zhihao Liu, Qiuyi Gu, Yitao Wang, Dongming Qiao, Yixian Zhang
Core Contributions
  • Real-world robot data mixes useful progress with stalls, corrections, and suboptimal behavior; effective learning needs frame-level advantages that separate reliable progress from regressions.
  • STEAM is label-free: it trains an ensemble of temporal-offset predictors on frame pairs within expert trajectories, using normalized temporal offset as self-supervision.
  • Yields per-frame advantage signals from demonstrations alone β€” no reward labels β€” so heterogeneous data can be filtered for what genuinely helps.
  • Matters because the cost of advantage labels, not data volume, is the practical bottleneck for real-world policy learning.
Show abstract
Real-world robot learning increasingly relies on heterogeneous data, but demonstrations and rollouts often mix useful progress with stalls, corrections, and suboptimal behavior. Effective policy learning therefore requires frame-level advantages that distinguish reliable local progress from failures and regressions. We propose Self-supervised Temporal Ensemble Advantage Modeling (STEAM), a label-free method that learns such advantages from expert demonstrations. STEAM trains an ensemble of temporal-offset predictors on frame pairs within expert trajectories, using the normalized temporal offset between two frames as a self-supervised signal. Each predictor maps a frame pair to a distribution over temporal offsets, which is converted into a scalar advantage. STEAM then takes the minimum advantage across the ensemble to score mixed-quality rollout data conservatively. Across real-world bimanual towel folding, chip checkout, cola restocking, and single-arm pick-and-place tasks, STEAM identifies stalls, failures, and recoveries. When combined with CFGRL, STEAM further improves policy success rate by 59%, 54.3%, 23% and 16.2% over baselines, respectively.
#22 h=5

X-Morph: Human Motion Priors for Scalable Robot Learning Across Morphologies

2026-06-29 cs.RO πŸ‘€ Chengyang He (h=5)
Ritwik Sharma, Shivam Sood, Arhaan Jain, Shyam Charan Kesavamoorthi, Chengyang He
Core Contributions
  • Humanoid progress rides on abundant human motion data, but comparable data is scarce for non-humanoid legged robots like quadrupeds, hexapods, and quadruped manipulators.
  • Direct human-to-robot retargeting produces motions that look plausible yet are physically inconsistent or hard to track under robot dynamics.
  • X-Morph converts human motion into deployable locomotion and loco-manipulation across morphologies while enforcing physical consistency.
  • Matters as a way to transfer the human-motion data advantage to embodiments that lack their own large motion corpora.
Show abstract
Recent progress in humanoid behavior models has been driven in large part by abundant human motion data, but comparable motion data is scarce for non-humanoid legged robots such as quadrupeds, hexapods, and quadruped manipulators. A promising alternative is to repurpose human motion across embodiments; however, direct retargeting often produces motions that are visually plausible yet physically inconsistent or difficult to track under robot dynamics. We present X-Morph, a human-motion-to-robot-behavior pipeline that converts human motion into deployable locomotion and loco-manipulation policies for diverse non-humanoid legged morphologies. A cross-morphology retargeting stage converts human motions into kinematically plausible, intent-preserving robot references, which are then tracked by a privileged RL policy and distilled into a causal student policy. We evaluate X-Morph on three morphologically distinct platforms: a quadruped, a hexapod, and a quadruped equipped with a manipulator. The resulting policies track diverse retargeted motions, generalize to unseen human motions, and support downstream use cases including video-based teleoperation, behavior-prior control, and text-conditioned motion generation. These results suggest that large-scale human motion can serve as a substrate for learning broad, reusable behavior priors beyond humanoid robots. Project page: https://maker-rat.github.io/morph/
Humanoid & Whole-Body Control
#3 h=24

ReactiveBFM: Reactive Closed-Loop Motion Planning Towards Universal Humanoid Whole-Body Control

2026-06-29 cs.ROcs.AIcs.CV πŸ‘€ Jiangmiao Pang (h=24)
Xiao Chen, Weishuai Zeng, Xiaojie Niu, Zirui Wang, Jianan Li
Core Contributions
  • Behavior Foundation Models give humanoids robust control priors but only replay predefined reference motions, leaving them brittle to environmental shifts and unable to react.
  • Shows that naively cascading a generative motion planner onto a BFM fails: inevitable tracking discrepancies compound into fatal exposure bias.
  • Introduces a real-time closed-loop planning-control framework with a scheduled prefix-sampling curriculum that directly suppresses that cumulative exposure bias.
  • Aims at universal whole-body control β€” reactive coordination under disturbance β€” rather than open-loop motion playback.
Show abstract
While current Behavior Foundation Models (BFMs) provide robust control priors for humanoids, they only execute pre-defined reference motions. As a result, they are vulnerable to environmental shifts and incapable of reactive whole-body coordination. Naively cascading them with generative motion planners fails to achieve true reactivity, as inevitable tracking discrepancies induce fatal cumulative exposure bias. To bridge this gap, we propose ReactiveBFM, a real-time closed-loop planning-control framework. At its core, we effectively mitigate exposure bias via a scheduled prefix sampling curriculum, forcing the generative planner to actively learn error-recovery behaviors from imperfect physical states rather than ground-truth trajectories. Systematically, to reconcile the severe latency mismatch between auto-regressive planning and high-frequency tracking, we introduce an asynchronous replanning mechanism. Combined with trajectory chunking to temporally ensemble spatial references, our system guarantees spatio-temporally fluid execution without physical jitter. Deployed on the Unitree G1 humanoid, ReactiveBFM demonstrates unprecedented physical agility across a vast repertoire of text-conditioned closed-loop motions. Notably, ReactiveBFM achieves zero-shot moving target reaching, showcasing intricate whole-body coordination and on-the-fly replanning. In sim-to-sim benchmarking under severe perturbations, ReactiveBFM achieves a 93.1% success rate, significantly outperforming cascaded open-loop baselines by 28.6%.
#7 h=13

WARP: Whole-Body Retargeting for Learning from Offline Human Demonstrations

2026-06-29 cs.RO πŸ‘€ Shreyas Kousik (h=13)
Zhenyang Chen, Chuizheng Kong, Chuye Zhang, Yuanshao Yang, Lawrence Y. Zhu
Core Contributions
  • Tackles the embodiment gap blocking human-demo-to-robot transfer for whole-body mobile manipulation: existing retargeting is imprecise and multi-modal, so supervised policies never cleanly converge.
  • WARP is an offline pipeline that explicitly models human-robot embodiment differences to extract precise, unique whole-body actions from human pose.
  • By removing action multi-modality it produces clean, single-valued targets that imitation learning can actually fit.
  • Unlocks human data β€” which scales far better than mobile teleoperation β€” as a viable training source for whole-body manipulation.
Show abstract
Direct transfer from human demonstration to learnable robot action is a crucial step towards scalable whole-body mobile manipulation. While human data scales better than mobile teleoperation, it requires overcoming significant embodiment gaps. Existing retargeting methods yield imprecise or inconsistent solutions, causing action multi-modality that prevents supervised policies from reliably converging. We present Whole-body-Aware Retargeting from human Pose (WARP), an offline pipeline that explicitly models embodiment differences to extract precise, unique whole-body actions. WARP leverages a closed-form Shoulder-Elbow-Wrist (SEW) geometric solver for exact end-effector tracking while preserving whole-body structural intent. Paired with lazy mobile-base control, it extracts accurate, consistent robot trajectories. Evaluations show WARP provides highly reliable data for open-loop real-world replay. To our knowledge, WARP is the first framework to achieve zero-shot whole-body mobile manipulation directly from offline human demonstrations, eliminating the need for human-in-the-loop teleoperation action data. More details on https://warp-retarget.github.io/
#10 h=9

VLK: Learning Humanoid Loco-Manipulation from Synthetic Interactions in Reconstructed Scenes

2026-06-29 cs.ROcs.AIcs.GReess.SY πŸ‘€ Guanya Shi (h=9)
Yen-Jen Wang, Jiaman Li, Sirui Chen, Takara E. Truong, Pei Xu
Core Contributions
  • Perception-based humanoid loco-manipulation needs synchronized egocentric images, language commands, and robot-compatible kinematic trajectories β€” a complete tuple no existing dataset provides at scale.
  • Generates vision-language-kinematics supervision synthetically: 3D Gaussian Splatting reconstructs metric-scale indoor scenes, then navigation and object-interaction trajectories are synthesized within them.
  • Sidesteps the hardware data-collection bottleneck by manufacturing whole-body supervision inside reconstructed real environments.
  • Matters as a scalable data engine for the egocentric-image-to-whole-body-motion mapping that perception-based humanoids require.
Show abstract
Perception-based humanoid loco-manipulation requires connecting egocentric observations and task instructions to whole-body motion. Learning this mapping requires synchronized egocentric images, language commands, and robot-compatible kinematic trajectories, yet no existing data source provides this complete tuple at scale. We address this bottleneck by generating vision-language-kinematics (VLK) supervision synthetically in reconstructed scenes. Our pipeline leverages 3D Gaussian Splatting to reconstruct metric-scale indoor environments, synthesizes navigation and object-interaction trajectories using privileged scene information, and renders paired egocentric observations after the fact. We produce 48,000 paired trajectories with no human intervention and train a VLK policy that predicts short-horizon whole-body kinematic trajectories. A whole-body tracker converts these predictions into actions on the physical humanoid. We evaluate on the physical Unitree G1 performing navigation and single-object transport, demonstrating that synthesized interactions in reconstructed scenes provide effective supervision for sim-to-real perception-based humanoid loco-manipulation. Project Website: https://vision-language-kinematics.github.io/
Tactile & Contact Manipulation
#14 h=7

Heterogeneous Tactile Transformer

2026-06-29 cs.RO πŸ‘€ Ruihan Gao (h=7)
Jianxin Bi, Qiang Wang, Jayaram Reddy, Kelvin Lin, Soibkhon Khajikhanov
Core Contributions
  • Tactile sensors are inherently heterogeneous β€” a model trained on one cannot run on another β€” which blocks learning contact-rich policies from diverse tactile data at scale.
  • HTT pairs sensor-specific encoders with a shared transformer trunk, pretrained via per-modality masked reconstruction plus cross-modal alignment between paired sensors.
  • Learns sensor-agnostic tactile representations so data from many different sensors can finally be pooled for one model.
  • Matters as a step toward a touch foundation model analogous to what vision and language already have.
Show abstract
Tactile sensors are inherently heterogeneous: a model trained on one sensor cannot be directly used on another, which limits learning contact-rich manipulation policies from diverse tactile data at scale. To bridge this gap, we propose the Heterogeneous Tactile Transformer (HTT), a framework that learns shared tactile representations across heterogeneous sensors. HTT consists of sensor-specific encoders and a shared transformer trunk, and is pretrained with per-modality masked reconstruction together with cross-modal alignment between paired sensors. Pretraining uses our novel Heterogeneous Paired Tactile (HPT) dataset, containing 1.6M synchronized paired frames across four vision- and array-based tactile sensors. Across distinct tactile perception and real-world manipulation tasks, HTT is shown to learn transferable representations that adapt to new tasks and previously unseen sensors. Dataset, code, and model checkpoints will be released upon publication at https://jxbi1010.github.io/htt-gh-page/.
#23 h=5

ConCent: Contact-Centric Real-to-Sim-to-Real Learning from One Demonstration

2026-06-29 cs.RO πŸ‘€ Katsushi Ikeuchi (h=5)
Heecheol Kim, Namiko Saito, Katsushi Ikeuchi, Yasuyuki Matsushita
Core Contributions
  • Sim-to-real transfer breaks on contact-rich tasks because subtle contact-dynamics discrepancies can flip task outcomes entirely.
  • Since object-environment interaction is mediated by contact, ConCent makes accurate reproduction of task-relevant contacts the central objective of real-to-sim-to-real learning.
  • Learns from a single demonstration β€” a strikingly data-light recipe for contact-centric manipulation.
  • Matters because scaling manipulation without large real-world datasets hinges precisely on getting contact, not just kinematics, right.
Show abstract
Sim-to-real policy transfer -- deploying policies trained in simulation in the real world -- is a promising paradigm for scaling robot manipulation without large-scale real-world data. However, transferring simulation-trained policies remains challenging due to discrepancies in contact dynamics -- particularly in contact-rich tasks where subtle differences can alter task outcomes entirely. Because interaction between the manipulated object and the environment is mediated through contact, task success depends on accurately reproducing task-relevant contacts. Accordingly, in manipulation, contact-centric fidelity -- reproducing both the contact event sequence (when, where, and how contacts occur) and the local contact dynamics (how forces and motions evolve at each contact) -- is a necessary condition for task success. Based on this insight, we propose a contact-centric real-to-sim-to-real RL framework that uses task-relevant contact event sequences extracted from real demonstrations as the learning objective. We approximate objects as groups of primitives and optimize their contact geometry in simulation so that the resulting local contact dynamics explain the observed state transitions. The contact event sequence is automatically extracted by replaying the demonstration. This sequence serves as a structured reward signal, guiding the policy toward physically plausible contact regimes validated in reality and preventing exploitation of unrealistic simulator contacts. The signal is obtained automatically, requiring no per-task reward design. Experiments on contact-rich manipulation tasks demonstrate more stable and robust sim-to-real policy transfer compared to unconstrained RL baselines.
#29 h=3

Seeing Touch from Motion: A Unified Modality-Aware Visuo-Tactile Policy with Tactile Motion Correlation

2026-06-29 cs.ROcs.CV πŸ‘€ Guojin Zhong (h=3)
Shengqi Xu, Guojin Zhong, Yang Liu, Fanjie Wang, Hu Luo
Core Contributions
  • Optical tactile sensors infer contact from gel-deformation images, but extracting the fine-grained contact state needed for contact-rich manipulation remains open.
  • Existing methods use either raw images or cumulative motion fields, both prone to perception errors; this work unifies them in a modality-aware policy.
  • Exploits tactile motion correlation to read contact more reliably than either representation alone, seeing 'touch from motion.'
  • Matters because finer contact-state estimation is the gating factor for dexterous, contact-rich manipulation with optical tactile sensors.
Show abstract
Visuo-Tactile policies leveraging optical tactile sensors have shown great promise in contact-rich manipulation. These sensors achieve high spatial resolution and multi-dimensional force sensing by utilizing an internal camera to monitor the deformation of their elastic gel surface, thereby indirectly inferring tactile cues. Despite their advantages, extracting fine-grained contact states necessary for contact-rich manipulation remains an open challenge. Existing methods typically use either raw images or cumulative motion fields to represent tactile cues. However, both are prone to perception ambiguity. Raw tactile images mainly capture appearance changes, while cumulative motion fields only reflect the aggregate gel deformation. Consequently, distinct fine-grained contact states can exhibit highly similar patterns, making it difficult to explicitly distinguish subtle contact variations. To address this issue, we explore the dynamic priors of tactile motion and discover that the correlation between transient and cumulative motion can explicitly distinguish fine-grained contact states. Based on this insight, we propose a motion-aware tactile representation to facilitate contact-rich manipulation. Beyond tactile representation, effective fusion of tactile and visual modalities is also critical. Most existing fusion methods either directly concatenate features from each modality or train modality-specific networks separately and fuse their outputs. However, these strategies struggle to simultaneously model cross-modal interactions and preserve modality-specific characteristics. In this work, we take advantage of the Mixture-of-Transformers architecture and propose a unified modality-aware visuo-tactile policy that captures cross-modal complementarity while maintaining modality-specific properties.
Navigation & Human-Aware Interaction
#17 h=6

HUMEMBR: Learning Human Routines for Predictive Embodied Navigation

2026-06-29 cs.RO πŸ‘€ SΓΆren Pirk (h=6)
Samira Huber, Klaas Pelzer, Duc M. Nguyen, Xuesu Xiao, SΓΆren Pirk
Core Contributions
  • Robots in human-centered spaces must reason over long histories β€” locate a person, predict where they will be, estimate when they typically leave β€” a fundamentally long-horizon memory problem.
  • Introduces Human-Centered Memory for Embodied Robots, a system for embodied question answering grounded in accumulated observations of human routines.
  • Captures long-term behavioral patterns so a robot can answer predictive queries about people rather than only reacting to the present scene.
  • Echoes a recurring theme in today's batch β€” that current observations alone are insufficient and explicit memory is required.
Show abstract
Understanding and navigating human-centered environments over extended periods of time while considering human behavior and routines remains a fundamental challenge in robotics. In real-world settings, robots may be asked to locate a specific individual, predict where that person is likely to be, or estimate when they typically leave a building. Addressing such queries requires reasoning over extensive histories of observations and capturing long-term behavioral patterns. To this end, we introduce Human-Centered Memory for Embodied Robots (HUMEMBR), a system designed for embodied question answering and routine-conditioned navigation. HUMEMBR integrates a continuous memory construction process with a parallel retrieval and querying mechanism, enabling the system to accumulate structured representations of human routines while supporting interactive, user-driven queries. Our experimental results indicate that HUMEMBR improves long-horizon reasoning about human behavior relative to full-context LLM baselines, while using substantially fewer tokens. Furthermore, we deploy HUMEMBR on a physical robot in two distinct environments, showing its ability to handle diverse queries and navigation tasks under real-world conditions.
#18 h=6

Legible Shared Autonomy: Implicit Communication of Robot Belief through Motion

2026-06-29 cs.ROcs.HC πŸ‘€ Tao Wang (h=6)
Jinwei Liu, Pengfei Li, Shaofeng Chen, Tao Wang, Yun-Bo Zhao
Core Contributions
  • Shared-autonomy arms infer user goals but keep their internal belief hidden; assisting along the shortest path stays ambiguous when several objects lie in similar directions.
  • Makes the robot's belief observable through motion β€” implicit communication β€” so the user can read which goal the system has actually inferred.
  • Trades a little path efficiency for legibility, resolving the ambiguity that erodes trust in assistive control for users with motor impairments.
  • Matters because trustworthy assistance depends on the user understanding the robot's intent, not just on reaching the goal fast.
Show abstract
Shared autonomy systems combine user input with autonomous assistance to help users with motor impairments control robot arms to perform everyday manipulation tasks, by inferring user goals and providing appropriate guidance. However, the robot's internal beliefs about user goals cannot be observed by users. Traditional shared autonomy systems provide assistance along efficient shortest paths toward inferred goals, but when multiple objects lie in similar directions, such assistive motion remains ambiguous and fails to reveal the specific goal identified by the robot. This creates two critical problems. First, when the robot correctly infers the goal, users continue controlling because they cannot perceive understanding from ambiguous assistive motion, wasting effort when autonomous completion would suffice. Second, when the robot misunderstands intent, users cannot quickly detect errors until assistive motion diverges significantly, requiring substantial corrective input. We address this by introducing legible motion into shared autonomy, where robot actions must both advance toward the goal and clearly reveal which goal has been inferred, enabling users to understand the robot's beliefs and adjust control accordingly. The robot modulates communication strength through confidence-aware adaptive authority allocation by providing assertive legible assistive actions when confident while increasing user authority when uncertain, transforming shared autonomy into transparent bidirectional collaboration. User studies including simulation and physical experiments with a six-degree-of-freedom robot arm demonstrate that legible shared autonomy significantly improves users' understanding of robot beliefs and reduces user control effort compared to standard shared autonomy.
#21 h=5

FutureNav: Unified World-Action Modeling for Vision-and-Language Navigation

2026-06-29 cs.RO πŸ‘€ Xiaoshuai Hao (h=5)
Lingfeng Zhang, Zeying Gong, Xiaoshuai Hao, Haoxiang Fu, Qiang Zhang
Core Contributions
  • Navigation foundation models scale VLMs but learn navigation primarily as direct action generation, without explicitly modeling world states or predicting their future evolution.
  • FutureNav is a VLM-based unified world-action framework that jointly encodes and predicts future world states alongside actions for vision-and-language navigation in continuous environments.
  • Adding explicit future-state prediction supplies the spatial understanding needed across long action sequences, where pure action models drift.
  • Matters because grounding instructions over long horizons requires anticipating the world, not just emitting the next move.
Show abstract
Vision-and-language navigation (VLN) in continuous environments requires an agent to ground instructions in egocentric observations while maintaining spatial understanding across long action sequences. Recent navigation foundation models have shown strong progress by scaling vision-language models, but they often learn navigation primarily as direct action generation, without explicitly modeling world states or predicting their future evolution. We introduce FutureNav, a VLM-based unified world-action modeling framework for vision-and-language navigation. Specifically, FutureNav jointly encodes text, visual, and spatial features and feeds them into the LLM, and optimizes four objectives for simultaneous world and action modeling: an action policy objective for navigation action prediction, inverse and forward dynamics objectives for modeling state transitions, and a future generation objective for predicting future spatial states. This unified architecture strengthens action prediction while explicitly modeling the world, without sacrificing inference speed. Extensive experiments show that, with only a 4B-scale backbone, FutureNav achieves state-of-the-art performance on multiple VLN benchmarks and substantially outperforms prior VLN methods, paving the way toward future world-action models for VLN. We will release the code and models to support future research.
#27 h=4

RoamFlow: Reinforcement-Aligned One-Step Action MeanFlow Policy for Image-Goal Navigation

2026-06-29 cs.RO πŸ‘€ Mir Feroskhan (h=4)
Zixuan Zhang, Yuqi Chen, Junjie Gao, Siyuan Song, Yongzhou Pan
Core Contributions
  • Image-goal navigation RL maps observations directly to actions but struggles with long-horizon dependencies, producing suboptimal trajectories.
  • RoamFlow uses MeanFlow to predict an average velocity field for trajectory synthesis, enabling efficient few-step β€” even one-step β€” generation with low inference latency.
  • A reinforcement-aligned two-stage training fuses generative trajectory modeling with RL objectives, marrying generative quality to goal-reaching reward.
  • Matters because inference latency and long-horizon coherence are both decisive for real image-goal navigation, and one-step flow addresses both.
Show abstract
Image-goal navigation is a key challenge in embodied robotics, where an agent must reach a target specified solely by a goal image. While existing reinforcement learning approaches map perceptual observations directly to actions, they struggle to model long-horizon dependencies, often leading to suboptimal trajectories. To address this limitation, we propose RoamFlow, a generative navigation framework that leverages MeanFlow to predict the average velocity field for trajectory synthesis, enabling efficient few-step generation and reducing inference latency. We further adopt a two-stage training strategy that combines expert imitation for stable initialization with reinforcement learning for task-specific policy refinement. Extensive experiments in both Habitat simulation and real-world robotic platforms demonstrate that RoamFlow achieves efficient inference while maintaining strong navigation performance under real-time constraints.
SLAM, Tracking & State Estimation
#1 h=35

Privacy-Preserving Decentralized Cooperative Localization with Range-Only Measurements: A Convex Optimization Based Approach

2026-06-29 cs.ROeess.SY πŸ‘€ S. Rathinam (h=35)
Nitesh Kumar, Reyshwanth Ganeshan, Sixu Li, Sivakumar Rathinam, Swaroop Darbha
Core Contributions
  • Targets a security flaw in cooperative localization: classic range-based methods broadcast explicit coordinates, exposing every robot's position in privacy-sensitive missions.
  • Avoids both accuracy-degrading noise injection and heavy cryptography by casting localization as Semi-Definite Programming that computes a Maximum-Volume Inscribed Ellipsoid under strictly bounded noise.
  • Robots reach fleet-wide spatial consensus by exchanging only abstract dual variables β€” never primal position estimates β€” so location is never revealed on the wire.
  • Novel intersection-plane constraints from landmarks tighten per-robot bounds and coupling constraints decompose into local LMIs; 3D Monte Carlo trials beat prior SDP localization on accuracy while staying parallelizable.
Show abstract
Cooperative localization using range-based measurements is critical for multi-robot systems operating in GPS-denied and unstructured environments. However, traditional cooperative approaches require sharing explicit spatial coordinates across the network, presenting a severe security vulnerability in privacy-sensitive missions. While recent literature has explored privacy-preserving alternatives, these methods typically rely on accuracy-degrading noise injection or computationally prohibitive cryptographic protocols. To overcome these limitations, we propose a novel, natively privacy-preserving Decentralized Cooperative Localization (DCL) framework based on convex optimization. Discarding probabilistic noise models, we assume strictly bounded measurement noise and formulate the localization problem via Semi-Definite Programming (SDP) to compute a Maximum-Volume Inscribed Ellipsoid (MVE). Our approach introduces novel intersection-plane constraints derived from landmark measurements to significantly tighten individual spatial bounds. To incorporate inter-robot range measurements securely, we uniquely decompose coupling constraints into localized Linear Matrix Inequalities (LMIs). Agents achieve fleet-wide spatial consensus by iteratively exchanging only abstract dual variables, completely avoiding the transmission of explicit primal position estimates. Extensive 3D Monte Carlo simulations demonstrate that our DCL framework outperforms existing SDP-based localization method in accuracy, while guaranteeing operational privacy and maintaining highly scalable, parallelizable computation.
#5 h=21

PS-MOT: Cultivating Instance Awareness from Point Seeds for Multi-Object Tracking

2026-06-29 cs.CVcs.ROeess.IV πŸ‘€ Kunyu Peng (h=21)
Kai Luo, Fei Teng, Mengfei Duan, Wanjun Jia, Xu Wang
Core Contributions
  • Replaces costly bounding-box supervision in multi-object tracking with cheap point annotations, shifting from spatial box-fitting to topological, center-driven representation.
  • Point supervision invites spatial ambiguity and identity drift; PS-Track answers with a points-to-instances hierarchy applied across data, model, and loss levels.
  • Temporal-Feedback Prompting evolves static points into temporally consistent prompts, recovering the instance awareness lost when boxes are dropped.
  • Matters as a cost-effective route to scalable MOT for embodied perception, where box labels are the expensive bottleneck.
Show abstract
We introduce Point-supervised Multi-Object Tracking (PS-MOT) as a cost-effective alternative to traditional bounding box supervision, shifting the focus from spatial fitting to topological center-driven representation. However, PS-MOT faces challenges, e.g., spatial ambiguity and identity drift due to the lack of explicit geometric structure and scale constraints. To address these, we propose PS-Track, a hierarchical pipeline transitioning from points to instances across data, model, and loss levels. At the data level, we introduce Temporal-Feedback Prompting (TFP) to evolve points into temporally consistent pseudo-labels using negative spatial cues and motion priors. At the model level, we design the Point-Excited Wavelet Attention (PEWA) module, which leverages semantic correlations to activate high-frequency components, ``hallucinating'' object boundaries. At the loss level, Uncertainty-Guided Gaussian Learning (UGL) models pseudo-labels as probabilistic distributions, dynamically calibrating supervision intensity. Experiments on DanceTrack, EmboTrack, SportsMOT, and JRDB demonstrate that PS-Track provides a feasible and effective point-supervised alternative across diverse tracking scenarios, establishing a new state-of-the-art for point-supervised tracking. The source code is available at https://github.com/xifen523/PS-MOT.
#24 h=5

TACO: A Test and Check Framework for Robust Pose Graph Optimization

2026-06-29 cs.RO πŸ‘€ Tobias Fischer (h=5)
Emilio Olivastri, Alberto Pretto, Tobias Fischer
Core Contributions
  • Pose Graph Optimization underpins SLAM but is highly sensitive to outliers from incorrect place-recognition associations caused by perceptual aliasing.
  • TACO is a test-and-check framework that filters outliers from PGO rather than explicitly modeling each measurement as inlier or outlier.
  • By screening associations rather than re-weighting them in a single model, it improves trajectory quality where aliasing-induced false loop closures would corrupt the map.
  • Matters because a few bad loop closures can substantially degrade an otherwise good SLAM estimate.
Show abstract
Pose Graph Optimization (PGO) is one of the most widely adopted approaches for solving Simultaneous Localization and Mapping (SLAM) problems. However, PGO approaches are particularly sensitive to outliers, which can substantially degrade the quality of the estimated trajectories. These outliers arise from incorrect place recognition associations caused by perceptual aliasing in the environment. In this paper, we present TACO (short for Test And Check Optimization), a robust optimization framework designed to filter out outliers from PGO systems. Rather than explicitly modeling measurements as inliers or outliers, TACO finds an approximation to the maximally consistent set of measurements incrementally through two complementary components: (i) The test component, namely the Incremental Probabilistic Consensus (IPC) algorithm, evaluates the consistency of each incoming loop closure online. (ii) The check component dubbed Switchable Outlier Sanitization leverages the existing Switchable Constraints to periodically sanitize any inconsistent measurements from the consistent set that IPC may have mistakenly included. We evaluate TACO on 2D SLAM and 3D Visual SLAM datasets against several state-of-the-art methods. The results show robustness comparable to state-of-the-art offline methods while preserving the computational efficiency required for online deployment, achieving a success rate above 90% in 2D and 83% in 3D across outlier rates up to 50%, with mean convergence times of approximately 45 ms and 100 ms, respectively. We release an open-source implementation of our method with this paper.
#25 h=5

MyGO-Splat: Multi-Objective Closed-Loop Geometric Feedback for RGB-Only Gaussian SLAM

2026-06-29 cs.RO πŸ‘€ Hui Zhu (h=5)
Fan Zhu, Ziyu Chen, Zhenjun Zhao, Zhisong Xu, Hui Zhu
Core Contributions
  • Monocular SLAM suffers scale ambiguity and no geometric self-correction; RGB-only 3D Gaussian Splatting systems stay open-loop because refined geometry cannot feed back to fix tracking drift.
  • MyGO-Splat analytically rasterizes Gaussian primitives into pixel-wise depth and surface normals so the map actively supervises camera-pose optimization β€” closing the loop.
  • Turns geometric feedback into drift correction for RGB-only Gaussian SLAM, addressing the core weakness of existing open-loop pipelines.
  • Matters because closing the geometry-to-tracking loop is what separates a drifting map from a self-correcting one.
Show abstract
Real-time monocular Simultaneous Localization and Mapping (SLAM) fundamentally suffers from scale ambiguity and a lack of geometric self-correction. While 3D Gaussian Splatting (3DGS) enables high-fidelity rendering, existing RGB-only systems remain open-loop because depth priors are injected into mapping but refined geometry cannot effectively regulate tracking drift. We present MyGO-Splat, a closed-loop Gaussian SLAM framework that analytically rasterizes Gaussian primitives into pixel-wise depth and surface normals, allowing the map to actively supervise camera pose optimization. To bridge monocular priors and scale consistency, our framework introduces scale-aware adaptive alignment that projects foundation-model depth estimates into the globally optimized Gaussian space, forming a self-correcting cycle for scale feedback. Extensive evaluations show that this closed-loop design improves scale stability and appearance-geometry consistency, achieving performance comparable to RGB-D methods while using only monocular input.
#28 h=3

CylindTrack: Depth-Aware Cylindrical Motion Modeling for Panoramic Multi-Object Tracking

2026-06-29 cs.CVcs.ROeess.IV πŸ‘€ Kai Luo (h=3)
Buyin Deng, Kai Luo, Lingxin Huang, Xinqi Liu, Fei Cheng
Core Contributions
  • Panoramic MOT is not a drop-in extension of perspective MOT: equirectangular video is horizontally periodic, breaking planar-motion assumptions and making IoU association unreliable at the 0deg/360deg seam.
  • Introduces depth-aware cylindrical motion modeling so association respects the wrap-around geometry of 360deg views.
  • Targets the larger object counts and stronger scale variation of wide field-of-view scenes that defeat standard trackers.
  • Matters because panoramic cameras' blind-spot advantage is wasted if the tracker fails exactly at the image seam.
Show abstract
Multi-Object Tracking (MOT) is a core capability for embodied perception, and panoramic cameras are attractive for embodied systems because their 360Β° field of view reduces blind spots and keeps surrounding targets observable for longer durations. However, panoramic MOT is not a straightforward extension of perspective MOT. In equirectangular panoramic videos, the horizontal image domain is periodic rather than Euclidean, which breaks planar motion assumptions and makes IoU-based association unreliable near the 0Β°/360Β° seam. Meanwhile, large-FoV scenes often contain more objects, stronger scale variation, and more frequent interactions, making online association particularly sensitive to unstable frame-wise depth cues. To address these issues, we propose CylindTrack, a depth-aware cylindrical tracking-by-detection framework for panoramic MOT. CylindTrack first introduces Depth-Temporal Trajectory Modeling (DTM), which promotes instance depth from an isolated frame-wise cue to a temporally filtered trajectory-level state. To improve the reliability of depth observations, we further develop Spherical Spatio-Temporal Consistency Learning (SSTC), which combines a Temporal Mixer and Spherical Geometry-aware Attention to enhance temporal coherence and panoramic geometric alignment in depth-aware representations. Finally, we design a Topology-Aware Cylindrical Motion Model (TCMM) that lifts horizontal motion into a continuous angular state space and performs seam-consistent motion prediction and association in the periodic panoramic domain. By jointly modeling trajectory-level depth consistency and panoramic topology, CylindTrack improves identity preservation and trajectory continuity in challenging panoramic scenes. The source code will be released at https://github.com/warriordby/CylindTrack.
#30 h=3

Sphere-VIO: Fast and Robust Visual-Inertial Odometry via Unified Spherical Representation for Heterogeneous Multi-Camera Systems

2026-06-29 cs.RO πŸ‘€ Yusen Xie (h=3)
Yueteng Yang, Yusen Xie, Hao Wei, Qianhao Wang, Boyu Zhou
Core Contributions
  • Multi-camera VIO widens the field of view but existing methods are tailored to fixed setups and lack compatibility with heterogeneous multi-camera systems.
  • Sphere-VIO adopts a unified spherical representation to provide a single cross-camera feature representation and association mechanism.
  • A lightweight filter-based design balances robust cross-camera feature tracking, stable depth estimation, and reliable real-time performance.
  • Matters because deployable VIO must run across varied, mixed camera rigs without per-setup re-engineering.
Show abstract
Multi-camera visual-inertial odometry (VIO) overcomes the inherent limitations of pure visual systems by expanding the field of view. However, existing algorithms are typically tailored for fixed camera setups and lack unified compatibility with heterogeneous multi-camera systems. Meanwhile, due to the absence of a unified cross-camera representation and association mechanism, current methods struggle to achieve a balance among robust cross-camera feature tracking, stable depth estimation, and reliable real-time performance. To address these issues, we present Sphere-VIO, a lightweight filter-based VIO framework with unified spherical representation for heterogeneous multi-camera systems. Specifically, we first propose a Unified Spherical Panorama Model (USPM) that supports all standard camera models and enables bidirectional fast mapping between multi-camera images and a shared spherical space without sequential stitching, simplifying cross-camera feature management and improving triangulation efficiency. Second, we design a parallel-accelerated depth-guided semi-direct tracking pipeline, namely Hierarchical Omnidirectional Feature Alignment (HOFA), with global spherical constraints for robust cross-camera matching, and fuse multi-camera depth observations into a standard depth filter for stable initialization. Finally, we develop a multi-camera-adapted ESKF backend that employs spherical bearing residuals and Schur complement marginalization to minimize computational overhead, enabling accurate real-time state estimation on resource-constrained devices. Extensive experiments on public benchmarks and a custom omnidirectional dataset show that Sphere-VIO achieves superior trade-offs between accuracy, robustness, efficiency, and cross-camera generality.
Control, Aerial & Hardware Systems
#2 h=33

Lateral String Stability for Vehicle Platoons

2026-06-29 cs.ROeess.SY πŸ‘€ S. Darbha (h=33)
Sixu Li, Swaroop Darbha, Yang Zhou
Core Contributions
  • Extends string-stability theory β€” well understood longitudinally β€” to the underexplored lateral axis, where path-tracking errors propagating down a platoon can cause unsafe lane deviations.
  • Motivated by the move to map-free, onboard-sensing autonomy, where occlusion and sensor error make lateral disturbance propagation a growing rather than shrinking concern.
  • Establishes conditions under which lateral tracking errors attenuate instead of amplifying along the convoy β€” the property safety claims for CAV platooning actually depend on.
  • Matters because energy, throughput, and especially safety gains from platooning are void if disturbances grow as they travel through the line.
Show abstract
Connected and automated vehicle (CAV) platooning promises gains in energy efficiency and traffic throughput and, most critically, in safety. These safety benefits hinge on string stability, which determines how disturbances propagate along a platoon. While longitudinal string stability is well studied, lateral string stability, which governs the propagation of path-tracking errors that can lead to unsafe deviations from the intended path, remains underexplored. Its importance is increasing as autonomous vehicles rely more heavily on onboard sensing and map-free navigation, where sensor occlusion and dense formations amplify safety risks. This paper presents a new framework for lateral string stability that directly addresses safety-critical path-relative tracking errors and enables consistent comparison across vehicles following the same road geometry. Central to this framework is an arc-length (Eulerian) viewpoint, a departure from traditional analyses, that clarifies how tracking errors at a given point on the path propagate from one vehicle to the next. A formal definition of lateral string stability is introduced along with two control strategies: an onboard-sensing-only controller and a novel learn-from-predecessor approach utilizing vehicle-to-vehicle (V2V) communication. We show that onboard sensing alone cannot guarantee attenuation of path-tracking errors, imposing a fundamental safety limitation, whereas V2V communication enables true error attenuation.
#6 h=17

MOAR Planner: Multi-Objective and Adaptive Risk-Aware Path Planning for Infrastructure Inspection with a UAV

2026-06-29 cs.RO πŸ‘€ Alexis Lussier Desbiens (h=17)
Louis Petit, Alexis Lussier Desbiens
Core Contributions
  • UAV infrastructure inspection must fly close to obstacles while juggling dynamic risks β€” weather, communication reliability, battery autonomy β€” that evolve mid-mission.
  • MOAR does real-time trajectory adaptation that concurrently optimizes safety, time, and energy rather than treating them as a fixed pre-flight trade-off.
  • Introduces damage and insertion cost concepts within a risk-aware cost function built on pre-computed cost maps, enabling replanning as conditions change.
  • Matters because a static plan cannot account for risks that shift during a long, close-proximity inspection flight.
Show abstract
The problem of autonomous navigation for UAV inspection remains challenging as it requires effectively navigating in close proximity to obstacles, while accounting for dynamic risk factors such as weather conditions, communication reliability, and battery autonomy. This paper introduces the MOAR path planner which addresses the complexities of evolving risks during missions. It offers real-time trajectory adaptation while concurrently optimizing safety, time, and energy. The planner employs a risk-aware cost function that integrates pre-computed cost maps, the new concepts of damage and insertion costs, and an adaptive speed planning framework. With that, the optimal path is searched in a graph using a discrete representation of the state and action spaces. The method is evaluated through simulations and real-world flight tests. The results show the capability to generate real-time trajectories spanning a broad range of evaluation metrics: around 90% of the range occupied by popular algorithms. The proposed framework contributes by enabling UAVs to navigate more autonomously and reliably in critical missions.
#13 h=7

AERIS: Aerial-Edge Role-Driven Intelligence at Runtime via Orchestrated Language-Model Swarm

2026-06-29 cs.RO πŸ‘€ Rongye Shi (h=7)
Jiabin Lou, Haopeng Wang, Xinyu Liu, Yu Zhang, Rongye Shi
Core Contributions
  • Putting LLMs on aerial platforms is constrained by strict heartbeat scheduling and limited onboard compute β€” large models simply cannot meet real-time deadlines.
  • Organizes dedicated small language models plus lightweight perception and control into roles instantiated at runtime, dynamically rebinding them across executors as resources shift.
  • Pushes intelligence to the edge through an orchestrated LM swarm rather than a single heavyweight model.
  • Achieves long-horizon instruction following under tight heartbeat budgets, a practical recipe for deployable aerial autonomy.
Show abstract
Integrating large language models into robotic systems holds promise for enhancing autonomy, yet practical deployment remains constrained by strict heartbeat-constrained scheduling and limited computational power. We propose AERIS: an edge deployment framework for aerial platforms. It organizes dedicated small language models combined with lightweight perception and control modules into roles that can be instantiated at runtime, and dynamically rebinds them across different executors as resources change, thereby pushing intelligent capabilities to the edge. AERIS achieves long-horizon instruction decomposition through an attention-subgoal alignment mechanism, which involves annotating the currently active instruction step in messages, thereby progressively approaching long-term objectives. We evaluate AERIS on a high-fidelity UAV Vision-and-Language Navigation benchmark. Under a heartbeat-timed execution mechanism, AERIS maintains a stable perception-decision-control loop between a low-frequency planner and a high-frequency controller, supporting real-time closed-loop operation. We further validate its deployability through two real-world experiments focused on planning and fast response. A demonstration video is provided in the supplementary materials.
#15 h=7

Data-Driven Modeling and Control for Tethered Space Systems with Koopman-Informed Graphs

2026-06-29 cs.RO πŸ‘€ Panfeng Huang (h=7)
Ao Jin, Yifeng Ma, Panfeng Huang, Fan Zhang
Core Contributions
  • Tethered space systems β€” tethers and nets β€” have high-dimensional, strongly coupled, nonlinear dynamics that defeat control, and data-driven models struggle with long-term stability and spatial generalization.
  • KGD integrates the Koopman operator's global linear evolution with a graph representation to capture the system's structural dynamics.
  • Marrying linear Koopman dynamics to graph structure directly targets the long-horizon stability and generalization weaknesses of prior learned models.
  • Matters for advanced orbital operations where flexible-component control reliability is critical.
Show abstract
Modeling tethered space systems is critical for advanced orbital operations. Flexible components such as tethers and space nets are integral to these systems but present significant control challenges due to their high dimensional, strongly coupled, and nonlinear dynamics. While data driven methods offer alternative modeling approaches, they frequently struggle with long term predictive stability and spatial generalization. To address this, we propose the Koopman Graph Dynamics (KGD) framework to learn the structural dynamics by integrating the global linear evolution of the Koopman operator with the local topological priors of Graph Neural Networks. Building upon this representation, we develop a KGD based Model Predictive Control strategy for tethered space systems. Subsequently, the ground experiments on flexible tether and space net demonstrate the high precision modeling capabilities of the proposed method. Crucially, the framework exhibits exceptional capacity for spatial transfer without retraining. Models trained exclusively on small configurations successfully predict and control significantly larger, unseen physical scales. Furthermore, the orbit simulations within a physics engine verify the effectiveness of the proposed approach for tethered space systems.
#20 h=6

Real-Time Compliance and Position Control of a Hyper-redundant Soft Robotic Arm

2026-06-29 cs.RO πŸ‘€ Runze Zuo (h=6)
Runze Zuo, Tianhua Zou, Naike Wu, Mingyuan Li, Daniel Bruder
Core Contributions
  • Robots in unstructured environments need accurate motion plus passive compliance to correct contact misalignment, but soft robots have struggled to precisely control both tip compliance and position.
  • Presents a 7-link arm whose six articulated joints provide twelve independently driven revolute axes, each actuated by an antagonistic pair of pneumatic muscles.
  • Every axis can simultaneously change its angle and linearly adjust its stiffness, so the hardware is co-designed around the position-and-compliance control problem.
  • Demonstrates real-time, independent regulation of position and compliance in a hyper-redundant soft arm β€” long an open challenge for soft robotics.
Show abstract
Robots working in unstructured or partially unobservable environments must combine accurate motion with physical compliance that can passively correct contact misalignment. Soft robots provide this compliance but have struggled to precisely control their tip compliance and position. This paper presents a robot architecture designed around that control problem: a 7-link arm whose six articulated joints provide twelve independently driven revolute axes, each actuated by an antagonistic pair of pneumatic muscles, so that every axis can simultaneously change its angle and linearly adjust its stiffness. The rigid articulated backbone makes the tip compliance and position of the arm predictable enough to be commanded quantitatively in real time. The robot employs a unified iterative inverse-kinematics and inverse-compliance controller to achieve simultaneous, quantitative control of both compliance and position. The task-space compliance and kinematics models and the control law are derived and verified on both the physical arm and a matched simulation. Simulation is then used to study how the same framework extends to other arm morphologies. Finally, the arm demonstrates tasks that have been difficult for both rigid and soft arms: rejecting disturbances while writing on a moving whiteboard, and passively correcting hidden misalignment during a key-insertion and drawer-opening task. That these tasks succeed under so straightforward a controller is evidence for the advantage of this algorithm-informed structural design.