检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]天津大学电气与自动化工程学院,天津300072
出 处:《控制工程》2012年第2期297-300,306,共5页Control Engineering of China
基 金:国家自然科学基金(60874073);天津市自然科学基金(08JCYBJC11900);天津市支撑项目(082CKFJC27900)
摘 要:针对飞行器上升段轨迹优化求解困难的问题,提出一种基于正交配点的优化求解方法。该方法以第二类切比雪夫正交多项式的零点作为系统控制变量和状态变量的离散点,利用拉格朗日插值多项式对状态和控制变量进行拟合。通过对多项式的求导将动力学微分方程约束转化为代数约束,从而把无限维的最优控制问题转化为一个有限维的非线性规划(Nonlinear Programming,NLP)问题。随后,利用序列二次规划(Sequential Quadratic Program-ming,SQP)方法求解转化后的NLP问题,获得最优的飞行轨迹。最后,飞行器上的仿真结果验证了所提方法的有效性。研究成果可为飞行器的制导控制提供可行的飞行轨迹,有一定的工程应用价值。A new method based on orthogonal collocation is proposed to deal with the difficulty of solving the ascent trajectory optimiza- tion problem. Lagrange polynomial is employed to approximate the state and control variables which are discrete values from the zeros of the second Chebyshev polynomial. The constraints of the dynamic differential equations can be transformed into algebraic equation con- straints by deriving the polynomial. As a result, the infinite dimensional optimal control problem is converted to a finite dimensional nonlinear programming (NLP) problem. Following that, the transformed problem can be solved by the sequential quadratic program- ming (SQP) method to obtain the optimal trajectory of a vehicle. Finally, simulation results verify the effectiveness of the proposed method. The results of this study can provide feasible flight trajectory for the guidance and control of a vehicle. Besides that, the appli- cation of this method to engineering is also valuable.
关 键 词:飞行器上升段 轨迹优化 正交配点 非线性规划 序列二次规划
分 类 号:TP273[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.70