179 search results - page 3 / 36 » An LP-Based Heuristic for Optimal Planning |
IJCAI
2007
13 years 6 months ago
2007
In this paper we propose a suite of techniques for planning with temporally extended preferences (TEPs). To this end, we propose a method for compiling TEP planning problems into ...
EMMCVPR
2009
Springer
13 years 11 months ago
2009
Springer
We describe a scheme for solving Energy Minimization problems, which is based on the A∗ algorithm accomplished with appropriately chosen LP-relaxations as heuristic functions. Th...
AIPS
2007
13 years 7 months ago
2007
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 ...
PAAMS
2010
Springer
13 years 10 months ago
2010
Springer
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
EVOW
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. The strategic supply chain design problem which allows capacity shifts and budget limitations can be formulated as a linear program. Since facilities are allowed to be op...