Jul 2026
Bound-Optimized Task Choice for Path Integral Control
This work proves that every task provides an upper bound on the true cost-to-go and that BOTC minimizes this bound, and proposes Bound-Optimized Task Choice (BOTC), a framework that optimizes over the entire space of valid approximations, termed tasks, satisfying the PI coupling constraint.
R. Anderson, Goutam Das, Takashi Tanaka
· arXiv.org · 0 citations