基于SQP算法的7000m载人潜水器有约束非线性控制分配研究

以7000m载人潜水器为研究对象,分析了潜水器的推进系统,并给出了6自由度推力转换模型,重点讨论了载人潜水器控制分配的优化问题.结合7000m载人潜水器的推进器布置和推进器特点,设计了优化准则代价函数,采用序列二次规划(sequential quadratic programm ing,SQP)算法求解了载人潜水器的非线性控制分配问题,通过半物理仿真平台实验验证了本文提出的控制分配算法的正确性和有效性.yh

On a Degenerate Parabolic Problem in Holder Spaces

In this paper, we study some degenerate parabolic equation with Cauchy-Dirichlet boundary conditions. This problem is considered in little Holder spaces. The optimal regularity of the solution v is obtained and is specified in terms of those of the second member when some conditions upon the Holder exponent with respect to the degeneracy are satisfied. The proofs mainly use the sum theory of linear operators with or without density of domains and the results of smoothness obtained in the study of some abstract linear differential equations of elliptic type.

Algorithm Studies on How to Obtain a Conditional Nonlinear Optimal Perturbation (CNOP)

The conditional nonlinear optimal perturbation (CNOP), which is a nonlinear generalization of the linear singular vector (LSV), is applied in important problems of atmospheric and oceanic sciences, including ENSO predictability, targeted observations, and ensemble forecast. In this study, we investigate the computational cost of obtaining the CNOP by several methods. Differences and similarities, in terms of the computational error and cost in obtaining the CNOP, are compared among the sequential quadratic programming (SQP) algorithm, the limited memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) algorithm, and the spectral projected gradients (SPG2) algorithm. A theoretical grassland ecosystem model and the classical Lorenz model are used as examples. Numerical results demonstrate that the computational error is acceptable with all three algorithms. The computational cost to obtain the CNOP is reduced by using the SQP algorithm. The experimental results also reveal that the L-BFGS algorithm is the most effective algorithm among the three optimization algorithms for obtaining the CNOP. The numerical results suggest a new approach and algorithm for obtaining the CNOP for a large-scale optimization problem.

Theoretical and experimental research on time-optimal trajectory planning and control of industrial robots

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