- 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 sub-optimal plans are then evolved using a generational algorithm towards the optimal plan. We present initial results from Blocks World and the Briefcase Domain and found that GP method almost always improved sub-optimal plans, often drastically.
- Copyright:
- 2002 by The University of Edinburgh. All Rights Reserved
- The sponsors of this research and the University of Edinburgh are authorised to reproduce and distribute reprints for their purposes notwithstanding any copyright annotation hereon. The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing official policies or endorsements, either express or implied, of the research sponsors or the University of Edinburgh.
- Links To Paper
- No links available
- Bibtex format
- @InProceedings{EDI-INF-RR-0100,
- author = {
Henrik Westerberg
and John Levine
},
- title = {Optimising Plans using Genetic Programming},
- book title = {Proceedings of the UK Workshop on Computational Intelligence (UKCI-01)},
- year = 2001,
- month = {Sep},
- }
|
