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

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@InProceedings{Rehakova:2018:ieeeSMC,

• author = "Lucie Rehakova and Roman Neruda",
• booktitle = "2018 IEEE International Conference on Systems, Man, and Cybernetics (SMC)",
• title = "Utilization of Genetic Programming to Solve a Simple Task Network Planning Problem",
• year = "2018",
• pages = "3660--3666",
• 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.",
• keywords = "genetic algorithms, genetic programming, Planning, Task analysis, Standards, Software algorithms, Automobiles, car",
• DOI = "doi:10.1109/SMC.2018.00619",
• ISSN = "2577-1655",
• month = oct,
• notes = "Also known as \cite{8616616}",

}

Genetic Programming entries for Lucie Rehakova Roman Neruda

Citations