Corpus ID: 26974327

Automated planning - theory and practice

  title={Automated planning - theory and practice},
  author={M. Ghallab and D. Nau and P. Traverso},
1 Introduction and Overview I Classical Planning 2 Representations for Classical Planning*3 Complexity of Classical Planning*4 State-Space Planning*5 Plan-Space Planning II Neoclassical Planning 6 Planning-Graph Techniques*7 Propositional Satisfiability Techniques*8 Constraint Satisfaction Techniques III Heuristics and Control Strategies 9 Heuristics in Planning*10 Control Rules in Planning*11 Hierarchical Task Network Planning*12 Control Strategies in Deductive Planning IV Planning with Time… Expand
An integrated model of planning and scheduling: main advantages and challenges
The main advantages and challenges of a novel model that integrates planning and scheduling, which homogeneously solves resources conflicts, in a flexible design with a strongly coupled form are analyzed. Expand
Integrating Constraint Models for Sequential and Partial-Order Planning
This paper extends the existing constraint model for sequential planning by constraints describing satisfaction of open goals and demonstrates experimentally that this extension pays-off especially when the planning problems become harder. Expand
An underlying framework based on planning graphs that provides a rich source for extracting distance-based heuristics for disjunctive planning and regression state-space planning and extensions to the heuristic framework to support the generation of parallel plans in state- space search. Expand
Improving the Performance of Hybrid Planning
A new pre-processing technique for hybrid planning - a method that combines reasoning about procedural knowledge and causalities and it is proved that the plan existence problem is decidable. Expand
Determining Redundant Actions in Sequential Plans
Techniques for determining redundancy of actions in plans are presented accompanied with necessary theoretical foundations and are also empirically evaluated using existing planning systems and standard planning benchmarks. Expand
An Approach to Temporal Planning and Scheduling in Domains with Predictable Exogenous Events
This paper proposes an approach to planning in temporal domains with exogenous events that happen at known times, imposing the constraint that certain actions in the plan must be executed during some predefined time windows which integrates constraint-based temporal reasoning into a graph-based planning framework using local search. Expand
The 28th International Conference on Automated Planning and Scheduling
Deep Probabilistic Planning combines gradient-based optimization in deep neural nets with ideas from probabilistic planning in order to efficiently solve continuous sequential decision-makingExpand
Programmatic Task Network Planning
This paper presents programmatic task networks (PTN), a formalism that extends classical HTN planning in three ways, and allows both operations and methods to have outputs instead of only inputs. Expand
Timeline-based Planning and Execution with Uncertainty: Theory, Modeling Methodologies and Practice
The objective of this work is to investigate the timeline-based approach to planning by addressing several aspects ranging from the semantics of the related planning concepts to the modeling and solving techniques. Expand
Constraint satisfaction for planning and scheduling problems
This issue mainly focus on managing complex problems where planning, scheduling, constraint satisfaction and search must be combined and/or interrelated, which entails an enormous potential for practical applications and future research. Expand