ZusammenfassungZahlreiche regelungstechnisch relevante Entwurfs- und Analysefragestellungen lassen sich als Entscheidungsprobleme formulieren und mit quantifizierten Ausdrücken darstellen. Um diese Formulierungen für die jeweilige regelungstechnische Aufgabe nutzen zu können, werden Methoden der Quantorenelimination verwendet. Dabei handelt es sich um ein aus der Modelltheorie stammendes Konzept, um quantifizierte Ausdrücke in quantorenfreie Äquivalente zu überführen. Dieser Ansatz wird in diesem Beitrag auf eine Reihe von Fragestellungen angewendet und anhand diverser Beispiele diskutiert.
13 May 2019 in Journal of Computational and Nonlinear Dynamics
A Lyapunov-based approach for calculating positive invariant sets in an automatic manner is presented. This is done using real algebraic geometry techniques, which are summed up under the term quantifier elimination (QE). Using available tools, the approach presented yields an algorithmizable procedure whose conservatism only depends on the initial choice for the Lyapunov candidate function. The performance of the approach is illustrated on a variant of the Rössler system and on the Lorenz-Haken system.
Model predictive control (MPC) is a promising approach to the lateral and longitudinal control of autonomous vehicles. However, the parameterization of the MPC with respect to high-level requirements such as passenger comfort, as well as lateral and longitudinal tracking, is challenging. Numerous tuning parameters and conflicting requirements need to be considered. In this paper, we formulate the MPC tuning task as a multi-objective optimization problem. Its solution is demanding for two reasons: First, MPC-parameterizations are evaluated in a computationally expensive simulation environment. As a result, the optimization algorithm needs to be as sample-efficient as possible. Second, for some poor parameterizations, the simulation cannot be completed; therefore, useful objective function values are not available (for instance, learning with crash constraints). In this work, we compare the sample efficiency of multi-objective particle swarm optimization (MOPSO), a genetic algorithm (NSGA-II), and multiple versions of Bayesian optimization (BO). We extend BO by introducing an adaptive batch size to limit the computational overhead. In addition, we devise a method to deal with crash constraints. The results show that BO works best for a small budget, NSGA-II is best for medium budgets, and none of the evaluated optimizers are superior to random search for large budgets. Both proposed BO extensions are, therefore, shown to be beneficial.
17 May 2020 in International Journal of Robust and Nonlinear Control
Summary: In this study, we propose constructive ways to determine input‐to‐state stability (ISS) as well as incremental ISS (δISS) of nonpolynomial dynamical systems. The developed procedures are based on sums‐of‐square decomposition. This tool is only applicable to polynomial systems. Thus, a rational recast of the nonpolynomial system description is used. This recast generally leads to an increased system order and additional constraints. These constraints must be respected in the resulting formulations. The proposed approach gives a unique and constructive procedure to determine the ISS and the δISS property, which is normally nontrivial and needs a good understanding of the system's dynamics. The proposed approaches are illustrated on several examples.
This paper adds to the discussion about theoretical aspects of particle swarm stability by proposing to employ stochastic Lyapunov functions and to determine the convergence set by quantifier elimination. We present a computational procedure and show that this approach leads to a reevaluation and extension of previously known stability regions for PSO using a Lyapunov approach under stagnation assumptions.