Repair policies for not reopening nodes in different search settings

Vitali Sepetnitsky, Ariel Felner, Roni Stern

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016
EditorsJorge A. Baier, Adi Botea
PublisherAAAI press
Pages81-88
Number of pages8
ISBN (Electronic)9781577357698
StatePublished - 1 Jan 2016
Event9th Annual Symposium on Combinatorial Search, SoCS 2016 - Tarrytown, United States
Duration: 6 Jul 20168 Jul 2016

Publication series

NameProceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016
Volume2016-January

Conference

Conference9th Annual Symposium on Combinatorial Search, SoCS 2016
Country/TerritoryUnited States
CityTarrytown
Period6/07/168/07/16

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Repair policies for not reopening nodes in different search settings'. Together they form a unique fingerprint.

Cite this