473 research outputs found

    Direct Adaptive Control for Stability and Command Augmentation System of an Air-Breathing Hypersonic Vehicle

    Get PDF
    In this paper we explore a Direct Adaptive Control scheme for stabilizing a non-linear, physics based model of the longitudinal dynamics for an air breathing hypersonic vehicle. The model, derived from first principles, captures the complex interactions between the propulsion system, aerodynamics, and structural dynamics. The linearized aircraft dynamics show unstable and non-minimum phase behavior. It also shows a strong short period coupling with the fuselage-bending mode. The value added by direct adaptive control and the theoretical requirements for stable convergent operation is displayed. One of the main benefits of the Directive Adaptive Control is that it can be implemented knowing very little detail about the plant. The implementation uses only measured output feedback to accomplish the adaptation. A stability analysis is conducted on the linearized plant to understand the complex aero-propulsion and structural interactions. The multivariable system possesses certain characteristics beneficial to the adaptive control scheme; we discuss these advantages and ideas for future work

    Safety Assurance of Non-Deterministic Flight Controllers in Aircraft Applications

    Get PDF
    Loss of control is a serious problem in aviation that primarily affects General Aviation. Technological advancements can help mitigate the problem, but the FAA certification process makes certain solutions economically unfeasible. This investigation presents the design of a generic adaptive autopilot that could potentially lead to a single certification for use in several makes and models of aircraft. The autopilot consists of a conventional controller connected in series with a robust direct adaptive model reference controller. In this architecture, the conventional controller is tuned once to provide outer-loop guidance and navigation to a reference model. The adaptive controller makes unknown aircraft behave like the reference model, allowing the conventional controller to successfully provide navigation without the need for retuning. A strong theoretical foundation is presented as an argument for the safety and stability of the controller. The stability proof of direct adaptive controllers require that the plant being controlled has no unstable transmission zeros and has a nonzero high frequency gain. Because most conventional aircraft do not readily meet these requirements, a process known as sensor blending was used. Sensor blending consists of using a linear combination of the plant’s outputs that has no unstable transmission zeros and has a nonzero high frequency gain to drive the adaptive controller. Although this method does not present a problem for regulators, it can lead to a steady state error in tracking applications. The sensor blending theory was expanded to take advantage of the system’s dynamics to allow for zero steady state error tracking. This method does not need knowledge of the specific system’s dynamics, but instead uses the structure of the A and B matrices to perform the blending for the general case. The generic adaptive autopilot was tested in two high-fidelity nonlinear simulators of two typical General Aviation aircraft. The results show that the autopilot was able to adapt appropriately to the different aircraft and was able to perform three-dimensional navigation and an ILS approach, without any modification to the controller. The autopilot was tested in moderate atmospheric turbulence, using consumer-grade sensors and actuators currently available in General Aviation aircraft. The generic adaptive autopilot was shown to be robust to atmospheric turbulence and sensor and actuator random noise. In both aircraft simulators, the autopilot adapted successfully to changes in airspeed, altitude, and configuration. This investigation proves the feasibility of a generic autopilot using direct adaptive controller. The autopilot does not need a priori information of the specific aircraft’s dynamics to maintain its safety and stability arguments. Real-time parameter estimation of the aircraft dynamics are not needed. Recommendations for future work are provided

    Direct Adaptive Control for a Trajectory Tracking UAV

    Get PDF
    This research focuses on the theoretical development and analysis of a direct adaptive control algorithm to enable a fixed-wing UAV to track reference trajectories while in the presence of persistent external disturbances. A typical application of this work is autonomous flight through urban environments, where reference trajectories would be provided by a path planning algorithm and the vehicle would be subjected to significant wind gust disturbances. Full 6-DOF nonlinear and linear UAV simulation models are developed and used to study the performance of the direct adaptive control system for various scenarios. A stability proof is developed to prove convergence of the direct adaptive control system under certain conditions. Specific adaptive controller implementation details are provided, including the use of a sensor blending algorithm to address the non-minimum phase properties of the UAV models. The robustness of the adaptive system pertaining to the amount of modeling error that can be accommodated by the controller is studied, and the disturbance rejection capabilities and limitations of the controllers are also analyzed. The overall results of this research demonstrate that the direct adaptive control algorithm can enable trajectory tracking in cases where there are both significant uncertainties in the external disturbances and considerable error in the UAV model

    Adaptive Augmentation of Non-Minimum Phase Flexible Aerospace Systems

    Get PDF
    This work demonstrates the efficacy of direct adaptive augmentation on a robotic flexible system as an analogue of a large flexible aerospace structure such as a launch vehicle or aircraft. To that end, a robot was constructed as a control system testbed. This robot, named “Penny,” contains the command and data acquisition capabilities necessary to influence and record system state data, including the flex states of its flexible structures. This robot was tested in two configurations, one with a vertically cantilevered flexible beam, and one with a flexible inverted pendulum (a flexible cart-pole system). The physical system was then characterized so that linear analysis and control design could be performed. These characterizations resulted in linear and nonlinear models developed for each testing configuration. The linear models were used to design linear controllers to regulate the nominal plant’s dynamical states. These controllers were then augmented with direct adaptive output regulation and disturbance accommodation. To accomplish this, sensor blending was used to shape the output such that the nonminimum phase open loop plant appears to be minimum phase to the controller. It was subsequently shown that augmenting linear controllers with direct adaptive output regulation and disturbance accommodation was effective in enhancing system performance and mitigating oscillation in the flexible structures through the system’s own actuation effort

    Sampled-Data Kalman Filtering and Multiple Model Adaptive Estimation for Infinite-Dimensional Continuous-Time Systems

    Get PDF
    Kalman filtering and multiple model adaptive estimation (MMAE) methods have been applied by researchers in several engineering disciplines to a multitude of problems featuring a linear (or mildly nonlinear) model based on finite-dimensional differential (or difference) equations perturbed by random inputs. However, many real-world systems are more naturally modeled using an infinite-dimensional continuous-time linear systems model, such as those most naturally modeled as partial differential equations or time-delayed differential equations along with a possibly infinite-dimensional measurement model. The Kalman filtering technique was extended to encompass infinite-dimensional continuous-time systems with sampled-data measurements and a technique to approximate an infinite-dimensional continuous-time system model with an essentially equivalent finite-dimensional discrete-time model upon which a filtering algorithm could be based was developed. The tools developed during this research were demonstrated using an estimation problem based on a stochastic partial differential equation with an unknown noise environment

    Identification of low order models for large scale processes

    Get PDF
    Many industrial chemical processes are complex, multi-phase and large scale in nature. These processes are characterized by various nonlinear physiochemical effects and fluid flows. Such processes often show coexistence of fast and slow dynamics during their time evolutions. The increasing demand for a flexible operation of a complex process, a pressing need to improve the product quality, an increasing energy cost and tightening environmental regulations make it rewarding to automate a large scale manufacturing process. Mathematical tools used for process modeling, simulation and control are useful to meet these challenges. Towards this purpose, development of process models, either from the first principles (conservation laws) i.e. the rigorous models or the input-output data based models constitute an important step. Both types of models have their own advantages and pitfalls. Rigorous process models can approximate the process behavior reasonably well. The ability to extrapolate the rigorous process models and the physical interpretation of their states make them more attractive for the automation purpose over the input-output data based identified models. Therefore, the use of rigorous process models and rigorous model based predictive control (R-MPC) for the purpose of online control and optimization of a process is very promising. However, due to several limitations e.g. slow computation speed and the high modeling efforts, it becomes difficult to employ the rigorous models in practise. This thesis work aims to develop a methodology which will result in smaller, less complex and computationally efficient process models from the rigorous process models which can be used in real time for online control and dynamic optimization of the industrial processes. Such methodology is commonly referred to as a methodology of Model (order) Reduction. Model order reduction aims at removing the model redundancy from the rigorous process models. The model order reduction methods that are investigated in this thesis, are applied to two benchmark examples, an industrial glass manufacturing process and a tubular reactor. The complex, nonlinear, multi-phase fluid flow that is observed in a glass manufacturing process offers multiple challenges to any model reduction technique. Often, the rigorous first principle models of these benchmark examples are implemented in a discretized form of partial differential equations and their solutions are computed using the Computational Fluid Dynamics (CFD) numerical tools. Although these models are reliable representations of the underlying process, computation of their dynamic solutions require a significant computation efforts in the form of CPU power and simulation time. The glass manufacturing process involves a large furnace whose walls wear out due to the high process temperature and aggressive nature of the molten glass. It is shown here that the wearing of a glass furnace walls result in change of flow patterns of the molten glass inside the furnace. Therefore it is also desired from the reduced order model to approximate the process behavior under the influence of changes in the process parameters. In this thesis the problem of change in flow patterns as result of changes in the geometric parameter is treated as a bifurcation phenomenon. Such bifurcations exhibited by the full order model are detected using a novel framework of reduced order models and hybrid detection mechanisms. The reduced order models are obtained using the methods explained in the subsequent paragraphs. The model reduction techniques investigated in this thesis are based on the concept of Proper Orthogonal Decompositions (POD) of the process measurements or the simulation data. The POD method of model reduction involves spectral decomposition of system solutions and results into arranging the spatio-temporal data in an order of increasing importance. The spectral decomposition results into spatial and temporal patterns. Spatial patterns are often known as POD basis while the temporal patterns are known as the POD modal coefficients. Dominant spatio-temporal patterns are then chosen to construct the most relevant lower dimensional subspace. The subsequent step involves a Galerkin projection of the governing equations of a full order first principle model on the resulting lower dimensional subspace. This thesis can be viewed as a contribution towards developing the databased nonlinear model reduction technique for large scale processes. The major contribution of this thesis is presented in the form of two novel identification based approaches to model order reduction. The methods proposed here are based on the state information of a full order model and result into linear and nonlinear reduced order models. Similar to the POD method explained in the previous paragraph, the first step of the proposed identification based methods involve spectral decomposition. The second step is different and does not involve the Galerkin projection of the equation residuals. Instead, the second step involves identification of reduced order models to approximate the evolution of POD modal coefficients. Towards this purpose, two different methods are presented. The first method involves identification of locally valid linear models to represent the dynamic behavior of the modal coefficients. Global behavior is then represented by ‘blending’ the local models. The second method involves direct identification of the nonlinear models to represent dynamic evolution of the model coefficients. In the first proposed model reduction method, the POD modal coefficients, are treated as outputs of an unknown reduced order model that is to be identified. Using the tools from the field of system identification, a blackbox reduced order model is then identified as a linear map between the plant inputs and the modal coefficients. Using this method, multiple local reduced LTI models corresponding to various working points of the process are identified. The working points cover the nonlinear operation range of the process which describes the global process behavior. These reduced LTI models are then blended into a single Reduced Order-Linear Parameter Varying (ROLPV) model. The weighted blending is based on nonlinear splines whose coefficients are estimated using the state information of the full order model. Along with the process nonlinearity, the nonlinearity arising due to the wear of the furnace wall is also approximated using the RO-LPV modeling framework. The second model reduction method that is proposed in this thesis allows approximation of a full order nonlinear model by various (linear or nonlinear) model structures. It is observed in this thesis, that, for certain class of full order models, the POD modal coefficients can be viewed as the states of the reduced order model. This knowledge is further used to approximate the dynamic behavior of the POD modal coefficients. In particular, reduced order nonlinear models in the form of tensorial (multi-variable polynomial) systems are identified. In the view of these nonlinear tensorial models, the stability and dissipativity of these models is investigated. During the identification of the reduced order models, the physical interpretation of the states of the full order rigorous model is preserved. Due to the smaller dimension and the reduced complexity, the reduced order models are computationally very efficient. The smaller computation time allows them to be used for online control and optimization of the process plant. The possibility of inferring reduced order models from the state information of a full order model alone i.e. the possibility to infer the reduced order models in the absence of access to the governing equations of a full order model (as observed for many commercial software packages) make the methods presented here attractive. The resulting reduced order models need further system theoretic analysis in order to estimate the model quality with respect to their usage in an online controller setting

    Inductive Pattern Formation

    Get PDF
    With the extended computational limits of algorithmic recursion, scientific investigation is transitioning away from computationally decidable problems and beginning to address computationally undecidable complexity. The analysis of deductive inference in structure-property models are yielding to the synthesis of inductive inference in process-structure simulations. Process-structure modeling has examined external order parameters of inductive pattern formation, but investigation of the internal order parameters of self-organization have been hampered by the lack of a mathematical formalism with the ability to quantitatively define a specific configuration of points. This investigation addressed this issue of quantitative synthesis. Local space was developed by the Poincare inflation of a set of points to construct neighborhood intersections, defining topological distance and introducing situated Boolean topology as a local replacement for point-set topology. Parallel development of the local semi-metric topological space, the local semi-metric probability space, and the local metric space of a set of points provides a triangulation of connectivity measures to define the quantitative architectural identity of a configuration and structure independent axes of a structural configuration space. The recursive sequence of intersections constructs a probabilistic discrete spacetime model of interacting fields to define the internal order parameters of self-organization, with order parameters external to the configuration modeled by adjusting the morphological parameters of individual neighborhoods and the interplay of excitatory and inhibitory point sets. The evolutionary trajectory of a configuration maps the development of specific hierarchical structure that is emergent from a specific set of initial conditions, with nested boundaries signaling the nonlinear properties of local causative configurations. This exploration of architectural configuration space concluded with initial process-structure-property models of deductive and inductive inference spaces. In the computationally undecidable problem of human niche construction, an adaptive-inductive pattern formation model with predictive control organized the bipartite recursion between an information structure and its physical expression as hierarchical ensembles of artificial neural network-like structures. The union of architectural identity and bipartite recursion generates a predictive structural model of an evolutionary design process, offering an alternative to the limitations of cognitive descriptive modeling. The low computational complexity of these models enable them to be embedded in physical constructions to create the artificial life forms of a real-time autonomously adaptive human habitat

    Development Of A High Performance Mosaicing And Super-Resolution Algorithm

    Get PDF
    In this dissertation, a high-performance mosaicing and super-resolution algorithm is described. The scale invariant feature transform (SIFT)-based mosaicing algorithm builds an initial mosaic which is iteratively updated by the robust super resolution algorithm to achieve the final high-resolution mosaic. Two different types of datasets are used for testing: high altitude balloon data and unmanned aerial vehicle data. To evaluate our algorithm, five performance metrics are employed: mean square error, peak signal to noise ratio, singular value decomposition, slope of reciprocal singular value curve, and cumulative probability of blur detection. Extensive testing shows that the proposed algorithm is effective in improving the captured aerial data and the performance metrics are accurate in quantifying the evaluation of the algorithm
    corecore