Robotics and embodied AI

Manipulation, locomotion, sim-to-real transfer and autonomous driving: learning systems that have to survive physics.

4,111 stories · RSS feed

arXiv AI
Aug 19

Hidden Prompts in Manuscripts Exploit AI-Assisted Peer Review

The article reports that in July 2025, 18 arXiv manuscripts contained hidden instructions designed to manipulate AI‑assisted peer review, such as covert commands to give only positive reviews. These prompts were concealed using white text and microscopic fonts, and the authors’ reactions ranged from withdrawal to defending the practice as a test of reviewer misuse of large language models. The study identifies four types of hidden prompts, critiques the ineffectiveness of honeypot defenses, and highlights inconsistent publisher policies while calling for controlled AI integration and harmonized guidelines in academic evaluation.

By Zhicheng Lin
arXiv AI
Aug 19

Efficient Dynamic Shielding for Parametric Safety Specifications

The paper presents dynamic shields for AI-controlled autonomous systems, enabling runtime safety enforcement that adapts to changing safety specifications without recomputing from scratch. Unlike traditional static shields, these dynamic shields are pre-designed for a set of possible safety parameters and can quickly adjust as the true specification becomes known during operation. Experiments on robot navigation in unknown terrains show that dynamic shields require only a few minutes offline and a fraction of a second to a few seconds online, outperforming brute-force recomputation by up to five times.

By Davide Corsi, Kaushik Mallik, Andoni Rodriguez, Cesar Sanchez
arXiv Machine Learning
Aug 19

Prism-GRPO: Faster VLA Policy Optimization via Splitting Same-outcome Groups

Prism‑GRPO enhances the GRPO reinforcement‑learning algorithm for vision‑language‑action policies by adding a weighted trajectory‑level execution‑quality score to binary success rewards. This approach splits groups with identical outcomes into a quality spectrum, preserving training signal while ensuring successes always outrank failures. Experiments on four RoboTwin tasks show Prism‑GRPO achieves higher success and quality at matched rollout budgets, reaching target success rates with up to 56% fewer rollouts and mitigating reward‑hacking behaviors that transfer to real‑robot deployment.

By Zeyun Deng, Yuzhe Lu, Yawei Wang, Linbo Liu, Qing Ping, Han Ding, Guande Wu, Panpan Xu, Jun Huan
arXiv Machine Learning
Aug 19

VLCP: Vision Language Control Policy Closed-Loop Code Replanning for Robot Manipulation

VLCP (Vision Language Control Policy) is a training‑free robot manipulation approach that keeps a vision‑language model (VLM) frozen and uses it to generate short Python control functions. Unlike traditional methods that retry a fixed policy, VLCP rewrites the control code every K steps based on multi‑view RGB, proprioceptive state, and state delta, allowing failures to be corrected within the same episode. In a 57‑task MuJoCo/RoboVerse benchmark, VLCP achieves 35.1% pooled success versus 3.5% for a single‑query baseline, with a 27.3% within‑episode recovery rate on failed grasps and efficient token usage.

By Dhia Naouali, Minghan Wu, Claudia Wong, Abhinav Puthran, Omar G. Younis
arXiv AI
Aug 19

HMS-SCP: Task-Oriented Multi-Scale Semantic Communication for V2X Cooperative Perception

The paper introduces HMS‑SCP, a hierarchical multi‑scale semantic‑aware cooperative perception framework for V2X communication. It uses a spatial importance predictor to select task‑relevant grid elements at multiple scales and maps them directly into complex‑valued symbols for joint source‑channel coding, achieving ultra‑low symbol rates and noise resilience. Experiments on OPV2V and DAIR‑V2X show that HMS‑SCP maintains high‑confidence far‑field detection with sub‑16 ms latency even under severe Rayleigh fading and extreme compression.

By Chun-Yeow Yeoh, Chee Keong Tan, Joanne Mun-Yee Lim, Heng-Siong Lim
arXiv AI
Aug 19

EXPO-FT: Sample-Efficient Reinforcement Learning Finetuning for Vision-Language-Action Models

EXPO-FT is a system that enables stable, sample‑efficient reinforcement learning fine‑tuning of pretrained Vision‑Language‑Action (VLA) policies. It achieves perfect success on a range of manipulation tasks—such as routing string lights, striking a pool ball, and inserting a flower into a wine bottle—using only about 19.1 minutes of online robot data. The approach outperforms both RL-from-scratch and existing VLA fine‑tuning methods, and the authors provide an open‑source codebase to support wider adoption.

By Perry Dong, Kuo-Han Hung, Tian Gao, Dorsa Sadigh, Chelsea Finn
arXiv AI
Aug 19

Solving nonconvex Hamilton--Jacobi--Isaacs equations with PINN-based policy iteration

The paper introduces a mesh‑free policy iteration framework that blends classical dynamic programming with physics‑informed neural networks (PINNs) to solve high‑dimensional, nonconvex Hamilton–Jacobi–Isaacs (HJI) equations. The method alternates between solving linear second‑order PDEs under fixed feedback policies and updating controls via pointwise minimax optimization using automatic differentiation. The authors prove local uniform convergence of the value function iterates to the unique viscosity solution under standard Lipschitz and uniform ellipticity assumptions, and demonstrate the approach’s accuracy and scalability in two‑, five‑, and ten‑dimensional stochastic games, outperforming direct PINN solvers.

By Hee Jun Yang, Minjung Gim, Yeoneung Kim
arXiv AI
Aug 19

Multi-Scale Spectral Attention Module-based Hyperspectral Segmentation in Autonomous Driving Scenarios

The paper investigates a Multi-Scale Spectral Attention Module (MSAM) for hyperspectral image segmentation in autonomous driving. MSAM uses three parallel 1D convolutions with different kernel sizes (1–11) and adaptive feature aggregation, integrated into UNet’s skip connections. Experiments on urban driving datasets show that MSAM improves mIoU by 2.32% and mF1 by 2.88% over baseline UNet-SC while keeping GPU performance competitive, with optimal kernel combinations varying by dataset.

By Imad Ali Shah, Jiarong Li, Tim Brophy, Martin Glavin, Edward Jones, Enda Ward, Brian Deegan
arXiv AI
Aug 19

LoopVLA: Learning Sufficiency in Recurrent Refinement for Vision-Language-Action Models

LoopVLA introduces a recurrent Vision‑Language‑Action architecture that learns to refine multimodal representations, predict actions, and estimate when further refinement is unnecessary. By iteratively applying a shared Transformer block and producing a sufficiency score at each step, it decouples refinement from fixed layer indices and aligns confidence scores with action quality through a self‑supervised objective. Experiments on LIBERO, LIBERO‑Plus, and VLA‑Arena demonstrate that LoopVLA reduces model parameters by 45% and boosts inference throughput up to 1.7× while matching or surpassing strong baselines in task success.

By Boyang Shen, Kaixiang Yang, Hao Wang, Qiuyu Yu, Qiang Xie, Qiang Li, Zhiwei Wang
arXiv AI
Aug 19

Towards Unified World Models for Visual Navigation via Memory-Augmented Planning and Foresight

The paper introduces UniWM, a unified, memory‑augmented world model that merges egocentric visual foresight and planning into a single multimodal autoregressive backbone. By grounding action selection in visually imagined outcomes and using a hierarchical memory to fuse short‑term perception with long‑term trajectory context, UniWM aligns prediction with control and improves navigation stability. Experiments on four challenging benchmarks and the 1X Humanoid Dataset show up to 30% higher success rates, reduced trajectory errors, zero‑shot generalization to unseen datasets, and scalability to high‑dimensional humanoid navigation.

By Yifei Dong, Fengyi Wu, Guangyu Chen, Lingdong Kong, Qiyu Hu, Yuxuan Zhou, Xu Zhu, Jingdong Sun, Jun-Yan He, Qi Dai, Alexander G. Hauptmann, Zhi-Qi Cheng
arXiv AI
Aug 19

Dijkstra as an Oracle for Online Stochastic Shortest Path Navigation with Provable Guarantees

The paper presents DORA, an online learning algorithm for robot navigation that uses Dijkstra’s algorithm as an exact planning engine under a weaker condition than usual causality—specifically, nonnegativity of a reduced cost on a determinized map. DORA calls a shortest‑path oracle a fixed number of times per episode, avoids estimating transition kernels, and incorporates a logarithmic survival weight to keep contact probabilities with dynamic obstacles within a budget. Experiments on grid‑world, directional drilling, and drone surveillance benchmarks show that DORA matches optimistic value iteration with the true transition kernel while performing 4.5 to 19.3 times less planner work, reduces contacts by a factor of seventeen compared to determinize‑and‑replan, and maintains contact rates within wide budget ranges.

By Mansur M. Arief, Ali Akarma, Ahmad Alfan Alfian Irfan
arXiv Machine Learning
Aug 19

Repetition as Reinforcement: Enhancing Sample Efficiency via Instant Episode Repetition in Reinforcement Learning

The paper proposes Instant Episode Repetition (IER), a method that immediately repeats action sequences from high‑reward episodes during training to boost sample efficiency. Unlike passive replay techniques, IER actively shapes data collection by re‑executing successful behaviors for a set number of subsequent episodes. Experiments on MuJoCo, the DeepMind Control Suite, and a robotic manipulation task show that IER improves learning performance over standard SAC, TD3, and self‑imitation baselines.

By Hoda Yamani, Yuning Xing, Koen van Rijnsoever, Bruce A. MacDonald, Henry Williams
arXiv AI
Aug 19

Domain-Adapted Molecular Language Models for Efficient Search of Make-on-Demand Libraries

The study evaluates four pretrained molecular language models on six virtual libraries covering drug discovery, organic materials, and catalysis. It finds that native embeddings vary widely in performance, while molecular fingerprints remain consistently strong. Fine‑tuning the models on library‑specific data markedly improves sample efficiency, with several adapted encoders outperforming others across all tasks.

By Henrik Wille, Luis-Finley Sch\"utz, Felix Strieth-Kalthoff
arXiv AI
Aug 19

Q-Learning With World Models

The paper introduces QWM, a framework that integrates world models with standard Q‑learning to perform test‑time search over imagined trajectories. By training the policy and value function solely on real transitions, QWM avoids compounding model bias while still benefiting from predictive search. Experiments on the Robomimic and LIBERO manipulation benchmarks show that QWM outperforms strong prior state‑of‑the‑art methods in both sample efficiency and performance.

By Perry Dong, Yueru Jia, Chelsea Finn, Dorsa Sadigh
arXiv AI
Aug 19

Validated Adaptation for Aerial Crowd Monitoring at Mass Gathering Scale: A Deployment Protocol, a Severity Law, and a Diagnostic for Label-Free Drone Crowd Counting, Toward the FIFA World Cup 2034 (Saudi Arabia)

The paper presents a validated protocol for adapting drone‑based crowd‑counting models to the extreme conditions expected at the 2034 FIFA World Cup in Saudi Arabia. Using 525 controlled runs and a full‑resolution corpus, the authors demonstrate that label‑free adaptation can recover 31‑49% of shift‑induced error across multiple corruptions and severities, achieving a 41.8 MAE improvement over a frozen source model. They also introduce a severity law, a stability budget, and a flux‑based risk module that detects real congestion episodes, culminating in a six‑point deployment protocol for safe aerial crowd monitoring.

By AlAnoud AllGhayth, AlJawharh AlOtaibi, Jude AlSubaie
arXiv AI
Aug 19

ManiCM: Real-time 3D Diffusion Policy via Consistency Model for Robotic Manipulation

ManiCM is a real‑time 3D diffusion policy for robotic manipulation that uses a consistency constraint to enable one‑step inference. The model conditions on point‑cloud input and directly predicts robot actions through a consistency distillation technique, avoiding the need to predict noise. Evaluated on 31 tasks from Adroit and Metaworld, ManiCM achieves an average ten‑fold speedup over state‑of‑the‑art methods while maintaining competitive success rates.

By Zifeng Gao, Guanxing Lu, Tianxing Chen, Wenxun Dai, Ziwei Wang, Chao Shang, Wenbo Ding, Yansong Tang
arXiv AI
Aug 19

Training with synthetic data for drone detection in thermal imagery

The paper explores a synthetic-first training approach for detecting drones in medium- and long-wave infrared imagery, combining synthetic scene generation with fine-tuning on real data. It demonstrates that synthetic data can establish initial object representations, but real infrared data is crucial to close domain gaps and improve reliability. The study finds that aligning datasets has a greater impact on performance than increasing model size, and that semantic alignment in feature space is the strongest predictor of success, with radiometric factors like entropy and dynamic range also contributing.

By Tanel Liiv, Sander Soodla, Nzamba Bignoumba, Alma M. Liezenga, Toomas Pruuden
arXiv AI
Aug 19

Visual Prompting for Robotic Manipulation with Annotation-Guided Pick-and-Place Using ACT

The paper presents a perception-action pipeline for robotic pick‑and‑place in convenience stores, using annotation‑guided visual prompting to identify pickable objects and placement locations via bounding boxes. It replaces traditional step‑by‑step planning with Action Chunking with Transformers (ACT), an imitation learning algorithm that predicts chunked action sequences from human demonstrations. The system is evaluated on success rate and visual analysis of grasping behavior, showing improved grasp accuracy and adaptability in retail environments.

By Muhammad A. Muttaqien, Tomohiro Motoda, Ryo Hanai, Yukiyasu Domae
Hugging Face Trending Papers
Aug 18

Plug-and-Play Traffic Element Awareness for End-to-End Autonomous Driving

The paper introduces a plug‑and‑play method that injects traffic‑element signals—such as traffic lights and road signs—into end‑to‑end autonomous driving models with minimal architectural changes. By augmenting several public datasets with comprehensive traffic‑element annotations, the authors evaluate this integration across diverse driving paradigms, consistently improving performance on nuScenes, NAVSIM‑v1, NAVSIM‑v2, and Bench2Drive. The approach achieves a new state‑of‑the‑art result on the challenging NAVSIM‑v2 benchmark, demonstrating the broad utility of traffic‑element awareness.