Cost based search considered harmful (extended abstract)

William Cushing, J. Benton, Subbarao Kambhampati

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Scopus citations

Abstract

Planning research has returned to the issue of optimizing costs (rather than sizes) of plans. A prevalent perception, at least among non-experts in search, is that graph search for optimizing the size of paths generalizes more or less trivially to optimizing the cost of paths. While this kind of generalization is usually straightforward for graph theorems, graph algorithms are a different story. In particular, implementing a search evaluation function by substituting cost for size is a Bad Idea. Though experts have stated as much, cutting-edge practitioners are still learning of the consequences the hard way; here we mount a forceful indictment on the inherent dangers of cost-based search.1

Original languageEnglish (US)
Title of host publicationProceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010
Pages140-141
Number of pages2
StatePublished - Dec 1 2010
Event3rd International Symposium on Combinatorial Search, SoCS 2010 - Atlanta, GA, United States
Duration: Jul 8 2010Jul 10 2010

Publication series

NameProceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010

Other

Other3rd International Symposium on Combinatorial Search, SoCS 2010
CountryUnited States
CityAtlanta, GA
Period7/8/107/10/10

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Cost based search considered harmful (extended abstract)'. Together they form a unique fingerprint.

  • Cite this

    Cushing, W., Benton, J., & Kambhampati, S. (2010). Cost based search considered harmful (extended abstract). In Proceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010 (pp. 140-141). (Proceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010).