Cost based search considered harmful (extended abstract)

William Cushing, J. Benton, Subbarao Kambhampati

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

10 Citations (Scopus)

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 - 2010
Event3rd International Symposium on Combinatorial Search, SoCS 2010 - Atlanta, GA, United States
Duration: Jul 8 2010Jul 10 2010

Other

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

Fingerprint

Costs
Function evaluation
Planning

ASJC Scopus subject areas

  • Computer Networks and Communications

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)

Cost based search considered harmful (extended abstract). / Cushing, William; Benton, J.; Kambhampati, Subbarao.

Proceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010. 2010. p. 140-141.

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

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, 3rd International Symposium on Combinatorial Search, SoCS 2010, Atlanta, GA, United States, 7/8/10.
Cushing W, Benton J, Kambhampati S. Cost based search considered harmful (extended abstract). In Proceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010. 2010. p. 140-141
Cushing, William ; Benton, J. ; Kambhampati, Subbarao. / Cost based search considered harmful (extended abstract). Proceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010. 2010. pp. 140-141
@inproceedings{321a714fde8646cbb96f8e8404618393,
title = "Cost based search considered harmful (extended abstract)",
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",
author = "William Cushing and J. Benton and Subbarao Kambhampati",
year = "2010",
language = "English (US)",
isbn = "9781577354819",
pages = "140--141",
booktitle = "Proceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010",

}

TY - GEN

T1 - Cost based search considered harmful (extended abstract)

AU - Cushing, William

AU - Benton, J.

AU - Kambhampati, Subbarao

PY - 2010

Y1 - 2010

N2 - 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

AB - 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

UR - http://www.scopus.com/inward/record.url?scp=84893413431&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84893413431&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84893413431

SN - 9781577354819

SP - 140

EP - 141

BT - Proceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010

ER -