Abstract

Multiobjective optimization plays an increasingly important role in modern applications, where several criteria are often of equal importance. The task in multiobjective optimization and multiobjective optimal control is therefore to compute the set of optimal compromises (the Pareto set) between the conflicting objectives. The advances in algorithms and the increasing interest in Pareto-optimal solutions have led to a wide range of new applications related to optimal and feedback control, which results in new challenges such as expensive models or real-time applicability. Since the Pareto set generally consists of an infinite number of solutions, the computational effort can quickly become challenging, which is particularly problematic when the objectives are costly to evaluate or when a solution has to be presented very quickly. This article gives an overview of recent developments in accelerating multiobjective optimal control for complex problems where either PDE constraints are present or where a feedback behavior has to be achieved. In the first case, surrogate models yield significant speed-ups. Besides classical meta-modeling techniques for multiobjective optimization, a promising alternative for control problems is to introduce a surrogate model for the system dynamics. In the case of real-time requirements, various promising model predictive control approaches have been proposed, using either fast online solvers or offline-online decomposition. We also briefly comment on dimension reduction in many-objective optimization problems as another technique for reducing the numerical effort.

Highlights

  • There is hardly ever a situation where only one goal is of interest at the same time

  • While we are usually satisfied with one optimal solution in the scalar-valued setting, there exists in general an infinite number of optimal compromises in the situation where multiple objectives are present

  • Since the solution to a Multiobjective Optimization Problem (MOP) is a set, it is significantly more expensive to compute than the optimum of a single objective problem, and many researchers devote their work to the development of algorithms for the efficient numerical approximation of Pareto sets

Read more

Summary

Introduction

There is hardly ever a situation where only one goal is of interest at the same time. Multiple goals are present in most technical applications, maximizing quality versus minimizing the cost being only one of many examples This dilemma leads to the field of multiobjective optimization, where we want to optimize all relevant objectives simultaneously. Since the solution to a Multiobjective Optimization Problem (MOP) is a set, it is significantly more expensive to compute than the optimum of a single objective problem, and many researchers devote their work to the development of algorithms for the efficient numerical approximation of Pareto sets. These advances have opened up new challenging application areas for multiobjective optimization.

Multiobjective Optimization
Theory
Solution Methods
Surrogate Models
Inaccuracies and -Dominance
Surrogate Models for the Objective Function
Surrogate Models for the Dynamical System
ROMS via Proper Orthogonal Decomposition or the Reduced Basis Method
Optimal Control Using Surrogate Models
ROM-Based Multiobjective Optimal Control of PDEs
Scalarization
Set-Oriented Approaches with -Dominance
Summary
Feedback Control
Online Multiobjective Optimization
Offline-Online Decomposition
Example
Reduction Techniques for Many-Objective Optimization Problems
Future Directions
Objective
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call