Faster than weighted A*: An optimistic approach to bounded suboptimal search

ICAPS 2008 - Proceedings of the 18th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2008, Pages 355-362

  Thayer, Jordan T ^a   Ruml, Wheeler ^a  

^a Univ of New Hampshire   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING;

BENCHMARK DOMAINS; HEURISTIC SEARCHES; OPTIMISTIC APPROACHES; OTHER APPLICATIONS; PATH FINDINGS; SHORTEST-PATH PROBLEMS; SPEED-UP; SUBOPTIMALITY; TEMPORAL PLANNING;

SCHEDULING;

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

References (14)

1. Bonet, B., and Geffner, H. 2001. Planning as heuristic search. Artificial Intelligence 129(1-2):5-33.
2. Hansen, E. A., and Zhou, R. 2007. Anytime heuristic search. Journal of Artificial Intelligence Research 28:267-297.
3. Hart, P. E.; Nilsson, N. J.; and Raphael, B. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions of Systems Science and Cybernetics SSC-4(2):100-107.
4. Haslum, P., and Geffner, H. 2001. Heuristic planning with time and resources. In Proceedings of ECP-01.
5. Helmert, M., and Roger, G. 2007. How good is almost perfect? In Proceedings of the ICAPS-2007 Workshop on Heuristics for Domain-independent Planning: Progress, Ideas, Limitations, Challenges.
6. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14:253-302.
7. *: An optimal admissible tree search. In Proceedings of IJCAI-85, 1034-1036.
8. Korf, R. E. 1990. Real-time heuristic search. Artificial Intelligence 42:189-211.
9. * with provable bounds on sub-optimality. In Proceedings of NIPS 16.
10. Pearl, J., and Kim, J. H. 1982. Studies in semi-admissible heuristics. IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-4(4):391-399.
11. Pearl, J. 1984. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley.
12. Pohl, I. 1970. Heuristic search viewed as path finding in a graph. Artificial Intelligence 1:193-204.
13. Pohl, I. 1973. The avoidance of (relative) catastrophe, heuristic competence, genuine dynamic weighting and computation issues in heuristic problem solving. In Proceedings of IJCAI-73, 12-17.
14. Zhou, R., and Hansen, E. 2006. Breadth-first heuristic search. Artificial Intelligence 170(4-5):385-408.