Satellite constellation method for ground targeting optimized with K-means clustering and genetic algorithm

被引:5
|
作者
Lee, Soung Sub [1 ]
机构
[1] Sejong Univ, Dept Aerosp Syst Engn, 209 Neungdong Ro, Seoul 05006, South Korea
关键词
Repeating ground track orbit; Machine learning; K-means clustering; Revisit performance; Target accessibility; FLOWER CONSTELLATION; DESIGN; MISSION; ORBITS;
D O I
10.1016/j.engappai.2023.107509
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This study proposed a satellite constellation method to cluster targets using machine learning and achieve the desired revisit performance for each target in an area of interest. Because a typical satellite constellation, such as the Walker method, does not consider the geometrical dynamics between the satellite and Earth's surface target, the target-oriented revisit performance analysis and the application of optimization method are limited. To overcome these limitations, this study developed a satellite constellation method that is customized according to the target using a repeating ground track orbit and machine learning techniques. The proposed model groups aim to maximize satellite revisit performance via K-means clustering and determine the optimal number of satellites required to achieve the desired revisit performance for each target through a quick and accurate accessibility analysis of various target distributions. This study revealed that three to five target clusters are more effective in improving the satellite revisit performance than a typical single target cluster, while identifying that the density of the target distribution is a significant influencing factor. Finally, the proposed model achieved the desired revisit performance, guaranteeing a timely response for 30 major disaster locations in East Asia and validating the model's optimal performance.
引用
收藏
页数:10
相关论文
共 50 条
  • [1] A K-means Optimized Clustering Algorithm Based on Improved Genetic Algorithm
    Pu, Qiu-Mei
    Wu, Qiong
    Li, Qian
    Lecture Notes in Electrical Engineering, 2022, 801 LNEE : 133 - 140
  • [2] An Optimized Version of the K-Means Clustering Algorithm
    Poteras, Cosmin Marian
    Mihaescu, Marian Cristian
    Mocanu, Mihai
    FEDERATED CONFERENCE ON COMPUTER SCIENCE AND INFORMATION SYSTEMS, 2014, 2014, 2 : 695 - 699
  • [3] On K-means Data Clustering Algorithm with Genetic Algorithm
    Kapil, Shruti
    Chawla, Meenu
    Ansari, Mohd Dilshad
    2016 FOURTH INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED AND GRID COMPUTING (PDGC), 2016, : 202 - 206
  • [4] Clustering with Niching Genetic K-means algorithm
    Sheng, WG
    Tucker, A
    Liu, XH
    GENETIC AND EVOLUTIONARY COMPUTATION GECCO 2004 , PT 2, PROCEEDINGS, 2004, 3103 : 162 - 173
  • [5] Modified K-Means Algorithm for Genetic Clustering
    Bonab, Mohammad Babrdel
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2011, 11 (09): : 24 - 28
  • [6] Research of K-means clustering method based on parallel genetic algorithm
    Dai, Wenhua
    Jiao, Cuizhen
    He, Tingting
    2007 THIRD INTERNATIONAL CONFERENCE ON INTELLIGENT INFORMATION HIDING AND MULTIMEDIA SIGNAL PROCESSING, VOL II, PROCEEDINGS, 2007, : 158 - +
  • [7] Research on k-means Clustering Algorithm An Improved k-means Clustering Algorithm
    Shi Na
    Liu Xumin
    Guan Yong
    2010 THIRD INTERNATIONAL SYMPOSIUM ON INTELLIGENT INFORMATION TECHNOLOGY AND SECURITY INFORMATICS (IITSI 2010), 2010, : 63 - 67
  • [8] A Clustering Method Based on K-Means Algorithm
    Li, Youguo
    Wu, Haiyan
    INTERNATIONAL CONFERENCE ON SOLID STATE DEVICES AND MATERIALS SCIENCE, 2012, 25 : 1104 - 1109
  • [9] A novel method for K-means clustering algorithm
    Zhao, Jinguo, 1600, Transport and Telecommunication Institute, Lomonosova street 1, Riga, LV-1019, Latvia (18):
  • [10] K-Means Clustering Algorithm Optimized by Particle Swarm Optimization Algorithm
    Chai, Yi
    Ma, Hao
    Zhang, Ke
    Qian, Kun
    INTERNATIONAL CONFERENCE ON CONTROL ENGINEERING AND AUTOMATION (ICCEA 2014), 2014, : 852 - 857