Abstract. State-of-the-art planners need to use different strategies to cope with the increasing complexity of realistic planning problems. These strategies tend to simplify the problem to make it more affordable. The separation of the planning and scheduling parts, the relaxation of the original problem, the application of heuristics, etc. are usual in modern planning. In this paper, we present an ongoing approach that divides the planning process into two consecutive stages. First, a sequential plan is generated by discarding the numeric conditions/effects of actions, thus ignoring the scheduling part of the problem. Second, this plan is parallelised while the satisfaction of numeric constraints is guaranteed, thus taking the scheduling p...
This paper studies novel subgoaling relaxations for automated planning with propositional and numeri...
This thesis deals with planning problems and Boolean satisfiability problems that represent major ch...
AbstractThe idea of synthesizing bounded length plans by compiling planning problems into a combinat...
Most of the key computational ideas in planning have been developed for simple planning languages wh...
Most of the key computational ideas in planning have been developed for simple planning languages wh...
Automated planning is known to be computationally hard in the general case. Propositional planning i...
Automated planning is known to be computationally hard in the general case. Propositional planning i...
AbstractThis paper presents an integrated view of a wide range of planning systems derived from diff...
International audienceWe present in this paper a hybrid planning system which combines constraint sa...
International audienceWe present in this paper a hybrid planning system which combines constraint sa...
International audienceWe present in this paper a hybrid planning system which combines constraint sa...
Branching and lower bounds are two key notions in heuristic search and combinatorial optimization. B...
This paper studies novel subgoaling relaxations for automated planning with propositional and numeri...
Numeric planning is known to be undecidable even under severe restrictions. Prior work has investiga...
AbstractIn most real-world reasoning problems, planning and scheduling phases are loosely coupled. F...
This paper studies novel subgoaling relaxations for automated planning with propositional and numeri...
This thesis deals with planning problems and Boolean satisfiability problems that represent major ch...
AbstractThe idea of synthesizing bounded length plans by compiling planning problems into a combinat...
Most of the key computational ideas in planning have been developed for simple planning languages wh...
Most of the key computational ideas in planning have been developed for simple planning languages wh...
Automated planning is known to be computationally hard in the general case. Propositional planning i...
Automated planning is known to be computationally hard in the general case. Propositional planning i...
AbstractThis paper presents an integrated view of a wide range of planning systems derived from diff...
International audienceWe present in this paper a hybrid planning system which combines constraint sa...
International audienceWe present in this paper a hybrid planning system which combines constraint sa...
International audienceWe present in this paper a hybrid planning system which combines constraint sa...
Branching and lower bounds are two key notions in heuristic search and combinatorial optimization. B...
This paper studies novel subgoaling relaxations for automated planning with propositional and numeri...
Numeric planning is known to be undecidable even under severe restrictions. Prior work has investiga...
AbstractIn most real-world reasoning problems, planning and scheduling phases are loosely coupled. F...
This paper studies novel subgoaling relaxations for automated planning with propositional and numeri...
This thesis deals with planning problems and Boolean satisfiability problems that represent major ch...
AbstractThe idea of synthesizing bounded length plans by compiling planning problems into a combinat...