{"type":"ScholarlyArticle","title":"AWA* - A Window Constrained Anytime Heuristic Search Algorithm","authors":[{"name":"Sandip Aine","slug":"sandip-aine","given":"Sandip","family":"Aine","affiliation":""},{"name":"P. P. Chakrabarti","slug":"p-p-chakrabarti","given":"P. P.","family":"Chakrabarti","affiliation":""},{"name":"Rajeev Kumar","slug":"rajeev-kumar","given":"Rajeev","family":"Kumar","affiliation":""}],"abstract":"This work presents an iterative anytime heuristic search algorithm called Anytime Window A* (AWA*) where node expansion is localized within a sliding window comprising of levels of the search tree/graph. The search starts in depth-first mode and gradually proceeds towards A* by incrementing the window size. An analysis on a uniform tree model provides some very useful properties of this algorithm.A modification of AWA* is presented to guarantee bounded optimal solutions at each iteration. Experimental results on the 0/1 Knapsack problem and TSP demonstrate the efficacy of the proposed techniques over some existing anytime search methods.","doi":null,"url":"https://ijcai.org/proceedings/2007/362","pdf":"https://ijcai.org/proceedings/2007/0362.pdf","markdown":"https://ijcai.org/proceedings/2007/362.md","bibtex":"https://ijcai.org/proceedings/2007/bibtex/362","volume":{"slug":"2007","title":"Proceedings of the Twentieth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2007","url":"https://ijcai.org/proceedings/2007/","year":2007,"location":"Hyderabad, India","dates":"","editors":"Ramon López de Mántaras","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":362,"pages":{"first":2250,"last":2254},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}