ID 原文 译文
53177 在此基础上结合高斯径向基核最小二乘支持向量机，采用提出的改进蚁群算法获得支持向量机的惩罚系数和核函数宽度，利用径向基核函数和决策函数在改进蚁群算法的路径转向位置处训练优化，得到平滑及安全的路径。 Basis on this, combined with the Gaussian radial basis kernel least squares support vector machine, the improved ant colony algorithm is used to obtain the penalty coefficient and kernel function width of the support vector machine, the radial basis kernel function and decision function are used to train and optimize the improved ant colony algorithm path turning position to obtain a smooth and safe path.
53178 仿真结果表明，提出的算法不但可以有效提高收敛速度和精度，而且使得路径光滑且安全。 Simulation results show that the proposed algorithm can improve the convergence speed and accuracy, and make the oath smooth and safe.
53179 为了能够充分地描述路况信息，本文采集髋关节角度、加速度运动信息和前后脚底压力信息作为识别信号源， The prosthetic motion information of gyroscope and acceleration sensors in the prosthetic socket are used as the data source, and the foot pressure switch information auxiliary analysis is used.
53180 采用改进的D-S(Dempster/Shafer)证据理论方法将陀螺仪传感器和加速度传感器信息融合，从而对假肢穿戴者行走的各路况运动模式进行有效的预识别。 The improved method of D-S theory combined with distance function is used to fuse the correlation coefficient, thereby to pre-recognize walking mode effectively.
53181 实验结果表明，基于改进证据理论数据融合的动力型下肢假肢运动模式预识别方法可有效地对上楼梯、下楼梯、上斜坡、下斜坡、平地行走5类运动模式进行预识别。 The experimental results show that five walking mode including upstairs, downstairs, uphill, downhill, level walking can be pre-identified by walking mode pre-recognition of power lower limb prosthesis based on the data fusion of improved D-S theory.
53182 该技术对动力型假肢的研制具有重要的实用价值。 The method has important practical value to develop the technology of dynamic prosthesis.
53183 在栅格地图环境下，传统A*算法搜索路径时选取的路径点受限于栅格中心，并且路径的转折角度固定为特定的离散值，因此存在长度非最优以及冗余转折较多的问题。 In a grid map environment, the path points selected by the traditional A*algorithm for searching a path are limited by the grid center, and the turning angle of the path is fixed to some specific discrete values, so there are problems of non-optimal length and many redundant transitions.
53184 为此，提出一种新启发搜索策略下的改进A*算法。 In this paper, an improved A*algorithm under a new heuristic search strategy is proposed.
53185 在探索当前节点的每个邻域节点时，将邻域点父节点的选取范围扩大到从当前点至起始点的整个支路， When exploring each adjacent node of the current node, the selection range of the parent node of the adjacent point is expanded to the entire branch from the current point to the starting point,
53186 采用邻域点与支路上的点直接相连的方式，找到所需真实代价G最小的安全路径， and adopt the way that the adjacent points are directly connected to the points on the branch road to find the safe path with the smallest real cost G.