NTH

PyRUA-DataFarm: LLM Agent as a Cost-Efficient Teleoperator for Real-Ready Robot Data

AuthorsKewei Zhang, Juncheng Ma, Guodong Lv, Duomin Wang, Feixiang Ruan, Ruiyang Si, Chuanrui Zhang, Yuxuan Chen, Hao Chen, Yichen Liu, Yintianrun Zhang, Yufan Deng, Enze Xie, Daquan Zhou

Affiliations[

November 5, 2026 3 min read
Watch on YouTube
The one-line take

A coding agent builds and checks a simulation-to-video data farm that aims to replace costly robot teleoperation with cheaper training demonstrations.

Key results

93
Farm policy successes, original scene

Successes in 100 trials; teleoperation-trained policies achieved 84.

87
Farm policy successes, unseen appearance

Successes in 100 trials; teleoperation-trained policies achieved 46.

26
Sim + domain randomization successes

Successes in 100 original-scene trials; the same baseline achieved 21 under unseen appearance.

0.80
Marginal cost per episode

Average USD cost for each additional episode, including simulation, rendering, and review.

107
Three-view data cost per hour

Average USD cost per task-hour, including adaptation and render-contract costs.

What the paper found

PyRUA-DataFarm replaces repeated robot teleoperation with an LLM coding agent that turns a task request and one calibration episode into simulated, action-labelled robot demonstrations. The agent builds the scene, controller, and success judge; the simulator supplies exact actions and states, while MiniMax-H3 renders synchronized camera views with real-scene appearance, guided by ControlNet. Independent checks and reviewers certify each episode before it enters the dataset. On five real-robot tasks, policies trained on 100 farm episodes achieved 93 successes in 100 trials in the original scene, compared with 84 for teleoperation-trained policies; under an unseen tablecloth and coloured lighting, they scored 87 versus 46. Conventional simulation with domain randomization reached only 26 successes in the original scene and 21 under changed appearance. The study uses π0.5 for policy training, Seedance as an alternative renderer, and reports coding-agent runs with OpenAI GPT-6 Astra and Anthropic Claude Opus 5.5; rendering uses NVIDIA B200 GPUs. After an average $21 task-adaptation cost and a $5 render contract, each additional episode costs $0.80, with no robot or operator required. A synchronized hour of three-view data costs $107 on average, below the cited teleoperation comparisons.

Original abstract

Teleoperation remains the default way to collect robot demonstrations, but every episode costs robot and operator time, and every new task starts from scratch. We ask whether a coding agent can take over the teleoperator's job. In our DataFarm, the agent receives a data request and one calibration episode of the robot in the target scene and rebuilds the task in simulation: it writes the scene, an expert controller, and a success judge. The simulator supplies exact actions, and a video model conditioned on real images renders each rollout as photographic video, generating all camera views together consistently. The output is real-ready data: synchronized camera views labelled with the robot's actions, on which a policy can be trained directly and deployed on the real robot. Independent judges certify the expert and every rendered episode before admission. On five real-robot tasks, policies trained only on farm data match policies trained on as many teleoperated episodes (93 vs. 84 successes in 100 trials), and under an unseen tablecloth and coloured light they keep 87 successes where the teleoperation-trained policies fall to 46. Adapting a task is fully automatic and costs \$21 of API usage on average, paid once per task, plus \$5 for a render contract; every further episode costs \$0.80 on average for simulation, rendering, and review, with no robot or operator. One hour of three-view data for a task costs \$107 on average, these costs included, slightly below a quote of \$117 for teleoperation in China and below \$290 in labour alone in North America.

Read the original paper

More in Robotics

Browse all 62 papers →