@COMMENT This file was generated by bib2html.pl <http://www.cs.cmu.edu/~pfr/misc_software/index.html#bib2html> version 0.90
@COMMENT written by Patrick Riley <http://www.cs.cmu.edu/~pfr>
@COMMENT This file came from Peter Stone's publication pages at
@COMMENT http://www.cs.utexas.edu/~pstone/papers
@InProceedings(StoVelBly94, Author="Peter Stone and Manuela Veloso and Jim Blythe",
        Title="The need for different domain-independent heuristics",
        Booktitle="Proceedings of the Second International Conference on {AI} Planning Systems",
        pages="164--169",
        Year="1994", Month="June",
        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 domain-independent search heuristics
                  of increasing complexity. We run PRODIGY with these
                  heuristics in a series of artificial domains where
                  in fact 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 in our empirical experiments
                  lead to the main conclusion of this paper: planning
                  algorithms need to use different search heuristics
                  in different domains.  We conclude the paper by
                  advocating the need to learn the correspondence
                  between particular domain characteristics and
                  specific search heuristics for planning efficiently
                  in complex domains.
        },
)