IDEAS home Printed from https://ideas.repec.org/a/sae/joudef/v15y2018i3p303-322.html
   My bibliography  Save this article

Evolutionary sensor allocation for the Space Surveillance Network

Author

Listed:
  • Gabriel H Greve
  • Kenneth M Hopkinson
  • Gary B Lamont

Abstract

The congested exosphere continues to contain more satellites and debris, raising the potential for destructive collisions. The Special Perturbations (SP) Tasker algorithm currently assigns the ground sensors tasks to track object locations. Accurate locations help avoid collisions. However, the SP Tasker ignores priority, which is the satellite’s importance factor. This article introduces the Evolutionary Algorithm Tasker (EAT) to solve the Satellite Sensor Allocation Problem (SSAP), which is a hybrid Evolutionary Strategy and Genetic Algorithm concept including specific techniques to explore the solution space and exploit the best solutions found. This approach goes beyond the current method, which does not include priority and other methods from the literature that have been applied to small-scale simulations. The SSAP model implementation extends Multi-Objective Evolutionary Algorithms (MOEAs) from the literature while accounting for priorities. Multiple real-world factors are considered, including each sensor’s field-of-view, the orbital opportunities to track a satellite, the capacity of the sensor, and the relative priority of the satellites. The single objective EAT is statistically compared to the SP Tasker algorithm. Simulations show that both the EAT and MOEA approaches effectively use priority in the core tasking algorithms to ensure that higher priority satellites are tracked.

Suggested Citation

  • Gabriel H Greve & Kenneth M Hopkinson & Gary B Lamont, 2018. "Evolutionary sensor allocation for the Space Surveillance Network," The Journal of Defense Modeling and Simulation, , vol. 15(3), pages 303-322, July.
  • Handle: RePEc:sae:joudef:v:15:y:2018:i:3:p:303-322
    DOI: 10.1177/1548512917712614
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1548512917712614
    Download Restriction: no

    File URL: https://libkey.io/10.1177/1548512917712614?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Tan, K.C. & Goh, C.K. & Mamun, A.A. & Ei, E.Z., 2008. "An evolutionary artificial immune system for multi-objective optimization," European Journal of Operational Research, Elsevier, vol. 187(2), pages 371-392, June.
    2. Goncalves, Jose Fernando & de Magalhaes Mendes, Jorge Jose & Resende, Mauricio G. C., 2005. "A hybrid genetic algorithm for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 167(1), pages 77-95, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ivorra, Benjamin & Mohammadi, Bijan & Manuel Ramos, Angel, 2015. "A multi-layer line search method to improve the initialization of optimization algorithms," European Journal of Operational Research, Elsevier, vol. 247(3), pages 711-720.
    2. Dengsheng Wu & Xiaoqian Zhu & Jie Wan & Chunbing Bao & Jianping Li, 2019. "A Multiobjective Optimization Approach for Selecting Risk Response Strategies of Software Project: From the Perspective of Risk Correlations," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 18(01), pages 339-364, January.
    3. Sels, Veronique & Craeymeersch, Kjeld & Vanhoucke, Mario, 2011. "A hybrid single and dual population search procedure for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 215(3), pages 512-523, December.
    4. Rego, César & Duarte, Renato, 2009. "A filter-and-fan approach to the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 194(3), pages 650-662, May.
    5. Gonçalves, J.F. & Mendes, J.J.M. & Resende, M.G.C., 2008. "A genetic algorithm for the resource constrained multi-project scheduling problem," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1171-1190, September.
    6. Chiang, Tsung-Che & Fu, Li-Chen, 2009. "Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 196(1), pages 78-92, July.
    7. Singh, Bindeshwar & Mukherjee, V. & Tiwari, Prabhakar, 2015. "A survey on impact assessment of DG and FACTS controllers in power systems," Renewable and Sustainable Energy Reviews, Elsevier, vol. 42(C), pages 846-882.
    8. Lin, Shih-Wei & Ying, Kuo-Ching, 2013. "Minimizing makespan in a blocking flowshop using a revised artificial immune system algorithm," Omega, Elsevier, vol. 41(2), pages 383-389.
    9. G I Zobolas & C D Tarantilis & G Ioannou, 2009. "A hybrid evolutionary algorithm for the job shop scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(2), pages 221-235, February.
    10. Hong-Sen Yan & Wen-Chao Li, 2017. "A multi-objective scheduling algorithm with self-evolutionary feature for job-shop-like knowledgeable manufacturing cell," Journal of Intelligent Manufacturing, Springer, vol. 28(2), pages 337-351, February.
    11. Seung-Hyun Moon & Yourim Yoon, 2022. "Genetic Mean Reversion Strategy for Online Portfolio Selection with Transaction Costs," Mathematics, MDPI, vol. 10(7), pages 1-20, March.
    12. Gonçalves, José Fernando & Resende, Mauricio G.C., 2015. "A biased random-key genetic algorithm for the unequal area facility layout problem," European Journal of Operational Research, Elsevier, vol. 246(1), pages 86-107.
    13. Nicolás Álvarez-Gil & Rafael Rosillo & David de la Fuente & Raúl Pino, 2021. "A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(4), pages 1353-1374, December.
    14. José Fernando Gonçalves & Mauricio G. C. Resende, 2011. "A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem," Journal of Combinatorial Optimization, Springer, vol. 22(2), pages 180-201, August.
    15. Thi-Kien Dao & Tien-Szu Pan & Trong-The Nguyen & Jeng-Shyang Pan, 2018. "Parallel bat algorithm for optimizing makespan in job shop scheduling problems," Journal of Intelligent Manufacturing, Springer, vol. 29(2), pages 451-462, February.
    16. Mauricio Resende, 2012. "Biased random-key genetic algorithms with applications in telecommunications," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(1), pages 130-153, April.
    17. Xiaoya Ma & Xiang Zhao, 2015. "Land Use Allocation Based on a Multi-Objective Artificial Immune Optimization Model: An Application in Anlu County, China," Sustainability, MDPI, vol. 7(11), pages 1-20, November.
    18. Mehmet Hakan Satman & Emre Akadal, 2020. "Machine Coded Compact Genetic Algorithms for Real Parameter Optimization Problems," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 8(1), pages 43-58, June.
    19. Gonçalves, José Fernando & Wäscher, Gerhard, 2020. "A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects," European Journal of Operational Research, Elsevier, vol. 286(3), pages 867-882.
    20. Lei, Yu & Gong, Maoguo & Zhang, Jun & Li, Wei & Jiao, Licheng, 2014. "Resource allocation model and double-sphere crowding distance for evolutionary multi-objective optimization," European Journal of Operational Research, Elsevier, vol. 234(1), pages 197-208.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:joudef:v:15:y:2018:i:3:p:303-322. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.