The Need for Different Domain-Independent Heuristics (1994)
Cached
Download Links
- [www-2.cs.cmu.edu]
- [ktm.ius.cs.cmu.edu]
- [www.salford.ac.uk]
- [www.cs.cmu.edu]
- [www.cs.cmu.edu]
- [www.ri.cmu.edu]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the Second International Conference on AI Planning Systems |
| Citations: | 41 - 14 self |
BibTeX
@INPROCEEDINGS{Stone94theneed,
author = {Peter Stone and Manuela Veloso and Jim Blythe},
title = {The Need for Different Domain-Independent Heuristics},
booktitle = {In Proceedings of the Second International Conference on AI Planning Systems},
year = {1994},
pages = {164--169}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
PRODIGY's planning algorithm uses domain-independent search heuristics. In this paper, we support our belief that there is no single search heuristic that performs more efficiently than others for all problems or in all domains. The paper presents three different domin-independent search heuristics of increasing complexity. We run PRODIGY with these heuristics in a series of artificial domains (introduced in (Barrett & Weld 1994)) where in act one of the heuristics performs more efficiently than the others. However, we introduce an additional simple domain where the apparently worst heuristic outperforms the other two. The results we obtained...
Citations
| 109 | PRODIGY: an integrated architecture for planning and learning - Carbonell, Etzioni, et al. - 1991 |
| 16 | Is there any need for domain-dependent control information - Ginsberg, Geddis - 1991 |
| 13 | Characterizing subgoal interactions for planning - Barrett, Weld - 1993 |
| 4 | Partial-order planning:Evaluating possible e ciency gains. Arti - cial Intelligence 67(1 - Barrett, Weld - 1994 |
