Anytime Pack Heuristic Search
Heuristic search is a fundamental problem solving technique in artificial intelligence. In this paper, we propose an anytime heuristic search algorithm called Anytime Pack Search (APS) which helps in solving hard combinatorial search problems efficiently. It expands nodes of a search graph in a localized best-first manner so as to converge towards good quality solutions at regular intervals. APS is complete on bounded graphs and guarantees termination with an optimal solution. Experimental results on the sliding-tile puzzle problem, the traveling salesman problem, and the single-machine scheduling problem show that APS significantly outperforms some of the state-of-the-art anytime algorithms.
Keywordsproblem solving heuristic search anytime algorithms
- 1.Aine, S., Chakrabarti, P.P., Kumar, R.: AWA* - A window constrained anytime heuristic search algorithm. In: Veloso, M.M. (ed.) IJCAI, pp. 2250–2255 (2007)Google Scholar
- 7.Lowerre, B.: The Harpy Speech Recognition System. PhD thesis, Carnegie Mellon University (1976)Google Scholar
- 9.van den Berg, J., Shah, R., Huang, A., Goldberg, K.Y.: Anytime nonparametric A*. In: AAAI, pp. 105–111 (2011)Google Scholar
- 10.Zhou, R., Hansen, E.A.: Beam-stack search: Integrating backtracking with beam search. In: Proceedings of the 15th International Conference on Automated Planning and Scheduling (ICAPS 2005), Monterey, CA, pp. 90–98 (2005)Google Scholar