Number of the records: 1
Utilization of Genetic Programming to Solve a Simple Task Network Planning Problem
- 1.
SYSNO ASEP 0499984 Document Type C - Proceedings Paper (int. conf.) R&D Document Type Conference Paper Title Utilization of Genetic Programming to Solve a Simple Task Network Planning Problem Author(s) Řeháková, L. (CZ)
Neruda, Roman (UIVT-O) SAI, RID, ORCIDSource Title Proceedings of the 2018 IEEE International Conference on Systems, Man, and Cybernetic. - Los Alamitos : IEEE CS, 2018 - ISSN 2577-1655 - ISBN 978-1-5386-6650-0 Pages s. 3660-3666 Number of pages 7 s. Publication form Online - E Action SMC 2018. International Conference on Systems, Man and Cybernetics Event date 07.10.2018 - 10.10.2018 VEvent location Miyazaki Country JP - Japan Event type WRD Language eng - English Country US - United States Keywords Planning ; Task analysis ; Genetic programming ; Standards ; Software algorithms ; Automobiles Subject RIV IN - Informatics, Computer Science OECD category Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8) R&D Projects GA18-23827S GA ČR - Czech Science Foundation (CSF) Institutional support UIVT-O - RVO:67985807 UT WOS 000459884803114 EID SCOPUS 85062225571 DOI 10.1109/SMC.2018.00619 Annotation 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. Workplace Institute of Computer Science Contact Tereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800 Year of Publishing 2019
Number of the records: 1