Learning-Guided Planning in Large Dynamic Action Spaces: Budgeted Tree Search for One-to-Many Mobile Charging
Paper recorded by Signals 4 on 2026-09-15 in cs.AI. Abstract reproduced from arXiv; link to the original below.
Published 2026-09-15 on arXiv · recorded by Signals 4 on 2026-09-16
Category: cs.AI · 人工智能 · first seen 2026-09-16
Abstract
Many learned sequential decision systems map the current state directly to an action. That shortcut becomes brittle when candidate actions are numerous, geometrically structured, and rebuilt with the state. One-to-many mobile charging makes this setting concrete: with N=250 sensors, the initial state induces about 1,125 candidate charging-stop actions; each chosen stop simultaneously serves its in
Read on arXiv →
Cite this page: Learning-Guided Planning in Large Dynamic Action Spaces: Budgeted Tree Search for One-to-Many Mobile Charging: the #55 most recent of 300 cs.AI papers we have recorded (as of 2026-09-15). Source: Signals 4 (Signals API) — https://data.jiangzhang.ca/signals4/t/papers/learning-guided-planning-in-large-dynamic-action-spaces-budgeted-tree-search-for.html
Free to quote with attribution to “Signals 4 (Signals API)”. Machine-readable:
papers.json
Get 4 AI signals a day by email — free.
Get 4 AI signals a day by email — free