Best-first utility-guided search

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 2378-2384

  Ruml, Wheeler ^a   Do, Minh B ^a  

^a PALO ALTO RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANY-TIME ALGORITHMS; OPTIMAL SOLUTIONS; SEQUENCE ALIGNMENTS; SHORTEST PATH PROBLEM; STATE-OF-THE-ART APPROACH; TEMPORAL PLANNING; USER'S PREFERENCES; UTILITY FUNCTIONS;

ARTIFICIAL INTELLIGENCE;

ALGORITHMS;

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

References (17)

1. B. Bonet and H. Geffner. Planning as heuristic search. Artificial Intelligence, 129(1-2):5-33, 2001. (Pubitemid 32498414)
2. Rina Dechter and Judea Pearl. The optimality of A*. In Laveen Kanal and Vipin Kumar, editors, Search in Artificial Intelligence, pages 166-199. Springer-Verlag, 1988.
3. Eric A. Hansen, Shlomo Zilberstein, and Victor A. Danilchenko. Anytime heuristic search: First results. CMPSCI 97-50, University of Massachusetts, Amherst, September 1997.
4. Peter E. Hart, Nils J. Nilsson, and Bertram Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions of Systems Science and Cybernetics, SSC-4(2):100-107, July 1968.
5. Patrik Haslum and Héctor Geffner. Heuristic planning with time and resources. In Proceedings of ECP- 01, 2001.
6. Jörg Hoffmann and Bernhard Nebel. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research, 14:253-302, 2001.
7. Heath Hohwald, Ignacio Thayer, and Richard E. Korf. Comparing best-first search and dynamic programming for optimal multiple sequence alignment. In Proceedings of IJCAI-03, pages 1239-1245, 2003.
8. Hirotada Kobayashi and Hiroshi Imai. Improvement of the A*algorithm for multiple sequence alignment. In Proceedings of the 9th Workshop on Genome Informatics, pages 120-130, 1998.
9. Richard E. Korf. Real-time heuristic search. Artificial Intelligence, 42:189-211, 1990.
10. Maxim Likhachev, Geoff Gordon, and Sebastian Thrun. ARA*: Anytime A*with provable bounds on sub-optimality. In Proceedings of NIPS 16, 2004.
11. Nils J. Nilsson. Problem-Solving Methods in Artificial Intelligence. McGraw-Hill, 1971.
12. Nils J. Nilsson. Principles of Artificial Intelligence. Tioga Publishing Co, 1980.
13. Judea Pearl and Jin H. Kim. Studies in semi-admissible heuristics. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-4(4):391-399, July 1982.
14. Ira Pohl. Heuristic search viewed as path finding in a graph. Artificial Intelligence, 1:193-204, 1970.
15. Stuart Russell and Eric Wefald. Do the Right Thing: Studies in Limited Rationality. MIT Press, 1991.
16. Rong Zhou and Eric A. Hansen. Multiple sequence alignment using Anytime A*. In Proceedings of AAAI-02, pages 975-976, 2002.
17. Rong Zhou and Eric Hansen. Breadth-first heuristic search. Artificial Intelligence, 170(4-5):385-408, 2006.