Bayesian Quality-Diversity approaches for constrained optimization problems with mixed continuous, discrete and categorical variables

TL;DR

This paper introduces a Bayesian Quality-Diversity optimization method tailored for complex design problems with mixed variables and constraints, significantly reducing computational costs while exploring diverse solutions.

Contribution

A novel Bayesian Quality-Diversity approach that handles mixed continuous, discrete, and categorical variables with constraints, improving efficiency over existing methods.

Findings

Reduces computational cost by up to two orders of magnitude.

Effectively handles mixed variables and constraints in design optimization.

Demonstrates faster convergence on aerospace design problems.

Abstract

Complex system design problems, such as those involved in aerospace engineering, require the use of numerically costly simulation codes in order to predict the performance of the system to be designed. In this context, these codes are often embedded into an optimization process to provide the best design while satisfying the design constraints. Recently, new approaches, called Quality-Diversity, have been proposed in order to enhance the exploration of the design space and to provide a set of optimal diversified solutions with respect to some feature functions. These functions are interesting to assess trade-offs. Furthermore, complex design problems often involve mixed continuous, discrete, and categorical design variables allowing to take into account technological choices in the optimization problem. Existing Bayesian Quality-Diversity approaches suited for intensive high-fidelity simulations are not adapted to mixed variables constrained optimization problems. In order to overcome these limitations, a new Quality-Diversity methodology based on mixed variables Bayesian optimization strategy is proposed in the context of limited simulation budget. Using adapted covariance models and dedicated enrichment strategy for the Gaussian processes in Bayesian optimization, this approach allows to reduce the computational cost up to two orders of magnitude, with respect to classical Quality-Diversity approaches while dealing with discrete choices and the presence of constraints. The performance of the proposed method is assessed on a benchmark of analytical problems as well as on two aerospace system design problems highlighting its efficiency in terms of speed of convergence. The proposed approach provides valuable trade-offs for decision-markers for complex system design.