Action Scheduling Optimization using Cartesian Genetic Programming

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

@InProceedings{Abud-Kappel:2019:BRACIS,

• author = "Marco Andre {Abud Kappel}",
• booktitle = "2019 8th Brazilian Conference on Intelligent Systems (BRACIS)",
• title = "Action Scheduling Optimization using Cartesian Genetic Programming",
• year = "2019",
• pages = "293--298",
• month = oct,
• keywords = "genetic algorithms, genetic programming, Cartesian Genetic Programming",
• ISSN = "2643-6264",
• DOI = "doi:10.1109/BRACIS.2019.00059",
• abstract = "Action scheduling optimisation is a problem that involves chronologically organizing a set of actions, jobs or commands in order to accomplish a pre-established goal. This kind of problem can be found in a number of areas, such as production planning, delivery logistic organization, robot movement planning and behavior programming for intelligent agents in games. Despite being a recurrent problem, selecting the appropriate time and order to execute each task is not trivial, and typically involves highly complex techniques. The main objective of this work is to provide a simple alternative to tackle the action scheduling problem, by using Cartesian Genetic Programming as an approach. The proposed solution involves the application of two simple main steps: defining the set of available actions and specifying an objective function to be optimized. Then, by the means of the evolutionary algorithm, an automatically generated schedule will be revealed as the most fitting to the goal. The effectiveness of this methodology was tested by performing an action schedule optimization on two different problems involving virtual agents walking in a simulated environment. In both cases, results showed that, throughout the evolutionary process, the simulated agents naturally chose the most efficient sequential and parallel combination of actions to reach greater distances. The use of evolutionary adaptive metaheuristics such as Cartesian Genetic Programming allows the identification of the best possible schedule of actions to solve a problem.",
• notes = "Also known as \cite{8923702}",

}

Genetic Programming entries for Marco Andre Abud Kappel

Citations