ترغب بنشر مسار تعليمي؟ اضغط هنا

Polynomial Chaos-Based Flight Control Optimization with Guaranteed Probabilistic Performance

115   0   0.0 ( 0 )
 نشر من قبل Dalong Shi
 تاريخ النشر 2020
والبحث باللغة English




اسأل ChatGPT حول البحث

A probabilistic performance-oriented controller design approach based on polynomial chaos expansion and optimization is proposed for flight dynamic systems. Unlike robust control techniques where uncertainties are conservatively handled, the proposed method aims at propagating uncertainties effectively and optimizing control parameters to satisfy the probabilistic requirements directly. To achieve this, the sensitivities of violation probabilities are evaluated by the expansion coefficients and the fourth moment method for reliability analysis, after which an optimization that minimizes failure probability under chance constraints is conducted. Afterward, a time-dependent polynomial chaos expansion is performed to validate the results. With this approach, the failure probability is reduced while guaranteeing the closed-loop performance, thus increasing the safety margin. Simulations are carried out on a longitudinal model subject to uncertain parameters to demonstrate the effectiveness of this approach.



قيم البحث

اقرأ أيضاً

This paper presents an iterative algorithm to compute a Robust Control Invariant (RCI) set, along with an invariance-inducing control law, for Linear Parameter-Varying (LPV) systems. As the real-time measurements of the scheduling parameters are typi cally available, in the presented formulation, we allow the RCI set description along with the invariance-inducing controller to be scheduling parameter dependent. The considered formulation thus leads to parameter-dependent conditions for the set invariance, which are replaced by sufficient Linear Matrix Inequality (LMI) conditions via Polyas relaxation. These LMI conditions are then combined with a novel volume maximization approach in a Semidefinite Programming (SDP) problem, which aims at computing the desirably large RCI set. In addition to ensuring invariance, it is also possible to guarantee performance within the RCI set by imposing a chosen quadratic performance level as an additional constraint in the SDP problem. The reported numerical example shows that the presented iterative algorithm can generate invariant sets which are larger than the maximal RCI sets computed without exploiting scheduling parameter information.
A probabilistic performance-oriented control design optimization approach is introduced for flight systems. Aiming at estimating rare-event probabilities accurately and efficiently, subset simulation is combined with surrogate modeling techniques to improve efficiency. At each level of subset simulation, the samples that are close to the failure domain are employed to construct a surrogate model. The existing surrogate is then refined progressively. In return, seed and sample candidates are screened by the updated surrogate, thus saving a large number of calls to the true model and reducing the computational expense. Afterwards, control parameters are optimized under rare-event chance constraints to directly guarantee system performance. Simulations are conducted on an aircraft longitudinal model subject to parametric uncertainties to demonstrate the efficiency and accuracy of this method.
Systematic design and verification of advanced control strategies for complex systems under uncertainty largely remains an open problem. Despite the promise of blackbox optimization methods for automated controller tuning, they generally lack formal guarantees on the solution quality, which is especially important in the control of safety-critical systems. This paper focuses on obtaining closed-loop performance guarantees for automated controller tuning, which can be formulated as a black-box optimization problem under uncertainty. We use recent advances in non-convex scenario theory to provide a distribution-free bound on the probability of the closed-loop performance measures. To mitigate the computational complexity of the data-driven scenario optimization method, we restrict ourselves to a discrete set of candidate tuning parameters. We propose to generate these candidates using constrained Bayesian optimization run multiple times from different random seed points. We apply the proposed method for tuning an economic nonlinear model predictive controller for a semibatch reactor modeled by seven highly nonlinear differential equations.
This article considers the $mathcal{H}_infty$ static output-feedback control for linear time-invariant uncertain systems with polynomial dependence on probabilistic time-invariant parametric uncertainties. By applying polynomial chaos theory, the con trol synthesis problem is solved using a high-dimensional expanded system which characterizes stochastic state uncertainty propagation. A closed-loop polynomial chaos transformation is proposed to derive the closed-loop expanded system. The approach explicitly accounts for the closed-loop dynamics and preserves the $mathcal{L}_2$-induced gain, which results in smaller transformation errors compared to existing polynomial chaos transformations. The effect of using finite-degree polynomial chaos expansions is first captured by a norm-bounded linear differential inclusion, and then addressed by formulating a robust polynomial chaos based control synthesis problem. This proposed approach avoids the use of high-degree polynomial chaos expansions to alleviate the destabilizing effect of truncation errors, which significantly reduces computational complexity. In addition, some analysis is given for the condition under which the robustly stabilized expanded system implies the robust stability of the original system. A numerical example illustrates the effectiveness of the proposed approach.
In this paper, we consider a stochastic Model Predictive Control able to account for effects of additive stochastic disturbance with unbounded support, and requiring no restrictive assumption on either independence nor Gaussianity. We revisit the rat her classical approach based on penalty functions, with the aim of designing a control scheme that meets some given probabilistic specifications. The main difference with previous approaches is that we do not recur to the notion of probabilistic recursive feasibility, and hence we do not consider separately the unfeasible case. In particular, two probabilistic design problems are envisioned. The first randomization problem aims to design textit{offline} the constraint set tightening, following an approach inherited from tube-based MPC. For the second probabilistic scheme, a specific probabilistic validation approach is exploited for tuning the penalty parameter, to be selected textit{offline} among a finite-family of possible values. The simple algorithm here proposed allows designing a textit{single} controller, always guaranteeing feasibility of the online optimization problem. The proposed method is shown to be more computationally tractable than previous schemes. This is due to the fact that the sample complexity for both probabilistic design problems depends on the prediction horizon in a logarithmic way, unlike scenario-based approaches which exhibit linear dependence. The efficacy of the proposed approach is demonstrated with a numerical example.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا