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 条
  • [41] A k-means based clustering algorithm
    Bloisi, Domenico Daniele
    Locchi, Luca
    COMPUTER VISION SYSTEMS, PROCEEDINGS, 2008, 5008 : 109 - 118
  • [42] An improved K-means clustering algorithm
    Huang, Xiuchang
    Su, Wei
    Journal of Networks, 2014, 9 (01) : 161 - 167
  • [43] An Enhancement of K-means Clustering Algorithm
    Gu, Jirong
    Zhou, Jieming
    Chen, Xianwei
    2009 INTERNATIONAL CONFERENCE ON BUSINESS INTELLIGENCE AND FINANCIAL ENGINEERING, PROCEEDINGS, 2009, : 237 - 240
  • [44] Adaptive K-Means clustering algorithm
    Chen, Hailin
    Wu, Xiuqing
    Hu, Junhua
    MIPPR 2007: PATTERN RECOGNITION AND COMPUTER VISION, 2007, 6788
  • [45] Improved Algorithm for the k-means Clustering
    Zhang, Sheng
    Wang, Shouqiang
    PROCEEDINGS OF THE 10TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA 2012), 2012, : 4717 - 4720
  • [46] A Novel K-Means Classification Method with Genetic Algorithm
    Li, Xuesi
    Jiang, Kai
    Wang, Hongbo
    Zhu, Xuejun
    Shi, Ruochong
    Shi, Haobin
    PROCEEDINGS OF 2017 IEEE INTERNATIONAL CONFERENCE ON PROGRESS IN INFORMATICS AND COMPUTING (PIC 2017), 2017, : 40 - 44
  • [47] A Novel Method for Clustering using k-means and Apriori Algorithm
    Ali, Syed Zishan
    Tiwari, Nikhil
    Sen, Sushmita
    PROCEEDINGS OF THE 2016 IEEE 2ND INTERNATIONAL CONFERENCE ON ADVANCES IN ELECTRICAL & ELECTRONICS, INFORMATION, COMMUNICATION & BIO INFORMATICS (IEEE AEEICB-2016), 2016, : 59 - 62
  • [48] A Novel Clustering Algorithm Combining Niche Genetic Algorithm with Canopy and K-means
    Zhang, Hua
    Zhou, Xiangbing
    2018 INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND BIG DATA (ICAIBD), 2018, : 26 - 32
  • [49] An ordered clustering algorithm based on K-means and the PROMETHEE method
    Liuhao Chen
    Zeshui Xu
    Hai Wang
    Shousheng Liu
    International Journal of Machine Learning and Cybernetics, 2018, 9 : 917 - 926
  • [50] An Improved K-Means Clustering Algorithm Based on Spectral Method
    Tian, Shengwen
    Yang, Hongyong
    Wang, Yilei
    Li, Ali
    ADVANCES IN COMPUTATION AND INTELLIGENCE, PROCEEDINGS, 2008, 5370 : 530 - 536