PDDL 2.1: representation vs. computation

Authors:
Hétor Geffner
Affiliations:
ICREA, Universitat Pomoeu Fabra, Barcelona, Spain
Venue:
Journal of Artificial Intelligence Research
Year:
2003

Citing 9
Cited 0

Practical planning: extending the classical AI planning paradigm

Practical planning: extending the classical AI planning paradigm
O-Plan: the open planning architecture

Artificial Intelligence
Constraint-Based Scheduling

Constraint-Based Scheduling
Algorithms for propagating resource constraints in AI planning and scheduling: existing approaches and new results

Artificial Intelligence
Temporal Planning with Mutual Exclusion Reasoning

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Numeric State Variables in Constraint-Based Planning

ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
PDDL2.1: an extension to PDDL for expressing temporal planning domains

Journal of Artificial Intelligence Research
Fast planning through planning graph analysis

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Planning with sharable resource constraints

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

I comment on the PDDL 2.1 language and its use in the planning competition, focusing on the choices made for accommodating time and concurrency. I also discuss some methodological issues that have to do with the move toward more expressive planning languages and the balance needed in planning research between semantics and computation.