DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | 안재명 | - |
dc.contributor.author | Lee, DongUk | - |
dc.contributor.author | 이동욱 | - |
dc.date.accessioned | 2024-08-08T19:31:50Z | - |
dc.date.available | 2024-08-08T19:31:50Z | - |
dc.date.issued | 2024 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=1100129&flag=dissertation | en_US |
dc.identifier.uri | http://hdl.handle.net/10203/322220 | - |
dc.description | 학위논문(박사) - 한국과학기술원 : 항공우주공학과, 2024.2,[v, 100 p. :] | - |
dc.description.abstract | This thesis introduces a two-phase framework to optimize a multitarget rendezvous mission using various rendezvous trajectory options and associated propulsion systems. In a space environment, multitarget rendezvous missions are more complex than typical routing problem optimization due to “the characteristics of the target moving,’ ‘the varying cost between targets over time,’ and ‘the characteristics of diverse transfer strategies,’ which are classified as a mixed integer nonlinear programming. To efficiently explore this problem, the first phase of the framework generates a single-target rendezvous trajectory consisting of various trajectory options. The second phase designs the multitarget rendezvous mission by combining the elementary solutions using an integer linear programming formulation. A series of case studies to demonstrate the validity of the proposed formulation and solution procedure are presented. | - |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | 랑데부▼a다수 대상체▼a최적화▼a궤도상 서비스 | - |
dc.subject | Rendezvous▼aMultitarget▼aOptimization▼aOn-orbit servicing | - |
dc.title | Optimal multi-target on-orbit servicing design with multi-mode propulsion | - |
dc.title.alternative | 복수 모드 추진 시스템을 고려한 복수 목표물 궤도상 서비스 최적 설계 | - |
dc.type | Thesis(Ph.D) | - |
dc.identifier.CNRN | 325007 | - |
dc.description.department | 한국과학기술원 :항공우주공학과, | - |
dc.contributor.alternativeauthor | Ahn, Jaemyung | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.