AWA* - A window constrained anytime heuristic search algorithm

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 2250-2255

  Aine, Sandip ^a   Chakrabarti, P P ^a   Kumar, Rajeev ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

0/1 KNAPSACK PROBLEMS; ANYTIME HEURISTIC SEARCHES; ANYTIME SEARCH; OPTIMAL SOLUTIONS; SEARCH TREES; SLIDING WINDOW; USEFUL PROPERTIES; WINDOW SIZE;

ARTIFICIAL INTELLIGENCE; FORESTRY; HEURISTIC ALGORITHMS; LEARNING ALGORITHMS; MODULAR ROBOTS; TREES (MATHEMATICS);

ITERATIVE METHODS;

EID: 77956024262     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. T. Dean and M. Boddy. An analysis of time-dependent planning. In Proceedings of 6th National Conference on Artificial Intelligence (AAAI 88), pages 49-54, St. Paul, MN, 1988. AAAI Press.
2. D. Furcy. Itsa*: Iterative tunneling search with a*. In Proceedings of AAAI Workshop on Heuristic Search, Memory-Based Heuristics and Their Applications, pages 21-26, 2006.
3. E. A. Hansen, S. Zilberstein, and V. A. Danilchenko. Anytime heuristic search: First results. Technical Report 50, Univ. of Massachusetts, 1997.
4. Y. Kitamura, M. Yokoo, T. Miyaji, and S. Tatsumi. Multi-state commitment search. In Proceedings of 10th IEEE International Conference on Tools with Artificial Intelligence, pages 431-439, 1998.
5. A. Kumar, A. Kumar, and M. Balakrishnan. Heuristic search based approach to scheduling, allocation and binding in data path synthesis. In Proceedings of 8th International Conference on VLSI Design, pages 75-80, 1995.
6. M. Likhachev, G. J. Gordon, and S. Thrun. Ara*: Anytime A* with provable bounds on sub-optimality. In Advances in Neural Information Processing Systems 16. MIT Press, Cambridge, MA, 2004.
7. J. Pearl. Heuristics: intelligent search strategies for computer problem solving. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1984.
8. I. Pohl. Heuristic search viewed as path finding in a graph. Artif. Intell., 1(3):193-204, 1970.
9. U. K. Sarkar, P. P. Chakrabarti, S. Ghose, and S. C. De Sarkar. Multiple stack branch and bound. Inf. Process. Lett., 37(1):43-48, 1991.
10. W. Zhang. Complete anytime beam search. In Proceedings of 14th National Conference of Artificial Intelligence AAAI'98, pages 425-430. AAAI Press, 1998.
11. R. Zhou and E. A. Hansen. Multiple sequence alignment using anytime a*. In Proceedings of 18th National Conference on Artificial Intelligence AAAI'2002, pages 975-976, 2002.
12. R. Zhou and E. A. Hansen. Beam-stack search: Integrating backtracking with beam search. In Proceedings of the 15th International Conference on Automated Planning and Scheduling (ICAPS-05), pages 90-98, Monterey, CA, 2005.