4 papers · 1 filter
Theoretical Analysis of Quality Diversity Algorithms for a Classical Path Planning Problem
Duc-Cuong Dang, Aneta Neumann, Frank Neumann +2
Quality diversity (QD) algorithms have shown to provide sets of high quality solutions for challenging problems in robotics, games, and combinatorial optimisation. So far, theoreti…
Global Complexification of Real Analytic Restricted Log-Exp-Analytic Functions
Andre Opris
We show that a real analytic restricted log-exp-analytic function has a holomorphic extension which is again restricted log-exp-analytic. We also establish a parametric version of…
Illustrating the Efficiency of Popular Evolutionary Multi-Objective Algorithms Using Runtime Analysis
Duc-Cuong Dang, Andre Opris, Dirk Sudholt
Runtime analysis has recently been applied to popular evolutionary multi-objective (EMO) algorithms like NSGA-II in order to establish a rigorous theoretical foundation. However, m…
Runtime Analyses of NSGA-III on Many-Objective Problems
Andre Opris, Duc-Cuong Dang, Frank Neumann +1
NSGA-II and NSGA-III are two of the most popular evolutionary multi-objective algorithms used in practice. While NSGA-II is used for few objectives such as 2 and 3, NSGA-III is des…