ExplorerArtificial IntelligenceAI
Research PaperResearchia:202603.13070

Compiling Temporal Numeric Planning into Discrete PDDL+: Extended Version

Andrea Micheli

Abstract

Since the introduction of the PDDL+ modeling language, it was known that temporal planning with durative actions (as in PDDL 2.1) could be compiled into PDDL+. However, no practical compilation was presented in the literature ever since. We present a practical compilation from temporal planning with durative actions into PDDL+, fully capturing the semantics and only assuming the non-self-overlapping of actions. Our compilation is polynomial, retains the plan length up to a constant factor and is...

Submitted: March 13, 2026Subjects: AI; Artificial Intelligence

Description / Details

Since the introduction of the PDDL+ modeling language, it was known that temporal planning with durative actions (as in PDDL 2.1) could be compiled into PDDL+. However, no practical compilation was presented in the literature ever since. We present a practical compilation from temporal planning with durative actions into PDDL+, fully capturing the semantics and only assuming the non-self-overlapping of actions. Our compilation is polynomial, retains the plan length up to a constant factor and is experimentally shown to be of practical relevance for hard temporal numeric problems.


Source: arXiv:2603.12188v1 - http://arxiv.org/abs/2603.12188v1 PDF: https://arxiv.org/pdf/2603.12188v1 Original Link: http://arxiv.org/abs/2603.12188v1

Please sign in to join the discussion.

No comments yet. Be the first to share your thoughts!

Access Paper
View Source PDF
Submission Info
Date:
Mar 13, 2026
Topic:
Artificial Intelligence
Area:
AI
Comments:
0
Bookmark