An approach to efficient planning with numerical fluents and multi-criteria plan quality

@article{Gerevini2008AnAT,
  title={An approach to efficient planning with numerical fluents and multi-criteria plan quality},
  author={A. Gerevini and A. Saetti and I. Serina},
  journal={Artif. Intell.},
  year={2008},
  volume={172},
  pages={899-944}
}
Dealing with numerical information is practically important in many real-world planning domains where the executability of an action can depend on certain numerical conditions, and the action effects can consume or renew some critical continuous resources, which in pddl can be represented by numerical fluents. When a planning problem involves numerical fluents, the quality of the solutions can be expressed by an objective function that can take different plan quality criteria into account. We… Expand
An Empirical Analysis of Some Heuristic Features for Planning through Local Search and Action Graphs
TLDR
Experimental results indicate that the current version of LPG using the identified best heuristic techniques as the default settings is competitive with the winner of the last (2008) International Planning Competition. Expand
Effective plan retrieval in case-based planning for metric-temporal problems
TLDR
This work proposes some new heuristic techniques for retrieving a plan from a library of existing plans that are promising for solving a new planning problem encountered by the CBP system, i.e. that can be efficiently adapted to solve the new problem. Expand
A Hybrid LP-RPG Heuristic for Modelling Numeric Resource Flows in Planning
TLDR
This work presents a heuristic for numeric planning problems building on the propositional relaxed planning graph, but using a mathematical program for numeric reasoning, and shows that the use of this heuristic enhances scalability on problems where numeric resource interaction is key in finding a solution. Expand
Plan Repair for Resource Constrained Tasks via Numeric Macro Actions
TLDR
This paper addresses the problem of plan repair for tasks involving mandatory constraints on consumable and continuous resources, modeled as numeric fluents by proposing a new notion of numeric macro actions, and shows two techniques for selecting useful macro actions. Expand
Using the Context-enhanced Additive Heuristic for Temporal and Numeric Planning
TLDR
Temporal Fast Downward (TFD) is presented, a planning system for temporal problems that is capable of finding low-makespan plans by performing a heuristic search in a temporal search space and outperforms all state-of-the-art temporal planning systems. Expand
A generate-and-test approach for computing “ optimal ” plans in SAT-based planning
Planning as Satisfiability (SAT) is the best approach for optimally (wrt makespan) solving classical planning problems. SAT-based planners, likeSATPLAN, can thus return plans having minimal makespanExpand
Planning as satisfiability with IPC simple preferences and action costs
TLDR
This paper reduces the IPC planning problems with soft goals from IPC-5 and/or action costs from I PC-6 to optimization problems extending SAT and implements these ideas in SATPLAN, and runs a wide experimental analysis on planning problems from I PCs, taking as references state-of-the-art planners on these competitions and the previous SAT-based approach. Expand
Selecting goals in oversubscription planning using relaxed plans
TLDR
A new technique to a priori select goals in no-hard-goals satisficing OSP by searching in the space of subsets of goals is presented, which is planner-independent once the goals have been selected and creates a new non-OSP problem that can be solved using off-the-shelf planners. Expand
Case-based Planning for Problems with Real-valued Fluents: Kernel Functions for Effective Plan Retrieval
TLDR
This work proposes some new heuristic techniques for retrieving a plan from a library of existing plans that is promising for a new given planning problem, i.e., that can be efficiently adapted to solve the new problem. Expand
Subgoaling Techniques for Satisficing and Optimal Numeric Planning
TLDR
Novel subgoaling relaxations for automated planning with propositional and numeric state variables and numeric conditions are studied, with the aim of reaching a good trade-off between accuracy and computation costs within a heuristic state-space search planner. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 58 REFERENCES
Planning Through Stochastic Local Search and Temporal Action Graphs in LPG
TLDR
This paper focuses on temporal planning, introducing TA-graphs and proposing some techniques to guide the search in LPG using this representation, and shows that these techniques can be very effective. Expand
Optimal Planning with a Goal-directed Utility Model
TLDR
PYRRHUS is presented, an extension to the UCPOP planning system that finds optimal plans for a class of goal-directed utility models suggested by Haddawy and Hanks, and suggests that optimal plans can be generated effectively by a planner using domain-specific heuristic knowledge, and furthermore that the planner can use the same knowledge as a goal-satisfying planner to solve corresponding optimization problems. Expand
Multiobjective heuristic state-space planning
TLDR
This paper enhances the GRT planner, an efficient domain-independent heuristic state-space planner, with the ability to consider multiple criteria, and uses a weighted A strategy and a multiobjective heuristic function, computed over a weighted hierarchy of user-defined criteria. Expand
Fast Planning through Greedy Action Graphs
TLDR
This paper proposes a new search method in the context of Blum and Furst's planning graph approach, which is based on local search, and introduces three heuristics to guide the local search. Expand
Planning with numeric variables in multiobjective planning
TLDR
This paper presents a heuristic planning approach that uses a richer representation with capabilities for numeric variables, including durations of actions, and multiobjective optimisation. Expand
An Approach to Temporal Planning and Scheduling in Domains with Predictable Exogenous Events
TLDR
This paper proposes an approach to planning in temporal domains with exogenous events that happen at known times, imposing the constraint that certain actions in the plan must be executed during some predefined time windows which integrates constraint-based temporal reasoning into a graph-based planning framework using local search. Expand
Taming Numbers and Durations in the Model Checking Integrated Planning System
TLDR
The most important algorithmic novelties that were necessary to tackle the new layers of expressiveness in the benchmark problems and to achieve a high level of performance are introduced and analyzed. Expand
Sapa: A Multi-objective Metric Temporal Planner
TLDR
An implementation of Sapa using many of the techniques presented in this paper was one of the best domain independent planners for domains with metric and temporal constraints in the third International Planning Competition, held at AIPS-02. Expand
Temporal Planning using Subgoal Partitioning and Resolution in SGPlan
TLDR
This paper presents a partition-and-resolve strategy that looks for locally optimal subplans in constraint-partitioned temporal planning subpro problems and that resolves those inconsistent global constraints across the subproblems. Expand
Planning with Resources and Concurrency: A Forward Chaining Approach
TLDR
It is shown how the forward chaining approach to planning can be extended to allow it to solve planning problems with concurrently executable actions with varying durations, and metric quantities like resources, both essential for modeling real applications. Expand
...
1
2
3
4
5
...