Search arXivSearch

arXiv · 2208.10411

Nonlinear Control Allocation Using A Piecewise Multi-Linear Representation

Abstract

Nonlinear control allocation is an important part of modern nonlinear dynamic inversion based flight control systems which require highly accurate model of aircraft aerodynamics. Generally, an accurately implemented onboard model determines how well the system nonlinearities can be canceled. Thus, more accurate model results in better cancellation, leading to the higher performance of the controller. In this paper, a new control system is presented that combines nonlinear dynamic inversion with a piecewise multi-linear representation based control allocation. The piecewise multi-linear representation is developed through a new generalization of Kronecker product for block matrices, combined with the canonical piecewise linear representation of nonlinear functions. Analytical expressions for the Jacobian of the piecewise multi-linear model are also presented. Proposed formulation gives an exact representation of piecewise multi-linear aerodynamic data and thus is capable of accurately modeling nonlinear aerodynamics over the entire flight envelope of an aircraft. Resulting nonlinear controller is applied to control of a tailless flying wing aircraft with ten independently operating control surfaces. The simulation results for two innovative control surface configurations indicate that perfect control allocation performance can be achieved, leading to better tracking performance compared with ordinary polynomial-based control allocation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jahanzeb Rajput, Hafiz Zeeshan Iqbal Khan. 2022-08-22. Nonlinear Control Allocation Using A Piecewise Multi-Linear Representation. https://doi.org/10.1109/taes.2023.3257139

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Observability and parameter estimation of a generic model for aggregated distributed energy resources

We propose a novel framework for estimating the parameters of an aggregated distributed energy resources (DER A) model. First, we introduce a rigorous method to determine whether all model parameters are estimable. When they are not, our approach identifies the subset of parameters that can be estimated. The proposed framework offers new insights into the number and specific parameters that can be reliably estimated based on commonly available measurements. It also highlights the limitations of calibrating such models. Second, we introduce a Kalman filtering method to calibrate the DER A model. Since we account for nonlinear effects such as saturation and deadbands, we develop a specific mechanism to handle smoothing functions within the Kalman filter. Specifically, we consider the extended and the unscented Kalman filter. We demonstrate the effectiveness of the proposed framework on a modified IEEE 34-node distribution feeder with inverter- based resources. Our findings align with the North American Electric Reliability Corporation's parameterization guideline and underscore the importance of model calibration in accurately capturing the collective dynamics of distributed energy resources installed on distribution systems.

eess.SY

Salted Fisher Information for Hybrid Systems

Discrete events change how parameter-influence propagates in hybrid systems. Prevailing Fisher information for- mulations assume that sensitivities evolve smoothly according to continuous-time variational equations and therefore neglect the sensitivity updates induced by discrete events. This paper derives a Fisher information matrix formulation compatible with hybrid systems. To do so, we use the saltation matrix, which encodes the first-order transformation of sensitivities induced by discrete events. We call the resulting formulation the salted Fisher information matrix (SFIM). The proposed framework unifies continuous information accumulation during flows with discrete updates at event times. We also show that hybrid persistence of excitation is sufficient for the SFIM to be positive definite

eess.SY

Min-Max Grassmannian Optimization for Online Subspace Tracking

We propose GeRoST (Geometrically Robust Subspace Tracking), an online subspace tracking algorithm that models uncertainty in a subspace using a Grassmannian ball. We derive an exact scalar dual for the worst-case subspace problem, establish conditions for a unique worst-case subspace and a Riemannian gradient, and characterize the minimum radius needed to cover a dimensional extension of the target subspace. Each update uses either a spectral direction computed in a reduced subspace or the gradient of the window reconstruction loss. Our numerical experiments show that GeRoST achieves lower mean post-fault prediction error than GREAT in system identification. In video separation, it achieves higher precision and a better precision--recall balance, as measured by the F$_1$ score, than both GREAT and GRASTA at the reported thresholds, with lower recall and longer runtime.

eess.SY