2 papers
cs.AI2024
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…
cs.NE2024
Evolutionary Algorithms for One-Sided Bipartite Crossing Minimisation
Jakob Baumann, Ignaz Rutter, Dirk Sudholt
Evolutionary algorithms (EAs) are universal solvers inspired by principles of natural evolution. In many applications, EAs produce astonishingly good solutions. As they are able to…