Timezone: »

Finding Options that Minimize Planning Time
Yuu Jinnai · David Abel · David Hershkowitz · Michael L. Littman · George Konidaris

Thu Jun 13 06:30 PM -- 09:00 PM (PDT) @ Pacific Ballroom #40
We formalize the problem of selecting the optimal set of options for planning as that of computing the smallest set of options so that planning converges in less than a given maximum of value-iteration passes. We first show that the problem is $\NP$-hard, even if the task is constrained to be deterministic---the first such complexity result for option discovery. We then present the first polynomial-time boundedly suboptimal approximation algorithm for this setting, and empirically evaluate it against both the optimal options and a representative collection of heuristic approaches in simple grid-based domains.

Author Information

Yuu Jinnai (Brown University)
David Abel (Brown University)
David Hershkowitz (Carnegie Mellon University)
Michael L. Littman (Brown University)
George Konidaris (Brown)

Related Events (a corresponding poster, oral, or spotlight)

More from the Same Authors