Temporal Numeric Planning with Patterns

Matteo Cardellini, Enrico Giunchiglia
12/12/2024
cs.AI

No confident code implementation found for this paper.

Abstract

We consider temporal numeric planning problems $Π$ expressed in PDDL2.1 level 3, and show how to produce SMT formulas $(i)$ whose models correspond to valid plans of $Π$, and $(ii)$ that extend the recently proposed planning with patterns approach from the numeric to the temporal case. We prove the correctness and completeness of the approach and show that it performs very well on 10 domains with required concurrency.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Symbolic Pattern Temporal Numeric Planning with Intermediate Conditions and Effects

86% match2026

Compiling Temporal Numeric Planning into Discrete PDDL+: Extended Version

80% match2026

Synthesis of timeline-based planning strategies avoiding determinization

79% match2025

Graph Learning for Numeric Planning

77% match1 repo332026

Planning with Dynamically Changing Domains

76% match2025

Integrating Reinforcement Learning, Action Model Learning, and Numeric Planning for Tackling Complex Tasks

76% match1 repo2025

Cite this paper

@article{cardellini2024temporal,
  title  = {Temporal Numeric Planning with Patterns},
  author = {Matteo Cardellini and Enrico Giunchiglia},
  year   = {2024},
  eprint = {2412.09101},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2412.09101v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2412.09101.svg)](https://codeofpaper.com/paper/2412.09101)

Discussion