This paper is concerned with a new discrete-time policy iteration adaptive dynamic programming (ADP) method for solving the infinite horizon optimal control problem of nonlinear systems. The idea is to use an iterativ...
详细信息
This paper is concerned with a new discrete-time policy iteration adaptive dynamic programming (ADP) method for solving the infinite horizon optimal control problem of nonlinear systems. The idea is to use an iterative ADP technique to obtain the iterative control law, which optimizes the iterative performance index function. The main contribution of this paper is to analyze the convergence and stability properties of policy iteration method for discrete-time nonlinear systems for the first time. It shows that the iterative performance index function is nonincreasingly convergent to the optimal solution of the Hamilton-Jacobi-Bellman equation. It is also proven that any of the iterative control laws can stabilize the nonlinear systems. Neural networks are used to approximate the performance index function and compute the optimal control law, respectively, for facilitating the implementation of the iterative ADP algorithm, where the convergence of the weight matrices is analyzed. Finally, the numerical results and analysis are presented to illustrate the performance of the developed method.
In this paper, a direct adaptive state-feedback control approach is developed for a class of nonlinear systems in discrete-time (DT) domain. We study MIMO unknown nonaffine nonlinear DT systems and employ a two-layer ...
详细信息
In this paper, a direct adaptive state-feedback control approach is developed for a class of nonlinear systems in discrete-time (DT) domain. We study MIMO unknown nonaffine nonlinear DT systems and employ a two-layer NN to design the controller. By using the presented method, the NN approximation is able to cancel the nonlinearity of the unknown DT plant. Meanwhile, pretraining is not required, and the weights of NNs used in adaptive control are directly updated online. Moreover, unlike standard NN adaptive controllers yielding uniform ultimate boundedness results, the tracking error is guaranteed to be uniformly asymptotically stable by utilizing Lyapunov's direct method. Two illustrative examples are provided to demonstrate the effectiveness and the applicability of the theoretical results. Copyright (c) 2014 John Wiley & Sons, Ltd.
In this paper, the robust decentralized stabilization of continuous-time uncertain nonlinear systems with multi control stations is developed using a neural network based online optimal control approach. The novelty l...
详细信息
In this paper, the robust decentralized stabilization of continuous-time uncertain nonlinear systems with multi control stations is developed using a neural network based online optimal control approach. The novelty lies in that the well-known adaptive dynamic programming method is extended to deal with the nonlinear feedback control problem under uncertain and large-scale environment. Through introducing an appropriate bounded function and defining a modified cost function, it can be observed that the decentralized optimal controller of the nominal system can achieve robust decentralized stabilization of original uncertain system. Then, a critic neural network is constructed for solving the modified Hamilton-Jacobi-Bellman equation corresponding to the nominal system in an online fashion. The weights of the critic network are tuned based on the standard steepest descent algorithm with an additional term provided to guarantee the boundedness of system states. The stability analysis of the closed-loop system is carried out via the Lyapunov approach. At last, two simulation examples are given to verify the effectiveness of the present control approach.
This paper is concerned with a new iterative theta-adaptive dynamic programming (ADP) technique to solve optimal control problems of infinite horizon discrete-time nonlinear systems. The idea is to use an iterative AD...
详细信息
This paper is concerned with a new iterative theta-adaptive dynamic programming (ADP) technique to solve optimal control problems of infinite horizon discrete-time nonlinear systems. The idea is to use an iterative ADP algorithm to obtain the iterative control law which optimizes the iterative performance index function. In the present iterative theta-ADP algorithm, the condition of initial admissible control in policy iteration algorithm is avoided. It is proved that all the iterative controls obtained in the iterative theta-ADP algorithm can stabilize the nonlinear system which means that the iterative theta-ADP algorithm is feasible for implementations both online and offline. Convergence analysis of the performance index function is presented to guarantee that the iterative performance index function will converge to the optimum monotonically. Neural networks are used to approximate the performance index function and compute the optimal control policy, respectively, for facilitating the implementation of the iterative theta-ADP algorithm. Finally, two simulation examples are given to illustrate the performance of the established method.
state recognition in disconnecting switches is important during substation automation. Here, an effective computer vision-based automatic detection and state recognition method for disconnecting switches is proposed. ...
详细信息
state recognition in disconnecting switches is important during substation automation. Here, an effective computer vision-based automatic detection and state recognition method for disconnecting switches is proposed. Taking advantage of some important prior knowledge about a disconnecting switch, the method is designed using two important features of the fixed-contact facet of such disconnecting switches. First, the Histograms of Oriented Gradients (HOG) of the fixed-contact are used to design a Linear Discriminant Analysis (LDA) target detector to position the disconnecting switches and distinguish their loci against a usual cluttered background. Then a discriminative Norm Gradient Field (NGF) feature is used to train the Support Vector Machine (SVM) state classifier to discriminate disconnecting switch states. Finally, experimental results, compared with other methods, demonstrate that the proposed method is effective and achieves a low miss rate while delivering high performance in both precision and recall rate. In addition, the adopted approach is efficient and has the potential to work in practical substation automation scenarios.
Detecting and recognizing text in natural images are quite challenging and have received much attention from the computer vision community in recent years. In this paper, we propose a robust end-to-end scene text reco...
详细信息
Detecting and recognizing text in natural images are quite challenging and have received much attention from the computer vision community in recent years. In this paper, we propose a robust end-to-end scene text recognition method, which utilizes tree-structured character models and normalized pictorial structured word models. For each category of characters, we build a part-based tree-structured model (TSM) so as to make use of the character-specific structure information as well as the local appearance information. The TSM could detect each part of the character and recognize the unique structure as well, seamlessly combining character detection and recognition together. As the TSMs could accurately detect characters from complex background, for text localization, we apply TSMs for all the characters on the coarse text detection regions to eliminate the false positives and search the possible missing characters as well. While for word recognition, we propose a normalized pictorial structure (PS) framework to deal with the bias caused by words of different lengths. Experimental results on a range of challenging public datasets (ICDAR 2003, ICDAR 2011, SVT) demonstrate that the proposed method outperforms state-of-the-art methods both for text localization and word recognition. (C) 2014 Elsevier Ltd. All rights reserved.
In this paper, an adaptive reinforcement learning-based solution is developed for the infinite-horizon optimal control problem of constrained-input continuous-time nonlinear systems in the presence of nonlinearities w...
详细信息
In this paper, an adaptive reinforcement learning-based solution is developed for the infinite-horizon optimal control problem of constrained-input continuous-time nonlinear systems in the presence of nonlinearities with unknown structures. Two different types of neural networks (NNs) are employed to approximate the Hamilton-Jacobi-Bellman equation. That is, an recurrent NN is constructed to identify the unknown dynamical system, and two feedforward NNs are used as the actor and the critic to approximate the optimal control and the optimal cost, respectively. Based on this framework, the action NN and the critic NN are tuned simultaneously, without the requirement for the knowledge of system drift dynamics. Moreover, by using Lyapunov's direct method, the weights of the action NN and the critic NN are guaranteed to be uniformly ultimately bounded, while keeping the closed-loop system stable. To demonstrate the effectiveness of the present approach, simulation results are illustrated.
Structured light plays an important role in visual sensing system of various applications. At present, many types of structured light are available throughout the market. Among different types of structured light, cro...
详细信息
Structured light plays an important role in visual sensing system of various applications. At present, many types of structured light are available throughout the market. Among different types of structured light, cross-line structured light (CLSL) has been also employed in some visual sensing systems. However, it seems that the existing calibration methods are not practical and simple for users. In this paper, a calibration technique is proposed as an alternative for those who are seeking for a practical and simple calibration. A regular chessboard is modified in order to have intersections between light stripes and additional lines. Two views of the CLSL captured during camera calibration process give sufficient information for estimating the parameters of light planes. Simple image processing techniques are applied to the images yielding 3D coordinates of points on the light planes. Based on three non-collinear 3D points, the parameters of the light planes are computed. The experimental results prove that the accuracy of the calibration is acceptable and suitable for moderate precise measurement systems. (C) 2016 Elsevier GmbH. All rights reserved.
In this study, we use generalized policy iteration approximate dynamic programming (ADP) algorithm to design an optimal controller for a class of discrete-time systems with actuator saturation. A integral function is ...
详细信息
In this study, we use generalized policy iteration approximate dynamic programming (ADP) algorithm to design an optimal controller for a class of discrete-time systems with actuator saturation. A integral function is proposed to manage the saturation nonlinearity in actuators and then the generalized policy iteration ADP algorithm is developed to deal with the optimal control problem. Compared with other algorithm, the developed ADP algorithm includes 2 iteration procedures. In the present control scheme, 2 neural networks are introduced to approximate the control law and performance index function. Furthermore, numerical simulations illustrate the convergence and feasibility of the developed method.
Feature is a crucial element of polarimetric synthetic aperture radar (PolSAR) image classification. Multiple types of Features, such as polarimetric features (PF) generated from the PolSAR data and various polarimetr...
详细信息
Feature is a crucial element of polarimetric synthetic aperture radar (PolSAR) image classification. Multiple types of Features, such as polarimetric features (PF) generated from the PolSAR data and various polarimetric target decompositions, texture features (TF) of the Pauli color-coded PolSAR images are used as features for PolSAR image classification. The obtained PF and TF often form the high-dimensional data, which leads to high computational complexity. Moreover, some features are irrelative and do nothing to improve the classification performance. Therefore, it is fairly indispensable to select a subset of useful features for PolSAR image classification. This paper proposes a multi-view feature selection method for PolSAR image classification. Firstly, two types of features, PF and TF are generated separately. Then the optimization model is built to pursue the feature selection matrices. Specifically, in order to maintain the consistency of different types of features, we search for the common representation of multiple types of features in the optimization problem. The l(2,1) norm sparsity regularization is imposed on the feature selection matrices to achieve feature selection. In addition, the manifold regularization on the common representation is utilized to preserve the structure information of the data. The effectiveness of the proposed method is evaluated on three real PolSAR data sets. Experimental results demonstrate the superiority of the proposed method.
暂无评论