Refinement vs. Replanning: Inference Compute Allocation in Robot Policies
arXiv:2611.19034v1 Announce Type: new Abstract: A frozen chunked robot policy can spend deployment-time inference compute in two coupled ways: more work within each policy call to refine a predicted action chunk, or more frequent policy calls to replan from fresh observations. We study this…
Read original reporting ↗This Observatory page contains only an indexed headline and short summary. It does not reproduce the article or substitute for the publisher’s reporting, corrections, context or terms.
Read the original at arXiv cs.RO ↗