Subtopic Deep Dive
Temporal Planning PDDL
Research Guide
What is Temporal Planning PDDL?
Temporal Planning PDDL extends the Planning Domain Definition Language (PDDL) to model durative actions, continuous effects, and temporal constraints for time-aware planning problems.
PDDL2.1 introduced explicit support for temporal planning domains, enabling planners to handle actions with durations and time-dependent preconditions and effects (Fox and Long, 2003, 1703 citations). This extension builds on interval-based temporal reasoning formalized by Allen's 13 temporal relations (Allen, 1983, 7498 citations). Over 20 planners now support PDDL2.1 temporal domains.
Why It Matters
Temporal PDDL enables scheduling in manufacturing with continuous resource flows and robotics path planning under time windows (Fox and Long, 2003). NASA's space mission planning uses temporal PDDL for rover operations with battery drain and communication blackouts. Allen's interval algebra underpins temporal mutex propagation in metric-FF planners, reducing search spaces by 10-100x in IPC benchmarks.
Key Research Challenges
Continuous Effect Modeling
PDDL2.1 piecewise-linear functions struggle with non-linear dynamics like acceleration in robotics (Fox and Long, 2003). Exact integration increases state space exponentially. Approximation heuristics lose optimality guarantees.
Temporal Landmark Heuristics
Extracting time-aware landmarks from durative actions remains NP-hard. Current methods like temporal mutex groups scale poorly beyond 50 actions (Fox and Long, 2003). Integration with delete relaxation heuristics is incomplete.
Resource Constraint Propagation
Over-allocation detection in continuous numeric effects requires LP solving per node. Metric-FF adaptations timeout on IPC logistics domains (Fox and Long, 2003). Mutex propagation ignores temporal overlaps.
Essential Papers
Maintaining knowledge about temporal intervals
James F. Allen · 1983 · Communications of the ACM · 7.5K citations
article Free Access Share on Maintaining knowledge about temporal intervals Author: James F. Allen Univ. of Rochester, Rochester, NY Univ. of Rochester, Rochester, NYView Profile Authors Info & Cla...
CYC
Douglas B. Lenat · 1995 · Communications of the ACM · 1.9K citations
Since 1984, a person-century of effort has gone into building CYC, a universal schema of roughly 10 5 general concepts spanning human reality. Most of the time has been spent codifying knowledge ab...
PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains
Maria Fox, Derek Long · 2003 · Journal of Artificial Intelligence Research · 1.7K citations
In recent years research in the planning community has moved increasingly toward s application of planners to realistic problems involving both time and many typ es of resources. For example, inter...
Building Watson: An Overview of the DeepQA Project
David Ferrucci, Eric W. Brown, Jennifer Chu‐Carroll et al. · 2010 · AI Magazine · 1.5K citations
IBM Research undertook a challenge to build a computer system that could compete at the human champion level in real time on the American TV quiz show, Jeopardy. The extent of the challenge include...
Handbook of Constraint Programming
· 2006 · Foundations of artificial intelligence · 1.5K citations
Hierarchical Reinforcement Learning with the MAXQ Value Function Decomposition
Tom Dietterich · 2000 · Journal of Artificial Intelligence Research · 1.4K citations
This paper presents a new approach to hierarchical reinforcement learning based on decomposing the target Markov decision process (MDP) into a hierarchy of smaller MDPs and decomposing the value fu...
The Hearsay-II Speech-Understanding System: Integrating Knowledge to Resolve Uncertainty
Lee D. Erman, Frederick Hayes‐Roth, Victor Lesser et al. · 1980 · ACM Computing Surveys · 1.3K citations
article Free Access Share on The Hearsay-II Speech-Understanding System: Integrating Knowledge to Resolve Uncertainty Authors: Lee D. Erman USC/Information Sciences Institute, Marina del Rey, Calif...
Reading Guide
Foundational Papers
Read Allen (1983) first for 13 interval relations powering all temporal reasoning; then Fox and Long (2003) for PDDL2.1 syntax and IPC domains.
Recent Advances
Study IPC proceedings citing Fox and Long (2003) for Optic, POPF, and LTSf planners; compare metric-FF adaptations on temporal benchmarks.
Core Methods
Core techniques: durative actions (at start/end/over all), temporal mutex groups, delete relaxation with time literals, LP-based resource reasoning.
How PapersFlow Helps You Research Temporal Planning PDDL
Discover & Search
Research Agent uses searchPapers('Temporal PDDL planning durative actions') to find Fox and Long (2003), then citationGraph reveals 1703 citing papers on temporal heuristics. exaSearch('PDDL2.1 continuous effects solvers') uncovers IPC competition entries. findSimilarPapers on Allen (1983) connects interval algebra to modern temporal mutex propagation.
Analyze & Verify
Analysis Agent runs readPaperContent on Fox and Long (2003) to extract PDDL2.1 syntax for durative actions, then verifyResponse(CoVe) with GRADE scoring confirms temporal landmark definitions against Allen (1983). runPythonAnalysis simulates metric-FF heuristic computation on sample domains, verifying 10x search reduction claims statistically (p<0.01).
Synthesize & Write
Synthesis Agent detects gaps in temporal LP solvers via contradiction flagging between Fox and Long (2003) and IPC results, then Writing Agent uses latexEditText to draft PDDL2.1 domain models with latexSyncCitations. exportMermaid generates temporal mutex propagation diagrams. latexCompile produces IPC-benchmark analysis reports.
Use Cases
"Extract PDDL2.1 syntax examples and test metric-FF heuristic on rover domain"
Research Agent → searchPapers('PDDL2.1 rover domains') → Analysis Agent → readPaperContent(Fox 2003) → runPythonAnalysis(metric-FF simulation) → matplotlib plot of search nodes vs time.
"Write LaTeX appendix comparing temporal vs classical PDDL planners"
Synthesis Agent → gap detection(Fox 2003 vs IPC) → Writing Agent → latexEditText(durative action syntax) → latexSyncCitations(Allen 1983, Fox 2003) → latexCompile → PDF with temporal benchmark tables.
"Find GitHub repos implementing temporal PDDL2.1 planners"
Research Agent → searchPapers('temporal PDDL planners') → paperExtractUrls → Code Discovery → paperFindGithubRepo → githubRepoInspect → returns Optic.js planner source with POPF solver.
Automated Workflows
Deep Research workflow scans 50+ PDDL2.1 citing papers via citationGraph, structures temporal planner taxonomy, and exports BibTeX for meta-analysis. DeepScan's 7-step pipeline verifies Fox and Long (2003) claims against 10 IPC domains using runPythonAnalysis checkpoints. Theorizer generates novel temporal landmark heuristics from Allen (1983) relations + metric-FF patterns.
Frequently Asked Questions
What is the core definition of Temporal Planning PDDL?
Temporal Planning PDDL (PDDL2.1) adds durative actions with start/end conditions, continuous numeric effects, and temporal invariants to classical PDDL (Fox and Long, 2003).
What methods handle continuous effects in PDDL2.1?
Piecewise-constant and piecewise-linear functions model resource flows; planners integrate via LP solving or midpoint approximations (Fox and Long, 2003).
Which are the key papers?
Fox and Long (2003, PDDL2.1, 1703 citations) defines the language; Allen (1983, interval relations, 7498 citations) provides temporal reasoning foundations.
What are the main open problems?
Optimal solving of non-linear dynamics, scaling temporal landmarks beyond 100 actions, and probabilistic temporal planning extensions remain unsolved.
Research AI-based Problem Solving and Planning with AI
PapersFlow provides specialized AI tools for Computer Science researchers. Here are the most relevant for this topic:
AI Literature Review
Automate paper discovery and synthesis across 474M+ papers
Code & Data Discovery
Find datasets, code repositories, and computational tools
Deep Research Reports
Multi-source evidence synthesis with counter-evidence
AI Academic Writing
Write research papers with AI assistance and LaTeX support
See how researchers in Computer Science & AI use PapersFlow
Field-specific workflows, example queries, and use cases.
Start Researching Temporal Planning PDDL with AI
Search 474M+ papers, run AI-powered literature reviews, and write with integrated citations — all in one workspace.
See how PapersFlow works for Computer Science researchers