← 研踪 PaperTrailarXiv:2609.19906 · v2
Learning and Transferring Closed-Loop Robot Software
首次提交 2026-09-17 16:51
版本更新 2026-10-29 18:18
雷达观测 2026-10-30 13:28
摘要
Closed-loop robot policies require observation processing, state management, and situation-dependent branching, making them costly to design and tune manually. Although coding agents increasingly support control-code generation and optimization, it remains unclear whether implementations improved on source tasks also support policy acquisition for new tasks. We study this question by treating complete closed-loop implementations as reusable execution experience. To learn each source policy, a coding agent generates policy code from a few successful demonstrations and iteratively improves it using simulation feedback. The validation-selected implementations are retained in a software archive. To transfer the acquired software to new tasks, the agent generates and improves policies using archived implementations, target demonstrations, and execution feedback. We evaluate policy learning and its relationship to cross-task transfer. For learning, across four source tasks in RoboCasa, iterative optimization increases the success rate from 28.3% with initially generated policy code to 64.2% with validation-selected policy code. We further validate this learning approach on a physical Unitree G1. For transfer, across nine additional target tasks in RoboCasa, success rates are 45.2% without references, 41.5% using initially generated policy code from source tasks, and 57.0% using their validation-selected policy code. These results show that improving source-task code also improves learning on new tasks.
观测到的版本
相邻记录可能跳过中间版本；首次发现 v2 及以上也会标为版本更新。
v2 · 2026-10-29 18:18 · 最新观测版本
Learning and Transferring Closed-Loop Robot Software
Closed-loop robot policies require observation processing, state management, and situation-dependent branching, making them costly to design and tune manually. Although coding agents increasingly support control-code generation and optimization, it remains unclear whether implementations improved on source tasks also support policy acquisition for new tasks. We study this question by treating complete closed-loop implementations as reusable execution experience. To learn each source policy, a coding agent generates policy code from a few successful demonstrations and iteratively improves it using simulation feedback. The validation-selected implementations are retained in a software archive. To transfer the acquired software to new tasks, the agent generates and improves policies using archived implementations, target demonstrations, and execution feedback. We evaluate policy learning and its relationship to cross-task transfer. For learning, across four source tasks in RoboCasa, iterative optimization increases the success rate from 28.3% with initially generated policy code to 64.2% with validation-selected policy code. We further validate this learning approach on a physical Unitree G1. For transfer, across nine additional target tasks in RoboCasa, success rates are 45.2% without references, 41.5% using initially generated policy code from source tasks, and 57.0% using their validation-selected policy code. These results show that improving source-task code also improves learning on new tasks.
查看此版本解读 →查看此版本原文 ↗