Breadth-first heuristic search

Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004

Volumn , Issue , 2004, Pages 92-100

  Zhou, Rong ^a   Hansen, Eric A ^a  

^a MISSISSIPPI STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BEAM SEARCH ALGORITHMS; HEURISTIC SEARCH; LINEAR-SPACE SEARCH ALGORITHMS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; LINEAR SYSTEMS; MOTION PLANNING; PROBLEM SOLVING; ROBOTICS;

HEURISTIC METHODS;

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

References (13)

1. Bonet, B., and Geffner, H. 2001 a. Heuristic search planner 2.0. AI Magazine 22(3):77-80.
2. Bonet, B., and Geffner, H. 2001b. Planning as heuristic search. Artificial Intelligence 129(1):5-33.
3. Haslum, P., and Geffner, H. 2000. Admissible heuristics for optimal planning. In Proc. of the 5th International Conference on AI Planning and Scheduling, 140-149.
4. Hirschberg, D. S. 1975. A linear space algorithm for computing maximal common subsequences. Communications of the ACM 18(6):341-343.
5. Korf, R. 1985. Depth-first iterative deepening: An optimal admissible tree search. Artificial Intelligence 27:97-109.
6. Korf, R. 1993. Linear-space best-first search. Artificial Intelligence 62:41-78.
7. Korf, R. 1999. Divide-and-conquer bidirectional search: First results. In Proc. of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), 1184-1189.
8. Korf, R., and Zhang, W. 2000. Divide-and-conquer frontier search applied to optimal sequence alignment. In Proceedings of the 17th National Conference on Artificial Intelligence (AAAI-00), 910-916.
9. Miura, T., and Ishida, T. 1998. Stochastic node caching for memory-bounded search. In Proc. of the 15th National Conference on Artificial Intelligence (AAAI-98), 450-456.
10. Myers, E., and Miller, W. 1988. Optimal alignments in linear space. Computer Appl. in the Biosciences 4:11-17.
11. Reinefeld, A., and Marsland, T. 1994. Enhanced iterative-deepening search. IEEE Trans. on Pattern Analysis and Machine Intelligence 16:701-710.
12. Zhou, R., and Hansen, E. 2003a. Sparse-memory graph search. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03), 1259-1266.
13. Zhou, R., and Hansen, E. 2003b. Sweep A*: Space-efficient heuristic search in partially ordered graphs. In Proc. of the 15th IEEE International Conf. on Tools with Artificial Intelligence, 427-434.