Finite Horizon Worst-Case Analysis of Linear Time-Varying Systems Applied to Launch Vehicle
This paper presents an approach to compute the worst-case gain of the interconnection of a finite time horizon linear time-variant system and a perturbation. The input/output behavior of the uncertainty is described by integral quadratic constraints (IQCs). A condition for the worst-case gain of such an interconnection can be formulated using dissipation theory as a parameterized Riccati differential equation, which depends on the chosen IQC multiplier. A nonlinear optimization problem is formulated to minimize the upper bound of the worst-case gain over a set of admissible IQC multipliers. This problem can be efficiently solved with a custom-tailored logarithm scaled, adaptive differential evolution algorithm. It provides a fast alternative to similar approaches based on solving semidefinite programs. The algorithm is applied to the worst-case aerodynamic load analysis for an expendable launch vehicle (ELV). The worst-case load of the uncertain ELV is calculated under wind turbulence during the atmospheric ascend and compared to results from nonlinear simulation.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Finite Horizon Robust Synthesis Using Integral Quadratic Constraints
We present a robust synthesis algorithm for uncertain linear time-varying (LTV) systems on finite horizons. The uncertain system is described as an interconnection of a known LTV system and a perturbation. The input-outp…
Trajectory-based Robustness Analysis for Nonlinear Systems
This paper considers the robustness of an uncertain nonlinear system along a finite-horizon trajectory. The uncertain system is modeled as a connection of a nonlinear system and a perturbation. The analysis relies on thr…
CVaR-based Safety Analysis in the Infinite Time Horizon Setting
We develop a risk-averse safety analysis method for stochastic systems on discrete infinite time horizons. Our method quantifies the notion of risk for a control system in terms of the severity of a harmful random outcom…
ManagementBe Greedy in Multi-Armed Bandits
The Greedy algorithm is the simplest heuristic in sequential decision problem that carelessly takes the locally optimal choice at each round, disregarding any advantages of exploring and/or information gathering. Theoret…
Multi-Armed BanditsImproved Worst-Case Regret Bounds for Randomized Least-Squares Value Iteration
This paper studies regret minimization with randomized value functions in reinforcement learning. In tabular finite-horizon Markov Decision Processes, we introduce a clipping variant of one classical Thompson Sampling (T…
reinforcement-learningReinforcement LearningReinforcement Learning (RL)Thompson Sampling