Name
Abstract | ||
|---|---|---|
When minimizing makespan during off-line planning, the fastest action sequence to reach a particular state is, by definition, preferred. When trying to reach a goal quickly in on-line planning, previous work has inherited that assumption: the faster of two paths that both reach the same state is usually considered to dominate the slower one. In this short paper, we point out that, when planning happens concurrently with execution, selecting a slower action can allow additional time for planning, leading to better plans. We present Slo'RTS, a metareasoning planning algorithm that estimates whether the expected improvement in future decision-making from this increased planning time is enough to make up for the increased duration of the selected action. Using simple benchmarks, we show that Slo'RTS can yield shorter time-to-goal than a conventional planner. This generalizes previous work on metareasoning in on-line planning and highlights the inherent uncertainty present in an on-line setting. |
Year | Venue | Field |
|---|---|---|
2017 | Proceedings of the International Conference on Automated Planning and Scheduling | Mathematical optimization,Job shop scheduling,Planning algorithms,Computer science,Planner |
DocType | ISSN | Citations |
Conference | 2334-0835 | 0 |
PageRank | References | Authors |
0.34 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bence Cserna | 1 | 1 | 3.76 |
| Wheeler Ruml | 2 | 1870 | 130.48 |
| Jeremy Frank | 3 | 216 | 23.82 |