{"type":"ScholarlyArticle","title":"Single-Agent Parallel Window Search: A Summary of Results","authors":[{"name":"Curt Powley","slug":"curt-powley","given":"Curt","family":"Powley","affiliation":""},{"name":"Richard E. Korf","slug":"richard-e-korf","given":"Richard E.","family":"Korf","affiliation":""}],"abstract":"We show how node ordering can be combined with parallel window search to quickly find a nearly optimal solution to single-agent problems. First, we show how node ordering by maximum g among nodes with equal f = g + h values can improve the performance of IDA*. We then consider a window search where different processes perform IDA* simultaneously on the same problem but with different cost thresholds. Finally, we combine the two ideas to produce a parallel window search algorithm in which node ordering information is shared among the different processes. Parallel window search can be used to find a nearly optimal solution quickly, improve the solution until it is optimal, and then finally guarantee optimality, depending on the amount of time available.","doi":null,"url":"https://ijcai.org/proceedings/1989/6","pdf":"https://ijcai.org/proceedings/1989/0006.pdf","markdown":"https://ijcai.org/proceedings/1989/6.md","bibtex":"https://ijcai.org/proceedings/1989/bibtex/6","volume":{"slug":"1989","title":"Proceedings of the Eleventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1989","url":"https://ijcai.org/proceedings/1989/","year":1989,"location":"Detroit, Michigan, USA","dates":"August 20-25 1989","editors":"N. S. Sridharan","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Tools","track":"Tools","number":6,"pages":{"first":36,"last":40},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}