中国科学院机构知识库网格系统: 检索

浏览/检索结果: 共7条，第1-7条

帮助

条数/页：排序方式：
	Multistep Look-Ahead Policy Iteration for Optimal Control of Discrete-Time Nonlinear Systems With Isoperimetric Constraints 期刊论文 OAI收割 IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2023, 页码: 13 作者: Li, Tao; Wei, Qinglai; Wang, Fei-Yue \| 收藏 \| 浏览/下载：15/0 \| 提交时间：2024/02/22 Performance analysis Optimal control Dynamic programming Iterative algorithms Upper bound Measurement Convergence Adaptive dynamic programming (ADP) isoperimetric constraints nonlinear systems optimal control policy iteration
	Neuro-Optimal Trajectory Tracking With Value Iteration of Discrete-Time Nonlinear Dynamics 期刊论文 OAI收割 IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2021, 页码: 12 作者: Wang, Ding; Ha, Mingming; Cheng, Long \| 收藏 \| 浏览/下载：27/0 \| 提交时间：2022/01/27 Trajectory Heuristic algorithms Convergence Trajectory tracking Stability criteria Optimal control Dynamic programming Adaptive critic design discrete-time nonlinear plants neuro-optimal trajectory tracking uniformly ultimately bounded stability value iteration
	Continuous-Time Time-Varying Policy Iteration 期刊论文 OAI收割 IEEE TRANSACTIONS ON CYBERNETICS, 2020, 卷号: 50, 期号: 12, 页码: 4958-4971 作者: Wei, Qinglai; Liao, Zehua; Yang, Zhanyu; Li, Benkai; Liu, Derong \| 收藏 \| 浏览/下载：41/0 \| 提交时间：2021/03/02 Optimal control Nonlinear systems Time-varying systems Mathematical model Dynamic programming Approximation algorithms Iterative algorithms Adaptive critic designs adaptive dynamic programming (ADP) neuro-dynamic programming nonlinear systems optimal control policy iteration
	A new algorithm for solving the best-fit sphere of optical aspherical surface (EI CONFERENCE) 会议论文 OAI收割 2nd International Conference on Advances in Materials and Manufacturing, ICAMMP 2011, December 16, 2011 - December 18, 2011, Guilin, China 作者: Lin J.; Lu M. 收藏 \| 浏览/下载：40/0 \| 提交时间：2013/03/25 To solve the best-fit sphere (BFS) accurately is one of the technological keys for the generating and testing of optical aspherical surfaces. This paper presents a new algorithm for solving the BFS of aspherical surfaces to suppress some deficiencies in the existing BFS algorithms. In the proposed approach it is not only suitable for the conic surface a BFS is constructed but also for higher order aspheres. The obtained asphericity and material removal function is more suitable for the machining and test. (2012) Trans Tech Publications which passes through both sides of endpoints in the section o -?xy of the aspherical surfaces Switzerland. the center of the BFS is shifted along the x-axis and its radius of curvature is automatically computed. The variable step size method is proposed to speed up the convergence of the iteration. Through numerically solving the BFS of conic and cubic surface the advantages of the proposed approach are verified. The results show that the proposed approach is of rapid convergence and high accuracy
	A micromechanical model for deformation behavior of nanocrystalline copper 会议论文 OAI收割 2010 International Conference on Advances in Materials and Manufacturing Processes, ICAMMP 2010, Shenzhen, China, NOV 06-08, 2010 作者: Lan JX(兰姣霞); Wu YZ(吴永中); Hong YS(洪友士); Lan JX 收藏 \| 浏览/下载：26/0 \| 提交时间：2013/02/26 Algorithms Copper Deformation Grain boundaries Grain size and shape Materials Micromechanics Molecular dynamics Strain energy Deformation behavior Deformation mechanism Developed model Experimental values Grain shapes Grain size Internal variable theory Iteration algorithms Micromechanical model Molecular dynamics simulations Nanocrystalline copper Nanocrystallines Pure copper Statistical distribution Stress strain relation Uniaxial tensions
	Super-resolution using adaptive blur parameter estimation (EI CONFERENCE) 会议论文 OAI收割 2010 6th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2010, September 23, 2010 - September 25, 2010, Chengdu, China 作者: Wang H.; Wang H.; Wang H.; Wang H.; Liu G. 收藏 \| 浏览/下载：16/0 \| 提交时间：2013/03/25 Super-resolution is a term for a set of methods of increasing image or video resolution. All these methods are based on the same idea: using information from several images to create one upsized image. In most of the super-resolution algorithms the blur parameter of a LR-image model is always manually set as a default value. In this paper we propose a method to adaptively estimate the blur parameter. We get the initial image of iteration by fusing all low-resolution images. When it is used in MAP algorithm three iterations are enough to get a stable solution. It is greatly reduce the computational power compared with other MAP algorithms. Experiments to real image sequences show that it well preserved the image detail and the reconstructed image is clear. 2010 IEEE.
	Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions 期刊论文 OAI收割 APPLIED NUMERICAL MATHEMATICS, 2007, 卷号: 57, 期号: 9, 页码: 1033-1049 作者: Zhao, Y. B. \| 收藏 \| 浏览/下载：25/0 \| 提交时间：2018/07/30 linear programming interior-point algorithms iteration complexity neighborhoods