Adjacent Grids Algorithm and Dynamics Programming Realization for Minimum Time-to-climb Trajectories

摘要：

This paper deals with the minimum time-to-climb problem, as a basic function of an aircraft during executing the flight mission. After discussing the longitudinal equation of motion, the relationship between consumption time and other state variables is obtained by disposing the aircraft equations of dynamics and motion. Based on the relationship, the time interval between any adjacent grids in the vertical plane is figured out. Finally, the minimum time cost for climbing from one flight point to the target point is calculated by dynamic programming (DP) method. The numerical simulation shows that, the algorithm presented in this paper which based on adjacent grids and DP can find the optimal flight trajectory series which is realizable in designated flight envelope, and the time cost of obtained trajectory serried satisfies with the requirement.

作者: Chen Yali Dong Xinmin Zu Enlin Liao Kaijun

作者单位: Aviation Automatic Control Engineering Department,Engineering Institute,Air Force Engineering University,Xian,Shaanxi,China

会议类型: 国际会议

会议名称: 2009 IEEE International Conference on Information and Automation(2009年 IEEE信息与自动化国际学术会议)

会议地点: 珠海、澳门

会议语种:英文

页码: 703-707

在线出版日期: 2009-06-22（万方平台首次上网日期，不代表论文的发表时间）