Sciweavers

17 search results - page 1 / 4
» Heuristics for Planning with Action Costs Revisited
Sort
View
ECAI
2008
Springer
13 years 6 months ago
Heuristics for Planning with Action Costs Revisited
We introduce a simple variation of the additive heuristic used in the HSP planner that combines the benefits of the original additive heuristic, namely its mathematical formulation...
Emil Keyder, Hector Geffner
CAEPIA
2007
Springer
13 years 10 months ago
Heuristics for Planning with Action Costs
We introduce a non-admissible heuristic for planning with action costs, called the set-additive heuristic, that combines the benefits of the additive heuristic used in the HSP pla...
Emil Keyder, Hector Geffner
AIPS
2007
13 years 6 months ago
Cost-Sharing Approximations for h+
Relaxations based on (either complete or partial) ignoring delete effects of the actions provide the basis for some seminal classical planning heuristics. However, the palette of ...
Vitaly Mirkis, Carmel Domshlak
JAIR
2010
167views more  JAIR 2010»
13 years 2 months ago
The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks
LAMA is a classical planning system based on heuristic forward search. Its core feature is the use of a pseudo-heuristic derived from landmarks, propositional formulas that must b...
Silvia Richter, Matthias Westphal
SCAI
2008
13 years 5 months ago
Troubleshooting when Action Costs are Dependent with Application to a Truck Engine
We propose a troubleshooting algorithm that can troubleshoot systems with dependent action costs. When actions are performed they may change the way the system is decomposed and af...
Håkan Warnquist, Mattias Nyberg, Petter S&au...