In this study, a novel numerical adaptive learning control scheme based on adaptive dynamic programming (ADP) algorithm is developed to solve numerical optimal control problems for infinite horizon discrete-time non-l...
详细信息
In this study, a novel numerical adaptive learning control scheme based on adaptive dynamic programming (ADP) algorithm is developed to solve numerical optimal control problems for infinite horizon discrete-time non-linear systems. Using the numerical controller, the domain of definition is constrained to a discrete set that makes the approximation errors always exist between the numerical controls and the accurate ones. Convergence analysis of the numerical iterative ADP algorithm is developed to show that the numerical iterative controls can make the iterative performance index functions converge to the greatest lower bound of all performance indices within a finite error bound under some mild assumptions. The stability properties of the system under the numerical iterative controls are proved, which allow the present iterative ADP algorithm to be implemented both on-line and off-line. Finally, two simulation examples are given to illustrate the performance of the present method.
In this paper, a self-learning control scheme is proposed for the infinite horizon optimal control of affine nonlinear systems based on the action dependent heuristic dynamic programming algorithm. The policy iteratio...
详细信息
In this paper, a self-learning control scheme is proposed for the infinite horizon optimal control of affine nonlinear systems based on the action dependent heuristic dynamic programming algorithm. The policy iteration technique is introduced to derive the optimal control policy with feasibility and convergence analysis. It shows that the "greedy" control action for each state is uniquely existent, the learned control policy after each policy iteration is admissible, and the optimal control policy is able to be obtained. Two three-layer perceptron neural networks are employed to implement the scheme. The critic network is trained by a novel rule to conform to the Bellman equation, and the action network is trained to yield a better control policy. Both training processes alternate until the optimal control policy is achieved. Two simulation examples are provided to validate the effectiveness of the approach.
This paper addresses the novel design of an underwater manipulator with a lightweight multilink structure and its free-floating autonomous operation. The concept design reduces the coupling between the manipulator and...
详细信息
This paper addresses the novel design of an underwater manipulator with a lightweight multilink structure and its free-floating autonomous operation. The concept design reduces the coupling between the manipulator and the vehicle efficiently, even in the case where the vehicle weight in air is not significantly greater than the manipulator weight. The specific implementation of the mechanical structure is elaborated. Moreover, a closed-loop control system based on binocular vision is proposed for underwater manipulation. In the end, experimental results demonstrate that the conceived underwater manipulator can accomplish the autonomous operation quickly.
In this study, an online adaptive optimal control scheme is developed for solving the infinite-horizon optimal control problem of uncertain non-linear continuous-time systems with the control policy having saturation ...
详细信息
In this study, an online adaptive optimal control scheme is developed for solving the infinite-horizon optimal control problem of uncertain non-linear continuous-time systems with the control policy having saturation constraints. A novel identifier-critic architecture is presented to approximate the Hamilton-Jacobi-Bellman equation using two neural networks (NNs): an identifier NN is used to estimate the uncertain system dynamics and a critic NN is utilised to derive the optimal control instead of typical action-critic dual networks employed in reinforcement learning. Based on the developed architecture, the identifier NN and the critic NN are tuned simultaneously. Meanwhile, unlike initial stabilising control indispensable in policy iteration, there is no special requirement imposed on the initial control. Moreover, by using Lyapunov's direct method, the weights of the identifier NN and the critic NN are guaranteed to be uniformly ultimately bounded, while keeping the closed-loop system stable. Finally, an example is provided to demonstrate the effectiveness of the present approach.
The movement of pedestrians involves temporal continuity,spatial interactivity,and random *** a result,pedestrian trajectory prediction is rather *** existing trajectory prediction methods tend to focus on just one as...
详细信息
The movement of pedestrians involves temporal continuity,spatial interactivity,and random *** a result,pedestrian trajectory prediction is rather *** existing trajectory prediction methods tend to focus on just one aspect of these challenges,ignoring the temporal information of the trajectory and making too many *** this paper,we propose a recurrent attention and interaction(RAI)model to predict pedestrian *** RAI model consists of a temporal attention module,spatial pooling module,and randomness modeling *** temporal attention module is proposed to assign different weights to the input sequence of a target,and reduce the speed deviation of different *** spatial pooling module is proposed to model not only the social information of neighbors in historical frames,but also the intention of neighbors in the current *** randomness modeling module is proposed to model the uncertainty and diversity of trajectories by introducing random *** conduct extensive experiments on several public *** results demonstrate that our method outperforms many that are state-ofthe-art.
This paper is concerned with a novel generalized policy iteration algorithm for solving optimal control problems for discrete-time nonlinear systems. The idea is to use an iterative adaptive dynamic programming algori...
详细信息
This paper is concerned with a novel generalized policy iteration algorithm for solving optimal control problems for discrete-time nonlinear systems. The idea is to use an iterative adaptive dynamic programming algorithm to obtain iterative control laws which make the iterative value functions converge to the optimum. Initialized by an admissible control law, it is shown that the iterative value functions are monotonically nonincreasing and converge to the optimal solution of Hamilton-Jacobi-Bellman equation, under the assumption that a perfect function approximation is employed. The admissibility property is analyzed, which shows that any of the iterative control laws can stabilize the nonlinear system. Neural networks are utilized to implement the generalized policy iteration algorithm, by approximating the iterative value function and computing the iterative control law, respectively, to achieve approximate optimal control. Finally, numerical examples are presented to verify the effectiveness of the present generalized policy iteration algorithm.
We propose a dictionary-based dense light field acquisition technique. This technique captures light field successfully from a sparse camera array with no mask or any other optical modifications on cameras. Light rays...
详细信息
We propose a dictionary-based dense light field acquisition technique. This technique captures light field successfully from a sparse camera array with no mask or any other optical modifications on cameras. Light rays in wider field are captured by our system to achieve larger disparity and higher angular resolution. We also accelerate the reconstruction of light field significantly by a local sliding window which applies median filter only in disaster areas and acquire satisfactory quality. In our experiments, light field with 7x7 views at resolution of 384x512 is restored from 5 cameras with PSNR of 33.0192dB with a computing time of 1.85 hours on a consumer-grade desktop computer. (C) 2014 Optical Society of America
Scene text detection could be formulated as a bi-label (text and non-text regions) segmentation problem. However, due to the high degree of intraclass variation of scene characters as well as the limited number of tra...
详细信息
Scene text detection could be formulated as a bi-label (text and non-text regions) segmentation problem. However, due to the high degree of intraclass variation of scene characters as well as the limited number of training samples, single information source or classifier is not enough to segment text from non-text background. Thus, in this paper, we propose a novel scene text detection approach using graph model built upon Maximally Stable Extremal Regions (MSERs) to incorporate various information sources into one framework. Concretely, after detecting MSERs in the original image, an irregular graph whose nodes are MSERs, is constructed to label MSERs as text regions or non-text ones. Carefully designed features contribute to the unary potential to assess the individual penalties for labeling a MSER node as text or non-text, and color and geometric features are used to define the pairwise potential to punish the likely discontinuities. By minimizing the cost function via graph cut algorithm, different information carried by the cost function could be optimally balanced to get the final MSERs labeling result. The proposed method is naturally context-relevant and scale-insensitive. Experimental results on the ICDAR 2011 competition dataset show that the proposed approach outperforms state-of-the-art methods both in recall and precision. (C) 2012 Elsevier B.V. All rights reserved.
In this paper, a finite horizon iterative adaptive dynamic programming (ADP) algorithm is proposed to solve the optimal control problem for a class of discrete-time nonlinear systems with unfixed initial state. A new ...
详细信息
In this paper, a finite horizon iterative adaptive dynamic programming (ADP) algorithm is proposed to solve the optimal control problem for a class of discrete-time nonlinear systems with unfixed initial state. A new is an element of-optimal control algorithm based on the iterative ADP approach is proposed that makes the performance index function iteratively converge to the greatest lower bound of all performance indices within an error is an element of in finite time. The convergence analysis of the proposed ADP algorithm in terms of performance index function and control policy is conducted. The optimal number of control steps can also be obtained by the proposed is an element of-optimal control algorithm for the unfixed initial state. Neural networks are used to approximate the performance index function, and compute the optimal control policy, respectively, for facilitating the implementation of the is an element of-optimal control algorithm. Finally, a simulation example is given to show the effectiveness of the proposed method. (C) 2012 Elsevier Ltd. All rights reserved.
作者:
Wang, Fei-YueChinese Acad Sci
Inst Automat State Key Lab Management & Control Complex Syst Beijing 100190 Peoples R China
Welcome to the new issue of IEEE Transactions on Computational Social systems (TCSS). First of all, on behalf of the Board of Governors and Prof. Enrique Herrera Viedma, Vice President for Publication, of the IEEE SMC...
Welcome to the new issue of IEEE Transactions on Computational Social systems (TCSS). First of all, on behalf of the Board of Governors and Prof. Enrique Herrera Viedma, Vice President for Publication, of the IEEE SMCS, I would like to announce and introduce the new Editor-in-Chief of the IEEE TCSS, Prof. Bin Hu, our Associate Editor since 2017 and a member of BoG since 2018. Currently, Bin Hu is the Director of the Gansu Provincial keylaboratory of Wearable Computing, Lanzhou University, Lanzhou, China, and an Adjunct Professor with the Computing Department, The Open University, Milton keynes, U.K. He is the Chair of the IEEE SMC Technical Committee on Computational Psychophysiology at IEEE SMC and the Vice- Chair of the China Committee of the International Society for Social Neuroscience. He is also serving as an Associate Editor for IEEE Transaction on Affective Computing. I am sure that IEEE TCSS will march to a new level of excellence under Prof. Bin Hu’s leadership. Congratulations to him and TCSS for the beginning of a new chapter!
暂无评论