Abstract
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.
Original language | English (US) |
---|---|
Title of host publication | IJCAI International Joint Conference on Artificial Intelligence |
Pages | 2016-2022 |
Number of pages | 7 |
State | Published - 2007 |
Event | 20th International Joint Conference on Artificial Intelligence, IJCAI 2007 - Hyderabad, India Duration: Jan 6 2007 → Jan 12 2007 |
Other
Other | 20th International Joint Conference on Artificial Intelligence, IJCAI 2007 |
---|---|
Country/Territory | India |
City | Hyderabad |
Period | 1/6/07 → 1/12/07 |
ASJC Scopus subject areas
- Artificial Intelligence