Planning with problems requiring temporal coordination

Authors:
Andrew Coles;Maria Fox;Derek Long;Amanda Smith
Affiliations:
Department of Computer and Information Sciences, University of Strathclyde, Glasgow, UK;Department of Computer and Information Sciences, University of Strathclyde, Glasgow, UK;Department of Computer and Information Sciences, University of Strathclyde, Glasgow, UK;Department of Computer and Information Sciences, University of Strathclyde, Glasgow, UK
Venue:
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Year:
2008

Citing 8
Cited 7

Temporal Planning with Mutual Exclusion Reasoning

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Managing concurrency in temporal planning using planner-scheduler interaction

Artificial Intelligence
The FF planning system: fast plan generation through heuristic search

Journal of Artificial Intelligence Research
PDDL2.1: an extension to PDDL for expressing temporal planning domains

Journal of Artificial Intelligence Research
VHPOP: versatile heuristic partial order planner

Journal of Artificial Intelligence Research
An approach to temporal planning and scheduling in domains with predictable exogenous events

Journal of Artificial Intelligence Research
Temporal planning using subgoal partitioning and resolution in SGPlan

Journal of Artificial Intelligence Research
When is temporal planning really temporal?

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence

The role of AI planning as a decision support tool in power substation management

AI Communications
Temporal planning in domains with linear processes

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A temporally expressive planner based on answer set programming with constraints: preliminary design

Logic programming, knowledge representation, and nonmonotonic reasoning
A universal planning system for hybrid domains

Applied Intelligence
COLIN: planning with continuous linear numeric change

Journal of Artificial Intelligence Research
Flexible execution of partial order plans with temporal constraints

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
A SAT-based approach to cost-sensitive temporally expressive planning

ACM Transactions on Intelligent Systems and Technology (TIST) - Special Section on Intelligent Mobile Knowledge Discovery and Management Systems and Special Issue on Social Web Mining

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the first planner capable of reasoning with both the full semantics of PDDL2.1 (level 3) temporal planning and with numeric resources. Our planner, CRIKEY3, employs heuristic forward search, using the start-and-end semantics of PDDL2.1 to manage temporal actions. The planning phase is interleaved with a scheduling phase, using a Simple Temporal Network, in order to ensure that temporal constraints are met. To guide search, we introduce a new temporal variant of the Relaxed Planning Graph heuristic that is capable of reasoning with the features of this class of domains, along with the Timed Initial Literals of PDDL2.2. CRIKEY3 extends the state-of-the-art in handling the full temporal expressive power of PDDL2.1, including numeric temporal domains.