Abstract
Fork-decoupled search is a recent approach to classical planning that exploits fork structures, where a single center component provides preconditions for several leaf components. The decoupled states in this search consist of a center state, along with a price for every leaf state. Given this, when does one decoupled state dominate another? Such statedominance criteria can be used to prune dominated search states. Prior work has devised only a trivial criterion. We devise several more powerful criteria, show that they preserve optimality, and establish their interrelations. We show that they can yield exponential reductions. Experiments on IPC benchmarks attest to the possible practical benefits.
Originalsprog | Engelsk |
---|---|
Tidsskrift | IJCAI International Joint Conference on Artificial Intelligence |
Vol/bind | 2016-January |
Sider (fra-til) | 3265-3271 |
Antal sider | 7 |
ISSN | 1045-0823 |
Status | Udgivet - 2016 |
Udgivet eksternt | Ja |
Begivenhed | 25th International Joint Conference on Artificial Intelligence, IJCAI 2016 - New York, USA Varighed: 9 jul. 2016 → 15 jul. 2016 |
Konference
Konference | 25th International Joint Conference on Artificial Intelligence, IJCAI 2016 |
---|---|
Land/Område | USA |
By | New York |
Periode | 09/07/2016 → 15/07/2016 |
Sponsor | AI Journal, Arizona State University, Baidu, et al., IBM, Sony Group Corporation |