Metraipolis › archive › dc_fb51b99be035
PathTime-VLA: Path-Time Decoupling for Factorized Post-Training of Vision-Language-Action Policies — arXiv:2610.11771
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.11771
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T06:35:21.648Z
- SHA-256 of the archived text
21d4010591579a7540a71b7eb49c407e24bb3993e25e9b50271f0e711c432f0e- Stable URL of this page
https://metraipolis.com/documento/dc_fb51b99be035
How to cite
PathTime-VLA: Path-Time Decoupling for Factorized Post-Training of Vision-Language-Action Policies — arXiv:2610.11771 — arXiv (en), https://arxiv.org/abs/2610.11771 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fb51b99be035 (Metraipolis archive dc_fb51b99be035, sha256 21d4010591579a7540a71b7eb49c407e24bb3993e25e9b50271f0e711c432f0e)
BibTeX
@misc{dcfb51b99be035,
title = {PathTime-VLA: Path-Time Decoupling for Factorized Post-Training of Vision-Language-Action Policies — arXiv:2610.11771},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.11771},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fb51b99be035; sha256 21d4010591579a7540a71b7eb49c407e24bb3993e25e9b50271f0e711c432f0e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.11771. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Vision-Language-Action (VLA) policies typically predict actions at fixed time intervals, coupling the route a robot follows with its execution pace. This coupling complicates adaptation from teleoperation: useful geometric guidance comes with timing shaped by interface delays and operator behavior. Our key insight is to bring the path-time parameterization of classical motion planning into the learned action representation of a VLA. We introduce PathTime-VLA, which represents motion as a progress-indexed interaction path $X(s)$ and a positive interval-time profile. The latter defines a monotone time law $t(s)$, yielding controller commands $X(s(t))$. For a given path, alternative executions are expressed through the time profile, allowing chunk-wise speed choices without changing the geometric prediction target. This representation supports a staged post-training procedure: demonstrations and DAgger interventions establish a target-domain prior, Speed-DQN learns execution multipliers from robot interaction, and Path-AWR uses rollout outcomes to refine the diffusion path generator. A path-conditioned action expert realizes the resulting motions while maintaining distinct learning interfaces for path generation and execution timing. Across three tasks, the complete method achieves $58/60$ successes versus $57/60$ for PathTime-VLA under BC + DAgger at fixed $1\times$, with approximately $39$-$52\%$ shorter mean completion times over successful trials. Tema degli esploratori: statistica e scienza dei dati (elenco arXiv cs.RO, nuovi lavori del giorno). Categorie arXiv: Robotics (cs.RO). Pagina del lavoro: https://arxiv.org/abs/2610.11771 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-09T05:55:22.111Z dalla pagina https://arxiv.org/list/cs.RO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).