Search

Recently, with the development of the marine economy, marine risers have garnered increasing attention as they present facile and reliable methods for oil and gas transportation. However, these risers are susceptible to vibrations, which can lead to system performance degradation and fatigue damage. Therefore, effective vibration control strategies are required to address this issue. In this study, a novel adaptive fault-tolerant control (FTC) strategy is adopted to suppress the vibrations of a 3-D riser-vessel system against the effects of actuator failures, backlash-like hysteresis, and external disturbances. A barrier-based Lyapunov function is merged to eliminate the time-varying output constraints of the system. Adaptive FTC laws with projection mapping operators are designed to compensate for parameter uncertainties and consider input nonlinearities to improve system robustness. Finally, a rigorous Lyapunov analysis and numerical simulations are performed to verify the validity of the proposed controller and guarantee uniformly bounded stability of the system.

Fault detection for distributed parameter processes (heat processes, fluid processes, etc.) is vital for safe and efficient operation. On one hand, the existing data-driven methods neglect the evolution dynamics of the processes and cannot guarantee that they work for highly dynamic or transient processes; on the other hand, model-based methods reported so far are mostly based on the backstepping technique, which does not possess enough redundancy for fault detection since only the boundary measurement is considered. Motivated by these considerations, we intend to investigate the robust fault detection problem for distributed parameter processes in a model-based perspective covering both boundary and in-domain measurement cases. A real-time fault detection filter (FDF) is presented, which gets rid of a large amount of data collection and offline training procedures. Rigorous theoretic analysis is presented for guiding the parameters selection and threshold computation. A time-varying threshold is designed such that the false alarm in the transient stage can be avoided. Successful application results on a hot strip mill cooling system demonstrate the potential for real industrial applications.

This article considers the synchronization problem of delayed reaction-diffusion neural networks via quantized sampled-data (SD) control under spatially point measurements (SPMs), where distributed and discrete delays are considered. The synchronization scheme, which takes into account the communication limitations of quantization and variable sampling, is based on SPMs and only available in a finite number of fixed spatial points. By utilizing inequality techniques and Lyapunov-Krasovskii functional, some synchronization criteria via a quantized SD controller under SPMs are established and presented by linear matrix inequalities, which can ensure the exponential stability of the synchronization error system containing the drive and response dynamics. Finally, two numerical examples are offered to support the proposed quantized SD synchronization method.

This paper introduces a fuzzy control (FC) under spatially local averaged measurements (SLAMs) for nonlinear-delayed distributed parameter systems (DDPSs) represented by parabolic partial differential-difference equations (PDdEs), where the fast-varying time delay and slow-varying one are considered. A Takagi-Sugeno (T-S) fuzzy PDdE model is first derived to exactly describe the nonlinear DDPSs. Then, by virtue of the T-S fuzzy PDdE model and a Lyapunov-Krasovskii functional, an FC design under SLAMs, where the membership functions of the proposed FC law are determined by the measurement output and independent of the fuzzy PDdE plant model, is developed on basis of spatial linear matrix inequalities (SLMIs) to guarantee the exponential stability for the resulting closed-loop DDPSs. Lastly, a numerical example is offered to support the presented approach.

We propose, in this paper, a framework for time series and nonlinear system modeling, called the basis function matrix-based flexible coefficient autoregressive (BFM-FCAR) model. It has very flexible nonlinear structure. We show that many famous nonlinear time series models can be derived under this framework by choosing the proper basis function matrices. Some probabilistic properties (the conditions of geometrical ergodicity) of the BFM-FCAR model are investigated. Taking advantage of the model structure, we present an efficient parameter estimation algorithm for the proposed framework by using the variable projection method. Finally, we show how new models are generated from the proposed framework.

A reinforcement learning-based method is proposed for optimal sensor placement in the spatial domain for modeling distributed parameter systems (DPSs). First, a low-dimensional subspace, derived by Karhunen-Loève decomposition, is identified to capture the dominant dynamic features of the DPS. Second, a spatial objective function is proposed for the sensor placement. This function is defined in the obtained low-dimensional subspace by exploiting the time-space separation property of distributed processes, and in turn aims at minimizing the modeling error over the entire time and space domain. Third, the sensor placement configuration is mathematically formulated as a Markov decision process (MDP) with specified elements. Finally, the sensor locations are optimized through learning the optimal policies of the MDP according to the spatial objective function. The experimental results of a simulated catalytic rod and a real snap curing oven system are provided to demonstrate the feasibility and efficiency of the proposed method in solving the combinatorial optimization problems, such as optimal sensor placement.

The extreme learning machine (ELM) has been extensively studied in the machine learning field and has been widely implemented due to its simplified algorithm and reduced computational costs. However, it is less effective for modeling data with non-Gaussian noise or data containing outliers. Here, a probabilistic regularized ELM is proposed to improve modeling performance with data containing non-Gaussian noise and/or outliers. While traditional ELM minimizes modeling error by using a worst-case scenario principle, the proposed method constructs a new objective function to minimize both mean and variance of this modeling error. Thus, the proposed method considers the modeling error distribution. A solution method is then developed for this new objective function and the proposed method is further proved to be more robust when compared with traditional ELM, even when subject to noise or outliers. Several experimental cases demonstrate that the proposed method has better modeling performance for problems with non-Gaussian noise or outliers.

In this paper, a sampled-data fuzzy control problem is addressed for a class of nonlinear coupled systems, which are described by a parabolic partial differential equation (PDE) and an ordinary differential equation (ODE). Initially, the nonlinear coupled system is accurately represented by the Takagi-Sugeno (T-S) fuzzy coupled parabolic PDE-ODE model. Then, based on the T-S fuzzy model, a novel time-dependent Lyapunov functional is used to design a sampled-data fuzzy controller such that the closed-loop coupled system is exponentially stable, where the sampled-data fuzzy controller consists of the ODE state feedback and the PDE static output feedback under spatially averaged measurements. The stabilization condition is presented in terms of a set of linear matrix inequalities. Finally, simulation results on the control of a hypersonic rocket car are given to illustrate the effectiveness of the proposed design method.

When solving constrained optimization problems by evolutionary algorithms, an important issue is how to balance constraints and objective function. This paper presents a new method to address the above issue. In our method, after generating an offspring for each parent in the population by making use of differential evolution (DE), the well-known feasibility rule is used to compare the offspring and its parent. Since the feasibility rule prefers constraints to objective function, the objective function information has been exploited as follows: if the offspring cannot survive into the next generation and if the objective function value of the offspring is better than that of the parent, then the offspring is stored into a predefined archive. Subsequently, the individuals in the archive are used to replace some individuals in the population according to a replacement mechanism. Moreover, a mutation strategy is proposed to help the population jump out of a local optimum in the infeasible region. Note that, in the replacement mechanism and the mutation strategy, the comparison of individuals is based on objective function. In addition, the information of objective function has also been utilized to generate offspring in DE. By the above processes, this paper achieves an effective balance between constraints and objective function in constrained evolutionary optimization. The performance of our method has been tested on two sets of benchmark test functions, namely, 24 test functions at IEEE CEC2006 and 18 test functions with 10-D and 30-D at IEEE CEC2010. The experimental results have demonstrated that our method shows better or at least competitive performance against other state-of-the-art methods. Furthermore, the advantage of our method increases with the increase of the number of decision variables.

In the field of evolutionary computation, there has been a growing interest in applying evolutionary algorithms to solve multimodal optimization problems (MMOPs). Due to the fact that an MMOP involves multiple optimal solutions, many niching methods have been suggested and incorporated into evolutionary algorithms for locating such optimal solutions in a single run. In this paper, we propose a novel transformation technique based on multiobjective optimization for MMOPs, called MOMMOP. MOMMOP transforms an MMOP into a multiobjective optimization problem with two conflicting objectives. After the above transformation, all the optimal solutions of an MMOP become the Pareto optimal solutions of the transformed problem. Thus, multiobjective evolutionary algorithms can be readily applied to find a set of representative Pareto optimal solutions of the transformed problem, and as a result, multiple optimal solutions of the original MMOP could also be simultaneously located in a single run. In principle, MOMMOP is an implicit niching method. In this paper, we also discuss two issues in MOMMOP and introduce two new comparison criteria. MOMMOP has been used to solve 20 multimodal benchmark test functions, after combining with nondominated sorting and differential evolution. Systematic experiments have indicated that MOMMOP outperforms a number of methods for multimodal optimization, including four recent methods at the 2013 IEEE Congress on Evolutionary Computation, four state-of-the-art single-objective optimization based methods, and two well-known multiobjective optimization based approaches.

The radial basis function network-based autoregressive with exogenous inputs (RBF-ARX) models have much more linear parameters than nonlinear parameters. Taking advantage of this special structure, a variable projection algorithm is proposed to estimate the model parameters more efficiently by eliminating the linear parameters through the orthogonal projection. The proposed method not only substantially reduces the dimension of parameter space of RBF-ARX model but also results in a better-conditioned problem. In this paper, both the full Jacobian matrix of Golub and Pereyra and the Kaufman's simplification are used to test the performance of the algorithm. An example of chaotic time series modeling is presented for the numerical comparison. It clearly demonstrates that the proposed approach is computationally more efficient than the previous structured nonlinear parameter optimization method and the conventional Levenberg-Marquardt algorithm without the parameters separated. Finally, the proposed method is also applied to a simulated nonlinear single-input single-output process, a time-varying nonlinear process and a real multiinput multioutput nonlinear industrial process to illustrate its usefulness.

We consider in this paper a class of nonlinear least squares problems in which the model can be represented as a linear combination of nonlinear functions. The variable projection algorithm projects the linear parameters out of the problem, leaving the nonlinear least squares problems involving only the nonlinear parameters. To implement the variable projection algorithm more efficiently, we propose a new variable projection functional based on matrix decomposition. The advantage of the proposed formulation is that the size of the decomposed matrix may be much smaller than those of previous ones. The Levenberg-Marquardt algorithm using finite difference method is then applied to minimize the new criterion. Numerical results show that the proposed approach achieves significant reduction in computing time.

In this paper, an adaptive neural network (NN) control with a guaranteed L(infinity)-gain performance is proposed for a class of parabolic partial differential equation (PDE) systems with unknown nonlinearities and persistent bounded disturbances. Initially, Galerkin method is applied to the PDE system to derive a low-order ordinary differential equation (ODE) system that accurately describes the dynamics of the dominant (slow) modes of the PDE system. Subsequently, based on the low-order slow model and the Lyapunov technique, an adaptive modal feedback controller is developed such that the closed-loop slow system is semiglobally input-to-state practically stable (ISpS) with an L(infinity)-gain performance. In the proposed control scheme, a radial basis function (RBF) NN is employed to approximate the unknown term in the derivative of the Lyapunov function due to the unknown system nonlinearities. The outcome of the adaptive L(infinity)-gain control problem is formulated as a linear matrix inequality (LMI) problem. Moreover, by using the existing LMI optimization technique, a suboptimal controller is obtained in the sense of minimizing an upper bound of the L(infinity)-gain, while control constraints are respected. Furthermore, it is shown that the proposed controller can ensure the semiglobal input-to-state practical stability and L(infinity)-gain performance of the closed-loop PDE system. Finally, by applying the developed design method to the temperature profile control of a catalytic rod, the achieved simulation results show the effectiveness of the proposed controller.

A new feedback-linearization-based neural network (NN) adaptive control is proposed for unknown nonaffine nonlinear discrete-time systems. An equivalent model in affine-like form is first derived for the original nonaffine discrete-time systems as feedback linearization methods cannot be implemented for such systems. Then, feedback linearization adaptive control is implemented based on the affine-like equivalent model identified with neural networks. Pretraining is not required and the weights of the neural networks used in adaptive control are directly updated online based on the input-output measurement. The dead-zone technique is used to remove the requirement of persistence excitation during the adaptation. With the proposed neural network adaptive control, stability and performance of the closed-loop system are rigorously established. Illustrated examples are provided to validate the theoretical findings.

This paper presents a Galerkin/neural-network- based guaranteed cost control (GCC) design for a class of parabolic partial differential equation (PDE) systems with unknown nonlinearities. A parabolic PDE system typically involves a spatial differential operator with eigenspectrum that can be partitioned into a finite-dimensional slow one and an infinite-dimensional stable fast complement. Motivated by this, in the proposed control scheme, Galerkin method is initially applied to the PDE system to derive an ordinary differential equation (ODE) system with unknown nonlinearities, which accurately describes the dynamics of the dominant (slow) modes of the PDE system. The resulting nonlinear ODE system is subsequently parameterized by a multilayer neural network (MNN) with one-hidden layer and zero bias terms. Then, based on the neural model and a Lure-type Lyapunov function, a linear modal feedback controller is developed to stabilize the closed-loop PDE system and provide an upper bound for the quadratic cost function associated with the finite-dimensional slow system for all admissible approximation errors of the network. The outcome of the GCC problem is formulated as a linear matrix inequality (LMI) problem. Moreover, by using the existing LMI optimization technique, a suboptimal guaranteed cost controller in the sense of minimizing the cost bound is obtained. Finally, the proposed design method is applied to the control of the temperature profile of a catalytic rod.

An approximate internal model-based neural control (AIMNC) strategy is proposed for unknown nonaffine nonlinear discrete processes under disturbed environment. The proposed control strategy has some clear advantages in respect to existing neural internal model control methods. It can be used for open-loop unstable nonlinear processes or a class of systems with unstable zero dynamics. Based on a novel input-output approximation, the proposed neural control law can be derived directly and implemented straightforward for an unknown process. Only one neural network needs to be trained and control algorithm can be directly obtained from model identification without further training. The stability and robustness of a closed-loop system can be derived analytically. Extensive simulations demonstrate the superior performance of the proposed AIMNC strategy.