Metraipolis › archive › dc_99ff81d55948
Look Ahead: Search-Driven Reasoning in Embodied AI — arXiv:2611.10769
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.10769
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-10T18:41:12.811Z
- SHA-256 of the archived text
bd8ccf984f61517c84531e1ed73238eec1cf21f566a13b078aa0fbafa60a8b02- Stable URL of this page
https://metraipolis.com/documento/dc_99ff81d55948
How to cite
Look Ahead: Search-Driven Reasoning in Embodied AI — arXiv:2611.10769 — arXiv (en), https://arxiv.org/abs/2611.10769 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_99ff81d55948 (Metraipolis archive dc_99ff81d55948, sha256 bd8ccf984f61517c84531e1ed73238eec1cf21f566a13b078aa0fbafa60a8b02)
BibTeX
@misc{dc99ff81d55948,
title = {Look Ahead: Search-Driven Reasoning in Embodied AI — arXiv:2611.10769},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.10769},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_99ff81d55948; sha256 bd8ccf984f61517c84531e1ed73238eec1cf21f566a13b078aa0fbafa60a8b02},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.10769. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Search allows a robotic policy to evaluate candidate futures before committing to an action. Motivated by test-time planning for vision-language action (VLA) models, we study selective search over action chunks in PushT using a frozen Action Chunking with Transformers (ACT) policy. Beam search generates perturbed alternatives around the policy prediction and scores them through rollouts from cloned simulator states. Across 50 evaluation episodes, beam search raises task success from 0% to 18% and increases average cumulative reward from 39.44 to 103.2. We introduce One Step Ahead (OSA), a gate that simulates the nominal policy chunk and invokes full search only when its predicted coverage drop exceeds a threshold. In the reported ablations, OSA preserves or improves success while reducing runtime by approximately 3x relative to full beam search. Ablations over tree depth, branching factor, beam width, and replanning frequency show that larger search budgets do not consistently improve performance. The results support selective test-time search for action-chunking policies; evaluation on language-conditioned VLAs and physical robots remains future work. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno). Categorie arXiv: Artificial Intelligence (cs.AI). Pagina del lavoro: https://arxiv.org/abs/2611.10769 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-10T18:37:37.504Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).