Domain independent approaches for finding diverse plans
Biplav Srivastava, Tuan Anh Nguyen, Alfonso Gerevini · 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 ap-proach to solving this problem. We propose differ-ent domain independent distance functions among plans that can provide meaningful insight about the diversity of the plan set. We then describe how two representative state-of-the-art domain indepen-dent planning approaches–one based on compila-tion 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. 1