Computer Science – Artificial Intelligence
Scientific paper
2011-03-18
Computer Science
Artificial Intelligence
Longer version of an extended abstract from SOCS 2010
Scientific paper
Recently, several researchers have found that cost-based satisficing search with A* often runs into problems. Although some "work arounds" have been proposed to ameliorate the problem, there has not been any concerted effort to pinpoint its origin. In this paper, we argue that the origins can be traced back to the wide variance in action costs that is observed in most planning domains. We show that such cost variance misleads A* search, and that this is no trifling detail or accidental phenomenon, but a systemic weakness of the very concept of "cost-based evaluation functions + systematic search + combinatorial graphs". We show that satisficing search with sized-based evaluation functions is largely immune to this problem.
Benton J.
Cushing William
Kambhampati Subbarao
No associations
LandOfFree
Cost Based Satisficing Search Considered Harmful does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Cost Based Satisficing Search Considered Harmful, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cost Based Satisficing Search Considered Harmful will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-185881