Seonho Lee
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Seonho Lee has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Daewon Chung
National Satellite Operation & Application Center, Korea Aerospace Research Institute, Daejeon, Republic of Korea
2 shared publications - Dongjin Kim
Department of Aerospace System Engineering, Korea Aerospace Research Institute (KARI) School, University of Science and Technology (UST), 217 Gajeong-ro, Yuseong-gu, Daejeon 34113, Republic of Korea
2 shared publications - Kimoon Lee
Department of Aerospace System Engineering, Korea Aerospace Research Institute (KARI) School, University of Science and Technology (UST), 217 Gajeong-ro, Yuseong-gu, Daejeon 34113, Republic of Korea
2 shared publications Eun-Song Shim
Agency for Defense Development, Daejeon, Republic of Korea
1 shared publicationHae-Dong Kim
Gyeongsang National University, Jinju, Republic of Korea
1 shared publication- Morgan Choi
Department of Aerospace System Engineering, Korea Aerospace Research Institute (KARI) School, University of Science and Technology (UST), 217 Gajeong-ro, Yuseong-gu, Daejeon 34113, Republic of Korea
1 shared publication
Latest Publications
- Open Access
Fuel-Optimal In-Track Satellite Formation Trajectory with J2 Perturbation Using Pontryagin Neural Networks
Satellite formation flying faces significant challenges in maintaining its desired configurations due to various orbital perturbations, particularly in low-Earth-orbit environments. This paper presents a novel approach to generating fuel-optimal reference trajectories for in-track satellite formations by incorporating both the Earth’s oblateness ( perturbation) and the inherent nonlinearity of the two-body problem. The resulting indirect optimal control problem is solved using Pontryagin Neural Networks (PoNNs). The proposed method transforms the conventional two-point boundary value problem into a mathematical programming problem, enabling the efficient computation of optimal trajectories. The effectiveness of our approach is validated through extensive numerical simulations at different inclinations of the chief satellite (0–90°) and cross-track separation distances (1–400 km), demonstrating significant reductions in annual fuel consumption compared to conventional approaches. The feasibility of these optimal trajectories is verified through closed-loop simulations using a PD controller, confirming their practical applicability in realistic mission scenarios. This research contributes to enhancing the long-term sustainability of satellite formation flying missions by optimizing fuel efficiency while maintaining precise formations.Open AccessFuel-Optimal In-Track Satellite Formation Trajectory with J2 Perturbation Using Pontryagin Neural Networks
Satellite formation flying faces significant challenges in maintaining its desired configurations due to various orbital perturbations, particularly in low-Earth-orbit environments. This paper presents a novel approach to generating fuel-optimal reference trajectories for in-track satellite formations by incorporating both the Earth’s oblateness ( perturbation) and the inherent nonlinearity of the two-body problem. The resulting indirect optimal control problem is solved using Pontryagin Neural Networks (PoNNs). The proposed method transforms the conventional two-point boundary value problem into a mathematical programming problem, enabling the efficient computation of optimal trajectories. The effectiveness of our approach is validated through extensive numerical simulations at different inclinations of the chief satellite (0–90°) and cross-track separation distances (1–400 km), demonstrating significant reductions in annual fuel consumption compared to conventional approaches. The feasibility of these optimal trajectories is verified through closed-loop simulations using a PD controller, confirming their practical applicability in realistic mission scenarios. This research contributes to enhancing the long-term sustainability of satellite formation flying missions by optimizing fuel efficiency while maintaining precise formations. - 4 May 2024
- Published by Springer Nature in International Journal of Aeronautical and Space Sciences
- Vol. 25 (3) , 1092-1104
Optimal Multi-impulse Elliptic Rendezvous Using Stagnation Escaping Whale Optimization Algorithm
- 4 May 2024
- Published by Springer Nature in International Journal of Aeronautical and Space Sciences
- Vol. 25 (3) , 1092-1104
Optimal Multi-impulse Elliptic Rendezvous Using Stagnation Escaping Whale Optimization Algorithm
- Open Access
Application of Optimal Scheduling for Synthetic Aperture Radar Satellite Constellation: Multi-Imaging Mission in High-Density Regional Area
This study explores optimizing Synthetic Aperture Radar (SAR) satellite constellation scheduling for multi-imaging missions in densely targeted areas using an in-house-developed Modified Dynamic Programming (MDP) algorithm. By employing Mixed-Integer Linear Programming (MILP) to define the mission planning problem, this research aims to maximize observation of high-value targets within restricted planning horizons. Numerical simulations, covering a wide range of target numbers and satellite configurations, reveal the MDP algorithm’s superior mission allocation efficiency, enhanced success rates, and reduced revisit times compared to the greedy algorithm. The findings underscore the MDP algorithm’s improved operational efficiency and planning robustness for complex imaging tasks, demonstrating significant advancements over traditional approaches.
Open AccessApplication of Optimal Scheduling for Synthetic Aperture Radar Satellite Constellation: Multi-Imaging Mission in High-Density Regional Area
This study explores optimizing Synthetic Aperture Radar (SAR) satellite constellation scheduling for multi-imaging missions in densely targeted areas using an in-house-developed Modified Dynamic Programming (MDP) algorithm. By employing Mixed-Integer Linear Programming (MILP) to define the mission planning problem, this research aims to maximize observation of high-value targets within restricted planning horizons. Numerical simulations, covering a wide range of target numbers and satellite configurations, reveal the MDP algorithm’s superior mission allocation efficiency, enhanced success rates, and reduced revisit times compared to the greedy algorithm. The findings underscore the MDP algorithm’s improved operational efficiency and planning robustness for complex imaging tasks, demonstrating significant advancements over traditional approaches.
- Open Access
- 6 March 2024
- Published by MDPI AG in Preprints.org
Application of Optimal Scheduling for SAR Satellite Constellation: Multi-Imaging Mission in High-Density Regional Area
This study explores optimizing Synthetic Aperture Radar (SAR) satellite constellation scheduling for multi-imaging missions in densely targeted areas using an in-house developed Modified Dynamic Programming (MDP) algorithm. By employing Mixed-Integer Linear Programming (MILP) to define the mission planning problem, the research aims to maximize observation of high-value targets within restricted planning horizons. Numerical simulations, covering a wide range of target numbers and satellite configurations, reveal the MDP algorithm’s superior mission allocation efficiency, enhanced success rates, and reduced revisit times, compared to the Greedy algorithm. The findings underscore the MDP algorithm’s improved operational efficiency and planning robustness for complex imaging tasks, demonstrating significant advancements over traditional approaches.
- 6 March 2024
- Published by MDPI AG in Preprints.org
Open AccessApplication of Optimal Scheduling for SAR Satellite Constellation: Multi-Imaging Mission in High-Density Regional Area
This study explores optimizing Synthetic Aperture Radar (SAR) satellite constellation scheduling for multi-imaging missions in densely targeted areas using an in-house developed Modified Dynamic Programming (MDP) algorithm. By employing Mixed-Integer Linear Programming (MILP) to define the mission planning problem, the research aims to maximize observation of high-value targets within restricted planning horizons. Numerical simulations, covering a wide range of target numbers and satellite configurations, reveal the MDP algorithm’s superior mission allocation efficiency, enhanced success rates, and reduced revisit times, compared to the Greedy algorithm. The findings underscore the MDP algorithm’s improved operational efficiency and planning robustness for complex imaging tasks, demonstrating significant advancements over traditional approaches.