Abstract
Finding the shortest plan for a given planning problem is extremely hard. We present a domain independent approach for plan optimisation based on Genetic Programming. The algorithm is seeded with correct plans created by hand-encoded heuristic policy sets. The plans are very unlikely to be optimal but are created quickly. The suboptimal plans are then evolved using a generational algorithm towards the optimal plan. We present initial results from Blocks World and found that GP method almost always improved sub-optimal plans, often drastically.
Original language | English |
---|---|
Title of host publication | Proceedings of the Sixth European Conference on Planning |
Place of Publication | Palo Alto |
Number of pages | 3 |
Publication status | Published - 21 May 2014 |
Event | 6th European Conference on Planning - Toledo, Spain Duration: 12 Sept 2001 → 14 Jul 2016 |
Conference
Conference | 6th European Conference on Planning |
---|---|
Abbreviated title | ECP 2001 |
Country/Territory | Spain |
City | Toledo |
Period | 12/09/01 → 14/07/16 |
Keywords
- plan optimisation
- genetic programming
- heuristic policy sets
- planning domains
- heuristics
- domain independent technique
- linear plans
- genetic operators