基于执行时间约束的机器人关节空间轨迹优化

为在保证机器人运动轨迹的平滑性的条件下提高机器人工作效率,提出一种基于轨迹执行时间归一化处理的关节空间运动轨迹规划优化算法。对轨迹的执行时间进行归一化处理,分析关节空间位置、速度、加速度的运动轨迹相对于归一化时间的数学模型;考虑关节运动参数的约束条件,采用五次多项式拟合机器人在关节空间的运动轨迹,分析不同轨迹执行时间对关节位置运动轨迹的超调量的影响,实现机器人关节空间的位置轨迹优化;在M atlab环境里对机器人的运动轨迹进行仿真建模,完成机器人运动学仿真。多组仿真结果表明,该算法在保证机器人轨迹平滑的基础上,能保证轨迹执行时间最优,有效地提高机器人的运动效率。     

基于PSO的工业机器人时间-脉动最优轨迹规划

为提高工业机器人的工作效率,并且保持机器人关节平稳运动,提出一种基于粒子群优化算法的时间-脉动最优轨迹规划方案;通过权重法将多目标优化转化为单目标优化,再运用粒子群优化算法得到时间-脉动最优的运动轨迹;轨迹规划中,采用了关节空间五次非均匀B样条插值法,以确保脉动曲线的连续性;最后以GRB4016工业机器人为研究对象进行仿真实验,结果表明,该方案可以得到较理想的运动轨迹,并验证了方案的有效性。     

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

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

改进B样条曲线的机器人轨迹拟合研究

以工业生产中常用的六自由度串联机器人PUMA560为研究对象,在关节空间采用改进B样条曲线进行轨迹拟合规划,相比于传统B样条插值与拟合算法显著改善了规划得到的轨迹全局最优解,并基于最优解对各关节进行规划得到时间最优的运动轨迹,验证该算法可以有效提高机器人运行效率的目的.     

工业机器人时间最优轨迹规划及轨迹控制的理论与实验研究

提出了一种用于工业机器人时间最优轨迹规划及轨迹控制的新方法, 它可以确保在关节位移、速度、加速度以及二阶加速度边界值的约束下, 机器人手部沿笛卡尔空间中规定路径运动的时间最短. 在这种方法中, 所规划的关节轨迹都采用二次多项式加余弦函数的形式, 不仅可以保证各关节运动的位移、速度、加速度连续而且还可以保证各关节运动的二阶加速度连续. 采用这种方法, 既可以提高机器人的工作效率又可以延长机器人的工作寿命. 以PUMA 5 6 0机器人为对象进行了计算机仿真和机器人实验, 结果表明这种方法是正确和有效的. 它为工业机器人在非线性运动学约束条件下的时间最优轨迹规划及控制问题提供了一种较好的解决方案.     

基于遗传算法的工业机器人时间最优轨迹规划及仿真研究

为了使工业机器人的末端执行器在任给路径下运行时间最短,在考虑机器人各关节速度、加速度、加加速度和力矩约束的情况下,以PUMA560为例,对工业机器人轨迹进行时间最优规划;在Matlab平台上,对该轨迹规划优化算法进行仿真,仿真结果表明机器人各关节时间最优轨迹规划比未处理的轨迹规划时间明显缩小6.999 4s,6.651 0s,6.351 2s,各个关节的轨迹曲线平滑,从而验证了该算法的有效性。     

基于遗传算法的多机器人系统最优轨迹规划

针对关节型多机器人系统在静态环境下的点到点的轨迹规划问题,提出了一种基于遗传算法的最优轨迹规划策略.采用遗传算法在综合考虑各机器人沿轨迹运动的安全性、运动代价以及运动学约束的基础上为单个机器人规划最优的运动轨迹,并通过协调各机器人沿预定轨迹运行的时间避免机器人之间碰撞的发生.针对含有3个二自由度平面关节型机器人的多机器人系统进行了仿真实验,实验结果验证了该方法的有效性.     

基于6DOF机器人的能耗最优轨迹规划

为研究MOTOMAN-UP6机器人的运动学和轨迹规划,该文采用标准D-H建模方法对该机器人进行运动学建模。基于该机器人的特性,采用了一种可易编程的位姿分离法进行逆运动学分析;因逆解的不唯一性,为使得轨迹的能耗最优,提出关节加权系数对轨迹点之间的关节变量进行处理后,得到最优轨迹;同时为减少机器人在运行中的冲击和振动,采用七次多项式对最优轨迹进行轨迹规划,得到了机器人各关节下的位移、速度、加速度、冲击的仿真曲线,曲线光滑且连续,同时也表明了在关节冲击方面优于五次多项式的规划。     

基于改进鲸鱼算法的机械臂轨迹优化

针对机械臂的轨迹优化问题,提出一种混合策略的改进鲸鱼算法,以达到时间最短、冲击最小的轨迹优化目标.采用五次样条函数拟合关节轨迹,保证冲击平滑连续变化.为证明轨迹优化效果,将提出的改进算法分别与遗传算法、粒子群算法和基本鲸鱼算法进行了一系列性能对比实验.实验数据表明改进后的算法比改进前收敛速度提高2.419倍,适应度值降...     

安全平滑的改进时间弹性带轨迹规划算法

传统TEB(time elastic band)算法在杂乱场景下规划易出现倒退、大转向等异常行为,造成加速度跳变,控制指令不平滑,机器人受到大冲击,不利于移动机器人轨迹跟踪.鉴于此,提出一种改进TEB算法,通过增加危险惩罚因子约束规划更安全的运动轨迹,增加加速度跳变以抑制约束减小运动中的最大冲击,增加末端平滑约束以减小末端冲击,实现目标点平滑、准确到达.构建图优化问题,以机器人的位姿和时间间隔为节点、目标函数和约束函数为边,利用问题的稀疏性快速获得相应时刻点的控制量.最后,通过基于机器人操作系统的大量对比仿真测试以及真实差速机器人上的物理实验对提出的改进TEB算法进行性能验证.结果表明,改进TEB算法在复杂环境中能够规划出更安全、平滑的轨迹,减小机器人所受冲击,实现移动机器人更合理地运动.     

A novel cartesian trajectory planning method by using triple NURBS curves for industrial robots

This article presents a novel method of robot pose trajectory synchronization planning. First of all, based on triple NURBS curves, a method of describing the position and orientation synchronization of the robot is proposed. Then, through considering geometric and kinematic constraints, especially angular velocity constraint, and employing bidirectional interpolation algorithm, a robot pose trajectory planning approach is developed, which has limited linear jerk, continuous bounded angular velocity and approximate optimal time, and does not need an optimization program. Ultimately, two robot pose paths, blade-shaped curve and fan-shaped curve, are utilized for simulations, and the results indicate that the proposed trajectory planning method can satisfy the given constraint conditions, i.e. the linear jerk is limited and the angular velocity is continuous bounded. The trajectory tracking experiments are further carried out on a 6-DOF industrial robot, and the results show that the proposed planning method can generate smooth trajectories to ensure the stability of the robot motion without impact in practical situations.     

A technique for time-jerk optimal planning of robot trajectories

A technique for optimal trajectory planning of robot manipulators is presented in this paper. In order to get the optimal trajectory, an objective function composed of two terms is minimized: a first term proportional to the total execution time and another one proportional to the integral of the squared jerk (defined as the derivative of the acceleration) along the trajectory. This latter term ensures that the resulting trajectory is smooth enough. The proposed technique enables one to take into account kinematic constraints on the robot motion, expressed as upper bounds on the absolute values of velocity, acceleration and jerk. Moreover, it does not require the total execution time of the trajectory to be set a priori. The algorithm has been tested in simulation yielding good results, also in comparison with those provided by another important trajectory planning technique.     

Optimal trajectory planning for industrial robots

An analysis of the results of an algorithm for optimal trajectory planning of robot manipulators is described in this paper. The objective function to be minimized is a weighted sum of the integral squared jerk and the execution time. Two possible primitives for building the trajectory are considered: cubic splines or fifth-order B-splines. The proposed technique allows to set constraints on the robot motion, expressed as upper bounds on the absolute values of velocity, acceleration and jerk. The described method is then applied to a 6-d.o.f. robot (a Cartesian gantry manipulator with a spherical wrist); the results obtained using the two different primitives are presented and discussed.     

Experimental Validation of Minimum Time-jerk Algorithms for Industrial Robots

In this paper, we present a minimum-time/jerk algorithm for trajectory planning and its experimental validation. The algorithm search for a trade-off between the need for a short execution time and the requirement of a sufficiently smooth trajectory, which is the well known necessary condition to limit the vibration during fast movements. The trade-off is achieved by adjusting the weight of two suitable functions, able to consider both the execution time and the squared-jerk integral along the whole trajectory. The main feature of this algorithm is its ability to smooth the trajectory’s profile by adjusting the intervals between two consecutive via-points so that the overall time is minimally delayed. The practical importance of this technique lies in the fact that it can be implemented in any industrial manipulator without a hardware upgrade. The algorithm does not need for a dynamic model of the robot: only the mechanical constraints on the position, velocity and acceleration ranges have to be set a priori. The experimental proof is provided in this paper by comparing the results of the proposed algorithm with those obtained by adopting some classical algorithms.     

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.

     

Simultaneous algorithm for trajectory planning

This paper addresses the solution of smooth trajectory planning for industrial robots in environments with obstacles using a direct method, creating the trajectory gradually as the robot moves. The presented method deals with the uncertainties associated with the lack of knowledge of kinematic properties of intermediate via‐points since they are generated as the algorithm evolves looking for the solution. Several cost functions are also proposed, which use the time that has been calculated to guide the robot motion. The method has been applied successfully to a PUMA 560 robot and four operational parameters (execution time, computational time, distance travelled and number of configurations) have been computed to study the properties and influence of each cost function on the trajectory obtained. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

Feedrate planning for machining with industrial six-axis robots

Nowadays, the adaptation of industrial robots to carry out high-speed machining operations is strongly required by the manufacturing industry. This new technology machining process demands the improvement of the overall performances of robots to achieve an accuracy level close to that realized by machine-tools. This paper presents a method of trajectory planning adapted for continuous machining by robot. The methodology used is based on a parametric interpolation of the geometry in the operational space. FIR filters properties are exploited to generate the tool feedrate with limited jerk. This planning method is validated experimentally on an industrial robot.     

Near Time-Optimal Control of Redundant Manipulators along a Specified Path with Jerks Constraint

A time-optimal control scheme for a general type of closed-chain manipulator is proposed. The considered manipulator is composed of multiple serial manipulators that are connected to each other and single manipulators may be kinematically redundant. Also, the limit on the actuator torques and actuator jerks are considered. The jerk constraints create a smooth trajectory for reducing strain on robot actuators and satisfy torque limitations of industrial actuators. Inclusion of the jerk constraints increases the traversal time, hence, a method is introduced to optimize this time. To this end, a simple method to find switching points is investigated.     

Human-robot collaboration while sharing production activities in dynamic environment: SPADER system

Interactive robot doing collaborative work in hybrid work cell need adaptive trajectory planning strategy. Indeed, systems must be able to generate their own trajectories without colliding with dynamic obstacles like humans and assembly components moving inside the robot workspace. The aim of this paper is to improve collision-free motion planning in dynamic environment in order to insure human safety during collaborative tasks such as sharing production activities between human and robot. Our system proposes a trajectory generating method for an industrial manipulator in a shared workspace. A neural network using a supervised learning is applied to create the waypoints required for dynamic obstacles avoidance. These points are linked with a quintic polynomial function for smooth motion which is optimized using least-square to compute an optimal trajectory. Moreover, the evaluation of human motion forms has been taken into consideration in the proposed strategy. According to the results, the proposed approach is an effective solution for trajectories generation in a dynamic environment like a hybrid workspace.