Sciweavers

Share
IJCAI
2007

Domain Independent Approaches for Finding Diverse Plans

8 years 7 months ago
Domain Independent Approaches for Finding Diverse Plans
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 to CSP, and the other based on heuristic local search – can be adapted to produce diverse plans. We present empirical evidence demonstrating the effectiveness of our approaches.
Biplav Srivastava, Tuan A. Nguyen, Alfonso Gerevin
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2007
Where IJCAI
Authors Biplav Srivastava, Tuan A. Nguyen, Alfonso Gerevini, Subbarao Kambhampati, Minh Binh Do, Ivan Serina
Comments (0)
books