基于AGA的时间最优机械臂轨迹规划算法*

根据机械臂运动学约束,提出了关节空间基于自适应遗传算法(AGA)的3-5-3多项式插值轨迹规划算法。利用运动学约束,以最优时间为目标,针对关节型机器人在静态环境下点到点的轨迹规划问题,利用AGA算法解算多项式插值的时间。通过与基于GA的3-5-3多项式机械臂轨迹规划进化曲线和运动位置、速度、加速度曲线对比,证明该方法在算法收敛、运行平稳度上都有突出优点。     

基于粒子群优化的时间最优机械臂轨迹规划算法

根据机械臂运动学约束,提出了关节空间基于粒子群优化(PSO)的时间最优3-5-3多项式插值轨迹规划算法,解决了由于多项式插值轨迹规划具有阶次高、没有凸包性质等缺点,难以应用传统优化方法进行优化的问题.粒子群算法结构简单、参数易调整的特点弥补了多项式阶插值的缺点.直接在优化目标空间搜索,巧妙地避免了粒子群计算构造自变量和因变量的映射,降低了搜索维数,简化了计算.在优化过程中,采用两个适应度函数之间切换的开关控制,使各段插值尽快收敛于运动学约束内.通过与传统3-5-3多项式插值的运动位置、速度、加速度曲线对比,证明该方法运行时间更短,稳定性和流畅性更好.     

基于改进蚁群算法的六自由度机械臂轨迹规划

为了解决六自由度械臂末端轨迹的平稳性和效率的问题,针对多关节机械臂末端轨迹提出了一种基于改进蚁群算法的多关节机械臂轨迹规划。采用了关节空间轨迹方法包括B样条插值、三次多项式插值和五次多项式插值进行实验分析论证,同时根据改进的蚁群算法对机械臂的轨迹进行规划,对比位置的准确性、轨迹的连续性、加速度的变化率,确定最后的轨迹规划算法为改进的蚁群算法与多项式轨迹规划相结合效果最好。     

六自由度飞机清洗臂运动学建模与轨迹优化

传统飞机清洗车由于关节运动不稳定,清洗时间长,清洗效率低造成无法对机身蒙皮进行快捷高效清洗。针对心目问题,设计了六自由度飞机清洗臂,为验证机械臂的运动性能,运用改进D-H法进行运动学分析得到机械臂末端转换矩阵,设计了GUI计算运动学正逆解。并提出将改进粒子群算法与3-5-3分段插值相结合的方法对飞机清洗臂进行时间最优轨迹规划。通过仿真结果显示,与传统3-5-3多项式插值相比,上述方法在保证运动稳定性的同时缩短了运动时间。为以后飞机清洗臂的路径规划与控制问题的研究奠定了基础。     

六自由度机械臂轨迹规划与仿真研究

针对六自由度链式机械臂在进行正运动学、逆运动学以及轨迹规划仿真时,不易直观地验证运动学算法的正确性和轨迹规划的效果,在正确建立机械臂数学模型的基础上,重点分析了机械臂在关节空间中轨迹规划的两种实现方法,并采用三维运动仿真进行了验证.开发了一套六自由度机械臂三维仿真软件,该仿真软件在VC++6.0开发平台上,首先利用分割类将基于MFC框架的窗口分割成为控制窗口和视图窗口两部分,然后利用OpenGL的图形库对机械臂进行建模,首次将正运动学、逆运动学以及轨迹规划算法融入其中开发而成.该仿真软件有效地验证了机械臂运动学模型建立的正确性,同时也对三次多项式和五次多项式两种轨迹规划方法做了直观的比较,结果表明后一种轨迹规划效果明显优于前一种.     

基于信赖域算法的机械臂时间最优轨迹规划

为了提高机械臂的工作效率,提出了一种新的时间最优轨迹规划方法.通过逆运动学运算得到与任务空间轨迹对应的关节空间位置序列,采用7次B样条曲线构造关节空间插值轨迹,将运动学约束转换为对B样条轨迹曲线控制顶点的约束,并适当放大约束条件,然后采用信赖域方法求解时间优化问题,从而规划出速度、加速度和脉动均连续且满足运动学约束的时间最优轨迹.仿真结果验证了所提出时间最优轨迹规划方法的有效性.     

电能表检验台体串联机械臂时间最优轨迹规划

时间最优轨迹规划有助于缩短机械臂运动时间,提高工作效率,在机械臂实际应用场景中起着至关重要的作用.针对串联机械臂点到点运动的时间最优轨迹规划问题,提出一种基于改进多种群遗传算法的最优轨迹规划方法.通过五次多项式插值对机械臂运动路径进行拟合,利用改进的多种群遗传算法对机械臂运动时间进行优化,改进之处包括:设计含有惩罚项的...     

基于改进灰狼算法的机械臂力矩最优轨迹研究

针对求解机械臂关节驱动力矩最小化问题，提出一种改进灰狼算法（GWO）对机械臂关节驱动力矩进行优化。首先，以五次多项式对机械臂进行轨迹插值，以机械臂各关节的角度、角速度、角加速度为约束条件，以各关节最小驱动力矩均值和为目标函数，建立了I力矩最优轨迹规划问题的数学模型；其次，为提高传统灰狼算法(GWO)的性能，提出了一种基于非线性控制参数策略的改进灰狼算法，用GWO对I机械臂运行轨迹进行优化求解，得到机械臂关节力矩均值和最小的运行路径，并与GWO、粒子群算法（PSO）进行对比。仿真实验表明，GWO收敛时间更短，所得最优力矩和更小，且规划出的机械臂各关节角度、速度曲线光滑、加速度曲线连续，验证了该力矩优化方法的有效性。     

机械臂最优运动规划问题的混合求解

提出一种基于GA和SQP求解机械臂最优运动规划问题的混合算法．首先采用B样条函数逼近关节运动轨迹，将最优控制问题转化为有约束的非线性规划问题，然后引入基于种群的GA算法，给出全局最优解的初始估计；最后利用序列二次规划(SQP)得到高精度全局最优解．仿真结果表明该方法优于单纯的GA或SQP方法。     

基于运动学模型重构的单关节故障机械臂容错路径规划

针对单关节故障机械臂的路径规划问题,提出一种基于运动学模型重构的容错路径规划方法.首先基于旋量理论进行单关节故障机械臂的通用运动学模型重构;然后分析机械臂的退化工作空间,并以运动性能平稳为约束对其进行栅格化处理;最后通过改进传统的A$^\ast$算法,在退化工作空间中搜索出能够满足任务要求的轨迹.以七自由度机械臂为对象进行仿真实验,验证了所提出方法的正确性和有效性.     

Adaptive end-effector pose control for tomato harvesting robots

This paper investigates the development of a tomato-harvesting robot operating on a plant factory and primarily studies the reachable pose of tomatoes in the nondexterous workspace of manipulator. The end-effector can only reach the tomatoes with reachable poses when the tomatoes are within the nondexterous workspace. If the grasping pose is not reachable, it will lead to grasping failure. An adaptive end-effector pose control method based on a genetic algorithm (GA) is proposed to find a reachable pose. The inverse kinematic solution based on analysis method of the manipulator is analyzed and the objective function of whether the manipulator has a solution or not is obtained. The grasping pose is set as an individual owing to the position of the tomatoes is fixed and the grasping pose is variable. The GA is used to solve until a pose that can make the inverse kinematics have a solution is generated. This pose is the reachable grasping pose of the tomato at this position. The quintic interpolation polynomial is used to plan the trajectory to avoid damage to tomatoes owing to fast approaching speed and a distance based background filtering method is proposed. Experiments were performed to verify the effectiveness of the proposed method. The radius of the workspace of the UR3e manipulator with the end-effector increased from 550 to 800 mm and the grasping range expanded by 208%. The harvesting success rate using the adaptive end-effector pose control method and trajectory planning method was 88%. The cycle of harvesting a tomato was 20 s. The experimental results indicated that the proposed tomato-recognition and end-effector pose control method are feasible and effective.     

基于带约束S型速度曲线的机械手笛卡尔空间轨迹规划

针对机械手在笛卡尔空间中轨迹规划问题，设计基于S型速度曲线的空间直线和空间圆弧插补算法。增加路径长度约束，将S型速度规划分为七段式、六段式、五段式和四段式4种类型；建立基于四元数的直线与圆弧运动的位姿模型，并采用弧长增量法插补技术实现轨迹规划。在六自由度机械手实时控制平台上进行了实验验证。结果表明:该算法可实现在路径长度约束下速度和加速度的自动调整；该算法可保证机械手末端加速度连续，有效减少冲击。     

基于QPSO算法的机器人时间最优轨迹规划

在考虑关节约束的前提下,为得到工业机器人时间最优的关节运动轨迹,提出一种工业机器人时间最优轨迹规划新算法。采用五次非均匀B样条插值法构造各关节运动轨迹,得到的机器人各关节位置准确,各关节速度、加速度和加加速度曲线连续。利用量子行为粒子群优化算法(Quantum-behaved Particle Swarm Optimization,简称QPSO)进行时间最优的轨迹规划,该算法可以在整个可行域上搜索,具有较强的全局搜索能力。与标准粒子群算法(Particle Swarm Optimization,简称PSO)和差分进化算法(Differential Evolution Algorithm,简称DE)相比较,结果显示使用该算法进行时间最优的轨迹规划得到的数值结果更小。     

Time-optimal trajectory planning in cable-based manipulators

In this paper, the trajectory planning of high-speed cable-based parallel manipulators is studied for a given geometrical path. The time-optimal trajectory-planning technique is adapted for these manipulators in which cable forces must be maintained tensile. This condition is represented as a constraint on the acceleration of the end-effector along the path. The results of this technique are evaluated experimentally on DeltaBot, a cable-based manipulator developed at the University of Waterloo. The performance of the time-optimal technique is examined both for the moving time of the manipulator and the computational time of the trajectory generation.     

基于能耗优化的深海电动机械臂轨迹规划

由于深海电动机械臂动力学模型较为复杂,难以基于动力学模型构建精确的能耗优化目标函数,因此,本文提出一种利用径向基函数（RBF）神经网络构建机械臂功耗模型的方法．首先,利用机械臂水下运动实验数据集训练所构建的RBF神经网络．利用基于该神经网络的功耗模型,结合机械臂关节空间轨迹规划多项式,建立机械臂能耗目标函数．然后,采用自适应粒子群优化（PSO）算法求解最优轨迹参数．结果显示,RBF功耗网络均方根误差（RMSE）为20.89 W;经过优化的轨迹的能耗比实验轨迹的能耗均值降低410.8 J（18.3%）．实验结果表明基于自适应PSO算法的轨迹规划方法实现了能耗优化的目标．     

Smooth trajectory planning for a parallel manipulator with joint friction and jerk constraints

In order to achieve better tracking accuracy effectively, a new smooth and near time-optimal trajectory planning approach is proposed for a parallel manipulator subject to kinematic and dynamic constraints. The complete dynamic model is constructed with consideration of all joint frictions. The presented planning problem can be solved efficiently by formulating a new limitation curve for dynamic constraints and a reduced form for jerk constraints. The motion trajectory is planned with quartic and quintic polynomial splines in Cartesian space and septuple polynomial splines in joint space. Experimental results show that smaller tracking error can be obtained. The developed method can be applied to any robots with analytical inverse kinematic and dynamic solutions.     

Time-optimal and Smooth Trajectory Planning for Robot Manipulators

This paper presents a practical time-optimal and smooth trajectory planning algorithm and then applies it to robot manipulators. The proposed algorithm uses the time-optimal theory based on the dynamics model to plan the robot’s motion trajectory, constructs the trajectory optimization model under the constraints of the geometric path and joint torque, and dynamically selects the optimal trajectory parameters during the solving process to prominently improve the robot’s motion speed. Moreover, the proposed algorithm utilizes the input shaping algorithm instead of the jerk constraint in the trajectory optimization model to achieve a smooth trajectory. The input shaping of trajectory parameters during postprocessing not only suppresses the residual vibration of the robot but also takes the signal delay caused by traditional input shaping into account. The combination of these algorithms makes the proposed time-optimal and smooth trajectory planning algorithm ensure absolute time optimality and achieve a smooth trajectory. The results of an experiment on a six-degree-of-freedom industrial robot indicate the validity of the proposed algorithm.