50 search results - page 1 / 10 » Heuristics and Symmetries in Classical Planning |
AIPS
2010
13 years 7 months ago
2010
Heuristic functions make MDP solvers practical by reducing their time and memory requirements. Some of the most effective heuristics (e.g., the FF heuristic function) first determ...
ECAI
2006
Springer
13 years 9 months ago
2006
Springer
In many types of planning algorithms distance heuristics play an important role. Most of the earlier works restrict to STRIPS operators, and their application to a more general lan...
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 ...
ECAI
2008
Springer
13 years 6 months ago
2008
Springer
Many forms of reasoning about actions and planning can be reduced to regression, the computation of the weakest precondition a state has to satisfy to guarantee the satisfaction of...
IROS
2009
IEEE
13 years 12 months ago
2009
IEEE
— In our previous works we had developed a framework for self-reconfiguration planning based on graph signature and graph edit-distance. The graph signature is a fast isomorphism...