Domain independent approaches for finding diverse plans
In many planning situations, a planner is required to return a set of plans satisfying the same goals which will be used by the external systems collectively. The external systems can specify the desired inter-relationships among the returned plans (e.g., diverse plans, similar plans, non-dominated plans) and the task of the planner is to return a set of plans which will meet these requirements. As an example, in adaptive web services composition, the web service engine wants to have a set of diverse plans/ compositions such that if there is a failure while executing one composition, an alternative may be used which is less likely to be failing simultaneously. In this paper, we take a domain-independent approach to solving the problem with any planner. We propose different distance functions among plans that provide meaningful insight about the plan set, and then show how standard planners like CSP-based and heuristics-based can be adapted to efficiently return such plans.
Srivastava, B.; Kambhampati, S.; Nguyen, T.; Do, M. B. ; Gerevini, A. Domain independent approaches for finding diverse plans. 20th International Joint Conference on Artificial Intelligence (IJCAI); 2007 January 6-12; Hyderabad; India; 2016-2022.