Skip to content
arXiv Robotics — research abstracts· Sida He·· 1 days agoSignalEditorial score75

Serving Agentic Robot Fleets: Workload Characterization, KV-Cache Thrashing, and Admission Control

Serving Agentic Robot Fleets: Workload Characterization, KV-Cache Thrashing, and Admission Control

Summary

This research abstract details the characterization of workload constraints for agentic robot fleets, focusing on key-value (KV) cache management and action deadlines.

Editorial context

The study characterizes resource constraints in agentic robot fleets, specifically addressing KV-cache thrashing and action deadlines on H800 GPUs, proposing admission control strategies to maintain throughput under concurrency.

Source: arXiv Robotics — research abstracts · Read original article ↗

Loading article text…

What the source reports

Publisher-reported claims, with original evidence. These results have not been independently verified by RoboSignal.

Reported numbers

  • tokens

    215,000

    View original evidence
    nerated by GPT-6-Astra, RPent, and pi0.5 (1,862 brain turns and 1,582 VLA inference chunks), profile both layers on H800 graphics processing units (GPUs), and replay the resulting agent programs on a vLLM serving engine. Brain contexts reach 215k tokens; the median Astra request takes 7.78 s, while the intervening environment-step gap is only 1.0 s. Under a 0.25 s action-chunk deadline, one VLA GPU meets the 1% starv
    Open source S3
  • request latency

    7.78

    View original evidence
    nerated by GPT-6-Astra, RPent, and pi0.5 (1,862 brain turns and 1,582 VLA inference chunks), profile both layers on H800 graphics processing units (GPUs), and replay the resulting agent programs on a vLLM serving engine. Brain contexts reach 215k tokens; the median Astra request takes 7.78 s, while the intervening environment-step gap is only 1.0 s. Under a 0.25 s action-chunk deadline, one VLA GPU meets the 1% starv
    Open source S3
  • environment-step gap

    1

    View original evidence
    nerated by GPT-6-Astra, RPent, and pi0.5 (1,862 brain turns and 1,582 VLA inference chunks), profile both layers on H800 graphics processing units (GPUs), and replay the resulting agent programs on a vLLM serving engine. Brain contexts reach 215k tokens; the median Astra request takes 7.78 s, while the intervening environment-step gap is only 1.0 s. Under a 0.25 s action-chunk deadline, one VLA GPU meets the 1% starv
    Open source S3
  • action-chunk deadline

    0.25

    View original evidence
    nerated by GPT-6-Astra, RPent, and pi0.5 (1,862 brain turns and 1,582 VLA inference chunks), profile both layers on H800 graphics processing units (GPUs), and replay the resulting agent programs on a vLLM serving engine. Brain contexts reach 215k tokens; the median Astra request takes 7.78 s, while the intervening environment-step gap is only 1.0 s. Under a 0.25 s action-chunk deadline, one VLA GPU meets the 1% starv
    Open source S3
  • paper: not_reported
Source excerpts and review record

Automatically extracted; no manual editorial approval recorded.

arXiv:2611.01404v1 Announce Type: new Abstract: Agentic robots combine a vision-language brain, a tool-using harness, and a vision-language-action (VLA) policy. Serving a fleet of these agents introduces two coupled resource constraints: the brain repeatedly revisits long, growing key-value (KV) cache states, while the VLA executes action chunks under tight control deadlines. We characterize 80 LIBERO-PRO episodes ge

Open source S2

nerated by GPT-6-Astra, RPent, and pi0.5 (1,862 brain turns and 1,582 VLA inference chunks), profile both layers on H800 graphics processing units (GPUs), and replay the resulting agent programs on a vLLM serving engine. Brain contexts reach 215k tokens; the median Astra request takes 7.78 s, while the intervening environment-step gap is only 1.0 s. Under a 0.25 s action-chunk deadline, one VLA GPU meets the 1% starv

Open source S3

ation target for one robot; under a 1.0 s deadline, its measured capacity reaches at least 32. In sustained brain replay, increasing concurrency from 20 to 32 robots reduces throughput from about 2.4 to 0.6 requests/s as repetitive prefill displaces generation. A static active-episode cap restores 2.24-2.25 requests/s and raises completed trace-program throughput from 1.30 to 5.00-5.55 episodes/min. Our measurements

Open source S4

Source:arXiv Robotics — research abstracts · arxiv.org

Timezone · UTC

Article dates follow your selected timezone. Briefing editions use Hong Kong time (UTC+8).