[논문]Design of Regional Coverage Low Earth Orbit (LEO) Constellation with Optimal Inclination

Shin, Jinyoung; Park, Sang-Young; Son, Jihae; Song, Sung-Chan

doi:10.5140/jass.2021.38.4.217

[국내논문] Design of Regional Coverage Low Earth Orbit (LEO) Constellation with Optimal Inclination 원문보기

Journal of astronomy and space sciences, v.38 no.4, 2021년, pp.217 - 227

Shin, Jinyoung (Astrodynamics and Control Laboratory, Department of Astronomy, Yonsei University) , Park, Sang-Young (Astrodynamics and Control Laboratory, Department of Astronomy, Yonsei University) , Son, Jihae (Hanwha Systems Co., Ltd) , Song, Sung-Chan (Hanwha Systems Co., Ltd)

Abstract ▼ AI-Helper

In this study, we describe an analytical process for designing a low Earth orbit constellation for discontinuous regional coverage, to be used for a surveillance and reconnaissance space mission. The objective of this study was to configure a satellite constellation that targeted multiple areas near the Korean Peninsula. The constellation design forms part of a discontinuous regional coverage problem with a minimum revisit time. We first introduced an optimal inclination search algorithm to calculate the orbital inclination that maximizes the geometrical coverage of single or multiple ground targets. The common ground track (CGT) constellation pattern with a repeating period of one nodal day was then used to construct the rest of the orbital elements of the constellation. Combining these results, we present an analytical design process that users can directly apply to their own situation. For Seoul, for example, 39.0° was determined as the optimal orbital inclination, and the maximum and average revisit times were 58.1 min and 27.9 min for a 20-satellite constellation, and 42.5 min and 19.7 min for a 30-satellite CGT constellation, respectively. This study also compares the revisit times of the proposed method with those of a traditional Walker-Delta constellation under three inclination conditions: optimal inclination, restricted inclination by launch trajectories from the Korean Peninsula, and inclination for the sun-synchronous orbit. A comparison showed that the CGT constellation had the shortest revisit times with a non-optimal inclination condition. The results of this analysis can serve as a reference for determining the appropriate constellation pattern for a given inclination condition.

Keyword

표/그림 (17)

그림 Fig. 1. Geometric relationship between sub-satellite point and ground target.
그림 Fig. 2. Graph of 2D coverage map of circular orbit with h = 500 km and i = 39° for Seoul.
그림 Fig. 3. Three-dimensional coverage graph over selectable inclination range.
그림 Fig. 4. Pseudocode for inclination search algorithm.
그림 Fig. 5. Pseudo code for CGT constellation design. CGT, common ground track.
그림 Fig. 6. Architecture of CGT constellation with optimal inclination. CGT, common ground track.
그림 Fig. 7. Regions of interests (A–J) near the Korean Peninsula.
그림 Fig. 8. Case I design result with 20 satellites.
표 Table 1. Regions of interest and their optimal inclinations
표 Table 2. Weights for 10 regions of interest by design conditions
표 Table 3. Orbital elements of CGT constellation with optimal inclination
그림 Fig. 10. Revisit times of Case II with 20 satellites (left) and 30 satellites (right).
그림 Fig. 9. Revisit times of optimally inclined (i = 39.0°) CGT constellations for region C. CGT, common ground track.
그림 Fig. 11. Revisit times of Case III with 20 satellites (left) and 30 satellites (right).
그림 Fig. 12. Revisit times of Walker-Delta and CGT constellations with inclination of 39.0˚, and optimal inclination for Seoul: 20 satellites (left), and 30 satellites (right). CGT, common ground track.
그림 Fig. 13. Revisit times of restricted (non-optimal) inclination 82.0°, altitude 535 km, under repeat ground track (RGT) condition: 20 satellites (left), and 30 satellites (right).
그림 Fig. 14. Revisit times of Sun-synchronous constellations, inclination 97.6°, altitude 561 km, under repeat-ground-track condition: 20 satellites (left), and 30 satellites (right).

AI 본문요약
AI-Helper

문제 정의

In this study, we describe an analytical approach for designing circular LEO microsatellite constellations for discontinuous regional coverage, which is part of the mission design process of a surveillance and reconnaissance mission for the Korean Peninsula. This study contributes to the study of the regional coverage problem in several ways.

제안 방법

This study contributes to the study of the regional coverage problem in several ways. First, the orbital inclination plays a decisive role in the design of the regional coverage constellation; therefore, we devised an optimal inclination search algorithm that considered both the coverage range of each satellite and the geographical location of the regions of interest. Furthermore, we describe an analytical design process so that users can directly apply it to their own situation without any complex optimization algorithms or iterative dynamic simulations.
Finally, we compare the revisit times of the CGT constellation and the Walker-Delta constellation under optimal and non-optimal inclination conditions. The results of this analysis can be used to determine the appropriate constellation pattern for a given inclination condition (Shin 2021).

성능/효과

For Seoul, for example, 39.0° was obtained as an optimal orbital inclination, and the maximum and average revisit times were 58.1 min and 27.9 min for a 20-satellite constellation, and 42.5 min and 19.7 min for a 30-satellite CGT constellation, respectively
First, as a result of the simulation of the single ground target case (Case I), the maximum, average, and minimum revisit times of the optimally inclined 20-satellite CGT constellation were 58.1 min, 27.9 min, and 0.2 min, respectively. This means the designed constellation pattern ensured a revisit time of less than 60 min with 20 satellites, without any orbital maintenance such as stationkeeping control, for two months.
In this study, we describe an analytical method to design constellations in circular LEOs for discontinuous regional coverage. The search algorithm proposed can determine the best inclination for a given constellation that maximizes the coverage for single or multiple ground regions. The optimal inclination search algorithm considers both the coverage range of the satellite and the location of the regions of interest.
The optimal inclination search algorithm considers both the coverage range of the satellite and the location of the regions of interest. As a result, this study suggests optimal inclinations for single or multiple ground regions. For Seoul, for example, 39.
7 min for a 30-satellite CGT constellation, respectively. Using the proposed algorithm, the revisit times of the CGT constellation were verified by comparing them with those of the Walker-Delta constellation under optimal and nonoptimal inclination conditions. It is clear that the CGT constellation had the shortest revisit times with a nonoptimal inclination condition.
Using the proposed algorithm, the revisit times of the CGT constellation were verified by comparing them with those of the Walker-Delta constellation under optimal and nonoptimal inclination conditions. It is clear that the CGT constellation had the shortest revisit times with a nonoptimal inclination condition. The results of this analysis can be used to determine the appropriate constellation pattern for any specific inclination condition.
The analytical and step-by-step design process yields efficient and optimal results so that there is no need to wait for a lengthy convergence or dynamic simulations, which leads to a faster overall design process for any specific number of satellites. Therefore, it can be used in the early stage of the mission design phase, allowing fast and simple comparisons between different constellation conditions.

후속연구

It is clear that the CGT constellation had the shortest revisit times with a nonoptimal inclination condition. The results of this analysis can be used to determine the appropriate constellation pattern for any specific inclination condition. The analytical and step-by-step design process yields efficient and optimal results so that there is no need to wait for a lengthy convergence or dynamic simulations, which leads to a faster overall design process for any specific number of satellites.
The results of this analysis can be used to determine the appropriate constellation pattern for any specific inclination condition. The analytical and step-by-step design process yields efficient and optimal results so that there is no need to wait for a lengthy convergence or dynamic simulations, which leads to a faster overall design process for any specific number of satellites. Therefore, it can be used in the early stage of the mission design phase, allowing fast and simple comparisons between different constellation conditions.

참고문헌 (20)

Adams WS, Rider L, Circular polar constellations providing continuous single or multiple coverage above a specified latitude, J. Astronaut. Sci. 35, 155-192 (1987).
Ballard AH, Rosette constellations of earth satellites, IEEE Trans. Aerosp. Electron. Syst. AES-16, 656-673 (1980). https://doi.org/10.1109/TAES.1980.308932

상세보기
Beste DC, Design of satellite constellations for optimal continuous coverage, IEEE Trans. Aerosp. Electron. Syst. AES-14, 466-473 (1978). https://doi.org/10.1109/TAES.1978.308608

상세보기
Clarke AC, Extra-terrestrial relays: can rocket stations give worldwide radio coverage? Prog. Astronaut. Rocketry 19, 3-6 (1966). https://doi.org/10.1016/B978-1-4832-2716-0.50006-2
Draim JE, Three- and four-satellite continuous-coverage constellations, J. Guid. Control Dyn. 8, 725-730 (1985). https://doi.org/10.2514/3.20047

상세보기
Fu X, Wu M, Tang Y, Design and maintenance of low-earth repeatground- track successive-coverage orbits, J. Guid. Control Dyn. 35, 686-691 (2012). https://doi.org/10.2514/1.54780

상세보기
Hanson J, Evans M, Turner R, Designing good partial coverage satellite constellations, in Astrodynamics Conference, Portland, OR, 20-22 Aug 1990. https://doi.org/10.2514/6.1990-2901
He Q, Han C, Satellite constellation design with adaptively continuous ant system algorithm, Chin. J. Aeronaut. 20, 297-303 (2007). https://doi.org/10.1016/S1000-9361(07)60047-8

상세보기
Kim Y, Kim M, Han B, Kim Y, Shin H, Optimum design of an SAR satellite constellation considering the revisit time using a genetic algorithm, Int. J. Aeronaut. Space Sci. 18, 334-343 (2017). https://doi.org/10.5139/IJASS.2017.18.2.334

원문보기 상세보기
Lee HW, Shimizu S, Yoshikawa S, Ho K, Satellite constellation pattern optimization for complex regional coverage, J. Spacecr. Rockets. 57, 1309-1327 (2020). https://doi.org/10.2514/1.A34657

상세보기
Luders RD, Satellite networks for continuous zonal coverage, ARS J. 31, 179-184 (1961). https://doi.org/10.2514/8.5422

상세보기
Mortari D, Wilkins MP, Bruccoleri C, The flower constellations, J. Astron. Sci. 52, 107-127 (2004). https://doi.org/10.1007/BF03546424

상세보기
Ortore E, Cinelli M, Circi C, A ground track-based approach to design satellite constellations, Aerosp. Sci. Technol. 69, 458-464 (2017). https://doi.org/10.1016/j.ast.2017.07.006

상세보기
Savitri T, Kim Y, Jo S, Bang H, Satellite constellation orbit design optimization with combined genetic algorithm and semianalytical approach, Int. J. Aerosp. Eng. 2017, 1235692 (2017). https://doi.org/10.1155/2017/1235692

상세보기
Shin JY, Microsatellite constellation design for regional coverage and constellation orbit deployment strategy, Master Thesis, Yonsei University (2021).
Ulybyshev Y, Satellite constellation design for complex coverage, J Spacecr. Rockets. 45, 843-849 (2008). https://doi.org/10.2514/1.35369

상세보기
Vallado DA, Fundamentals of astrodynamics and applications (Microcosm Press, Hawthorne, CA, 2013).
Walker JG, Some circular orbit patterns providing continuous whole earth coverage, J. Br. Interplanet. Soc. 24, 369-384 (1971).
Wertz JR, Larson WJ, Space Mission Analysis and Design (Microcosm Press, Hawthorne, CA 1999).
Zhang TJ, Shen HX, Li Z, Qie H, Cao J, et al., Restricted constellation design for regional navigation augmentation, Acta Astron. 150, 231-239 (2018). https://doi.org/10.1016/j.actaastro.2018.04.044

상세보기

표제어: PCR

동의어: Packet Collision Rate

용어 설명 출처 목록 (6)

용어 설명: PCR은 세균 특이성이 있는 primer를 이용하여 적은 수의 세균이 있을지라도 쉽게 검출할 수 있는 유용한 방법이며, 이를 이용하여 구강 내 치면세균막이나 타액에서 직접 세균을 검출할 수 있게 되었다[8].

내보내기 구분	파일저장 인쇄 메일전송
구성항목	기본정보 상세정보 관리번호, 논문명, 저널/프로시딩명, 저자 , 발행년, 권, 호, 시작페이지, 끝페이지, 발행기관 관리번호, 논문명, 대등논문명, 저자 , 저널/프로시딩명, 발행기관, 발행년, 발행언어, 권, 호, 시작페이지, 끝페이지, ISBN, ISSN, 주제분야, 키워드, 초록(한글), 초록(영문), 저자(소속기관)
저장형식	Text(ASCII format) Excel format RefWorks Direct Export RIS format (for Reference Manager, ProCite, EndNote), Scholar's Aids, Mendeley
메일정보	받는사람 (필수) @ 보내는사람 (선택) @ 제목 내용 KISTI 검색결과 이메일 서비스
안내	총 건의 자료가 검색되었습니다. 다운받으실 자료의 인덱스를 입력하세요. (1-10,000) 검색결과의 순서대로 최대 10,000건 까지 다운로드가 가능합니다. 데이타가 많을 경우 속도가 느려질 수 있습니다.(최대 2~3분 소요) 다운로드 파일은 UTF-8 형태로 저장됩니다. 파일의 내용이 제대로 보이지 않을실 때는 웹브라우저 상단의 보기 -> 인코딩 -> 자동선택 여부를 확인하십시오. ~ Text(ASCII format) Excel format

연합인증