Optimum Path of an Airplane -- Minimum Time to Climb

T. Theodorsen
{"title":"Optimum Path of an Airplane -- Minimum Time to Climb","authors":"T. Theodorsen","doi":"10.2514/8.8239","DOIUrl":null,"url":null,"abstract":"In this paper, the theory of variation is applied to the determination of the minimum time to climb for an airplane of constant weight. I t is evident that when sufficient boundary conditions are given—that is, for the beginning and the end point of the path—there is one and only one curve corresponding to the minimum time to climb. Because of the relative complexity of the resulting differential equation, it is convenient to generate such paths by a step-by-step procedure. The end point is then bracketed by proper choice of the higher derivatives at the origin. I t is evident that any decrease in weight during the time of the flight may also be properly bracketed by solving for the two limiting cases of initial and final weights of the airplane. I t will be observed, however, that the decrease in weight is actually too small to be of significance on the shape of the path. The solution is in a form which readily lends itself to routine machine calculation. Numerical calculations have been completed fcr a large number of cases pertaining to the Republic F-105 fighterbomber. Experimental flight tests are in the planning stage.","PeriodicalId":336301,"journal":{"name":"Journal of the Aerospace Sciences","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the Aerospace Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2514/8.8239","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this paper, the theory of variation is applied to the determination of the minimum time to climb for an airplane of constant weight. I t is evident that when sufficient boundary conditions are given—that is, for the beginning and the end point of the path—there is one and only one curve corresponding to the minimum time to climb. Because of the relative complexity of the resulting differential equation, it is convenient to generate such paths by a step-by-step procedure. The end point is then bracketed by proper choice of the higher derivatives at the origin. I t is evident that any decrease in weight during the time of the flight may also be properly bracketed by solving for the two limiting cases of initial and final weights of the airplane. I t will be observed, however, that the decrease in weight is actually too small to be of significance on the shape of the path. The solution is in a form which readily lends itself to routine machine calculation. Numerical calculations have been completed fcr a large number of cases pertaining to the Republic F-105 fighterbomber. Experimental flight tests are in the planning stage.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
飞机的最佳路径——最短爬升时间
本文将变分理论应用于定重飞机的最小爬升时间的确定。很明显,当给出足够的边界条件时,即对于路径的起点和终点,有且只有一条曲线对应于最小爬升时间。由于所得到的微分方程相对复杂,用一步一步的方法生成这样的路径是很方便的。然后通过在原点处适当选择高导数来括起终点。显然,在飞行期间的任何重量减少也可以通过求解飞机的初始重量和最终重量这两种极限情况来适当地括起来。然而,可以观察到,重量的减少实际上太小,对路径的形状没有意义。解的形式很容易用于常规的机器计算。已经完成了关于共和国F-105战斗轰炸机的大量案例的数值计算。实验飞行测试正处于计划阶段。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Energy Harvesting Process Modelling of an Aeronautical Structural Health Monitoring System Using a Bond-Graph Approach Deflection of Structures Using Principle of Quasi Work Target-Multiplicity Analysis of CML Processor for Partially-Correlated χ2 Targets Robust Active Vibration Control of Smart Structures; a Comparison between Two Approaches: µ-Synthesis & LMI-Based Design Performance Analysis of CFAR Detection of Fluctuating Radar Targets in Nonideal Operating Environments
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1