Showing cs.AIShow all
2 papers · 1 filter
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.AI2024
Sampling-based Pareto Optimization for Chance-constrained Monotone Submodular Problems
Xiankun Yan, Aneta Neumann, Frank Neumann
Recently surrogate functions based on the tail inequalities were developed to evaluate the chance constraints in the context of evolutionary computation and several Pareto optimiza…