Case-based Planning for Problems with Real-valued Fluents: Kernel Functions for Effective Plan Retrieval

  title={Case-based Planning for Problems with Real-valued Fluents: Kernel Functions for Effective Plan Retrieval},
  author={A. Gerevini and A. Saetti and I. Serina},
Case-based planning (CBP) re-uses existing plans as a starting point to solve new planning problems. In this work, we address CBP for planning in PDDL domains with real-valued fluents, that are essential to model real-world problems involving continuous resources. Specifically, we propose 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. The… Expand

Topics from this paper

Effective plan retrieval in case-based planning for metric-temporal problems
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
Identifying and Exploiting Features for Effective Plan Retrieval in Case-Based Planning
The proposed features-based retrieval approach can significantly improve the performance of a state-of-the-art case-based planning system and introduces a new class of features for efficiently retrieving solved planning problems from large plan libraries. Expand
On the Plan-Library Maintenance Problem in a Case-Based Planner
The problem of case base maintenance for planning is formally defined, which criteria should drive a successful policy to maintain the case base is discussed, some policies optimizing different criteria are introduced, and some policies are experimentally analyzed by evaluating their effectiveness and performance. Expand
Progress in Case-Based Planning
An updated overview of systems that have contributed to the evolution of the field or addressed some issues related to planning by reuse in a novel way is presented. Expand
Configurable Heuristic Adaptation for Improving Best First Search in AI Planning
  • I. Serina, M. Vallati
  • Computer Science
  • 2020 IEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI)
  • 2020
This paper introduces a highly configurable heuristic adaptation process based on the idea of dynamically penalising unpromising actions when an inconsistency in the heuristic evaluation is detected; its aim is to reduce the bias affecting specific actions, thereby encouraging exploration by the search process and adding diversity in the neighbourhood selection process. Expand
Numeric Kernel for Reasoning about Plans Involving Numeric Fluents
The paper proposes the notion of numeric kernel as a means for reasoning about plans involving numeric state variables, i.e. numeric fluents, and reports two possible repair strategies that can be employed as a direct application of the numeric kernel properties. Expand
Robust plan execution via reconfiguration and replanning
The MMA notion is presented, which allows to explicitly express the multiple execution modalities in which a given action can be executed; each execution modality models requirements/consequences on the involved consumable resources when that modality is selected. Expand
Robust Execution of Rover Plans via Action Modalities Reconfiguration
This paper proposes an effective continual planner - ReCon - that is able to detect violations of mission resource constraints, and find a new configuration of actions when such deviations refers to anomalies on the consumption of resources. Expand
ReCon: An Online Task ReConfiguration Approach for Robust Plan Execution
The paper studies the system for a typical planetary rover mission and provides a rich experimental analysis showing that, when the anomalies refer to unexpected resources consumption, the reconfiguration is not only more efficient but also more effective than a plan adaptation mechanism. Expand
Multi-Agent System in Practice: When Research Meets Reality
The aim of this paper is to bring the two diverging branches of agent theory and practice back together in order to better adapt agent technology to the requirements of professional software. Expand


Kernel functions for case-based planning
  • I. Serina
  • Mathematics, Computer Science
  • Artif. Intell.
  • 2010
This paper describes an innovative case-based planning system, called OAKplan, which can efficiently retrieve planning cases from plan libraries containing more than ten thousand cases, choose heuristically a suitable candidate and adapt it to provide a good quality solution plan which is similar to the one retrieved from the case library. Expand
A Survey on Case-Based Planning
A survey of case-based planning, in terms of its historical roots, underlying foundations, methods and techniques currently used, limitations, and future trends is presented. Expand
An approach to efficient planning with numerical fluents and multi-criteria plan quality
An incremental approach to automated planning with numerical fluents and multi-criteria objective functions for pddl numerical planning problems and defines the numerical action graph (NA-graph) representation for numerical plans and proposes some new local search techniques using this representation. Expand
Domain Independent Approaches for Finding Diverse Plans
It is described how two representative state-of-the-art domain independent planning approaches - one based on compilation to CSP, and the other based on heuristic local search - can be adapted to produce diverse plans. Expand
Efficient Plan Adaptation through Replanning Windows and Heuristic Goals
This paper investigates a domain-independent method for plan adaptation that modifies the original plan by replanning within limited temporal windows containing portions of the plan that need to be revised. Expand
PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains
The syntax of the language, PDDL2.1, is described, which has considerable modelling power -- exceeding the capabilities of current planning technology -- and presents a number of important challenges to the research community. Expand
Plan Reuse Versus Plan Generation: A Theoretical and Empirical Analysis
The utility of plan-reuse techniques is limited and that these limits have not been determined yet, as it is revealed that plan reuse can actually be strictly more difficult than plan generation. Expand
Plan Stability: Replanning versus Plan Repair
This work presents arguments to support the claim that plan stability is a valuable property, and proposes an implementation, based on LPG, of a plan repair strategy that adapts a plan to its new context. Expand
A metric for distributions with applications to image databases
This paper uses the Earth Mover's Distance to exhibit the structure of color-distribution and texture spaces by means of Multi-Dimensional Scaling displays, and proposes a novel approach to the problem of navigating through a collection of color images, which leads to a new paradigm for image database search. Expand
Optimal assignment kernels for attributed molecular graphs
We propose a new kernel function for attributed molecular graphs, which is based on the idea of computing an optimal assignment from the atoms of one molecule to those of another one, includingExpand