An algorithm better than AO*?

Proceedings of the National Conference on Artificial Intelligence

Volumn 3, Issue , 2005, Pages 1343-1348

  Bonet, Blai ^a   Geffner, Héctor ^b  

^a UNIVERSIDAD SIMÓN BOLÍVAR   (Venezuela)

^b UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; GRAPH THEORY; HEURISTIC METHODS; INFORMATION TECHNOLOGY; ITERATIVE METHODS; OPTIMIZATION; PLANNING;

HEURISTIC FUNCTIONS; LEARNING IN DEPTH-FIRST SEARCH (LDFS); PLANNING PROBLEMS; VALUE ITERATION (VI) ALGORITHM;

ARTIFICIAL INTELLIGENCE;

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

References (23)

1. Barto, A.; Bradtke, S.; and Singh, S. 1995. Learning to act using real-time dynamic programming. Artificial Intelligence 72:81-138.
2. Bellman, R. 1957. Dynamic Programming. Princeton University Press.
3. Bertsekas, D. 1995. Dynamic Programming and Optimal Control, (2 Vols). Athena Scientific.
4. Bonet, B., and Geffner, H. 2000. Planning with incomplete information as heuristic search in belief space. In Chien, S.; Kambhampati, S.; and Knoblock, C., eds., Proc. 6th International Conf. on Artificial Intelligence Planning and Scheduling, 52-61. Breckenridge, CO: AAAI Press.
5. Bonet, B., and Geffner, H. 2003. Labeled RTDP: Improving the convergence of real-time dynamic programming. In Giunchiglia, E.; Muscettola, N.; and Nau, D., eds., Proc. 13th International Conf. on Automated Planning and Scheduling, 12-21. Trento, Italy: AAAI Press.
6. Bonet, B., and Geffner, H. 2005. Learning in DFS: A unified approach to heuristic search in deterministic, non-deterministic, probabilistic, and game tree settings.
7. Chakrabarti, P. P. 1994. Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search. Artificial Intelligence 65(2):329-345.
8. Fuxi, Z.; Ming, T.; and Yanxiang, H. 2003. A solution to billiard balls puzzle using AO* algorithm and its application to product development. In Palade, V.; Hewlett, R.; and Jain, L., eds., Proc. 7th International Conf. on Knowledge-Based Intelligent Information & Engineering Systems, 1015-1022. Springer.
9. Garey, M. 1972. Optimal binary identification procedures. SIAM Journal on Applied Mathematics 23(2): 173-186.
10. Hansen, E., and Zilberstein, S. 2001. LAO*: A heuristic search algorithm that finds solutions with loops. Artificial Intelligence 129:35-62.
11. Hart, P.; Nilsson, N.; and Raphael, B. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4:100-107.
12. Ishida, T., and Korf, R. 1995. Moving-target search: A real-time search for changing goals. IEEE Trans. on Pattern Analysis and Machine Intelligence 17:609-619.
13. Jimenéz, P., and Torras, C. 2000. An efficient algorithm for searching implicit AND/OR graphs with cycles. Artificial Intelligence 124:1-30.
14. Koenig, S. 2001. Minimax real-time heuristic search. Artificial Intelligence 129:165-197.
15. Korf, R. 1990. Real-time heuristic search. Artificial Intelligence 42(2-3):189-211.
16. Mahanti, A.; Ghose, S.; and Sadhukhan, S. K. 2003. A framework for searching AND/OR graphs with cycles. CoRR es. AI/0305001.
17. Martelli, A., and Montanari, U. 1973. Additive AND/OR graphs. In Nilsson, N., ed., Proc. 3rd International Joint Conf. on Artificial Intelligence, 1-11. Palo Alto, CA: William Kaufmann.
18. Nilsson, N. 1980. Principles of Artificial Intelligence. Tioga.
19. Pattipati, K., and Alexandridis, M. 1990. Applications of heuristic search and information theory to sequential fault diagnosis. IEEE Trans. System, Man and Cybernetics 20:872-887.
20. Pearl, J. 1983. Heuristics. Morgan Kaufmann.
21. Plaat, A.; Schaeffer, J.; Pijls, W.; and de Bruin, A. 1996. Best-first fixed-depth minimax algorithms. Artificial Intelligence 87(12):255-293.
22. Reinefeld, A., and Marsland, T. 1994. Enhanced iterative-deepening search. IEEE Trans. on Pattern Analysis and Machine Intelligence 16(7):701-710.
23. Russell, S., and Norvig, P. 1994. Artificial Intelligence: A Modern Approach. Prentice Hall.