Corpus ID: 8636641

When is Temporal Planning Really Temporal?

@inproceedings{Cushing2007WhenIT,
  title={When is Temporal Planning Really Temporal?},
  author={William Cushing and S. Kambhampati and Mausam and Daniel S. Weld},
  booktitle={IJCAI},
  year={2007}
}
While even STRIPS planners must search for plans of unbounded length, temporal planners must also cope with the fact that actions may start at any point in time. Most temporal planners cope with this challenge by restricting action start times to a small set of decision epochs, because this enables search to be carried out in state-space and leverages powerful state-based reachability heuristics, originally developed for classical planning. Indeed, decision-epoch planners won the International… Expand
Research in Concurrent Planning
While even STRIPS planners must search for plans of unbounded length, temporal planners must also cope with the fact that actions may start at any point in time. Most temporal planners cope with thisExpand
Managing concurrency in temporal planning using planner-scheduler interaction
TLDR
The contribution is to describe the first competitive planner capable of solving problems that require concurrent actions, Crikey, that can successfully tackle a wide range of temporal problems. Expand
Evaluating Temporal Planning Domains
TLDR
The analysis establishes that the benchmark domains are indeed inherently sequential, and suggests some real-world domains with required concurrency, and uses a compilation argument to show that these are harder in the sense that they correspond to longer sequential plans. 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
Temporally-Expressive Planning as Constraint Satisfaction Problems
TLDR
An alternative view of temporal planning is proposed by investigating a new declarative semantics of PDDL, and a natural encoding of this semantics in a constraint programming setting is shown that can solve more general planning problems than the current state-of-the-art. Expand
A New Approach to Temporal Planning with Rich Metric Temporal Properties
TLDR
The empirical study shows that MTP outperforms the state-of-the-art PDDL+ planner SMTPlan+ on several domains it performed best on and MTP performs and scales on problem size well for challenging domains with rich temporal properties the authors create. Expand
Temporal Landmarks: What Must Happen, and When
TLDR
It is shown how to derive temporal landmarks and constraints on their associated time points from planning problems, and how exploiting them, in a planner-independent way, can improve planner performance. Expand
A Complete State-Space Based Temporal Planner
TLDR
This paper presents a pruning method for solving the next troublesome issue is solving a simple temporal problem (STP) in each state for computing g-values and introduces a new method that solves them more efficiently than the state of the art algorithms do. Expand
Temporal Planning With Required Concurrency Using Classical Planning
TLDR
This paper describes novel classes of temporal planning instances for which TPSHE is provably sound and complete, and significantly outperforms all planners from the temporal track of the International Planning Competition. Expand
Situated Planning for Execution Under Temporal Constraints
TLDR
A new approach for time-sensitive temporal planning is described that is aware of the fact that plan execution will start only once planning finishes, and incorporates this information into its decision making, in order to focus the search on branches that are more likely to lead to plans that will be feasible when the planner finishes. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 137 REFERENCES
Managing concurrency in temporal planning using planner-scheduler interaction
TLDR
The contribution is to describe the first competitive planner capable of solving problems that require concurrent actions, Crikey, that can successfully tackle a wide range of temporal problems. Expand
Evaluating Temporal Planning Domains
TLDR
The analysis establishes that the benchmark domains are indeed inherently sequential, and suggests some real-world domains with required concurrency, and uses a compilation argument to show that these are harder in the sense that they correspond to longer sequential plans. 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
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
VHPOP: Versatile Heuristic Partial Order Planner
VHPOP is a partial order causal link (POCL) planner loosely based on UCPOP. It draws from the experience gained in the early to mid 1990's on flaw selection strategies for POCL planning, and combinesExpand
Taming Numbers and Durations in the Model Checking Integrated Planning System
TLDR
The most important algorithmic novelties that were necessary to tackle the new layers of expressiveness in the benchmark problems and to achieve a high level of performance are introduced and analyzed. Expand
An Approach to Temporal Planning and Scheduling in Domains with Predictable Exogenous Events
TLDR
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
Complexity of Concurrent Temporal Planning
TLDR
These results are the first to show that temporal planning can be computationally more complex than classical planning and show how and why a very large and important fragment of temporal PDDL is reducible to classical planning. Expand
Branching and pruning: An optimal temporal POCL planner based on constraint programming
TLDR
A domain-independent formulation of temporal planning based on Constraint Programming is introduced that successfully combines a POCL branching scheme with powerful and sound pruning rules and is competitive with the best parallel planners in the special case in which actions have all the same duration. Expand
Planning with Resources and Concurrency: A Forward Chaining Approach
TLDR
It is shown how the forward chaining approach to planning can be extended to allow it to solve planning problems with concurrently executable actions with varying durations, and metric quantities like resources, both essential for modeling real applications. Expand
...
1
2
3
4
5
...