Adaptive actuator failure compensation design for unknown chaotic multi‐input systems

In this paper, an adaptive control approach is designed for compensating the faults in the actuators of chaotic systems and maintaining the acceptable system stability. We propose a state‐feedback model reference adaptive control scheme for unknown chaotic multi‐input systems. Only the dimensions of the chaotic systems are required to be known. Based on Lyapunov stability theory, new adaptive control laws are synthesized to accommodate actuator failures and system nonlinearities. An illustrative example is studied. The simulation results show the effectiveness of the design method. Copyright © 2014 John Wiley & Sons, Ltd.     

A stiffness parameter and truncation error criterion for adaptive path following in structural mechanics

We explore a truncation error criterion to steer adaptive step length refinement and coarsening in incremental-iterative path following procedures, applied to problems in large-deformation structural mechanics. Elaborating on ideas proposed by Bergan and collaborators in the 1970s, we first describe an easily computable scalar stiffness parameter whose sign and rate of change provide reliable information on the local behavior and complexity of the equilibrium path. We then derive a simple scaling law that adaptively adjusts the length of the next step based on the rate of change of the stiffness parameter at previous points on the path. We show that this scaling is equivalent to keeping a local truncation error constant in each step. We demonstrate with numerical examples that our adaptive method follows a path with a significantly reduced number of points compared to an analysis with uniform step length of the same fidelity level. A comparison with Abaqus illustrates that the truncation error criterion effectively concentrates points around the smallest-scale features of the path, which is generally not possible with automatic incrementation solely based on local convergence properties.     

A Global Maximum Error Controller Based Nonlinearity Aware TPWL Method for Reducing Nonlinear Systems

Abstract

Model order reduction is a common practice to reduce large order systems so that their simulation and control become easy. Nonlinearity aware trajectory piecewise linear is a variation of trajectory piecewise linearization technique of order reduction that is used to reduce nonlinear systems. With this scheme, the reduced approximation of the system is generated by weighted sum of the linearized and reduced sub-models obtained at certain linearization points on the system trajectory. This scheme uses dynamically inspired weight assignment that makes the approximation nonlinearity aware. Just as weight assignment, the process of linearization points selection is also important for generating faithful approximations. This article uses a global maximum error controller based linearization points selection scheme according to which a state is chosen as a linearization point if the error between a current reduced model and the full order nonlinear system reaches a maximum value. A combination that not only selects linearization points based on an error controller but also assigns dynamic inspired weights is shown in this article. The proposed scheme generates approximations with higher accuracies. This is demonstrated by applying the proposed method to some benchmark nonlinear circuits including RC ladder network and inverter chain circuit and comparing the results with the conventional schemes.     

A case-deletion diagnostic for penalized calibration estimators and BLUP under linear mixed models in survey sampling

The penalized calibration technique in survey sampling combines usual calibration and soft calibration by introducing a penalty term. Certain relevant estimates in survey sampling can be considered as penalized calibration estimates obtained as particular cases from an optimization problem with a common basic structure. In this framework, a case deletion diagnostic is proposed for a class of penalized calibration estimators including both design-based and model-based estimators. The diagnostic compares finite population parameter estimates and can be calculated from quantities related to the full data set. The resulting diagnostic is a function of the residual and leverage, as other diagnostics in regression models, and of the calibration weight, a singular feature in survey sampling. Moreover, a particular case, which includes the basic unit level model for small area estimation, is considered. Both a real and an artificial example are included to illustrate the diagnostic proposed. The results obtained clearly show that the proposed diagnostic depends on the calibration and soft-calibration variables, on the penalization term, as well as on the parameter to estimate.     

Effects of apparent image velocity and complexity on the dynamic visual field using a high-speed train driving simulator

Train driving is a highly visual task. The visual capabilities of the train driver affects driving safety and driving performance. Understanding the effects of train speed and background image complexity on the visual behavior of the high-speed train driver is essential for optimizing performance and safety. This study investigated the role of the apparent image velocity and complexity on the dynamic visual field of drivers. Participants in a repeated-measures experiment drove a train at nine different speeds in a state-of-the-art high-speed train simulator. Eye movement analysis indicated that the effect of image velocity on the dynamic visual field of high-speed train driver was significant while image complexity had no effect on it. The fixation range was increasingly concentrated on the middle of the track as the speed increased, meanwhile there was a logarithmic decline in fixation range for areas surrounding the track. The extent of the visual search field decreased gradually, both vertically and horizontally, as the speed of train increased, and the rate of decrease was more rapid in the vertical direction. A model is proposed that predicts the extent of this tunnel vision phenomenon as a function of the train speed.Relevance to industryThis finding can be used as a basis for the design of high-speed railway system and as a foundation for improving the operational procedures of high-speed train driver for safety.     

A practical Equivalent Electrical Circuit model for Proton Exchange Membrane Fuel Cell (PEMFC) systems

An alternative Equivalent Electrical Circuit for Proton Exchange Membrane Fuel Cells is modelled in this study. Both I–V characteristics and H₂ consumptions corresponding to generated power under load and no-load conditions are investigated. For this purpose, H₂ consumptions and I–V characteristics of three different sized PEMFCs are tested. There is a very good harmony between the model results and measured values (relative error %0.7, %6.4 and %2.5 for FC-A, FC-B and FC-C respectively). In the proposed model current passes only on parallel resistance and not on serial resistance at no-load condition. Thus, a FC with higher parallel resistance should be preferred. Another key output of this study is that based on the proposed model, performance comparison of FCs can be performed with the parameters defined in this work. Proposals made in this study can easily be used for performance analysis of FCs under for both steady state and transient analysis.     

Gradient-based recursive parameter estimation for a periodically nonuniformly sampled-data Hammerstein–Wiener system based on the key-term separation

The identification of the Hammerstein–Wiener (H-W) systems based on the nonuniform input–output dataset remains a challenging problem. This article studies the identification problem of a periodically nonuniformly sampled-data H-W system. In addition, the product terms of the parameters in the H-W system are inevitable. In order to solve the problem, the key-term separation is applied and two algorithms are proposed. One is the key-term-based forgetting factor stochastic gradient (KT-FFSG) algorithm based on the gradient search. The other is the key-term-based hierarchical forgetting factor stochastic gradient (KT-HFFSG) algorithm. Compared with the KT-FFSG algorithm, the KT-HFFSG algorithm gives more accurate estimates. The simulation results indicate that the proposed algorithms are effective.     

SINA: Semantic interpretation of user queries for question answering on interlinked data

The architectural choices underlying Linked Data have led to a compendium of data sources which contain both duplicated and fragmented information on a large number of domains. One way to enable non-experts users to access this data compendium is to provide keyword search frameworks that can capitalize on the inherent characteristics of Linked Data. Developing such systems is challenging for three main reasons. First, resources across different datasets or even within the same dataset can be homonyms. Second, different datasets employ heterogeneous schemas and each one may only contain a part of the answer for a certain user query. Finally, constructing a federated formal query from keywords across different datasets requires exploiting links between the different datasets on both the schema and instance levels. We present Sina, a scalable keyword search system that can answer user queries by transforming user-supplied keywords or natural-languages queries into conjunctive SPARQL queries over a set of interlinked data sources. Sina uses a hidden Markov model to determine the most suitable resources for a user-supplied query from different datasets. Moreover, our framework is able to construct federated queries by using the disambiguated resources and leveraging the link structure underlying the datasets to query. We evaluate Sina over three different datasets. We can answer 25 queries from the QALD-1 correctly. Moreover, we perform as well as the best question answering system from the QALD-3 competition by answering 32 questions correctly while also being able to answer queries on distributed sources. We study the runtime of SINA in its mono-core and parallel implementations and draw preliminary conclusions on the scalability of keyword search on Linked Data.