Compiling Temporal Numeric Planning into Discrete PDDL+: Extended Version

• URL: http://arxiv.org/abs/2603.12188v1
• Date: Thu, 12 Mar 2026 17:19:30 GMT
• Title: Compiling Temporal Numeric Planning into Discrete PDDL+: Extended Version
• Abstract summary: We present a practical compilation from temporal planning with durative actions into PDDL+.<n>Our compilation is experimentally shown to be of practical relevance for hard temporal numeric problems.
• Score: 58.220343994928776
• License: http://creativecommons.org/licenses/by-sa/4.0/
• 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 experimentally shown to be of practical relevance for hard temporal numeric problems.

Related papers

• PDDL-ART: Autonomous Symbolic Abstraction From Demonstration For Long-Horizon Robotic Manipulation Using Vision-Language Models [14.072904523937536]
  We present a Vision-Language Model-based approach called PDDL-ART.<n>It generates task-specific PDDL domain and problem descriptions from a single expert demonstration.<n>PDDL-ART achieves an average success rate of 93.3%, compared to 78.3% for a baseline VLM-based planner.
  arXiv  Detail & Related papers  (2026-08-17T21:29:29Z)
• Language Models For Generalised PDDL Planning: Synthesising Sound and Programmatic Policies [14.156642420488168]
  We study the usage of language models (LMs) for planning over world models specified in the Planning Domain Definition Language (PDDL)<n>We prompt LMs to generate Python programs that serve as generalised policies for solving PDDL problems from a given domain.<n>We conduct experiments on competition benchmarks which show that our policies can solve more PDDL problems than PDDL planners and recent LM approaches within a fixed time and memory constraint.
  arXiv  Detail & Related papers  (2025-08-25T21:28:14Z)
• Latent Diffusion Planning for Imitation Learning [78.56207566743154]
  Latent Diffusion Planning (LDP) is a modular approach consisting of a planner and inverse dynamics model.<n>By separating planning from action prediction, LDP can benefit from the denser supervision signals of suboptimal and action-free data.<n>On simulated visual robotic manipulation tasks, LDP outperforms state-of-the-art imitation learning approaches.
  arXiv  Detail & Related papers  (2025-04-23T17:53:34Z)
• Planetarium: A Rigorous Benchmark for Translating Text to Structured Planning Languages [20.62336315814875]
  We introduce textitPlanetarium, a benchmark designed to evaluate language models' ability to generate PDDL code from natural language descriptions of planning tasks.<n>textitPlanetarium features a novel PDDL equivalence algorithm that flexibly evaluates the correctness of generated PDDL, along with a dataset of 145,918 text-to-PDDL pairs.
  arXiv  Detail & Related papers  (2024-07-03T17:59:53Z)
• PROC2PDDL: Open-Domain Planning Representations from Texts [56.627183903841164]
  Proc2PDDL is the first dataset containing open-domain procedural texts paired with expert-annotated PDDL representations. We show that Proc2PDDL is highly challenging, with GPT-3.5's success rate close to 0% and GPT-4's around 35%.
  arXiv  Detail & Related papers  (2024-02-29T19:40:25Z)
• Real-World Planning with PDDL+ and Beyond [55.73913765642435]
  We present Nyx, a novel PDDL+ planner built to emphasize lightness, simplicity, and, most importantly, adaptability. Nyx can be tailored to virtually any potential real-world application requiring some form of AI Planning, paving the way for wider adoption of planning methods for solving real-world problems.
  arXiv  Detail & Related papers  (2024-02-19T07:35:49Z)
• HDDL 2.1: Towards Defining a Formalism and a Semantics for Temporal HTN Planning [64.07762708909846]
  Real world applications need modelling rich and diverse automated planning problems. hierarchical task network (HTN) formalism does not allow to represent planning problems with numerical and temporal constraints. We propose to fill the gap between HDDL and these operational needs and to extend HDDL by taking inspiration from PDDL 2.1.
  arXiv  Detail & Related papers  (2023-06-12T18:21:23Z)
• Planning with Complex Data Types in PDDL [2.7412662946127755]
  We investigate a modeling language for complex software systems, which supports complex data types such as sets, arrays, records, and unions. We map this representation further to PDDL to be used with domain-independent PDDL planners.
  arXiv  Detail & Related papers  (2022-12-29T21:19:22Z)
• A Logical Semantics for PDDL+ [4.111899441919164]
  PDDL+ is an extension of PDDL2.1 which incorporates fully-featured autonomous processes. Unlike PDDL2.1, PDDL+ lacks a logical semantics, relying instead on state-transitional semantics enriched with hybrid automata semantics for the continuous states. We propose a natural extension of Reiter's situation calculus theories inspired by hybrid automata.
  arXiv  Detail & Related papers  (2021-11-23T00:32:15Z)
• Tensor Processing Primitives: A Programming Abstraction for Efficiency and Portability in Deep Learning Workloads [86.62083829086393]
  This work introduces the Processing Primitives (TPP), a programming abstraction striving for efficient, portable implementation of Deep Learning-workloads with high-productivity. TPPs define a compact, yet versatile set of 2D-tensor operators (or a virtual ISA), which can be utilized as building-blocks to construct complex operators on high-dimensional tensors. We demonstrate the efficacy of our approach using standalone kernels and end-to-end DL-workloads expressed entirely via TPPs that outperform state-of-the-art implementations on multiple platforms.
  arXiv  Detail & Related papers  (2021-04-12T18:35:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.