arXiv AI

SPADE: Sketch-guided Path Planning Augmented with Diffusion Experts

arXiv:2606. 03512v1 Announce Type: cross Abstract: Path planning is essential for Autonomous Mobile Robots (AMRs).

arXiv AI
Jun 2

ExpertGen: Scalable Sim-to-Real Expert Policy Learning from Imperfect Behavior Priors

arXiv:2603. 15956v3 Announce Type: replace-cross Abstract: Learning generalizable and robust behavior cloning policies requires large volumes of high-quality robotics data.

By Zifan Xu, Ran Gong, Maria Vittoria Minniti, Kausik Sivakumar, Ahmet Salih Gundogdu, Eric Rosen, Riedana Yan, Tushar Kusnur, Zixing Wang, Di Deng, Peter Stone, Xiaohan Zhang, Karl Schmeckpeper
arXiv AI
Oct 5

EVOL: Simulator-Guided Evolutionary Expert Synthesis for Deployment-Free Learning Path Recommendation

EVOL is a framework that uses a knowledge‑tracing simulator to generate per‑learner expert demonstrations via evolutionary search, and then trains a deployment‑free policy that distills these demonstrations into a feed‑forward learner. The method employs an asymmetric actor‑critic architecture, where the actor plans blindly as in real deployment while the critic has access to privileged simulator state during training. Across three educational datasets and varying path lengths, EVOL outperforms eight baselines and shows that the quality of evolutionary experts, rather than the imitation objective, drives final performance.

By Geonwoo Bang, Dongho Kim, Moohong Min
arXiv Machine Learning
Sep 11

ObstaDiff: Generalizable Diffusion Policy Learning via Obstacle-aware Representations

ObstaDiff is a diffusion-policy framework that introduces a lightweight obstacle-aware visual encoder to generate structured representations of targets, obstacles, and background. By aligning these representations, the policy produces end-effector trajectories that focus on a target-centered bottleneck pose while accounting for surrounding obstacles. In real-robot greenhouse trials, ObstaDiff achieved a 75.41% task success rate and an 8.20% obstacle collision rate, outperforming existing imitation-learning baselines in cluttered agricultural settings.

By Jiawen Wang, Kevin Yao, Khalid Jawed
arXiv AI
Aug 13

TMRL: Diffusion Timestep-Modulated Pretraining Enables Exploration for Efficient Policy Finetuning

arXiv:2605. 12236v2 Announce Type: replace-cross Abstract: Fine-tuning pre-trained robot policies with reinforcement learning (RL) often inherits the bottlenecks introduced by pre-training with behavioral cloning (BC), which produces narrow action distributions that lack the coverage necessary for downstream exploration.

By Matthew M. Hong, Jesse Zhang, Anusha Nagabandi, Abhishek Gupta
arXiv AI
Sep 23

SAIL: Test-Time Scaling for In-Context Imitation Learning with VLM

SAIL is a framework that transforms robot imitation learning into an iterative refinement problem, enabling test-time scaling of trajectory generation. It employs Monte Carlo Tree Search where each node represents a full trajectory and edges denote refinements, guided by an archive of successful trajectories, a vision‑language model for scoring, and step‑level feedback. Experiments on six manipulation tasks in simulation and real‑world settings show that higher test‑time compute consistently raises success rates, reaching up to 95% on complex tasks.

By Makoto Sato, Yusuke Iwasawa, Yujin Tang, So Kuroki
arXiv AI
2d ago

Steertuning Policies from a Few Human Videos

Steertuning is a system that lets robots learn new tasks in new environments from only five human demonstrations, completing the entire process in under five minutes. It first pre‑trains a 400‑million‑parameter diffusion policy on 100 hours of egocentric human data, then fine‑tunes the model for just 2 minutes using the demonstration most similar to the current environment. The approach achieves a 71 % success rate across 12 tasks in 12 distinct settings, from labs to kitchens, and the authors will release the dataset, model weights, code, and robot videos.

By Billy Yan, Isaac Tu, Kelly Lee, Blake Chang, Kenny Ma, Kanad Patel, Dhawal Kabra, Neer Patel, Kevin Wu, Lerrel Pinto, Irmak Guzey
arXiv AI
5d ago

LeWAM: End-to-End World and Action Modeling with JEPAs

LeWAM is an end‑to‑end joint‑embedding predictive architecture that learns compact latent world models without pixel reconstruction and directly supports policy execution and planning. It trains jointly on next‑latent‑state prediction and action‑flow matching while imposing an isotropic Gaussian constraint on the latent state. The approach yields significant performance gains, raising visual‑planning success rates from 28.6 % to 89.7 % on contact‑rich tasks, from 10.9 % to 46.2 % on long‑horizon tasks, and speeding up planning by 32.3×, while remaining competitive on behavior‑cloning tasks and providing interpretable control‑relevant representations.

By Minghao Fu, Tavis Siebert, Eryk Halicki, Randall Balestriero