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 条
  • [21] A new method for initialising the K-means clustering algorithm
    Qing, Xiaoping
    Zheng, Shijue
    2009 SECOND INTERNATIONAL SYMPOSIUM ON KNOWLEDGE ACQUISITION AND MODELING: KAM 2009, VOL 2, 2009, : 41 - 44
  • [22] Genetic TKM: A Hybrid Clustering Method Based on Genetic Algorithm, Tabu Search and K-Means
    Yaghini, Masoud
    Gereilinia, Nasim
    INTERNATIONAL JOURNAL OF APPLIED METAHEURISTIC COMPUTING, 2013, 4 (01) : 67 - 77
  • [23] Improved K-means Clustering Algorithm Based on the Optimized Initial Centriods
    Wang, Shunye
    2013 3RD INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT), 2013, : 450 - 453
  • [24] Optimized K-Means Clustering Algorithm based on Artificial Fish Swarm
    Yu, HaiTao
    Cheng, Xiaoxu
    Jia, Meijuan
    Jiang, Qingfeng
    PROCEEDINGS 2013 INTERNATIONAL CONFERENCE ON MECHATRONIC SCIENCES, ELECTRIC ENGINEERING AND COMPUTER (MEC), 2013, : 1783 - 1787
  • [25] An Optimized Initialization Center K-means Clustering Algorithm based on Density
    Yuan, Qilong
    Shi, Haibo
    Zhou, Xiaofeng
    2015 IEEE INTERNATIONAL CONFERENCE ON CYBER TECHNOLOGY IN AUTOMATION, CONTROL, AND INTELLIGENT SYSTEMS (CYBER), 2015, : 790 - 794
  • [26] A genetic algorithm that exchanges neighboring centers for k-means clustering
    Laszlo, Michael
    Mukherjee, Sumitra
    PATTERN RECOGNITION LETTERS, 2007, 28 (16) : 2359 - 2366
  • [27] An Immune Genetic K-Means Algorithm for Mongolian Elements Clustering
    Hua, Chun
    Cheng, Chun Ying
    ADVANCES IN NEURAL NETWORKS - ISNN 2018, 2018, 10878 : 273 - 278
  • [28] A quantum-inspired genetic algorithm for k-means clustering
    Xiao, Jing
    Yan, YuPing
    Zhang, Jun
    Tang, Yong
    EXPERT SYSTEMS WITH APPLICATIONS, 2010, 37 (07) : 4966 - 4973
  • [29] An Optimized Approach for Prostate Image Segmentation Using K-Means Clustering Algorithm with Elbow Method
    Sammouda, Rachid
    El-Zaart, Ali
    COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE, 2021, 2021
  • [30] An Improved Heuristic K-Means Clustering Method Using Genetic Algorithm Based Initialization
    Mustafi, D.
    Sahoo, G.
    Mustafi, A.
    ADVANCES IN COMPUTATIONAL INTELLIGENCE, 2017, 509 : 123 - 132