Cost based search considered harmful (extended abstract)

William Cushing; J. Benton; Subbarao Kambhampati

Cost based search considered harmful (extended abstract)

William Cushing, J. Benton, Subbarao Kambhampati

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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 language	English (US)
Title of host publication	Proceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010
Pages	140-141
Number of pages	2
State	Published - Dec 1 2010
Event	3rd International Symposium on Combinatorial Search, SoCS 2010 - Atlanta, GA, United States Duration: Jul 8 2010 → Jul 10 2010

Publication series

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

Other

Other	3rd International Symposium on Combinatorial Search, SoCS 2010
Country/Territory	United States
City	Atlanta, GA
Period	7/8/10 → 7/10/10

ASJC Scopus subject areas

Computer Networks and Communications

Cite this

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 (Proceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010).

Research output: Chapter in Book/Report/Conference proceeding › Conference 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. 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.

@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",

month = dec,

day = "1",

language = "English (US)",

isbn = "9781577354819",

series = "Proceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010",

pages = "140--141",

booktitle = "Proceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010",

note = "3rd International Symposium on Combinatorial Search, SoCS 2010 ; Conference date: 08-07-2010 Through 10-07-2010",

}

TY - GEN

T1 - Cost based search considered harmful (extended abstract)

AU - Cushing, William

AU - Benton, J.

AU - Kambhampati, Subbarao

PY - 2010/12/1

Y1 - 2010/12/1

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

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

SP - 140

EP - 141

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

T2 - 3rd International Symposium on Combinatorial Search, SoCS 2010

Y2 - 8 July 2010 through 10 July 2010

ER -

Cost based search considered harmful (extended abstract)

Abstract

Publication series

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this