Generating diverse plans to handle unknown and partially known user preferences

@article{Nguyen2012GeneratingDP,
  title={Generating diverse plans to handle unknown and partially known user preferences},
  author={T. Nguyen and M. Do and A. Gerevini and I. Serina and B. Srivastava and S. Kambhampati},
  journal={Artif. Intell.},
  year={2012},
  volume={190},
  pages={1-31}
}
Current work in planning with preferences assumes that user preferences are completely specified, and aims to search for a single solution plan to satisfy these. In many real world planning scenarios, however, the user may provide no knowledge or at best partial knowledge of her preferences with respect to a desired plan. In such situations, rather than presenting a single plan as the solution, the planner must instead provide a set of plans containing one or more plans that are similar to the… Expand
Planning with Incomplete User Preferences and Domain Models
TLDR
This research addresses planning problems with incomplete domain models, specifically those annotated with possible preconditions and effects of actions, and formalizes the notion of plan robustness capturing the probability of success for plans during execution. Expand
Multiple Plans are Better than One: Diverse Stochastic Planning
TLDR
This work forms a problem, called diverse stochastic planning, that aims to generate a set of representative — small and diverse — behaviors that are nearoptimal with respect to the known objective and proposes a solution relying on the Frank-Wolfe method. Expand
Alternative Plan Generation and Online Preference Learning in Scheduling Individual Activities
TLDR
Based on the assumption that a user might systematically misweight his preferences over the various aspects of a plan, an online non-intrusive method to learn his actual preferences is presented, based on monitoring his selections over the alternative plans. Expand
Covering Landmark Interactions for Semantically Diverse Plans
TLDR
An extension of the LAMA planner called DLAMA is presented that generates multiple plans, each required to systematically satisfy alternative landmark disjuncts, and it is shown that, in comparison with prior diverse planners, DLAMA reduces average plan length while achieving plan set diversity. Expand
Evaluating Diversity in Classical Planning
TLDR
It is shown that planners searching for plan sets must consider a third metric, parsimony, that prefers shorter plans while maximizing diversity, and three existing approaches for generating diverse plans are evaluated and two new algorithms are evaluated designed to explicitly manage diversity and interaction between the diversity and quality metrics. Expand
Reshaping Diverse Planning
TLDR
This work revisits diverse planning literature in search of such a collection of computational problems, and proposes a novel approach to diverse planning, exploiting existing classical planners via planning task reformulation and choosing a subset of plans of required size in post-processing. Expand
Reshaping Diverse Planning : Let There Be Light !
The need for multiple plans to a planning problem has been established by various applications. In some, solution quality has the predominant role, while in others diversity is the key factor. MostExpand
Bounding Quality in Diverse Planning
Diverse planning is an important problem in automated planning with various real world applications. Recently, diverse planning has seen renewed interest, with work that defines a taxonomy ofExpand
Finding Diverse High-Quality Plans for Hypothesis Generation
TLDR
A planner is developed that first efficiently solves the “top-k” costoptimal planning problem to find k best plans, followed by clustering to produce diverse plans as cluster representatives, and empirically evaluate multiple clustering algorithms and similarity measures, and characterize the tradeoffs in choosing parameters and similarity Measures. Expand
Automatic Generation of Flexible Plans via Diverse Temporal Planning
TLDR
This paper describes a technique for automatically synthesizing a TPN which covers multiple possible executions for a given temporal planning problem specified in PDDL 2.1, and generates TPNs which can generalize the set of plans they are generated. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 85 REFERENCES
Planning with Qualitative Temporal Preferences
TLDR
This paper proposes a logical language for specifying non-Markovian preferences over the evolution of states and actions associated with a plan, and proposes an approach to computing preferred plans via bounded best-first search in a forward-chaining planner. Expand
Planning with Preferences
TLDR
This paper reviews the latest developments in automated preference-based planning, and various approaches for preference representation, and the main practical approaches developed so far. Expand
Effective Approaches for Partial Satisfaction (Over-Subscription) Planning
TLDR
Three techniques based on integer programming, regression planning with reachability heuristics, and anytime heuristic search for a forward state-space heuristic planner are developed, which generate plans that are comparable to the quality of plans generated by OptiPlan, while incurring only a small fraction of the cost. Expand
Model-Lite Planning : Diverse Multi-Option Plans & Dynamic Objective Functions
Knowledge acquisition is one major bottle-neck in using planning systems. Model-lite planning reduces this burden by placing responsibility on the planning system to cope with partially specifiedExpand
Domain Independent Approaches for Finding Diverse Plans
TLDR
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
A POMDP formulation of preference elicitation problems
TLDR
Methods that exploit the special structure of preference elicitation to deal with parameterized belief states over the continuous state space, and gradient techniques for optimizing parameterized actions are described. Expand
Simultaneous Elicitation of Preference Features and Utility
TLDR
This work describes computational procedures for identifying optimal alternatives w.r.t minimax regret in the presence of both utility and concept uncertainty; and develops several heuristic query strategies that focus simultaneously on reduction of relevant concept and utility uncertainty. 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
Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies
TLDR
Algorithms, that interleave search and preference elicitation, to find a solution which is necessarily optimal, that is, optimal no matter what the missing data will be, with the aim to ask the user to reveal as few preferences as possible are defined. Expand
Decision-Theoretic GOLOG with Qualitative Preferences
TLDR
This work proposes a framework for agent programming that integrates rich, non-Markovian, qualitative user preferences expressed in a linear temporal logic with quantitative Markovian reward functions and presents an algorithm that compiles qualitative preferences into GOLOG programs and proves it sound and complete with respect to the space of solutions. Expand
...
1
2
3
4
5
...