Javascript must be enabled to continue!
LPRPG-P: Relaxed Plan Heuristics for Planning with Preferences
View through CrossRef
In this paper we present a planner, LPRPG-P, capable of reasoning with the non-temporal subset of PDDL 3 preferences. Our focus is on computation of relaxed plan based heuristics that effectively guide a planner towards good solutions satisfying preferences. We build on the planner LPRPG, a hybrid relaxed planning graph (RPG)--linear programming (LP) approach. We make extensions to the RPG to reason with propositional preferences, and to the LP to reason with numeric preferences. LPRPG-P is the first planner with direct guidance for numeric preference satisfaction, exploiting the strong numeric reasoning of the LP. We introduce an anytime search approach for use with our new heuristic, and present results showing that LPRPG-P extends the state of the art in domain-independent planning with preferences.
Association for the Advancement of Artificial Intelligence (AAAI)
Title: LPRPG-P: Relaxed Plan Heuristics for Planning with Preferences
Description:
In this paper we present a planner, LPRPG-P, capable of reasoning with the non-temporal subset of PDDL 3 preferences.
Our focus is on computation of relaxed plan based heuristics that effectively guide a planner towards good solutions satisfying preferences.
We build on the planner LPRPG, a hybrid relaxed planning graph (RPG)--linear programming (LP) approach.
We make extensions to the RPG to reason with propositional preferences, and to the LP to reason with numeric preferences.
LPRPG-P is the first planner with direct guidance for numeric preference satisfaction, exploiting the strong numeric reasoning of the LP.
We introduce an anytime search approach for use with our new heuristic, and present results showing that LPRPG-P extends the state of the art in domain-independent planning with preferences.
Related Results
Identifying and Leveraging Promising Design Heuristics for Multi-Objective Combinatorial Design Optimization
Identifying and Leveraging Promising Design Heuristics for Multi-Objective Combinatorial Design Optimization
Abstract
Design heuristics are traditionally used as qualitative principles to guide the design process, but they have also been used to improve the efficiency of...
Leveraging Design Heuristics for Multi-Objective Metamaterial Design Optimization
Leveraging Design Heuristics for Multi-Objective Metamaterial Design Optimization
Abstract
Design optimization of metamaterials and other complex systems often relies on the use of computationally expensive models. This makes it challenging to use...
On the conflict between mate preference and adaptation : a mathematical approach
On the conflict between mate preference and adaptation : a mathematical approach
Étude du conflit entre sélection sexuelle et adaptation : une approche mathématique
Les préférences sexuelles jouent un rôle majeur dans le processus d'adaptation e...
High School Seniors' Perceptions of Family Environment
High School Seniors' Perceptions of Family Environment
The researcher investigated perceived family environment for high school seniors. The independent variables were educational/vocational plan, residence plan, feelings about the fut...
Extension of some project scheduling heuristics and their comparison at low and high levels of resource requirement
Extension of some project scheduling heuristics and their comparison at low and high levels of resource requirement
Some of the most frequently used scheduling heuristics for resource constrained projects are Activity Time (ACTIM), Activity Resource (ACTRES) and Resource Over Time (ROT) which ar...
Extension of some project scheduling heuristics and their comparison at low and high levels of resource requirement
Extension of some project scheduling heuristics and their comparison at low and high levels of resource requirement
Some of the most frequently used scheduling heuristics for resource constrained projects are Activity Time (ACTIM), Activity Resource (ACTRES) and Resource Over Time (ROT) which ar...
Evolution of group-theoretic cryptology attacks using hyper-heuristics
Evolution of group-theoretic cryptology attacks using hyper-heuristics
Abstract
In previous work, we developed a
single
evolutionary algorithm (EA) to solve random instance...
The ABC of Heuristics: Approximate Bayesian Computation as a Framework for Heuristic Inference
The ABC of Heuristics: Approximate Bayesian Computation as a Framework for Heuristic Inference
Heuristics have long been viewed as simple decision rules that sacrifice optimality for cognitive efficiency. However, this perspective fails to fully account for their effectivene...

