Summary of Temporal Numeric Planning with Patterns, by Matteo Cardellini and Enrico Giunchiglia
Temporal Numeric Planning with Patterns
by Matteo Cardellini, Enrico Giunchiglia
First submitted to arxiv on: 12 Dec 2024
Categories
- Main: Artificial Intelligence (cs.AI)
- Secondary: None
GrooveSquid.com Paper Summaries
GrooveSquid.com’s goal is to make artificial intelligence research accessible by summarizing AI papers in simpler terms. Each summary below covers the same AI paper, written at different levels of difficulty. The medium difficulty and low difficulty versions are original summaries written by GrooveSquid.com, while the high difficulty version is the paper’s original abstract. Feel free to learn from the version that suits you best!
| Summary difficulty | Written by | Summary |
|---|---|---|
| High | Paper authors | High Difficulty Summary Read the original abstract here |
| Medium | GrooveSquid.com (original content) | Medium Difficulty Summary The paper presents a method for solving temporal numeric planning problems, specifically those expressed in PDDL2.1 level 3. The authors develop SMT formulas that correspond to valid plans of these problems, extending the existing “planning with patterns” approach from numeric to temporal settings. They demonstrate the correctness and completeness of their approach, showing its effectiveness on 10 domains requiring concurrency. |
| Low | GrooveSquid.com (original content) | Low Difficulty Summary This paper solves a type of planning problem called temporal numeric planning. Imagine you need to plan out a series of tasks that happen at different times, like making a schedule for your day or week. The authors show how to turn these problems into special formulas that can be solved using existing technology. They test their approach on 10 different scenarios and find it works well. |
