【摘要】：在當(dāng)今世界,航天事業(yè)是衡量一個國家科技水平的重要標(biāo)志。航天事業(yè)的發(fā)展是復(fù)雜而又艱難的,它涉及的領(lǐng)域幾乎遍布各個行業(yè)范圍,越來越受到廣泛的關(guān)注�？臻g交會技術(shù)與天地往返技術(shù)、太空行走技術(shù)并列為載人航天三大重要技術(shù),由此可見其在航天技術(shù)之中的重要性。盡管各國已經(jīng)多次完成了交會對接任務(wù),然而由于其本身的復(fù)雜性和高風(fēng)險的本質(zhì),尚不能說這項技術(shù)已經(jīng)成熟。另外由于航天事業(yè)的高成本、高消耗,如何設(shè)計變軌過程以達(dá)到節(jié)省燃料和減少轉(zhuǎn)移時間等目的也是很值得研究和探討的。本文針對航天交會理論的Lambert問題進(jìn)行了詳細(xì)闡述。同時,根據(jù)航天器的軌道根數(shù)和速度及位置矢量在地球慣性坐標(biāo)系下進(jìn)行軌道建模,分別采用枚舉法、遺傳算法和和聲搜索算法三種智能優(yōu)化算法對軌道進(jìn)行優(yōu)化設(shè)計,對三種不同前提進(jìn)行了深入研究,主要研究內(nèi)容包括以下幾個方面。首先,建立軌道優(yōu)化問題的數(shù)學(xué)模型及目標(biāo)和飛行器的動力學(xué)模型。為清晰描述航天器交會過程,首先介紹了衛(wèi)星的二體問題、軌道根數(shù)等基礎(chǔ)知識。并建立了軌道根數(shù)和速度矢量及位置矢量的轉(zhuǎn)換式,為后續(xù)的Lambert問題分析及軌道優(yōu)化設(shè)計奠定基礎(chǔ)。其次,針對航天交會中的異面轉(zhuǎn)移Lambert問題,分別采取三種方法:半長軸迭代的二分法、Battin-Vaughan算法和曲線交點提取法求解Lambert問題。闡述了三種算法的核心思想和求解步驟。利用兩個算例仿真驗證了三種算法的有效性,并對三種算法的效率和精確性進(jìn)行了比較分析得出結(jié)論。最后,對轉(zhuǎn)移軌道優(yōu)化問題依次從參數(shù)的選取、目標(biāo)函數(shù)的定義、約束條件的分析、優(yōu)化算法的選擇四個方面依次展開。首先分析空間約束條件,分別研究真近點角和轉(zhuǎn)移時間對燃料消耗的影響。分別以燃料消耗和轉(zhuǎn)移時間為優(yōu)化指標(biāo)對轉(zhuǎn)移軌道交會系統(tǒng)進(jìn)行單目標(biāo)和多目標(biāo)優(yōu)化設(shè)計。分別采用枚舉法、遺傳算法和和聲搜索算法作為主要優(yōu)化方法,闡述三種方法的核心思想和設(shè)計思路,結(jié)合過程約束,對三種優(yōu)化算法仿真驗證了準(zhǔn)確性,并對三種方法進(jìn)行了比較研究,為異面橢圓的轉(zhuǎn)移軌道優(yōu)化設(shè)計提供參考和決策依據(jù)。
[Abstract]:In today's world, aerospace is an important symbol of a country's scientific and technological level. The development of aerospace industry is complex and difficult. Space rendezvous technology, space walking technology and space walking technology are three important technologies of manned spaceflight, which shows their importance in spaceflight technology. Although rendezvous and docking missions have been completed many times, the technology cannot be said to be mature due to its complexity and high risk nature. In addition, because of the high cost and high consumption of the aerospace industry, how to design the orbit transfer process to save fuel and reduce the transfer time is also worth studying and discussing. In this paper, the Lambert problem of space rendezvous theory is discussed in detail. At the same time, according to the orbit root number, velocity and position vector of the spacecraft, the orbit is modeled in the earth inertial coordinate system. Three intelligent optimization algorithms, enumeration method, genetic algorithm and harmony search algorithm, are used to optimize the orbit design. Three different premises are studied in depth, the main research contents include the following aspects. Firstly, the mathematical model of orbit optimization problem and the dynamic model of target and vehicle are established. In order to describe the process of spacecraft rendezvous clearly, the basic knowledge of satellite two-body problem, orbital root number and so on is introduced. The transformation formula of orbit root number, velocity vector and position vector is established, which lays a foundation for the following Lambert problem analysis and orbit optimization design. Secondly, aiming at the cross-plane transfer Lambert problem in the rendezvous, three methods are adopted: the semi-long-axis iterative dichotomy and the curve intersection extraction method to solve the Lambert problem. The core idea and solving steps of the three algorithms are expounded. The effectiveness of the three algorithms is verified by two examples, and the efficiency and accuracy of the three algorithms are compared and analyzed. Finally, the optimization problem of transfer orbit is developed from four aspects: the selection of parameters, the definition of objective function, the analysis of constraint conditions, and the selection of optimization algorithm. Firstly, the space constraint conditions are analyzed, and the effects of true proximity angle and transfer time on fuel consumption are studied respectively. The single objective and multi-objective optimization design of the transfer orbit rendezvous system is carried out with the fuel consumption and transfer time as the optimization index respectively. The enumeration method, genetic algorithm and harmony search algorithm are used as the main optimization methods respectively. The core ideas and design ideas of the three methods are expounded. The accuracy of the three optimization algorithms is verified by the simulation of the three optimization algorithms combined with the process constraints. The three methods are compared and studied to provide the reference and decision basis for the optimal design of the transfer orbit of the cross-plane ellipse.
【學(xué)位授予單位】：哈爾濱工業(yè)大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2015
【分類號】：V412.41

【參考文獻(xiàn)】

相關(guān)期刊論文 前4條

1 張洪波;鄭偉;湯國建;;混合遺傳算法在遠(yuǎn)程交會軌道設(shè)計中的應(yīng)用[J];航天控制;2006年02期

2 韓潮,謝華偉;空間交會中多圈Lambert變軌算法研究[J];中國空間科學(xué)技術(shù);2004年05期

3 鄭永煌;;空間交會對接技術(shù)[J];自然雜志;2011年06期

4 劉士明;董長虹;周韜;;基于高斯偽譜法的時間可變多級攔截彈最優(yōu)彈道設(shè)計[J];戰(zhàn)術(shù)導(dǎo)彈技術(shù);2013年03期

相關(guān)博士學(xué)位論文 前1條

1 羅亞中;空間最優(yōu)交會路徑規(guī)劃策略研究[D];國防科學(xué)技術(shù)大學(xué);2007年

相關(guān)碩士學(xué)位論文 前1條

1 梁海伶;和聲搜索算法在函數(shù)優(yōu)化問題中的應(yīng)用研究[D];東北大學(xué)　;2009年

，

本文編號：2173921