Conference on Robot Learning (CoRL) 2026 · Austin, TX
Paper · Full video · Code
A robot does not need the same control rate when standing still as when recovering from a push. TARC lets the policy decide, choosing both what action to take and how long to hold it, subject to a budget the user specifies directly.
TARC's control frequency during a perturbation experiment on the Go1. The policy holds 16.7 Hz during stable standstill, spikes to 50 Hz the instant it is pushed, and drops straight back once the robot stabilises. No fixed-rate controller can do this.
Most robotic systems rely on fixed-frequency discrete-time controllers, creating a trade-off between the efficiency of low-frequency control and the responsiveness of high-frequency feedback. As a result, systems typically default to high control rates for robustness, at the cost of wasted inference bandwidth and unnecessary actuation. Addressing this, we introduce Time-Adaptive Robotic Control (TARC), a reinforcement learning framework in which the policy jointly predicts a control action and its duration of application. TARC learns temporally extended actions by optimizing task performance under soft or hard constraints on the number of control switches, enabling adaptive modulation of control rates. We evaluate TARC on two robotic hardware platforms — a high-speed RC car and the Unitree Go1 quadruped — and on a vision-language action model in simulation, where each query incurs a costly transformer forward pass which we aim to minimize. Across all settings, TARC matches the performance of high-frequency discrete-time controllers while operating at less than half their control frequency. Unlike fixed-rate controllers, TARC adapts its control frequency online, allocating high-frequency feedback only when required.
The policy is queried only when a new action is needed. Between queries the previous action is held for Δt steps: short holds during demanding phases, long holds when the situation is stable, cutting inference cost proportionally.
A time-adaptive policy maps the state to a pair: an action ut and a duration Δt for which that action is held. One query therefore covers Δt control steps, and the effective control frequency f = fmax / Δt becomes something the policy chooses online rather than a number fixed at design time.
We pose this as a constrained MDP: maximize task reward subject to a budget on the expected number of policy queries. With qt ∈ {0, 1} indicating whether the policy is queried at step t,
\[ \max_{\pi} \; \mathbb{E}_{\pi}\!\left[\sum_{t} \gamma^{t} r(x_t, u_t)\right] \quad \text{s.t.} \quad \mathbb{E}_{\pi}\!\left[\sum_{t} \gamma^{t} q_t\right] \leq \frac{K}{1-\gamma} \]
where K ∈ (0, 1] is the query budget — a fixed-frequency controller queries at every step, saturating it at K = 1. Constraining the rate itself has two practical consequences:
Three platforms spanning very different demands: a drifting RC car, a quadruped, and a vision-language-action model. Policies for the two hardware platforms are trained entirely in simulation and deployed zero-shot, with no fine-tuning — the average frequencies selected in simulation transfer almost exactly to the real robots.
Each query to a VLA is a full transformer forward pass, which makes inference frequency a direct deployment cost — and makes this the setting where adaptive querying pays off most. We apply TARC at the post-training stage of a frozen π0 checkpoint on the LIBERO benchmark, using diffusion steering to predict how much of an action chunk to execute before re-querying.
TARC matches the success rate of the fixed chunk-size-20 baseline while using an average chunk length of 32.1 ± 7.8, roughly 38% fewer transformer forward passes. Against a fixed baseline matched to TARC's own average chunk length (32), TARC achieves a higher success rate.
That last comparison is the informative one. A fixed schedule running at TARC’s average rate does worse than TARC — so the gain comes from where the queries are spent, not simply from querying less. The learned chunk length also varies per task: longer where sustained open-loop execution suffices, shorter where the task demands frequent replanning.
Run Then Turn, one of three scenarios unseen during training. Across all three, TARC exceeds the 50 Hz baseline in task reward at less than half its control frequency — 365 policy queries per 1000 environment steps versus 1000, a 64% reduction in onboard inference load.
Control frequency responds to task difficulty on its own: lower on smooth low-speed turning, higher during velocity changes and abrupt transitions.
A reverse-parking maneuver requiring a drift. TARC is equivalent to the 30 Hz baseline in task reward at less than half the control frequency, with substantially smaller variance across rollouts and 21% less total commanded throttle travel — a direct reduction in mechanical wear.
@misc{sukhija2025tarctimeadaptiveroboticcontrol,
title={TARC: Time-Adaptive Robotic Control},
author={Arnav Sukhija and Lenart Treven and Jin Cheng and Florian Dörfler and Stelian Coros and Andreas Krause},
year={2025},
eprint={2510.23176},
archivePrefix={arXiv},
primaryClass={cs.RO},
url={https://arxiv.org/abs/2510.23176},
}
This project has received funding from the Swiss National Science Foundation under NCCR Automation, grant agreement 51NF40 180545.