Displaying 41 – 60 of 206

Showing per page

Receding-horizon control of constrained uncertain linear systems with disturbances

Luigi Chisci, Paola Falugi, Giovanni Zappa (2002)

Kybernetika

The paper addresses receding-horizon (predictive) control for polytopic discrete-time systems subject to input/state constraints and unknown but bounded disturbances. The objective is to optimize nominal performance while guaranteeing robust stability and constraint satisfaction. The latter goal is achieved by exploiting robust invariant sets under linear and nonlinear control laws. Tradeoffs between maximizing the initial feasibility region and guaranteeing ultimate boundedness in the smallest...

Reconfigurability analysis for reliable fault-tolerant control design

Ahmed Khelassi, Didier Theilliol, Philippe Weber (2011)

International Journal of Applied Mathematics and Computer Science

In this paper the integration of reliability evaluation in reconfigurability analysis of a fault-tolerant control system is considered. The aim of this work is to contribute to reliable fault-tolerant control design. The admissibility of control reconfigurability is analyzed with respect to reliability requirements. This analysis shows the relationship between reliability and control reconfigurability defined generally through Gramian controllability. An admissible solution for reconfigurability...

Reconfigurable control design with integration of a reference governor and reliability indicators

Philippe Weber, Boumedyen Boussaid, Ahmed Khelassi, Christophe Aubrun (2012)

International Journal of Applied Mathematics and Computer Science

A new approach to manage actuator redundancy in the presence of faults is proposed based on reliability indicators and a reference governor. The aim is to preserve the health of the actuators and the availability of the system both in the nominal behavior and in the presence of actuator faults. The use of reference governor control allocation is a solution to distribute the control efforts among a redundant set of actuators. In a degraded situation, a reconfigured control allocation strategy is...

Recursive identification algorithm for dynamic systems with output backlash and its convergence

Ruili Dong, Qingyuan Tan, Yonghong Tan (2009)

International Journal of Applied Mathematics and Computer Science

This paper proposes a recursive identification method for systems with output backlash that can be described by a pseudoWiener model. In this method, a novel description of the nonlinear part of the system, i.e., backlash, is developed. In this case, the nonlinear system is decomposed into a piecewise linearized model. Then, a modified recursive general identification algorithm (MRGIA) is employed to estimate the parameters of the proposed model. Furthermore, the convergence of the MRGIA for the...

Recursive identification of Wiener systems

Włodzimierz Greblicki (2001)

International Journal of Applied Mathematics and Computer Science

A Wiener system, i.e. a cascade system consisting of a linear dynamic subsystem and a nonlinear memoryless subsystem is identified. The a priori information is nonparametric, i.e. neither the functional form of the nonlinear characteristic nor the order of the dynamic part are known. Both the input signal and the disturbance are Gaussian white random processes. Recursive algorithms to estimate the nonlinear characteristic are proposed and their convergence is shown. Results of numerical simulation...

Recursive self-tuning control of finite Markov chains

Vivek Borkar (1997)

Applicationes Mathematicae

A recursive self-tuning control scheme for finite Markov chains is proposed wherein the unknown parameter is estimated by a stochastic approximation scheme for maximizing the log-likelihood function and the control is obtained via a relative value iteration algorithm. The analysis uses the asymptotic o.d.e.s associated with these.

Reduced order controllers for Burgers' equation with a nonlinear observer

Jeanne Atwell, Jeffrey Borggaard, Belinda King (2001)

International Journal of Applied Mathematics and Computer Science

A method for reducing controllers for systems described by partial differential equations (PDEs) is applied to Burgers' equation with periodic boundary conditions. This approach differs from the typical approach of reducing the model and then designing the controller, and has developed over the past several years into its current form. In earlier work it was shown that functional gains for the feedback control law served well as a dataset for reduced order basis generation via the proper orthogonal...

Reduced resistive MHD in Tokamaks with general density

Bruno Després, Rémy Sart (2012)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

The aim of this paper is to derive a general model for reduced viscous and resistive Magnetohydrodynamics (MHD) and to study its mathematical structure. The model is established for arbitrary density profiles in the poloidal section of the toroidal geometry of Tokamaks. The existence of global weak solutions, on the one hand, and the stability of the fundamental mode around initial data, on the other hand, are investigated.

Reduced resistive MHD in Tokamaks with general density

Bruno Després, Rémy Sart (2012)

ESAIM: Mathematical Modelling and Numerical Analysis

The aim of this paper is to derive a general model for reduced viscous and resistive Magnetohydrodynamics (MHD) and to study its mathematical structure. The model is established for arbitrary density profiles in the poloidal section of the toroidal geometry of Tokamaks. The existence of global weak solutions, on the one hand, and the stability of the fundamental mode around initial data, on the other hand, are investigated.

Reduced-order Unscented Kalman Filtering with application to parameter identification in large-dimensional systems

Philippe Moireau, Dominique Chapelle (2011)

ESAIM: Control, Optimisation and Calculus of Variations

We propose a general reduced-order filtering strategy adapted to Unscented Kalman Filtering for any choice of sampling points distribution. This provides tractable filtering algorithms which can be used with large-dimensional systems when the uncertainty space is of reduced size, and these algorithms only invoke the original dynamical and observation operators, namely, they do not require tangent operator computations, which of course is of considerable benefit when nonlinear operators are considered....

Reduced-order Unscented Kalman Filtering with application to parameter identification in large-dimensional systems

Philippe Moireau, Dominique Chapelle (2011)

ESAIM: Control, Optimisation and Calculus of Variations

We propose a general reduced-order filtering strategy adapted to Unscented Kalman Filtering for any choice of sampling points distribution. This provides tractable filtering algorithms which can be used with large-dimensional systems when the uncertainty space is of reduced size, and these algorithms only invoke the original dynamical and observation operators, namely, they do not require tangent operator computations, which of course is of considerable benefit when nonlinear operators are considered....

Reduction and transfer equivalence of nonlinear control systems: Unification and extension via pseudo-linear algebra

Ülle Kotta, Palle Kotta, Miroslav Halás (2010)

Kybernetika

The paper applies the pseudo-linear algebra to unify the results on reducibility, reduction and transfer equivalence for continuous- and discrete-time nonlinear control systems. The necessary and sufficient condition for reducibility of nonlinear input-output equation is presented in terms of the greatest common left factor of two polynomials describing the behaviour of the ‘tangent linearized system’ equation. The procedure is given to find the reduced (irreducible) system equation that is transfer...

Reduction of large circuit models via low rank approximate gramians

Jing-Rebecca Li, Jacob White (2001)

International Journal of Applied Mathematics and Computer Science

We describe a model reduction algorithm which is well-suited for the reduction of large linear interconnect models. It is an orthogonal projection method which takes as the projection space the sum of the approximate dominant controllable subspace and the approximate dominant observable subspace. These approximate dominant subspaces are obtained using the Cholesky Factor ADI (CF-ADI) algorithm. We describe an improvement upon the existing implementation of CF-ADI which can result in significant...

Redundancy relations for fault diagnosis in nonlinear uncertain systems

Alexey Shumsky (2007)

International Journal of Applied Mathematics and Computer Science

The problem of fault detection and isolation in nonlinear uncertain systems is studied within the scope of the analytical redundancy concept. The problem solution involves checking the redundancy relations existing among measured system inputs and outputs. A novel method is proposed for constructing redundancy relations based on system models described by differential equations whose right-hand sides are polynomials. The method involves a nonlinear transformation of the initial system model into...

Refinement of a fuzzy control rule set.

Antonio González, Raúl Pérez (1998)

Mathware and Soft Computing

Fuzzy logic controller performance depends on the fuzzy control rule set. This set can be obtained either by an expert or from a learning algorithm through a set of examples. Recently, we have developed SLAVE an inductive learning algorithm capable of identifying fuzzy systems. The refinement of the rules proposed by SLAVE (or by an expert) can be very important in order to improve the accuracy of the model and in order to simplify the description of the system. The refinement algorithm is based...

Refracted Lévy processes

A. E. Kyprianou, R. L. Loeffen (2010)

Annales de l'I.H.P. Probabilités et statistiques

Motivated by classical considerations from risk theory, we investigate boundary crossing problems for refracted Lévy processes. The latter is a Lévy process whose dynamics change by subtracting off a fixed linear drift (of suitable size) whenever the aggregate process is above a pre-specified level. More formally, whenever it exists, a refracted Lévy process is described by the unique strong solution to the stochastic differential equation dUt=−δ1{Ut>b} dt+dXt, where X={Xt : t≥0} is a Lévy...

Currently displaying 41 – 60 of 206