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 Anh Nguyen 0001', 'Alfonso Gerevini', 'Subbarao Kambhampati', 'Minh Binh Do', 'Ivan Serina']
Domain independent approaches for finding diverse plans