Utilization of Genetic Programming to Solve a Simple Task Network Planning Problem

0499984 - ÚI 2019 RIV US eng C - Konferenční příspěvek (zahraniční konf.)
Řeháková, L. - Neruda, Roman
Utilization of Genetic Programming to Solve a Simple Task Network Planning Problem.
Proceedings of the 2018 IEEE International Conference on Systems, Man, and Cybernetic. Los Alamitos: IEEE CS, 2018, s. 3660-3666. ISBN 978-1-5386-6650-0. ISSN 2577-1655.
[SMC 2018. International Conference on Systems, Man and Cybernetics. Miyazaki (JP), 07.10.2018-10.10.2018]
Grant CEP: GA ČR(CZ) GA18-23827S
Institucionální podpora: RVO:67985807
Klíčová slova: Planning * Task analysis * Genetic programming * Standards * Software algorithms * Automobiles
Obor OECD: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

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.
Trvalý link: http://hdl.handle.net/11104/0292162