家用智能看护机器人高精度里程计估计算法

为了解决家用智能看护机器人车轮轮胎和地面作用力与电机输出力矩不平衡,易导致看护机器人产生滑动、里程计估计精度低的问题,引入牵引系数描述机器人滑动情况,推导含牵引系数的看护机器人运动学模型,以增量式光电编码器和惯性测量单元2种传感器为输入,将含牵引系数的运动学模型应用于基于扩展卡尔曼滤波算法的看护机器人里程计估计算法,搭建看护机器人实验系统完成算法验证。结果表明：在家用瓷砖地面,看护机器人分别以0.1,0.2,0.4 m/s的速度移动时,与传统里程计估计算法相比,所提出的机器人里程计估计算法的误差降低了40%左右。将含牵引系数的运动学模型应用于机器人里程计估计算法,可有效降低看护机器人的里程计估计误差,为提高看护机器人在室内地面的自主导航精度提供了一定的参考。     

动态环境下基于时序滑动窗口的鲁棒激光SLAM系统

无人驾驶场景中的动态物体会影响同时定位与建图（SLAM）系统的整体精度和鲁棒性，针对现有多数激光SLAM系统在动态环境下易出现里程计漂移、定位失败和建图重影问题，本文融合轻量级PointPillars目标检测网络和多目标跟踪方法，构建了一种面向动态场景的语义激光SLAM系统.该系统首先利用PointPillars网络获取潜在动态目标检测框并过滤检测框内特征点，以获取里程计初始位姿.其次基于匀速卡尔曼滤波器的多目标跟踪算法获取跟踪结果，以构建时序滑动窗口，实现鲁棒、高效的目标级数据时空关联，以去除动态物体和恢复静态目标，进一步优化里程计.最后在包含动态场景的KITTI和NUSCENES公开数据集上与主流激光SLAM方法进行对比实验，结果表明本系统在里程计和全局地图的准确性和鲁棒性方面有显著的提高，同时系统保持了实时性，可满足动态场景下自主机器人系统和智能交通应用.     

融合光度和深度的视觉里程计改进算法

针对视觉里程计中对纹理较少的环境难以获得高精度相机位姿的问题,提出一种融合光度和深度的视觉同步定位与绘图(SLAM)方法.首先构造基于光度和深度的相机位姿优化函数,通过t分布模型计算每个像素点的光度和深度误差权重,对每一帧图像引入帧权重系数λ来平衡光度和深度,并采用中值法求解帧权重λ,求得相机位姿.然后对10个国际标准数据集进行仿真实验,结果表明,对纹理丰富的环境,本方法能够保持DVO SLAM算法的建图精度;对纹理较少的环境,本方法的建图精度要高于DVO SLAM算法,绝对路径误差降低31.6%,相对位姿误差降低19.4%.     

改进位姿估计环节的ORB-SLAM稠密建图算法

为了提高ORB-SLAM2系统的位姿估计精度并解决仅能生成稀疏地图的问题,提出了一种融合ICP算法与曼哈顿世界假说的位姿估计策略并在ORB-SLAM2系统中加入稠密建图线程来实现稠密建图。首先通过ORB特征点法、LSD算法和AHC方法进行点、线、面特征的提取,其中点、线特征跟上一帧匹配,面特征在全局地图中匹配。然后采用基于surfel的稠密建图策略将图像划分为非平面与平面区域,非平面采用ICP算法计算位姿,平面则通过面与面的正交关系确定曼哈顿世界从而使用不同的位姿估计策略,其中曼哈顿世界场景通过位姿解耦实现基于曼哈顿帧观测的无漂移旋转估计,而曼哈顿世界场景下的平移以及非曼哈顿世界场景位姿采用追踪的点、线、面特征进行估计和优化;最后根据关键帧和相应位姿实现稠密建图。采用TUM数据集对所提建图方法进行验证,实验结果与ORB-SLAM2算法比较,最终均方根误差RMSE平均减少0.24cm,平均定位精度提高7.17%,验证了所提方法进行稠密建图的可行性和有效性。     

基于滑动窗口优化的激光雷达惯性测量单元紧耦合同时定位与建图算法

针对现有的激光里程计在面临室外大场景建图时,普遍会出现定位精度低、鲁棒性差的问题,本文提出一种16线激光和IMU惯性测量单元紧耦合的SLAM算法。首先对IMU进行估计位姿,通过线性插值矫正激光点云的运动畸变；接着通过曲率提取场景特征,并根据不同特征性质进行分类；然后利用帧间匹配模块在滑动窗口内构建局部地图；最后利用帧与局部地图匹配得到的距离和IMU数据构建联合优化函数。借助KITTI数据集和自行录制的园区数据集,对改进算法与主流的Lego-LOAM和同样使用紧耦合方案的LIO-Mapping进行分模块和整个系统的精度评定,实测结果表明,在符合里程计实时性的要求下,改进激光里程计精度高于Lego-LOAM和LIO-Mapping方案。     

基于视觉-IMU-编码器的SLAM新算法

VINS-Mono算法应用于轮式机器人时,由于惯性测量单元(inertial measurement unit, IMU)加速度计信噪比较小,观测尺度不准确,会出现定位精度下降。对此,提出了一种融合单目相机、惯性测量单元和编码器的改进算法。在VINS-Mono初始化和后端优化的目标函数中,增加编码器测量残差项,直接融合由编码器数据计算的速度,增强尺度的可观性,降低定位累积误差,提高了定位精度。另外,针对车轮打滑造成编码器速度测量不准的问题,利用IMU角速度计测量值计算打滑因子,自适应调整编码器残差项在目标函数中的权重及其鲁棒核函数的阈值,减小车轮打滑对定位结果的影响。在两轮移动机器人上的实验表明,改进算法具有较强的鲁棒性,定位精度比VINS-Mono提高了一个数量级。     

基于激光雷达里程计的高速公路三维建模方法

构建三维道路数字模型对智能车服务和道路管理具有重要意义。文中针对高速公路不同路段应用场景下车辆运行速度快、干扰噪声多、特征少和无回环检测辅助等一系列问题，提出一种以激光雷达信息为建模基础数据、激光雷达里程计与LOAM技术等多传感器融合的高速公路三维建模方法。首先，通过车载激光雷达获取道路场景的激光点云数据，使用激光雷达图像分割技术赋予每一个点有关构造物的标签，剔除道路上其他运动车辆的信息，减少建模噪声；其次，制定了一个精确的同步策略来对GNSS、IMU和激光雷达等传感器进行集成；在此基础上，结合惯性导航预积分结果、基于特征点云的位姿约束和RTK数据构建因子图，消除激光雷达里程计的累积误差，从而构建全局一致性的高速公路三维数字模型。为了保持姿态估计的有限数量，文中还引入了基于关键帧的滑动窗口优化策略。最后，分别采集高速公路场景中常见的3种路段（一般路段、桥梁和隧道路段）进行建模分析，结果表明，在具有挑战性的高速公路场景建模中，文中方法能够有效提高建模鲁棒性、精度以及模型有效性。     

ArUco-SLAM:基于ArUco二维码阵列的单目实时建图定位系统

高精度自动建图算法是ArUco二维码阵列定位系统应用的前提和核心,现有在线建图算法累计误差大且易受误检测影响,而人工标定和离线建图的方式则效率低、耗时长. 为解决上述问题,本文提出了一种ArUco-SLAM单目实时建图定位算法,其采用前后端并行建图、联合优化的框架,前端以坐标系变换封闭原理对地图进行快速更新和局部修正;后端以非线性优化算法最小化二维码顶点总体重投影误差,实现对关键帧序列囊括地图的全局优化;最终,基于联合优化算法实现对前后端地图的匹配,消除前端地图的累计误差. 设计实验对所提算法进行了验证,实验结果证明其相比现有建图系统有着累计误差小和建图效率高的优点,具有建立大规模二维码阵列厘米级精度地图的能力.      

基于因子图的无人喷雾机多源融合定位

针对果林环境GPS信号容易丢失,造成农机位姿估计误差较大的问题,提出了一种基于因子图的喷雾机多源融合定位方法.采用集成彩色和深度相机与IMU的RealSense D435i传感器,感知无人喷雾机周围环境信息.通过改进的自适应阈值均匀Harris角点提取方法,利用金字塔LK光流算法跟踪匹配角点,使用迭代最近点算法估计相机运动,最终采用因子图优化算法迭代优化位姿估计误差.试验在林间道路进行,改进的方法与惯性组合导航相比,在GPS信号丢失时可以有效地实时估计喷雾机位姿,试验测试距离总共112.39 m,多传感器融合后的位姿更新频率约为50 Hz.结果表明:喷雾机定位均方根误差减少了0.816 m,最大误差减少了4.613 m,姿态角度估计最大误差减少了2.713°.     

换流站巡检四足机器人建图定位系统优化

为解决巡检机器人对换流站狭窄区域场景以及多楼层场景建图定位困难的问题，本文采用四足机器人作为巡检平台，对四足机器人建图定位系统进行优化。首先融合深度相机与激光雷达点云，对融合点云进行地面分割，提取边缘特征、非地面面特征以及地面面特征，优化基于特征的点云匹配算法，使用紧耦合的迭代卡尔曼滤波器(iterated extended Kalman filter, IEKF)来融合点云特征点和惯性测量单元（inertial measurement unit, IMU），通过ORB（oriented FAST and rotated BRIEF）描述符计算关键帧图像的BoW（Bag-of-Words）向量用于回环检测消除建图累积误差。其次，通过无迹卡尔曼滤波（unscented Kalman filter, UKF)融合足式里程计作为四足机器人正态分布变换（normal distribution transform，NDT）姿态匹配初值，加快NDT匹配时间，通过实时匹配融合点云与三维地图得到全局位姿进行姿态更新。实验结果表明，本文提出的建图方法可以实现狭窄通道以及多楼层场景的有效建图，所提出的定位方法可以实现两种场景下帧图匹配时间至42 ms以及重复定位精度6 cm以内的实时有效定位。     

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.     

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).     

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.     

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.