自由时间最优控制问题的一种控制向量参数化方法

针对自由时间最优控制问题,提出一种控制向量参数化（CVP）方法.通过引入时间尺度因子,将自由时间最优控制问题转化为固定时间问题,并将终端时刻作为优化参数.基于CVP方法,最优控制问题被转化为一个非线性规划（NLP）问题.建立目标和约束函数的Hamiltonian函数,通过求解伴随方程获得目标和约束函数的梯度,采用序列二次规划（SQP）方法获得问题的数值解.对于控制有切换结构的优化问题,给出了一种网格精细化策略,以提高控制质量.补料分批反应器最优控制问题的仿真实验验证了所提出方法的有效性.     

微生物批式流加发酵过程中的时滞最优控制

考虑到1, 3-丙二醇(1, 3-PD)批式流加发酵过程中的时滞现象,提出一个非线性时滞微分方程来描述该过程.以终端时刻1, 3-PD的单位时间产量作为性能指标,同时,以甘油和碱的流加速度、发酵过程的终端时刻作为控制向量,建立一个含控制和状态约束的时滞最优控制模型.为了求解该最优控制问题,首先通过时间尺度变换,将该最优控制问题转化为具有固定终端时刻的等价最优控制问题;然后,应用控制参数化方法,将等价的最优控制问题用一系列有限维优化问题来近似;最后,构造一种改进的粒子群优化方法来求解相应的近似优化问题.数值结果表明,终端时刻的1, 3-PD的单位时间产量比已有结果提高了约58%.     

移动机器人速度加速度饱和约束下的时间最优控制

针对机器人运动系统中普遍存在的速度和加速度约束, 提出一种满足以上约束的机器人运动时间最优控制方法. 首先, 通过最优条件构造哈密尔顿函数, 根据极小值原理求解时间最优控制; 其次, 通过相轨迹分析, 证明了满足约束的时间最优控制律的形式; 再次, 通过求解最优时间, 将满足约束的时间最优控制律转换成末端时间为最优时间的燃料最优控制律; 最后, 在RoboCup 小型足球机器人上进行对比实验, 验证了该方法在规划与实际上的一致性.     

飞行器上升段轨迹的优化设计

针对飞行器上升段轨迹优化求解困难的问题,提出一种基于正交配点的优化求解方法。该方法以第二类切比雪夫正交多项式的零点作为系统控制变量和状态变量的离散点,利用拉格朗日插值多项式对状态和控制变量进行拟合。通过对多项式的求导将动力学微分方程约束转化为代数约束,从而把无限维的最优控制问题转化为一个有限维的非线性规划(Nonlinear Programming,NLP)问题。随后,利用序列二次规划(Sequential Quadratic Program-ming,SQP)方法求解转化后的NLP问题,获得最优的飞行轨迹。最后,飞行器上的仿真结果验证了所提方法的有效性。研究成果可为飞行器的制导控制提供可行的飞行轨迹,有一定的工程应用价值。     

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

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

基于APSO的微纳卫星编队轨迹规划方法

针对微纳卫星编队在指定时间内由初始构型到指定构型的路径规划问题,提出了一种基于自适应惯性权重粒子群优化(adaptive-inertial-weightedparticleswarmoptimization,APSO)算法的轨迹规划方法。首先,通过Radau伪谱法将轨迹规划的连续最优控制问题离散化为参数优化的非线性规划(nonlinear programming, NLP)问题;其次,采用APSO算法对NLP问题求解,避免了复杂梯度求解困难的问题,同时降低了计算量;最后,通过仿真实验表明,所提方法可在更短时间内求得满足约束条件的最优轨迹,以完成在线轨迹规划任务。     

基于Gauss伪谱法的飞机最优目标瞄准控制

为实现战对抗时对逃逸目标的最优瞄准,提出了一种基于高斯伪谱法(GPM)的控制方法。建立了考虑敏捷性、多约束的飞机动态方程,推导了两阶段目标瞄准条件表达式,并设计优化指标,在此基础上将飞机最优瞄准概括为带约束终端时间未知的多阶最优控制问题。利用高斯伪谱法将此连续的边值最优控制问题离散并转化为等价的非线性规划(NLP)问题,通过遗传算法(GA)解算其初值,并应用序列二次规划(SQP)算法求解。仿真结果表明：所设计的控制方法能有效实现对目标的瞄准,满足武器发射条件。     

基于Radau伪谱法的重复使用运载器再入轨迹优化

为了提高数值解法的收敛速度,本文利用Radau伪谱法求解重复使用运载器的再入轨迹优化问题.该方法在一组Legendre-Gauss-Radau点上构造全局Lagrange插值多项式对状态变量和控制变量进行逼近,在动力学方程中状态变量对时间的导数可由插值多项式的导数来近似,故可将动力学方程约束转化为在Legendre-Gauss-Radau点上的代数微分方程约束.因此,可将连续时间的最优控制问题转化为有限维的非线性规划(NLP)问题,之后通过稀疏NLP求解器SNOPT即可对其进行求解.最后的仿真结果显示,通过该方法优化后的再入轨迹成功满足过程约束与边界约束.由于该方法的高效率和高精度特性,可将其应用于轨迹快速优化工程实际问题中.     

基于伪谱法的双摆吊车时间最优消摆轨迹规划策略

在工业生产过程中,桥式吊车系统经常会体现出双摆系统的特性,导致更多欠驱动状态量的出现,增大控制难度.基于此,论文提出了一种针对双摆桥式吊车系统的时间最优轨迹规划方法,可以得到全局时间最优且具有消摆能力的轨迹.具体而言,为方便地构造以时间为代价函数的优化问题,首先对系统运动学模型进行相应的变换;在此基础上,考虑包括两级摆角及台车速度和加速度上限值在内的多种约束,构造出相应的优化问题;然后,利用高斯伪谱法(Gauss-pseudospectral method, GPM)将该带约束的优化问题转化为更易于求解的非线性规划问题,且在转化过程中,可以非常方便地考虑轨迹约束.求解该非线性规划问题,即可得到时间最优的台车轨迹.不同于已有的大多数方法,该方法可获得全局时间最优的结果.最后,通过仿真与实验结果验证了这种时间最优轨迹规划方法具有满意的控制性能.     

多约束下基于能量耗散的再入轨迹优化设计

研究了多约束条件下的再入轨迹优化设计.引入了能量的概念,以它替代时间作为积分变量,解决了再入过程的时间不确定问题.在此摹础上,依据再入段特性确定出控制变量的大致模型,从而将对最优控制变量的寻找转化为对控制模型参数的优化,使得优化控制易f实现;对过程约束和终端状态约束进行处理,构成性能指标函数的辅助部分,从而将有约束优化问题转化为无约束优化问题,然后用单纯形替换法来求解.仿真结果表明方法能够比较快速地获得一条满足再入约束条件的优化轨迹,且优化算法简单,容易实现,具有较好的工程应用前景.     

Smooth time-optimal tool trajectory generation for CNC manufacturing systems

An optimization approach is proposed in this paper for generating smooth and time-optimal path constrained tool trajectory for Cartesian computer numerical control (CNC) manufacturing systems. The desired smooth time-optimal trajectory generation (STOTG) problem is formulated as a general optimal control problem. And axis jerk (derivative of acceleration with respect to time) constraints are introduced into this problem to remove discontinuities of the acceleration profiles. The desired smoothness of the trajectory can be accomplished by adjusting the values of jerk constraints. A control vector parameterization (CVP) method is applied to convert the optimal control problem into a nonlinear programming (NLP) problem which can be solved conveniently and effectively. The third derivative of the path parameter with respect to time (pseudo-jerk) and jerk act as optimization variables. The pseudo-jerk is approximated as piecewise constant, thus for at least second-order continuous parametric path, the resulted optimized trajectory with respect to time is also at least second-order continuous. Sequential quadratic programming (SQP) method is used to solve the NLP problem, through which numerical solution is obtained. Non-smooth (i.e. without considering jerk constraints) time-optimal trajectory generation (non-STOTG) problem is also considered in this paper for the purpose of comparison. Solutions of time-optimal trajectory generation (TOTG) problems for two test paths are performed to verify the effectiveness of the proposed approach.     

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.

     

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.     

基于混合遗传算法的工业机器人最优轨迹规划

为兼顾工业机器人工作效率与轨迹的平稳性,提出一种基于混合遗传算法的二次轨迹规划方案.通过最优时间轨迹规划得到最小执行时间,在最小执行时间内进行最优冲击轨迹规划,进而规划出一条既高效又平滑的运动轨迹.采用五次均匀B样条在关节空间进行快速插值,不仅保证了各关节速度和加速度连续性还保证了各关节冲击的连续性.连续平滑的冲击可以减少机械振动,延长机器人的工作寿命.选用PUMA560为对象进行仿真与实验,结果表明,该方案可以获得比较理想的机器人运动轨迹,所提出的混合遗传算法能有效提高全局寻优的性能和算法运行的稳定性.     

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.     

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.     

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

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