AI & ML
Practice Is Not Free: Measuring the Embodied Cost of Reset-Free Robot Practice
arXiv cs.RO0 views
arXiv:2611.19979v1 Announce Type: new Abstract: When a robot practices without human resets, every attempt still costs wall-clock time, actuator wear, and sometimes a person's attention, yet the schedulers that decide what to practice next treat attempts as free. We present an open, low-cost testbed for measuring these costs: a self-built SO-101 arm runs two demonstration-trained ACT policies that reset each other, with a vision-based success detector and a ledger that records the time, joint travel, and human interventions of every attempt. We formulate cost-aware practice scheduling, in which task selection is rewarded by measured competence gain net of embodied cost, and specify in advance the comparison that will test it. Its first two conditions, run on hardware for 51 minutes of robot time, show that a fixed retry limit did not reduce the share of execution time lost to failures (36%, against 27% for a feasibility rule; not significant) and saved no robot time. The logs suggest why: failures showed no sign of clustering, so a retry right after a failure was as likely to succeed as any other attempt. The ledger also shows that most of the retry rule's extra human time came from cubes knocked out of reach rather than from the rule itself, and a cost-aware rule replayed on the logs recovers the sensible choice without a hand-set limit. We also report lessons from building the system, including a coverage effect in which concentrating demonstrations in a smaller workspace raised success there from 8/20 to 10/10.
Source:https://arxiv.org/abs/2611.19979PreviousValue and Policy Calibration from Execution Feedback for Socially Compatible DrivingNextMoViC: Real-Time Humanoid Whole-Body Control from Monocular Video Streams
Related posts
Discontinuity-Aware Solvers for Vapor-Compression Cycles
0arXiv cs.NA
Memorization capacity of deep ReLU neural networks characterized by width and depth
0arXiv cs.NA
Time-Delayed Transformers for Data-Driven Modeling of Low-Dimensional Dynamics
0arXiv cs.NA
First-order methods for stochastic and finite-sum convex optimization with deterministic constraints
0arXiv cs.NA
Smooth Surfaces via Nets of Geodesics
0arXiv cs.NA
A Large Gap between Galerkin Errors with and without Mesh-Uniform Regularity for the KdV Equation with Boundary Dissipation
0arXiv cs.NA