An Approach to Temporal Planning and Scheduling in Domains with Predictable Exogenous Events

@article{Gerevini2006AnAT,
  title={An Approach to Temporal Planning and Scheduling in Domains with Predictable Exogenous Events},
  author={A. Gerevini and A. Saetti and I. Serina},
  journal={J. Artif. Intell. Res.},
  year={2006},
  volume={25},
  pages={187-231}
}
The treatment of exogenous events in planning is practically important in many real-world domains where the preconditions of certain plan actions are affected by such events. In this paper we focus on 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. When actions have durations, handling such temporal constraints adds an extra difficulty to planning. We… Expand
A Temporal Relaxed Planning Graph Heuristic for Planning with Envelopes
TLDR
An adaptation of a Temporal Relaxed Planning Graph heuristic is presented, that accounts for dependencies between facts and actions in the relaxed planning graph; and the envelopes that are open in the state being evaluated, that significantly improves the performance of a temporal planner on benchmark domains with required concurrency. Expand
Temporal-numeric planning with control parameters
TLDR
This thesis motivates a proposed extension to PDDL to allow actions with infinite domain parameters, which are called control parameters, and proposes an extension to a delete-relaxation heuristic, called the Temporal Relaxed Planning Graph, to tackle problems with control parameters; especially in problems with producer-consumer relationship of actions. Expand
Planning with Problems Requiring Temporal Coordination
TLDR
CRIKEY3 is the first planner capable of reasoning with both the full semantics of PDDL2.1 (level 3) temporal planning and with numeric resources, and introduces a new temporal variant of the Relaxed Planning Graph heuristic that is capable of Reasoning with the features of this class of domains. Expand
When is Temporal Planning Really Temporal?
TLDR
A complete state-space temporal planning algorithm is designed, which the authors hope will be able to achieve high performance by leveraging the heuristics that power decision epoch planners. Expand
Planning in domains with derived predicates through rule-action graphs and local search
TLDR
This paper proposes an approach to planning with derived predicates where the search space consists of “Rule-Action Graphs”, particular graphs of actions and rules representing derived predicate, which are integrated into a framework for planning through local search and rule-action graphs. Expand
Extending the Use of Inference in Temporal Planning as Forwards Search
TLDR
This paper shows how to improve the performance of forward-search planners that attempt to solve the full temporal planning problem, both by narrowing the use of the concurrency machinery to situations that demand it and also by improving the power of inference to prune redundant branches of the search space for common patterns of interaction in temporal domains that do require concurrency. Expand
Temporal Planning with Preferences and Time-Dependent Continuous Costs
TLDR
This paper considers modeling and reasoning with plan quality metrics that are not directly correlated with plan makespan, building on the planner POPF and presents a mixed integer programming encoding to manage the the interaction between the hard temporal constraints for plan steps, and soft temporal constraint for preferences. Expand
ITSAT: An Efficient SAT-Based Temporal Planner
TLDR
The empirical results show that not only does ITSAT outperform the state-of-the-art temporally expressive planners, it is also competitive with the fast temporal planners that cannot handle required concurrency. Expand
Automated Planning in Temporal Domains: Some Recent Advances and Current Research Topics
  • A. Gerevini
  • Computer Science
  • 14th International Symposium on Temporal Representation and Reasoning (TIME'07)
  • 2007
TLDR
A solution of a planning problem is a (partially) ordered set of actions forming a valid plan, whose execution in the initial state transforms it into a world state where the problem goals are satisfied. Expand
TLP-GP: Solving Temporally-Expressive Planning Problems
  • F. Maris, P. Régnier
  • Computer Science
  • 2008 15th International Symposium on Temporal Representation and Reasoning
  • 2008
TLDR
An algorithm which solves temporally-expressive planning problems, that is problems for which all possible solutions require concurrency of actions, and is compared with two state-of-the-art temporally -expressive planners such as LPGP and VHPOP. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 50 REFERENCES
Integrating Planning and Temporal Reasoning for Domains with Durations and Time Windows
TLDR
A new approach to planning in domains with durations and time windows is proposed, combining graph-based planning and disjunctive constraint-based temporal reasoning, which is implemented in a planner that took part in the 4th International Planning Competition. Expand
Planning with Disjunctive Temporal Constraints
Many real-world problems contain elements of both planning and scheduling problems. In response, many frameworks and systems have been developed that add scheduling abilities to planning systems. WeExpand
Planning Through Stochastic Local Search and Temporal Action Graphs in LPG
TLDR
This paper focuses on temporal planning, introducing TA-graphs and proposing some techniques to guide the search in LPG using this representation, and shows that these techniques can be very effective. Expand
Planning in Time: Windows and Durations for Activities and Goals
  • S. Vere
  • Computer Science, Medicine
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • 1983
A general purpose automated planner/scheduler is described which generates parallel plans to achieve goals with imposed time con-straints. Both durations and start time windows may be specified forExpand
Extended Critical Paths in Temporal Planning
Timed initial literals refer to a recently added feature to the problem domain description language PDDL. Besides the modelling perspective to express exogenous events, this language extension allowsExpand
Planning-Scheduling Connections through Exogenous Events
Exogenous events appear in many practical planning and scheduling problems but until recently only the latter methodology has explicitly dealt with them. While exogenous events are commonly viewed asExpand
Fast Planning in Domains with Derived Predicates: An Approach Based on Rule-Action Graphs and Local Search
TLDR
This paper presents some techniques for representing rules and reasoning with them, which are integrated into a method for planning through local search and rule-action graphs, and proposes some new heuristics for guiding the search. Expand
Temporal Planning with Mutual Exclusion Reasoning
TLDR
This paper presents TGP, a new algorithm for temporal planning that operates by incrementally expanding a compact planning graph representation that handles actions of differing duration and demonstrates that mutual exclusion reasoning remains valuable in a rich temporal setting. Expand
Sapa: A Multi-objective Metric Temporal Planner
TLDR
An implementation of Sapa using many of the techniques presented in this paper was one of the best domain independent planners for domains with metric and temporal constraints in the third International Planning Competition, held at AIPS-02. Expand
PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains
TLDR
The syntax of the language, PDDL2.1, is described, which has considerable modelling power -- exceeding the capabilities of current planning technology -- and presents a number of important challenges to the research community. Expand
...
1
2
3
4
5
...