This master thesis describes the design and the implementation of the algorithm solving the domain- independent partial order simple task network planning problem using the tree-based genetic programming. The work contains comparison of several possible approaches to the problem --- it compares different representations, ways of evaluation and approaches to the partial ordering. It defines heuristics to improve the efficiency of the algorithm, including the distance heuristic, the local search and the individual equivalency. The implementation was tested on several experiments to show the abilities, strengths and weaknesses of the algorithm. Powered by TCPDF (www.tcpdf.org)
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:352623 |
| Date | January 2016 |
| Creators | Řeháková, Lucie |
| Contributors | Neruda, Roman, Pilát, Martin |
| Source Sets | Czech ETDs |
| Language | English |
| Detected Language | English |
| Type | info:eu-repo/semantics/masterThesis |
| Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.0027 seconds