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 条
  • [31] Genetic K-means algorithm
    Krishna, K
    Murty, MN
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 1999, 29 (03): : 433 - 439
  • [32] One optimized choosing method of K-means document clustering center
    Suo, Hongguang
    Nie, Kunming
    Sun, Xin
    Wang, Yuwei
    INFORMATION RETRIEVAL TECHNOLOGY, 2008, 4993 : 490 - 495
  • [33] An Improved K-means Clustering Algorithm
    Wang Yintong
    Li Wanlong
    Gao Rujia
    2012 WORLD AUTOMATION CONGRESS (WAC), 2012,
  • [34] Unsupervised K-Means Clustering Algorithm
    Sinaga, Kristina P.
    Yang, Miin-Shen
    IEEE ACCESS, 2020, 8 : 80716 - 80727
  • [35] Granular K-means Clustering Algorithm
    Zhou, Chenglong
    Chen, Yuming
    Zhu, Yidong
    Computer Engineering and Applications, 2023, 59 (13) : 317 - 324
  • [36] Modified k-Means Clustering Algorithm
    Patel, Vaishali R.
    Mehta, Rupa G.
    COMPUTATIONAL INTELLIGENCE AND INFORMATION TECHNOLOGY, 2011, 250 : 307 - +
  • [37] Modified K-means clustering algorithm
    Li, Wei
    CISP 2008: FIRST INTERNATIONAL CONGRESS ON IMAGE AND SIGNAL PROCESSING, VOL 4, PROCEEDINGS, 2008, : 618 - 621
  • [38] The MinMax k-Means clustering algorithm
    Tzortzis, Grigorios
    Likas, Aristidis
    PATTERN RECOGNITION, 2014, 47 (07) : 2505 - 2516
  • [39] The global k-means clustering algorithm
    Likas, A
    Vlassis, N
    Verbeek, JJ
    PATTERN RECOGNITION, 2003, 36 (02) : 451 - 461
  • [40] Improved K-means clustering algorithm
    Zhang, Zhe
    Zhang, Junxi
    Xue, Huifeng
    CISP 2008: FIRST INTERNATIONAL CONGRESS ON IMAGE AND SIGNAL PROCESSING, VOL 5, PROCEEDINGS, 2008, : 169 - 172