ITSA: Iterative Tunneling Search with A

AAAI Workshop - Technical Report

Volumn WS-06-08, Issue , 2006, Pages 21-26

  Furcy, David A ^a  

^a UNIVERSITY OF WISCONSIN OSHKOSH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE TUNNELING SEARCH; OPTIMIZATION ALGORITHM; STANDARD BENCHMARK DOMAINS;

ALGORITHMS; BENCHMARKING; ITERATIVE METHODS; OPTIMIZATION; SEARCH ENGINES;

HEURISTIC METHODS;

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

References (29)

1. Aarts, E., and Lenstra, J. 1997. Local Search in Combinatorial Optimization. West Sussex, England: John Wiley & Sons.
2. Bisiani, R. 1987. Beam search. In Shapiro, S., ed., Encyclopedia of Artificial Intelligence. New York : Wiley & Sons. 56-58.
3. Boddy, M., and Dean, T. 1989. Solving time-dependent planning problems. In Proceedings of the International Joint Conference on Artificial Intelligence, 979-984.
4. Boddy, M. 1991. Anytime problem solving using dynamic programming. In Proceedings of the National Conference on Artificial Intelligence, 738-743.
5. Dean, T., and Boddy, M. 1988. An analysis of time-dependent planning. In Proceedings of the National Conference on Artificial Intelligence, 49-54.
6. Furcy, D., and Koenig, S. 2005a. Limited discrepancy beam search. In Proceedings of the International Joint Conference on Artificial Intelligence, 125-131.
7. Furcy, D., and Koenig, S. 2005b. Scaling up WA* with commitment and diversity. In Proceedings of the International Joint Conference on Artificial Intelligence, 1521-1522.
8. Furcy, D. 2004. Speeding up the convergence of online heuristic search and scaling up offline heuristic search. Ph.D. thesis, College of Computing, Georgia Institute of Technology, Atlanta (Georgia). Available as Technical Report GIT-COGSCI-2004/04.
9. Gaschnig, J. 1979. Performance measurement and analysis of certain search algorithms. Technical Report CMU-CS-79-124, Computer Science Department, Carnegie-Mellon University. Ph. D. Thesis.
10. Hansen, E., and Zilberstein, S. 1996. Anytime heuristic search: Preliminary report. In Proceedings of the AAAI Fall Symposium on Flexible Computation in Intelligent Systems; Results, Issues and Opportunities, 55-59.
11. Hansen, E.; Zilberstein, S.; and Danilchenko, V. 1997. Anytime heuristic search: First results. Technical Report CMPSCI 97-50, Department of Computer Science, University of Massachusetts, Amherst (Massachusetts).
12. Hart, P.; Nilsson, N.; and Raphael, B. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics SSC-4(2): 100-107.
13. Harvey, W., and Ginsberg, M. 1995. Limited discrepancy search. In Proceedings of the International Joint Conference on Artificial Intelligence, 607-615.
14. Korf, R. 1997. Finding optimal solutions to Rubik's cube using pattern databases. In Proceedings of the National Conference on Artificial Intelligence, 700-705.
15. Kumar, V. 1990. Branch-and-bound search. In Shapiro, S. C., ed., Encyclopedia of Artificial Intelligence. New York : Wiley, 2nd edition. 1000-1004.
16. Lawler, E., and Wood, D. 1966. Branch-and-bound methods: A survey. Operations Research 14(4):699-719.
17. Lawler, E.; Lenstra, J.; Kan, A. R.; and Shmoys, D., eds. 1985. The Traveling Salesman Problem. John Wiley and sons.
18. Likhachev, M.; Gordon, G.; and Thrun, S. 2004. ARA*: Anytime A* with provable bounds on sub-optimality. In Proceedings of Advances in Neural Information Processing Systems 16 (NIPS).
19. Papadimitriou, C., and Steiglitz, K. 1998. Combinatorial Optimization: Algorithms and Complexity. Mineola, New York: Dover Publications.
20. Pearl, J. 1985. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley.
21. Pohl, I. 1970. First results on the effect of error in heuristic search. In Meltzer, B., and Michie, D., eds., Machine Intelligence, volume 5. American Elsevier, New York. 219-236.
22. Pohl, I. 1973. The avoidance of (relative) catastrophe, heuristic competence, genuine dynamic weighting and computational issues in heuristic problem solving. In Proceedings of the International Joint Conference on Artificial Intelligence, 20-23.
23. Ratner, D., and Pohl, I. 1986. Joint and LPA*: Combination of approximation and search. In Proceedings of the National Conference on Artificial Intelligence, 173-177.
24. Ribeiro, C., and Hansen, P., eds. 2001. Essays and Surveys in Metaheuristics. Kluwer Academic Publishers.
25. Russell, S., and Norvig, P. 1995. Artificial Intelligence - A Modern Approach. Prentice Hall, first edition.
26. Voss, S.; Martello, S.; Osman, I.; and Roucairol, C., eds. 1999. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer Academic.
27. Winston, P. 1992. Artificial Intelligence. Addison-Wesley, Reading, MA, third edition.
28. Zhang, W. 1998. Complete anytime beam search. In Proceedings of the National Conference on Artificial Intelligence, 425-430.
29. Zhou, R., and Hansen, E. 2004. Breadth-first heuristic search. In Proceedings of the International Conference on Automated Planning and Scheduling, 92-100.