We examine two policies for reopening of nodes: never reopen (NR) and always reopen (AR). While there are circumstances where each policy is beneficial, we observed empirically that NR is usually faster. However, NR may fail to return a solution of the desired quality in two scenarios: (1) in a bounded suboptimal search when inconsistent heuristics are used and (2) in a bounded cost setting. To remedy this we provide two repair policies for NR when the desired quality was not obtained. The first policy is to restart AR. The second policy is to repeatedly place the nodes that were not reopened back in OPEN and continue with NR. Experimental results show that both repair polices outperform the AR policy.
|Title of host publication||Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016|
|Editors||Jorge A. Baier, Adi Botea|
|Number of pages||8|
|State||Published - 2016|
|Event||9th Annual Symposium on Combinatorial Search, SoCS 2016 - Tarrytown, United States|
Duration: 6 Jul 2016 → 8 Jul 2016
|Name||Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016|
|Conference||9th Annual Symposium on Combinatorial Search, SoCS 2016|
|Period||6/07/16 → 8/07/16|
Bibliographical noteFunding Information:
The research was supported by the Israeli Science Foundation (ISF) under grant #417/13 to Ariel Felner.
Copyright © 2016, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.