Lifted Sequential Planning with Lazy Constraint Generation Solvers
- URL: http://arxiv.org/abs/2307.08242v1
- Date: Mon, 17 Jul 2023 04:54:58 GMT
- Title: Lifted Sequential Planning with Lazy Constraint Generation Solvers
- Authors: Anubhav Singh, Miquel Ramirez, Nir Lipovetzky, and Peter J. Stuckey
- Abstract summary: This paper studies the possibilities made open by the use of Lazy Clause Generation (LCG) based approaches to Constraint Programming (CP)
We propose a novel CP model based on seminal ideas on so-called lifted causal encodings for planning as satisfiability.
We report that for planning problem instances requiring fewer plan steps our methods compare very well with the state-of-the-art in optimal sequential planning.
- Score: 28.405198103927955
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: This paper studies the possibilities made open by the use of Lazy Clause
Generation (LCG) based approaches to Constraint Programming (CP) for tackling
sequential classical planning. We propose a novel CP model based on seminal
ideas on so-called lifted causal encodings for planning as satisfiability, that
does not require grounding, as choosing groundings for functions and action
schemas becomes an integral part of the problem of designing valid plans. This
encoding does not require encoding frame axioms, and does not explicitly
represent states as decision variables for every plan step. We also present a
propagator procedure that illustrates the possibilities of LCG to widen the
kind of inference methods considered to be feasible in planning as (iterated)
CSP solving. We test encodings and propagators over classic IPC and recently
proposed benchmarks for lifted planning, and report that for planning problem
instances requiring fewer plan steps our methods compare very well with the
state-of-the-art in optimal sequential planning.
Related papers
- 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) - LLM-Assist: Enhancing Closed-Loop Planning with Language-Based Reasoning [65.86754998249224]
We develop a novel hybrid planner that leverages a conventional rule-based planner in conjunction with an LLM-based planner.
Our approach navigates complex scenarios which existing planners struggle with, produces well-reasoned outputs while also remaining grounded through working alongside the rule-based approach.
arXiv Detail & Related papers (2023-12-30T02:53:45Z) - Unified Task and Motion Planning using Object-centric Abstractions of
Motion Constraints [56.283944756315066]
We propose an alternative TAMP approach that unifies task and motion planning into a single search.
Our approach is based on an object-centric abstraction of motion constraints that permits leveraging the computational efficiency of off-the-shelf AI search to yield physically feasible plans.
arXiv Detail & Related papers (2023-12-29T14:00:20Z) - 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) - Capturing (Optimal) Relaxed Plans with Stable and Supported Models of
Logic Programs [4.020523898765405]
We show that given a planning problem, all subsets of actions that could be ordered to produce relaxed plans for the problem can be captured with stable models of a logic program.
We introduce one causal and one diagnostic encoding of the relaxed planning problem as logic programs, both capturing relaxed plans with their supported models.
arXiv Detail & Related papers (2023-06-08T09:34:38Z) - AdaPlanner: Adaptive Planning from Feedback with Language Models [56.367020818139665]
Large language models (LLMs) have recently demonstrated the potential in acting as autonomous agents for sequential decision-making tasks.
We propose a closed-loop approach, AdaPlanner, which allows the LLM agent to refine its self-generated plan adaptively in response to environmental feedback.
To mitigate hallucination, we develop a code-style LLM prompt structure that facilitates plan generation across a variety of tasks, environments, and agent capabilities.
arXiv Detail & Related papers (2023-05-26T05:52:27Z) - Extended Task and Motion Planning of Long-horizon Robot Manipulation [28.951816622135922]
Task and Motion Planning (TAMP) requires integration of symbolic reasoning with metric motion planning.
Most TAMP approaches fail to provide feasible solutions when there is missing knowledge about the environment at the symbolic level.
We propose a novel approach for decision-making on extended decision spaces over plan skeletons and action parameters.
arXiv Detail & Related papers (2021-03-09T14:44:08Z) - Divide-and-Conquer Monte Carlo Tree Search For Goal-Directed Planning [78.65083326918351]
We consider alternatives to an implicit sequential planning assumption.
We propose Divide-and-Conquer Monte Carlo Tree Search (DC-MCTS) for approximating the optimal plan.
We show that this algorithmic flexibility over planning order leads to improved results in navigation tasks in grid-worlds.
arXiv Detail & Related papers (2020-04-23T18:08:58Z) - 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.