間接法在多航天器到指定軌道半?yún)f(xié)同交會(huì)問題中的應(yīng)用.pdf_第1頁
已閱讀1頁,還剩92頁未讀, 繼續(xù)免費(fèi)閱讀

下載本文檔

版權(quán)說明:本文檔由用戶提供并上傳,收益歸屬內(nèi)容提供方,若內(nèi)容存在侵權(quán),請進(jìn)行舉報(bào)或認(rèn)領(lǐng)

文檔簡介

1、With the increase of worldwide space mission, space technology has become a research hotspot and it has beening developing rapidly in recent years.For the general spacecraft trajectory optimization problem, it is a prior

2、ity to reduce fuel consumption,which is relevant to economic cost of the mission.However, for certain emergencies, it is necessary to complete a specific space task in a relatively short period of time.In this paper, the

3、 main content of the study is to gain the optimal trajectory of rapid rendezvous between two or more spacecraft in a determined orbit under finite continuous thrust.The problem of spacecraft trajectory optimization under

4、 finite continuous thrust has the characteristics of strong nonlinearity, strong constraint conditions and multi-peak value.So, it is difficult to solve this kind of optimization problem.For the problem of active and pas

5、sive rendezvous, due to the less spacecraft parameters, using direct collocation method or indirect method can be relatively easy to get good optimization results.However, for the problem of rapid rendezvous between two

6、or more spacecraft,due to the increase of the number of parameters needed to be optimized, especially for non-planar rendezvous problems, extra parameters need to be introduced to represent the time of burn arcs and coas

7、t arcs, it is the difficult to obtain the ideal optimization results by using direct method.Due to the particularity of the rendezvous task, the spacecraft need to complete rendezvous task in the determined orbit and the

8、 rendezvous point can be any point on the orbit, using orbital elements coordinate system can better depict the constraint conditions than using cartesian coordinate system.For rendezvous between two or more spacecraft,

9、orbital elements coordinate system is used in this paper, and the switching function under orbital elements coordinate system is obtained by using Pontryagin maximum principle and variational principle.In addition, owing

10、 to the characteristics of strong nonlinearity, strong constraint conditions and multi-peak value, it is difficult to obtain the ideal optimization result by using the traditional optimization algorithm when dealing with

11、 this problem.Therefore,artificial intelligence optimization method is used to search for the initial value, and then the value is used as an initial value in the traditional optimization algorithm, thus the sensibility

12、of traditional optimization algorithm to the initial value can be overcomed.In the part of the artificial intelligence optimization, penalty function method is used to deal with the constraint of the problem.The accuracy

13、 of solution obtained by artificial intelligence optimization method is not enough, but it is sufficient used as the initial value of the subsequent optimization.The advantages and disadvantages of indirect method and co

14、llocation method are compared and analyzed by comparing the simulation results of several examples,which contain planar and non-planar rendezvous between two or multiple spacecraft.It is found that the simulation results

15、 obtained when the two spacecraft semi-cooperative rendezvous are ideal, the total fuel consumption in the task is almost equal to the sum of the fuel consumption when each of the spacecraft transfer to the determined or

16、bit.In the multiple spacecraft semi-cooperative rendezvous task, the fuel consuption of some spacecraft in the rendezvous task may be more than the fuel consuption when the spacecraft transfer to the determined orbit.Thi

17、s is because the spacecraft need to burn in some inappropriate position.It is found that the radial thrust of every spacecraft is much smaller than the tangential thrust and the normal thrust of the spacecraft when solvi

溫馨提示

  • 1. 本站所有資源如無特殊說明,都需要本地電腦安裝OFFICE2007和PDF閱讀器。圖紙軟件為CAD,CAXA,PROE,UG,SolidWorks等.壓縮文件請下載最新的WinRAR軟件解壓。
  • 2. 本站的文檔不包含任何第三方提供的附件圖紙等,如果需要附件,請聯(lián)系上傳者。文件的所有權(quán)益歸上傳用戶所有。
  • 3. 本站RAR壓縮包中若帶圖紙,網(wǎng)頁內(nèi)容里面會(huì)有圖紙預(yù)覽,若沒有圖紙預(yù)覽就沒有圖紙。
  • 4. 未經(jīng)權(quán)益所有人同意不得將文件中的內(nèi)容挪作商業(yè)或盈利用途。
  • 5. 眾賞文庫僅提供信息存儲(chǔ)空間,僅對用戶上傳內(nèi)容的表現(xiàn)方式做保護(hù)處理,對用戶上傳分享的文檔內(nèi)容本身不做任何修改或編輯,并不能對任何下載內(nèi)容負(fù)責(zé)。
  • 6. 下載文件中如有侵權(quán)或不適當(dāng)內(nèi)容,請與我們聯(lián)系,我們立即糾正。
  • 7. 本站不保證下載資源的準(zhǔn)確性、安全性和完整性, 同時(shí)也不承擔(dān)用戶因使用這些下載資源對自己和他人造成任何形式的傷害或損失。

評論

0/150

提交評論