New robotics and physical-AI papers, with what each one means for the industry.
Scaling robot manipulation policies requires large amounts of diverse, action-labeled data, yet collecting such data in the real world remains expensive and difficult to scale. Existing methods either depend on human teleoperation, rely on simulation with limited visual realism, or use human videos that lack embodiment-specific annotations.
Generalist robot policies are trained with imitation learning and are bounded by the quality and coverage of their demonstrations. Reinforcement learning can improve and extend them, either by fine-tuning the policy weights or by training a small module to steer the input noise of a frozen generative policy.
Action-conditioned world models offer a promising foundation for generalist robotic intelligence by predicting the consequences of actions. However, existing robotic datasets provide limited coverage of the diverse interaction dynamics required for generalizable world modeling.
This arXiv preprint introduces AVL-JEPA, a training method that stops joint-embedding world models from discarding action-conditioned physical dynamics while preserving visual representations. Across four simulated robot control tasks, it reaches 81.5% success on PushT and 88.7% on TwoRoom under Gaussian input noise, versus 15.3% and 65.7% for the baseline, while maintaining competitive clean-environment performance. The work matters for robot planners that must stay reliable when camera or state observations are noisy.
This preprint introduces a training-time auxiliary loss for latent world models: a temporary linear head regresses the physical quantities used in a task's success criterion directly from latent states. On PushT and cube it raises planning success by 3.5 and 3.4 absolute points over the same baseline, with significant paired-test gains, while leaving test-time model and inputs unchanged. It matters because success criteria can tell world models exactly which physical quantities the latent state must retain for reliable planning.
This preprint extends policy-constrained TD-MPC into PL-MPC by changing critic training targets, MPPI terminal values, and actor distillation without altering the world model or planner. On HumanoidBench, it lifts total average return from 98±18 to 387±255 on balance-hard and from 199±13 to 466±200 on hurdle; in zero-shot sim-to-real wrench–nut alignment on a KUKA IIWA14 it achieves 74.2% vs 61.3% success on the training object size. The result matters because it shows targeted interactions in the planning–learning loop can improve hard robot control tasks beyond the usual planner–policy alignment.
Latent world models learn action-conditioned dynamics in representation space and often score candidate actions by Euclidean distance to a goal representation. Joint training typically regularizes the representation to prevent collapse, but the resulting representation geometry also determines how terminal errors are weighted during planning.
Papers come from arXiv robotics feeds. Where our summary is not written yet, you see the opening lines of the abstract.