Symbolic Pattern Temporal Numeric Planning with Intermediate Conditions and Effects

• URL: http://arxiv.org/abs/2602.09798v1
• Date: Tue, 10 Feb 2026 14:03:40 GMT
• Title: Symbolic Pattern Temporal Numeric Planning with Intermediate Conditions and Effects
• Authors: Matteo Cardellini, Enrico Giunchiglia,
• Abstract summary: A Symbolic Pattern Planning (SPP) approach was proposed for numeric planning where a pattern suggests a causal order between actions.<n>In this paper, we extend the SPP approach to the temporal planning with Intermediate Conditions and Effects (ICEs) fragment.
• Score: 6.600299648478795
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Recently, a Symbolic Pattern Planning (SPP) approach was proposed for numeric planning where a pattern (i.e., a finite sequence of actions) suggests a causal order between actions. The pattern is then encoded in a SMT formula whose models correspond to valid plans. If the suggestion by the pattern is inaccurate and no valid plan can be found, the pattern is extended until it contains the causal order of actions in a valid plan, making the approach complete. In this paper, we extend the SPP approach to the temporal planning with Intermediate Conditions and Effects (ICEs) fragment, where $(i)$ actions are durative (and thus can overlap over time) and have conditions/effects which can be checked/applied at any time during an action's execution, and $(ii)$ one can specify plan's conditions/effects that must be checked/applied at specific times during the plan execution. Experimental results show that our SPP planner Patty $(i)$ outperforms all other planners in the literature in the majority of temporal domains without ICEs, $(ii)$ obtains comparable results with the SoTA search planner for ICS in literature domains with ICEs, and $(iii)$ outperforms the same planner in a novel domain based on a real-world application.

Related papers

• The Cognitive Bandwidth Bottleneck: Shifting Long-Horizon Agent from Planning with Actions to Planning with Schemas [56.62286434195321]
  This paper systematically studies the effectiveness of two different action representations.<n>We propose cognitive bandwidth perspective as a conceptual framework to qualitatively understand the differences.<n>We provide an actionable guide for building more capable PwS agents for better scalable autonomy.
  arXiv  Detail & Related papers  (2025-10-08T14:47:40Z)
• Counterfactual Scenarios for Automated Planning [12.720308658692892]
  Counterfactual Explanations (CEs) are a powerful technique used to explain Machine Learning models.<n>We propose a novel explanation paradigm that is based on counterfactual scenarios.<n>We show that producing counterfactual scenarios is often only as expensive as computing a plan for $P$.
  arXiv  Detail & Related papers  (2025-08-29T11:16:17Z)
• Hindsight Planner: A Closed-Loop Few-Shot Planner for Embodied Instruction Following [62.10809033451526]
  This work focuses on building a task planner for Embodied Instruction Following (EIF) using Large Language Models (LLMs)<n>We frame the task as a Partially Observable Markov Decision Process (POMDP) and aim to develop a robust planner under a few-shot assumption.<n>Our experiments on the ALFRED dataset indicate that our planner achieves competitive performance under a few-shot assumption.
  arXiv  Detail & Related papers  (2024-12-27T10:05:45Z)
• Temporal Numeric Planning with Patterns [0.4972323953932129]
  We consider temporal numeric planning problems $Pi$ expressed in PDDL2.1 level 3.<n>We show how to produce formulas $(i)$ whose models correspond to valid plans of $Pi$, and $(ii)$ that extend the recently proposed planning with patterns approach from the numeric to the temporal case.
  arXiv  Detail & Related papers  (2024-12-12T09:28:34Z)
• Improving Plan Execution Flexibility using Block-Substitution [0.0]
  Partial-order plans in AI planning facilitate execution flexibility due to their less-constrained nature. Plan deordering removes unnecessary action orderings within a plan, while plan reordering modifies them arbitrarily to minimize action orderings. This study, in contrast with traditional plan deordering and reordering strategies, improves a plan's flexibility by substituting its subplans with actions outside the plan for a planning problem.
  arXiv  Detail & Related papers  (2024-06-05T09:30:48Z)
• PDDLEGO: Iterative Planning in Textual Environments [56.12148805913657]
  Planning in textual environments has been shown to be a long-standing challenge even for current models. We propose PDDLEGO that iteratively construct a planning representation that can lead to a partial plan for a given sub-goal. We show that plans produced by few-shot PDDLEGO are 43% more efficient than generating plans end-to-end on the Coin Collector simulation.
  arXiv  Detail & Related papers  (2024-05-30T08:01:20Z)
• Symbolic Numeric Planning with Patterns [1.450144681559089]
  We encode the problem of finding a plan for $Pi$ with bound $n$ as a formula with fewer variables and/or clauses than the state-of-the-art rolled-up and relaxed-relaxed-$exists$ encodings. We show that our planner Patty has remarkably good comparative performances on this year's International Planning Competition.
  arXiv  Detail & Related papers  (2023-12-15T17:20:25Z)
• Planning as In-Painting: A Diffusion-Based Embodied Task Planning Framework for Environments under Uncertainty [56.30846158280031]
  Task planning for embodied AI has been one of the most challenging problems. We propose a task-agnostic method named 'planning as in-painting' The proposed framework achieves promising performances in various embodied AI tasks.
  arXiv  Detail & Related papers  (2023-12-02T10:07:17Z)
• Tree-Planner: Efficient Close-loop Task Planning with Large Language Models [63.06270302774049]
  Tree-Planner reframes task planning with Large Language Models into three distinct phases. Tree-Planner achieves state-of-the-art performance while maintaining high efficiency.
  arXiv  Detail & Related papers  (2023-10-12T17:59:50Z)
• Describe, Explain, Plan and Select: Interactive Planning with Large Language Models Enables Open-World Multi-Task Agents [26.78244595330595]
  "$underlineD$escribe" is an interactive planning approach based on Large Language Models (LLMs) DEPS facilitates better error correction on initial LLM-generated $textitplan$ by integrating $textitdescription$ of the plan execution process. Experiments mark the milestone of the first zero-shot multi-task agent that can robustly accomplish 70+ Minecraft tasks.
  arXiv  Detail & Related papers  (2023-02-03T06:06:27Z)
• STRIPS Action Discovery [67.73368413278631]
  Recent approaches have shown the success of classical planning at synthesizing action models even when all intermediate states are missing. We propose a new algorithm to unsupervisedly synthesize STRIPS action models with a classical planner when action signatures are unknown.
  arXiv  Detail & Related papers  (2020-01-30T17:08:39Z)

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.