冗余自由度超声检测机器人的逆运动学分析

针对一类冗余自由度超声检测机器人的传统逆运动学求解算法耗时长且准确度低的问题,提出了一种基于集合划分和解析解法相结合的逆运动学求解算法。首先采用De-navit-Hartenberg方法建立检测机器人的运动学方程;其次,利用解析解法求出机器人逆解的解析表达式,并提出三种自由度分配方案;最后,选择合适的自由度分配方案,据此对超声波探头位姿集合作划分,结合逆解解析式求出运动学逆解。实际应用中,借助十一轴超声波检测机器人,利用该算法对具有复杂外形的飞机螺旋桨叶片进行检测。结果表明,与传统的纯数值解法相比,该算法能够快速得到精确的运动学逆解。     

融合改进天牛须和正余弦的双重搜索优化算法

针对标准正余弦优化算法在搜索时存在的计算精度低、容易陷入局部最优值等缺点,借鉴天牛须算法运算简单、搜索速度较快的特点,本文提出了一种融合改进天牛须和正余弦的双重搜索优化算法(BAS-SCA).首先,在现有标准正余弦算法基础上,引入动态自适应权重机制来平衡全局搜索和局部搜索,提升收敛速度;其次,提出了一种新的转换参数模型,该参数模型通过结合指数型函数和余弦函数来替换传统的线性衰减函数;最后,为了提升正余弦的搜索精度和速度,同时尽可能跳出局部最优解,提出了改进的天牛须搜索算法,引入动态步长搜索机制将固定步长搜索改为变步长搜索,创新性地将改进的天牛须算法与改进的正余弦算法进行融合实现双重搜索优化,有效避免局部极值问题.实验表明,通过14个标准测试函数验证,所提双重搜索优化算法BAS-SCA相较于其它现有优化算法,具有更高的寻优精度和更快的收敛速度.     

基于旋转子矩阵正交的6R机器人运动学逆解研究

以机器人运动学方程为基础,基于变换矩阵中旋转子矩阵正交的特性,提出一种6R机器人运动学逆解算法.通过矢量运算,得到含有4个未知变量的4个常系数非线性方程,辅以其它方程,最终得到8组封闭解.通过对钱江一号焊接机器人的实例求解,验证了该算法解决逆解问题仅需0.087 ms,比传统的反变换法具有更优的实时性能;平面工况的运动仿真验证了该算法的有效性.该算法可应用于6R机器人的强实时在线控制系统.     

机器人逆运动学求解的可视化算法

机器人逆运动学求解的可视化算法包含两部分，数值求解两个(或一个)非线性方程和4(或5)自由度机器人封闭解，实现了任意结构的6自由度机器人的逆运动学方程的求解，根据D-H参数表生成机器人三维模型实现机器人结构的可视化，有效地判断逆解的合理性，并为机器人学习提供了辅助工具。     

基于Paden-kahan子问题的冗余度机器人运动学求解

针对7DOF机器人的逆运动学求解问题,提出了一种可提高运动控制精度的混合算法.这种算法使用 旋量理论来描述机器人的运动.它首先求出对运动学性能指标进行优化的速度级逆解;然后固定一个特殊关节,将 问题转化为非冗余度机器人的运动控制,应用Paden-Kahan子问题法得到逆运动学封闭解.通过仿真实例,证实了 这种混合算法的有效性.     

结合MPGA-RBFNN的一般机器人逆运动学求解

针对一般机器人逆运动学求解过程中存在的求解速度慢、精度低的问题，将多种群遗传算法（multiple population genetic algorithm，MPGA）引入径向基函数神经网络（radial basis functions neural network，RBFNN），提出一种适用于一般机器人的高精度MPGA-RBFNN算法。该算法采用3层结构的RBFNN进行一般机器人逆运动学求解，结合一般机器人的正运动学模型，采用MPGA优化RBFNN的网络结构和连接权值的方法，同时应用混合编码和演化的方式，实现了从机器人工作空间位姿到关节角度的非线性映射，从而避免了复杂的公式推导并提高了求解速度。采用6R一般机器人作为实验平台进行实验，实验结果表明:MPGA-RBFNN算法不仅提高了一般机器人在逆运动学中的求解速度，而且MPGA-RBFNN算法的训练成功率和逆解的计算准确率也得到了提高。     

融入变异交叉的改进天牛须算法求解TSP及工程应用

为找到最短路径,克服传统算法收敛速度慢、求解精度低等问题,提出一种融入变异交叉的改进天牛群算法(MBSO).首先将个体天牛转换成群体天牛搜索寻优;在群体进化过程中融入变异和交叉,提高全局搜索到更优结果;最后加入天牛须间长度自适应和步长自适应机制的搜索算法,改善算法的探索能力.将改进的算法通过MATLAB对TSPLIB中的数据集进行仿真实验,并用于PON网络规划问题.证明改进的天牛须算法在收敛速度和求解精度两方面较其他算法都有所提升,算法运行时间平均减少0.3 s,实验结果更接近最优解.     

6R机器人实时逆运动学算法研究

提出一套解决各类6R机器人逆运动学问题的实时算法. 一般算法通过矢量计算和16阶矩阵分解得到一般6R机器人的最多16组逆运动学解. 封闭解法直接提取运动学等式求出关节变量的解析解. 组合算法将封闭解法或一般算法的结果作为初始值, 采用牛顿-拉夫森方法迭代出逆运动学精确解, 适用于所有接近满足封闭解条件或一般算法条件的6R机器人. 求解实验结果表明, 整套算法最大算法时间约为2.03 ms, 为任意几何结构的6R机器人应用于强实时系统提供了逆运动学解决方案.     

基于BP神经网络的排爆机械臂逆运动学分析

机械臂逆运动学是已知末端执行器的位姿求解机械臂各关节变量,主要用于机械臂末端执行器的精确定位和轨迹规划,如何高效的求解机械臂运动学逆解是机械臂轨迹控制的难点;针对传统的机械臂逆运动学求解方法复杂且存在多解等问题,提出一种基于BP神经网络的机械臂逆运动学求解方法;以四自由度机械臂为研究对象,对其运动学原理进行分析,建立BP神经网络模型并对神经网络算法进行改进,最后使用MATLAB进行仿真验证;仿真结果表明:使用BP神经网络模型求解机械臂逆运动学问题设计过程简单,求解精度较高,一定程度上避免了传统方法的不足,是一种可行的机械臂逆运动学求解方法。     

六自由度机械臂逆运动学算法

根据D-H参数法确定六自由度机械臂的运动学方程,结合平面几何法和欧拉角变换法将机械臂的逆运动学求解问题分为两部分,一通过平面几何法确定机械臂腕部点的坐标与前三个关节角的关系,二通过欧拉角变换法确定机械臂末端姿态与后三个关节角的关系,根据逆运动解的选取原则从八组解中选取最优解;利用MATLAB中的Robotics Toolbox建立机械臂的正运动学模型,通过多组位姿下的正逆运动解对比验证逆运动学求解算法的准确性;利用VC++中的QueryPerformanceCounter函数和MATLAB中tic-toc语句得到不同算法所消耗的平均时间,通过消耗时间的对比说明该算法的快速性;利用VC++编程实现机械臂写字的过程,通过对比输入字的形状与机械臂末端的实际运动轨迹,进一步验证该算法是一种快速而准确的逆运动学求解算法。     

A neuro-simulated annealing approach to the inverse kinematics solution of redundant robotic manipulators

The neural-network-based inverse kinematics solution is one of the recent topics in the robotics because of the fact that many traditional inverse kinematics problem solutions such as geometric, iterative and algebraic are inadequate for redundant robots. However, since the neural networks work with an acceptable error, the error at the end of inverse kinematics learning should be minimized. In this study, simulated annealing (SA) algorithm was used together with the neural-network-based inverse kinematics problem solution robots to minimize the error at the end effector. The solution method is applied to Stanford and Puma 560 six-joint robot models to show the efficiency. The proposed algorithm combines the characteristics of neural network and an optimization technique to obtain the best solution for the critical robotic applications. Three Elman neural networks were trained using separate training sets and different parameters, since one of them can give better results than the others can. The best result is selected within three neural network results by computing the end effector error via direct kinematics equation of the robotic manipulator. The decimal part of the neural network result was improved up to 10 digits using simulated annealing algorithm. The obtained best solution is given to the simulated annealing algorithm to find the best-fitting 10 digits for the decimal part of the solution. The end effector error was reduced significantly.     

A neural-network committee machine approach to the inverse kinematics problem solution of robotic manipulators

In robotics, inverse kinematics problem solution is a fundamental problem in robotics. Many traditional inverse kinematics problem solutions, such as the geometric, iterative, and algebraic approaches, are inadequate for redundant robots. Recently, much attention has been focused on a neural-network-based inverse kinematics problem solution in robotics. However, the result obtained from the neural network requires to be improved for some sensitive tasks. In this paper, a neural-network committee machine (NNCM) was designed to solve the inverse kinematics of a 6-DOF redundant robotic manipulator to improve the precision of the solution. Ten neural networks (NN) were designed to obtain a committee machine to solve the inverse kinematics problem using separately prepared data set since a neural network can give better result than other ones. The data sets for the neural-network training were prepared using prepared simulation software including robot kinematics model. The solution of each neural network was evaluated using direct kinematics equation of the robot to select the best one. As a result, the committee machine implementation increased the performance of the learning.     

全局和声搜索方法及其在仿人灵巧臂逆运动学求解中的应用

仿人灵巧臂逆运动学(IK)问题可转化为等效的最小化问题,并采用数值优化方法求解.和声搜索(HS)是模拟乐师在音乐演奏中调整音调现象的一种启发式搜索方法,目前还尚未在机器人机械臂逆运动学问题中得到应用.本文提出一种基于粒子群体智能的全局和声搜索方法(GHSA),该方法在和声搜索算法中引入微粒群操作(PSO),采用粒子群策略替代常规和声搜索算法中的搜索法则创作新和声,通过粒子自身认知和群体知识更新和声变量位置信息平衡算法对解空间全局探索与局部开发间能力;同时算法还引入变异操作增强算法跳出局部最优解能力,基准函数测试表明该方法改善了全局搜索能力及求解可靠性.在此基础上以七自由度(7-DOF)冗余仿人灵巧臂为例,考虑以灵巧臂末端位姿误差和“舒适度”指标构建适应度函数并采用GHSA算法求解其逆运动学(IK)问题,数值仿真结果表明了该方法是解决仿人灵巧臂逆运动学问题的一种有效方法.     

An improved beetle antennae search algorithm with Lévy flight and its application in micro-laser assisted turning

The beetle antennae search (BAS) algorithm is a single-solution metaheuristic optimizer that imitates the foraging behavior of beetles. Due to its easy implementation and fast convergence, it has been applied in various engineering fields. To enhance the local search ability and preclude the blindness of position updates performed in BAS, an improved beetle antennae search algorithm with Lévy flight (IBAS) is proposed in this paper. Additionally, to further enhance the algorithm performance, the features of inertia, normalization, and elitist selection are adopted into this proposed hybrid algorithm. In a comparison with other algorithms based on 15 well-known benchmark functions and 4 classic engineering problems, IBAS maintains good performance under the premise of a trade-off between efficacy and efficiency. The detailed results suggest that the improvements adapted in IBAS alleviate the shortcomings of BAS. In addition, a real-world engineering problem, laser energy prediction in micro-laser assisted turning, is used to further validate the potential of the proposed algorithm for industrial applications. The results indicate the feasibility of the new solution based on the IBAS algorithm. Two further applications of IBAS in the reconstruction of the temperature field and online laser energy detection are also discussed.     

Comparison of four different heuristic optimization algorithms for the inverse kinematics solution of a real 4-DOF serial robot manipulator

In this study, a 4-degree-of-freedom (DOF) serial robot manipulator was designed and developed for the pick-and-place operation of a flexible manufacturing system. The solution of the inverse kinematics equation, one of the most important parts of the control process of the manipulator, was obtained by using four different optimization algorithms: the genetic algorithm (GA), the particle swarm optimization (PSO) algorithm, the quantum particle swarm optimization (QPSO) algorithm and the gravitational search algorithm (GSA). These algorithms were tested with two different scenarios for the motion of the manipulator’s end-effector. One hundred randomly selected workspace points were defined for the first scenario, while a spline trajectory, also composed of one hundred workspace points, was used for the second. The optimization algorithms were used for solving of the inverse kinematics of the manipulator in order to successfully move the end-effector to these workspace points. The four algorithms were compared according to the execution time, the end-effector position error and the required number of generations. The results showed that the QPSO could be effectively used for the inverse kinematics solution of the developed manipulator.     

换电模式下电动车货运路径优化模型与算法

针对考虑电池续航能力和换电站约束的电动车货运路径优化问题,提出考虑速度、载重和距离等多因素的电动车碳排放计算方法。首先,以耗电量和旅行时间费用最小化为目标,建立混合整数规划模型;然后,在爬山优化和换电邻域搜索的基础上提出一种自适应遗传算法,并设计随种群适应度变化而自适应调整的交叉和变异概率;最后,采用爬山搜索加强算法的局部搜索能力,并设计电动车换电邻域搜索策略对最优解进行进一步的改进,以满足电池续航能力和换电站约束,得到最优可行解。实验结果表明：相较于传统的遗传算法,自适应遗传算法能够更快速有效地找到满意解;考虑耗电量和旅行时间的路径安排能够减少货运配送的碳排放和总费用;与固定的交叉和变异概率参数设置相比,自适应参数调节方法能够更有效防止局部优化问题,提高算法的全局搜索能力。     

基于遗传算法的机器人运动学逆解

在分析以往逆解方法的基础上，提出了用遗传算法求解机器人运动学逆解的方法，给出了用于优化求解的适合度函数，并提出用二次编码法提高解的精度．计算机模拟证明：该方法能快速收敛于全局最优解，能给出机器人的可能解，并能计算冗余度机器人的逆解．