A novel optimal tracking control method for a class of discrete-time systems with actuator saturation and unknown dynamics is proposed in this paper. The scheme is based on the iterative adaptive dynamic programming (...
详细信息
A novel optimal tracking control method for a class of discrete-time systems with actuator saturation and unknown dynamics is proposed in this paper. The scheme is based on the iterative adaptive dynamic programming (ADP) algorithm. In order to implement the control scheme, a data-based identifier is first constructed for the unknown system dynamics. By introducing the M network, the explicit formula of the steady control is achieved. In order to eliminate the effect of the actuator saturation, a nonquadratic performance functional is presented, and then an iterative ADP algorithm is established to achieve the optimal tracking control solution with convergence analysis. For implementing the optimal control method, neural networks are used to establish the data-based identifier, compute the performance index functional, approximate the optimal control policy and solve the steady control, respectively. Simulation example is provided to verify the effectiveness of the presented optimal tracking control scheme.
Under the condition of uniaxial rotation test and using norm restriction of the angular rotation vector, a nonlinear equations set including 6 uncorrelated rotations is established to define the SIMU calibration frame...
详细信息
ISBN:
(纸本)9781479900305
Under the condition of uniaxial rotation test and using norm restriction of the angular rotation vector, a nonlinear equations set including 6 uncorrelated rotations is established to define the SIMU calibration frame. A test scheme of clockwise & counter clockwise rotations is adopted to eliminate the effect of earth rotation and gyro drift errors. Linearization and iterative algorithm are put forward to resolve the nonlinear equations set with very high precision. In accelerometer calibration model, the two-order nonlinear coefficient and cross-coupling coefficient are both considered. The static multi-position method is used to calibrate accelerometers, but in each static position, it is necessary to conduct an extra vertical rotation test to determine gravitation vector in SIMU frame and the result can be used as accelerometer input reference. A static nine-position accelerometer calibration scheme is presented and the simulation results show that scale factor matrix and bias can be estimated with high accuracy, but the two-order nonlinear coefficient and cross-coupling coefficient are relatively affected by accelerometer measurement noise.
Interference alignment(IA) is a powerful scheme that has emerged out of recent work in the context of the MIMO X *** of the existing IA schemes are aimed to optimize the sum-capacity,the error probability,and the mean...
详细信息
ISBN:
(纸本)9781467360760
Interference alignment(IA) is a powerful scheme that has emerged out of recent work in the context of the MIMO X *** of the existing IA schemes are aimed to optimize the sum-capacity,the error probability,and the mean square errors(MSE) of the system,and less consider the system power *** paper proposes a new IA scheme to minimize the system transmit power under the condition of every user's MSE constraint through a joint design of linear transmitter and receiver for a K-user MIMO interference *** order to solve our optimization problem,we employ the Lagrange function and Karush-Kuhn-Tucker(KKT) conditions,then get the transmitter precoding and receiving filter matrices expressions by the analysis and ***,we use a joint iterative algorithm to solve the proposed optimization *** results verify that the provided scheme improves the power efficiency.
This paper proposes a finite difference scheme for variable-order nonlinear fractional diffusion equation, in which the nonlinear source term is considered implicit. A linear iterative algorithm for nonlinear scheme i...
详细信息
This paper proposes a finite difference scheme for variable-order nonlinear fractional diffusion equation, in which the nonlinear source term is considered implicit. A linear iterative algorithm for nonlinear scheme is introduced. The stability and convergence of the method are proved by discrete energy method. The convergence order of the method is O ( h). Some examples demonstrate that the method is efficient and reliable.
A new iterative algorithm for discrete HJB equations is proposed. Monotone convergence has been proved for the *** example shows the efficiency of the algorithm.
A new iterative algorithm for discrete HJB equations is proposed. Monotone convergence has been proved for the *** example shows the efficiency of the algorithm.
In the present paper, we introduce the concept of eta-relaxed strong convexity of a differentiable functional and extend Ding and Yao's auxiliary variational inequality technique [X.P. Ding, J.C. Yao, Existence an...
详细信息
In the present paper, we introduce the concept of eta-relaxed strong convexity of a differentiable functional and extend Ding and Yao's auxiliary variational inequality technique [X.P. Ding, J.C. Yao, Existence and algorithm of solutions for mixed quasi-variational-like inclusions in Banach spaces, Computers and Mathematics with Applications, 49 (2005), 857-869] to develop iterative algorithms for finding the approximate solutions to the mixed quasi-variational-like inclusion problem (in short, MQVLIP) in a Banach space. On the one hand, we establish a result on the existence of a solution to the equilibrium problem by virtue of well-known Brouwer's fixed-point theorem. Moreover, by using this result we derive the existence and uniqueness of a solution to the MQVLIP and the existence of the approximate solutions generated by the algorithm for the MQVLIP. On the other hand, we use the concepts of eta-relaxed strong convexity of a differentiable functional and eta-cocoercivity of a composite map to prove the strong convergence of the approximate solutions to the unique solution of the MQVLIP. (C) 2008 Elsevier Ltd. All rights reserved.
An n x n real matrix P is said to be a generalized reflection matrix if P-T = P and P-2 = I (where P-T is the transpose of P). A matrix A is an element of R-nxn is said to be a reflexive (anti-reflexive) matrix with r...
详细信息
An n x n real matrix P is said to be a generalized reflection matrix if P-T = P and P-2 = I (where P-T is the transpose of P). A matrix A is an element of R-nxn is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix P if A = PAP (A = -PAP). The reflexive and anti-reflexive matrices have wide applications in many fields. In this article, two iterative algorithms are proposed to solve the coupled matrix equations {A(1)XB(1) + (C1XD1)-D-T = M-1, A(2)XB(2) + (C2XD2)-D-T = M-2, over reflexive and anti-reflexive matrices, respectively. We prove that the first (second) algorithm converges to the reflexive (anti-reflexive) solution of the coupled matrix equations for any initial reflexive (anti-reflexive) matrix. Finally two numerical examples are used to illustrate the efficiency of the proposed algorithms.
A numerical method is proposed to simulate the transverse vibrations of a viscoelastic moving string constituted by an integral law. In the numerical computation, the Galerkin method based on the Hermite functions is ...
详细信息
A numerical method is proposed to simulate the transverse vibrations of a viscoelastic moving string constituted by an integral law. In the numerical computation, the Galerkin method based on the Hermite functions is applied to discretize the state variables, and the Runge- Kutta method is applied to solve the resulting differential-integral equation system. A linear iterative process is designed to compute the integral terms at each time step, which makes the numerical method more efficient and accurate. As examples, nonlinear parametric vibrations of an axially moving viscoelastic string are analyzed.
The problem we will consider in this paper is binary image restoration. It is, in essence, difficult to solve because of the combinatorial nature of the problem. To overcome this difficulty, we propose a new minimizat...
详细信息
The problem we will consider in this paper is binary image restoration. It is, in essence, difficult to solve because of the combinatorial nature of the problem. To overcome this difficulty, we propose a new minimization model by making use of a new variable to enforce the image to be binary. Based on the proposed minimization model, we present a fast alternating minimization algorithm for binary image restoration. We prove the convergence of the proposed alternating minimization algorithm. Experimental results show that the proposed method is feasible and effective for binary image restoration.
This study addresses the strong stabilisation problem for continuous-time linear systems with an unknown input delay via dynamic output feedback controllers. A new criterion for dynamic output feedback stabilisability...
详细信息
This study addresses the strong stabilisation problem for continuous-time linear systems with an unknown input delay via dynamic output feedback controllers. A new criterion for dynamic output feedback stabilisability is proposed in terms of matrix inequalities with the separation of the controller gain with the Lyapunov matrix and the system matrices. Based on these new characterisations, an iterative algorithm is given to design the dynamic output feedback controllers with the initial values obtained by some proposed state feedback stabilisation methods. The effectiveness and merits of the proposed approach are shown through several examples.
暂无评论