14 search results - page 1 / 3 » Reformulating Constraint Models for Classical Planning |
FLAIRS
2008
13 years 6 months ago
2008
Constraint satisfaction techniques are commonly used for solving scheduling problems, still they are rare in AI planning. Although there are several attempts to apply constraint s...
CCO
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. We study in this lecture the literature on mixed integer programming models and formulations for a specific problem class, namely deterministic production planning probl...
SARA
2009
Springer
13 years 11 months ago
2009
Springer
Classical planning deals with finding a (shortest) sequence of actions transferring the world from its initial state to a state satisfying the goal condition. Traditional planning...
KR
1994
Springer
13 years 8 months ago
1994
Springer
Despite the long history of classical planning, there has been very little comparative analysis of the performance tradeoffs offered by the multitude of existing planning algorith...
CVPR
2011
IEEE
13 years 20 days ago
2011
IEEE
In this paper we reformulate the 3D reconstruction of deformable surfaces from monocular video sequences as a labeling problem. We solve simultaneously for the assignment of featu...