Abstract

This paper describes an algorithm solving the domain-independent problem of partial order simple task network planning using tree-based genetic programming. It provides several enhancements and tailored solutions of the standard genetic programming approach to improve the efficiency of the algorithm, including distance heuristic, local search, and equivalence of the individuals. The algorithm was tested on several experiments from the hierarchical planning domain in order to demonstrate its abilities, strengths and weaknesses.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call