Metraipolis › archive › dc_fafbc3111c2c

A Schema Bounded Language Model for Refining Robot Policies Without Destabilizing Local Learning — arXiv:2609.05133

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.05133
License (as archived)
CC0-1.0
Archived
2026-10-16T22:29:01.158Z
SHA-256 of the archived text
1924fe0e9f8c3335d76ba215b68d5ba6ca6e9ca9ab9fca55447b5109ebab7055
Stable URL of this page
https://metraipolis.com/documento/dc_fafbc3111c2c

How to cite

A Schema Bounded Language Model for Refining Robot Policies Without Destabilizing Local Learning — arXiv:2609.05133 — arXiv (en), https://arxiv.org/abs/2609.05133 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fafbc3111c2c (Metraipolis archive dc_fafbc3111c2c, sha256 1924fe0e9f8c3335d76ba215b68d5ba6ca6e9ca9ab9fca55447b5109ebab7055)
BibTeX
@misc{dcfafbc3111c2c,
  title = {A Schema Bounded Language Model for Refining Robot Policies Without Destabilizing Local Learning — arXiv:2609.05133},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.05133},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fafbc3111c2c; sha256 1924fe0e9f8c3335d76ba215b68d5ba6ca6e9ca9ab9fca55447b5109ebab7055},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.05133. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

This paper addresses navigation by composite heterogeneous robots in a decentralized system when policy reasoning and local control operate at different update levels. In a NetLogo--Python implementation, three robots share motion dynamics but use different LLM backends. Each robot independently combines a large language model (LLM) policy agent, an Upper Confidence Bound (UCB) bandit, and a Double Deep Q-Network (Double DQN) controller; no central LLM generates team actions. LLM inference is confined to round-level policy generation and refinement rather than tick-level action selection. The robots perform cross-LLM communication through a shared round summary containing policies, outcomes, and learning feedback. UCB performs refinement-mode selection, and the policy-conditioned Double DQN performs tick-level action selection from navigation variables, active policy parameters, and the LLM action prior. Each of the four configurations was evaluated over 30 rounds. In the fixed simulation, the complete configuration reached the goal in all 90 correlated robot--round records and achieved the lowest median completion time (42 ticks) and P90 (73.2 ticks); its median was 25.0--39.1\% lower than those of the other configurations. These observations provide descriptive, configuration-level evidence from the evaluated configurations.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-07 in cs.AI).
Categorie arXiv: Robotics (cs.RO) ; Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2609.05133 — 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-10-16T22:18:11.572Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).