AWA*-a window constrained anytime heuristic search algorithm

Authors:
Sandip Aine;P. P. Chakrabarti;Rajeev Kumar
Affiliations:
Department of Computer Science & Engineering, Indian Institute of Technology Kharagpur, India;Department of Computer Science & Engineering, Indian Institute of Technology Kharagpur, India;Department of Computer Science & Engineering, Indian Institute of Technology Kharagpur, India
Venue:
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Year:
2007

Citing 6
Cited 8

Heuristics: intelligent search strategies for computer problem solving

Heuristics: intelligent search strategies for computer problem solving
Multiple stack branch and bound

Information Processing Letters
Complete anytime beam search

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Multiple sequence alignment using anytime A*

Eighteenth national conference on Artificial intelligence
Heuristic search based approach to scheduling, allocation and binding in Data Path Synthesis

VLSID '95 Proceedings of the 8th International Conference on VLSI Design
Anytime Heuristic Searc: First Results TITLE2:

Anytime Heuristic Searc: First Results TITLE2:

Where do we go now?: anytime algorithms for path planning

Proceedings of the 4th International Conference on Foundations of Digital Games
Contract Search: Heuristic Search under Node Expansion Constraints

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
The LAMA planner: guiding cost-based anytime planning with landmarks

Journal of Artificial Intelligence Research
Anytime algorithms for biobjective heuristic search

AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
Anytime column search

AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
Efficient anytime algorithm for large-scale QoS-aware web service composition

International Journal of Web and Grid Services
Anytime algorithms for mining groups with maximum coverage

AusDM '12 Proceedings of the Tenth Australasian Data Mining Conference - Volume 134
Incremental Beam search

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

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.