非完整移动机器人的迭代学习控制

首先针对迭代初态偏移期望初态的情况,利用构造期望轨迹的办法给出了基于相对阶的迭代学习控制算法,然后借助于压缩映射原理与Gronwall-Bellman不等式给出了算法收敛性的证明.最后将得到的迭代学习控制律应用于非完整移动机器人的跟踪控制问题.MATLAB仿真结果表明了所给控制算法的有效性.     

初态偏移非线性系统跟踪控制的迭代学习算法

基于迭代学习控制理论提出一种新的可变增益学习控制算法,并对系统初态的迭代学习律进行了讨论,利用算子理论证明在非线性系统中存在初态偏移时经过迭代学习后,输出仍能跟踪期望轨迹;对其收敛性进行数学证明,得到谱半径形式的迭代学习律收敛的充分条件,从而解决了可变学习增益迭代学习控制的初态偏移问题.最后在注塑机注射速度控制系统中与增益不可变迭代学习算法进行比较,仿真结果验证了算法的有效性.     

网络控制系统中迭代学习控制算法的鲁棒收敛性分析

针对网络控制系统中受输入扰动和初态干扰的非线性系统,提出了一种迭代学习控制算法,讨论了输出数据丢失情况下系统输出对期望轨迹的跟踪问题。采用一个概率已知的随机贝努利序列来描述网络控制系统中的数据丢失现象,即如果输出数据没有丢失,则利用跟踪误差来修正上一次迭代学习时的控制量,从而获得系统当前控制量;如果存在输出数据丢失现象,则系统当前控制量保持上一次迭代时的控制量不变。给出了保证算法收敛的充分条件。从理论上证明了系统满足给定的收敛条件时,在数据丢失网络环境下具有输入扰动、初态扰动的被控系统随迭代学习次数的增加,系统输出除初始点以外都能够收敛于期望轨迹。通过仿真算例进一步验证了所提方法的有效性。     

基于边界层的一类不确定系统的迭代学习控制

针对一类具有任意初态和非周期有界扰动的不确定非线性时变系统,提出一种基于边界层的迭代学习控制方法,将边界层设计成一个具有剩余宽度的指数衰减函数,通过边界层把任意初态问题转换为零初值迭代学习问题.针对周期和非周期不确定性扰动,分别设计周期项的学习律和非周期项的边界学习律,然后在此基础上给出了迭代学习控制算法.文中给出了相关定理,并应用类Lyapunov方法给出了定理的详细证明.仿真结果表明,所提出的算法是有效的,轨迹跟踪误差能收敛到边界层.     

一种改进的非线性离散系统迭代学习控制算法

针对非线性离散时变系统的迭代学习控制问题,提出了一种改进的迭代学习控制算法。在新控制算法中,除了在传统算法基础上增加了状态补偿外,还引用了小波变换来对跟踪误差进行了滤波而没有相位补偿。利用该算法进行学习控制,使系统的实际输出以更快的速度收敛于系统的理想输出;并进一步从理论上证明了新算法的收敛性。     

迭代学习在多智能体编队中的控制研究

针对具有控制时延的非线性多智能体系统模型,设计了一种能够实现其稳定编队的迭代学习控制算法.首先,建立单个智能体的动态特性,根据多智能体的拓扑连接结构,将多智能体编队控制问题转化为跟踪问题.其次,针对每个智能体设计形式统一的迭代学习控制器,根据每个智能体不同的动态特性,选取合适的学习增益矩阵.最后,基于λ范数理论证明了算法的收敛性.由于该迭代学习控制算法放宽了对迭代初值的限定,使其达到在任意常值初态条件下的稳定控制,从而满足了各个智能体在初始位置随机分布时的编队控制要求.仿真结果证明了文中所给算法的有效性.     

非线性系统开闭环PID型迭代学习控制的收敛性分析

针对一类参数未知非线性的迭代学习控制问题提出了一种开闭环PID型迭代学习控制律,这种迭代学习律同时利用了系统当前的跟踪误差和前次迭代控制的跟踪误差修正控制作用,给出了迭代学习控制算法收敛的充分性条件.分析表明,所给出的迭代学习控制律推广了现有的结果.     

基于GPS的太阳跟踪系统优化设计研究

优化设计了一种基于新型控制模式和控制算法的槽式太阳能一维跟踪系统,以解决太阳能程序跟踪模式下累积误差增大、控制算法不精确、跟踪精度不高的问题.增加了GPS信号接收器和角度传感器模块,增强了跟踪过程中预防算法参数变动和恢复装置状态的能力;提出了添加多重修正系数的太阳方位角计算公式,采用MATLAB软件进行模拟仿真,并通过误差分析论证了该控制算法的正确性和优越性.在太阳能槽式集热系统中,此跟踪系统能够满足东西向的一维跟踪要求,理论跟踪精度达到0.1°,实验跟踪精度达到0.23°,具有跟踪精度高、安装简单、管理方便等优点.     

不确定时滞系统的PD型迭代学习控制算法

针对不确定时滞系统,在网络时滞范围已知情况下,采用改进PD型迭代学习控制算法补偿网络时滞.在初态是严格重复时,给出这类系统的极限轨迹和迭代输出收敛于该极限轨迹的充分条件.并与P型迭代学习控制算法进行比较.仿真结果表明改进后的PD型迭代学习控制算法能够有效地补偿此类时滞.当网络时滞范围变窄时,能够更加精确跟踪极限轨迹.在相同迭代次数情况下,PD型迭代学习控制算法比P型迭代学习控制算法能更快收敛于极限轨迹.     

非线性时变系统开闭环PI型迭代学习控制研究

讨论了一类非线性时变系统开闭环PI型迭代学习控制算法,该算法相对于开环、闭环PI型迭代学习算法不仅能较快地跟踪期望轨迹,而且能增强学习控制的鲁棒性。给出了仿真研究实例,仿真结果验证了该算法的有效性和优越性。     

Characterization of Ordovician carbonate reservoirs, southeastern Saskatchewan, Canada

The discovery of the prolific Ordovician Red River reservoirs in 1995 in southeastern Saskatchewan was the catalyst for extensive exploration activity which resulted in the discovery of more than 15 new Red River pools. The best yields of Red River production to date have been from dolomite reservoirs. Understanding the processes of dolomitization is, therefore, crucial for the prediction of the connectivity, spatial distribution and heterogeneity of dolomite reservoirs.The Red River reservoirs in the Midale area consist of 3～4 thin dolomitized zones, with a total thickness of about 20 m, which occur at the top of the Yeoman Formation. Two types of replacement dolomite were recognized in the Red River reservoir: dolomitized burrow infills and dolomitized host matrix. The spatial distribution of dolomite suggests that burrowing organisms played an important role in facilitating the fluid flow in the backfilled sediments. This resulted in penecontemporaneous dolomitization of burrow infills by normal seawater. The dolomite in the host matrix is interpreted as having occurred at shallow burial by evaporitic seawater during precipitation of Lake Almar anhydrite that immediately overlies the Yeoman Formation. However, the low δ18O values of dolomited burrow infills (-5.9‰～ -7.8‰, PDB) and matrix dolomites (-6.6‰～ -8.1‰, avg. -7.4‰ PDB) compared to the estimated values for the late Ordovician marine dolomite could be attributed to modification and alteration of dolomite at higher temperatures during deeper burial, which could also be responsible for its 87Sr/86Sr ratios (0.7084～0.7088) that are higher than suggested for the late Ordovician seawaters (0.7078～0.7080). The trace amounts of saddle dolomite cement in the Red River carbonates are probably related to "cannibalization" of earlier replacement dolomite during the chemical compaction.     

An Index mechanism for multi-scale view in spatial databases

There are numerous geometric objects stored in the spatial databases. An importance function in a spatial database is that users can browse the geometric objects as a map efficiently. Thus the spatial database should display the geometric objects users concern about swiftly onto the display window. This process includes two operations:retrieve data from database and then draw them onto screen. Accordingly, to improve the efficiency, we should try to reduce time of both retrieving object and displaying them. The former can be achieved with the aid of spatial index such as R-tree, the latter require to simplify the objects. Simplification means that objects are shown with sufficient but not with unnecessary detail which depend on the scale of browse. So the major problem is how to retrieve data at different detail level efficiently. This paper introduces the implementation of a multi-scale index in the spatial database SISP (Spatial Information Shared Platform) which is generalized from R-tree. The difference between the generalization and the R-tree lies on two facets: One is that every node and geometric object in the generalization is assigned with a importance value which denote the importance of them, and every vertex in the objects are assigned with a importance value,too. The importance value can be use to decide which data should be retrieve from disk in a query. The other difference is that geometric objects in the generalization are divided into one or more sub-blocks, and vertexes are total ordered by their importance value. With the help of the generalized R-tree, one can easily retrieve data at different detail levels.Some experiments are performed on real-life data to evaluate the performance of solutions that separately use normal spatial index and multi-scale spatial index. The results show that the solution using multi-scale index in SISP is satisfying.     

A computer generator for randomly layered structures

AcomputergeneratorforrandomlylayeredstructuresYUJia shun1,2,HEZhen hua2(1.TheInstituteofGeologicalandNuclearSciences,NewZealand;2.StateKeyLaboratoryofOilandGasReservoirGeologyandExploitation,ChengduUniversityofTechnology,China)Abstract:Analgorithmisintrod…     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

Exciton Seebeck in Molecular Systems

Various applications relevant to the exciton dynamics,such as the organic solar cell,the large-area organic light-emitting diodes and the thermoelectricity,are operating under temperature gradient.The potential abnormal behavior of the exicton dynamics driven by the temperature difference may affect the efficiency and performance of the corresponding devices.In the above situations,the exciton dynamics under temperature difference is mixed with     

Achieving Unusual States of Matter Under High Pressure

The elongation method,originally proposed by Imamura was further developed for many years in our group.As a method towards O(N)with high efficiency and high accuracy for any dimensional systems.This treatment designed for one-dimensional(ID)polymers is now available for three-dimensional(3D)systems,but geometry optimization is now possible only for 1D-systems.As an approach toward post-Hartree-Fock,it was also extended to     

《Chinese Science Bulletin》SUBJECT INDEX TO VOLUME 59(2014)

正~~     

An on-line scaling method for improving scalability of a database cluster

The explosive growth of the Internet and database applications has driven database to be more scalable and available, and able to support on-line scaling without interrupting service. To support more client's queries without downtime and degrading the response time, more nodes have to be scaled up while the database is running. This paper presents the overview of scalable and available database that satisfies the above characteristics. And we propose a novel on-line scaling method. Our method improves the existing on-line scaling method for fast response time and higher throughputs. Our proposed method reduces unnecessary network use, i.e. , we decrease the number of data copy by reusing the backup data. Also, our on-line scaling operation can be processed parallel by selecting adequate nodes as new node. Our performance study shows that our method results in significant reduction in data copy time.     

An improved R-tree based on childnode''s probability

R-Tree is a good structure for spatial searching. But in this indexing structure,either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different, if we make the subnode who has the most possibility be traveled first, the time cost will be decreased in most of the cases. In some case, the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on the structure of R-tree, to increase the possibility of founding the satisfying answer in the front sub trees. We names this structure probability based arranged R-tree (PBAR-tree).     

Integrating GIS Web services based on mediating architecture

The geographic information service is enabled by the advancements in general Web service technology and the focused efforts of the OGC in defining XML-based Web GIS service. Based on these models, this paper addresses the issue of services chaining,the process of combining or pipelining results from several interoperable GIS Web Services to create a customized solution. This paper presents a mediated chaining architecture in which a specific service takes responsibility for performing the process that describes a service chain. We designed the Spatial Information Process Language (SIPL) for dynamic modeling and describing the service chain, also a prototype of the Spatial Information Process Execution Engine (SIPEE) is implemented for executing processes written in SIPL. Discussion of measures to improve the functionality and performance of such system will be included.