首页 | 本学科首页   官方微博 | 高级检索  
     检索      

月球最优软着陆两点边值问题的数值解法
引用本文:王大轶,李铁寿,马兴瑞.月球最优软着陆两点边值问题的数值解法[J].航天控制,2000,18(3):44-49,55.
作者姓名:王大轶  李铁寿  马兴瑞
作者单位:1. 北京控制工程研究所,北京100080
2. 中国航天科技集团公司,北京100830
基金项目:中国科学院资助项目,19782004,
摘    要:对于月球软着陆,燃耗最优是制导过程的基本要求.文中首先应用极大值原理设计了最优着陆制导控制律,此时求解最优轨迹变成一个两点边值问题(TPBVP).本文利用一种基于初值猜测技术的打靶法求解这个两点边值问题,得到软着陆最优轨迹.结果表明该方法可有效改善迭代计算,具有一定的优越性.

关 键 词:月球软着陆  最优轨迹  两点边值问题
修稿时间:1999-12-01

Numerical Solution of TPBVP in Optimal Lunar Soft Landing
Wang Dayi,Li Tieshou,Ma Xingrui.Numerical Solution of TPBVP in Optimal Lunar Soft Landing[J].Aerospace Control,2000,18(3):44-49,55.
Authors:Wang Dayi  Li Tieshou  Ma Xingrui
Institution:Wang Dayi ,Li Tieshou (Beijing Institute of Control Benineering, 100080)Ma Xingrui (China Aerospace Science Corporation, 100830)
Abstract:Minimal fuel guidance is the primary demand for lunar soft landing. First, the Maximum principle is used to generate an optimal guidance law for lunar landing, and the TPBVP is to be solved as a result of the numerical solution for optimal trajectory. In this paper, shooting methods based on an initial variable guess technique are proposed to solve the TPBVP, and the optimal landing trajectory is obtained. A simulation result is given to demonstrate the feasibility of the improved method for iteration calculation.
Keywords:Lunar soft landing  Optimal trajectory TPBVP
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号