• Corpus ID: 2599113

Domain Independent Approaches for Finding Diverse Plans

@inproceedings{Srivastava2007DomainIA,
  title={Domain Independent Approaches for Finding Diverse Plans},
  author={B. Srivastava and Tuan Anh Nguyen and Alfonso Gerevini and S. Kambhampati and Minh Binh Do and Ivan Serina},
  booktitle={IJCAI},
  year={2007}
}
In many planning situations, a planner is required to return a diverse set of plans satisfying the same goals which will be used by the external systems collectively. We take a domain-independent approach to solving this problem. We propose different domain independent distance functions among plans that can provide meaningful insights about the diversity in the plan set. We then describe how two representative state-of-the-art domain independent planning approaches - one based on compilation… 

Figures and Tables from this paper

On the Use of Landmarks in LPG
TLDR
This work proposes the use of Landmarks for the LPG planner, considering different design choices and analysing empirically its impact on the performance of the planner, finding results comparable with the state-of-the-art planner LAMA.
Diverse Plan Generation by Plan Adaptation and by First-Principles Planning: A Comparative Study
TLDR
A conceptual framework for plan diversity is developed which subsumes both case-based and first-principles diverse plan generation, and is used to contrast two such systems, identifying their relative strengths and weaknesses.
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.
A Combinatorial Search Perspective on Diverse Solution Generation
TLDR
This paper presents a generic bi-level optimization framework for finding cost-sensitive diverse solutions and proposes complete methods under this framework, which guarantee finding a set of cost sensitive diverse solutions satisficing the given criteria whenever there exists such a set.
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.
On the Plan-Library Maintenance Problem in a Case-Based Planner
TLDR
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.
Multiagent Planning Supported by Plan Diversity Metrics and Landmark Actions
TLDR
The proposed multiagent planning approach was experimentally analyzed on one newly designed domain and one classical benchmark domain and results show what combination of plan quality estimation and diversity metrics provide the best planning efficiency.
Offline and Online Plan Library Maintenance in Case-Based Planning
TLDR
The problem of maintaining the library of plans in a recent case-based planner called OAKplan is addressed, a complementary online approach that attempts to limit the growth of the library is introduced, and the combination of offline and online techniques to ensure the best performance of the case- based planner are considered.
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.
Towards Model-lite Planning : Extending Sapa for Incomplete Metric Model
TLDR
This paper considers the scenario in which the exact trade-off between objective functions time and cost of the plan is unknown to the planner and proposes an approach using heuristic search to find a set of plans which shows the usefulness in supporting the user’s decision.
...
...

References

SHOWING 1-10 OF 17 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.
Plan Stability: Replanning versus Plan Repair
TLDR
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.
Managing the Life Cycle of Plans
TLDR
This work focuses in particular on the automatic synthesis of plan metadata for plans containing conditional and parallel actions, well-structured loops, and non-deterministic choices, thus allowing a system to embed plans into context and organize them in meaningfully structured plan repositories.
Finding Diverse and Similar Solutions in Constraint Programming
TLDR
A number of different classes of diversity and similarity problems are defined and a number of practical solution methods are proposed, some of which use global constraints for enforcing diversity (or similarity) between solutions.
Generating qualitatively Different Plans througt Metatheoretic Biases
TLDR
Experimental results are provided that validate the effectiveness of the biasing method for reliably generating a range of plans with meaningful semantic differences.
Metatheoretic Plan Summarization and Comparison
We describe a domain-independent framework for plan summarization and comparison that can help a human understand both key strategic elements of an individual plan and important differences among
Course of Action Generation for Cyber Security Using Classical Planning
TLDR
In this application, the generation of attack plans for a simple but realistic web-based document control system is demonstrated, with excellent performance compared to the prevailing state of the art in this area.
Generation of Multiple Qualitatively Different Plan Options
TLDR
A Web-based demonstration of a Course of Action comparison matrix being used as an interface to an O-Plan plan server to explore multiple qualitatively different plan options based on different command-level requirements and different assumptions about the conditions on the island.
Adaptation inWeb Service Composition and Execution
TLDR
A staged approach for adaptive WSCE (A-WSCE) is motivated that cleanly separates the functional and non-functional requirements of a new service, and enables different environmental changes to be absorbed at different stages of composition and execution.
...
...