Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Computer Simulation》 2007-12
Add to Favorite Get Latest Update

Fast Optimization of Trajectory for Lunar Soft Landing

TANG Qiong(College of Astronautics,Northwestern Polytechnical University,Xi'an Shanxi 710072,China)  
Determining how to find the best controls of the lunar landing vehicle so that it is able to safely reach surface of the moon involves the solution of a two-point boundary value problem.This problem,which is considered to be difficult,is traditionally solved on the ground prior to flight.The optimal controls are found regardless of computing time by using most of algorithms.However,it's crucial to find the optimal controls in real-time for some landing tasks.Traditional trajectory optimal algorithm can not perform this fast optimization task.In this work,a new hypothesis is introduced according to the distinguished features of lunar and the character of soft landing trajectory.The set of dynamics and kinematics equations of motion is simplified,which improves the efficiency of optimization greatly.Then the methods of multipliers are used to deal with the terminal constraints.Later the Conjugate-Gradient Method is applied to evaluate the soft landing trajectory.Successful results show that the algorithm is able to generate a feasible soft landing trajectory of about 600 seconds flight time in 3 seconds on the desktop computer.
【CateGory Index】: V476.3
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved