Skip to main content

Regular Space TT&C Mission Planning Based on Hierarchical Progress in Space Information Networks

  • Conference paper
  • First Online:
Space Information Network (SINC 2020)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1353))

Included in the following conference series:

  • 434 Accesses

Abstract

With the development of space missions and the diversity of satellites, space information networks have become more complex. Space TT&C (Tracking Telemetry and Command) missions are faced with shortage of resources and complex demand characteristics. In view of these challenges, we propose a hierarchical progressive TT&C mission planning algorithm. Firstly, we model the TT&C mission planning problem as a mixed integer linear programming problem with aiming at maximizing the network reward, i.e., the weighted number of completed TT&C missions. Then, we decompose this problem into multiple levels of optimization sub-problems according to the types of constraints and use time buckets and binary conflict trees to reduce the complexity of the algorithm. Finally, we use the binary conflict tree to perform local disturbances Simulation results show that, compared with the existing planning algorithms, the proposed algorithm not only guarantees the efficiency of the algorithm, but also improves the total reward of TT&C mission planning.

This work was supported in part by the Natural Science Foundation of China under Grant U19B2025, and Grant 62001347, in part by the China Postdoctoral Science Foundation under Grant 2019TQ0241 and Grant 2020M673344, and in part by the Fundamental Research Funds for the Central Universities under Grant XJS200117.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Wang, Y., Sheng, M., Zhuang, W., et al.: Multi-resource coordinate scheduling for earth observation in space information networks. IEEE J. Sel. Areas Commun. 36(2), 268–279 (2018)

    Article  Google Scholar 

  2. Song, C., et al.: New development of satellite communication in the 5G Era. Digital Commun. World 2019(08), 36–37 (2019)

    Google Scholar 

  3. Liu, R., Sheng, M., et al.: Tasking planning based on task splitting and merging in relay satellite network. J. Commun. 38(S1), 110–117 (2018)

    Google Scholar 

  4. Li, B., et al.: The development status of broadband satellite networks. Electron. World 2012(13), 127 (2012)

    Google Scholar 

  5. Hao, C., et al.: Challenges for the development of satellite internet network. Digital Commun. World 2019(07), 35–36+49 (2019)

    Google Scholar 

  6. Li, J.: coordinated task planning research of space-aeronautics earth-observing. Doctor, National University of Defense Technology (2013)

    Google Scholar 

  7. Chen, X.: Research on the acquisition technologies in spread spectrum TT&C system. Doctor, National University of Defense Technology (2010)

    Google Scholar 

  8. Yi, C., et al.: The recent development and prospect of satellite communication. J. Commun. 36(06), 161–176 (2015)

    Google Scholar 

  9. Clement, B.J., Johnston, M.D.: The Deep Space Network scheduling problem. In: Twentieth National Conference on Artificial Intelligence & the Seventeenth Innovative Applications of Artificial Intelligence Conference. DBLP (2005)

    Google Scholar 

  10. Arbabi, M., Garate, J.A., Kocher, D.F.: Interactive real time scheduling and control summer. In: Computer Simulation Conference (1985)

    Google Scholar 

  11. Jin. G., et al.: Ground station resource scheduling optimization model and its heuristic algorithm. Syst. Eng. Electron. 2004(12), 1839–1841+1875 (2004)

    Google Scholar 

  12. Zhang, N., et al.: A new model for satellite TT&C resource scheduling and its solution algorithm. J. Astronautics 30(05), 2140–2145 (2009)

    Google Scholar 

  13. Wang, Y., et al.: Study on petri net model for multi-satellites-ground station system. J. Air Force Eng. Univ. (Nat. Sci. Edn.) 4(02), 7–11 (2003)

    Google Scholar 

  14. Liu, Y., et al.: The method of mission planning of the ground station of satellite based on dynamic programming. Chin. Space Sci. Technol. 2005(01), 47–50 (2005)

    Google Scholar 

  15. Du, H.: Design of space TT & C resource scheduling model based on multi agent technology. Syst. Simul. Technol. Appl. 16, 78–81 (2015)

    Google Scholar 

  16. Li, Y.: Research on satellite-ground station data transmission scheduling models and algorithms. Doctor, National University of Defense Technology (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Di Zhou .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wang, C., Zhou, D., Sheng, M., Li, J., Xiao, Y. (2021). Regular Space TT&C Mission Planning Based on Hierarchical Progress in Space Information Networks. In: Yu, Q. (eds) Space Information Network. SINC 2020. Communications in Computer and Information Science, vol 1353. Springer, Singapore. https://doi.org/10.1007/978-981-16-1967-0_8

Download citation

  • DOI: https://doi.org/10.1007/978-981-16-1967-0_8

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-16-1966-3

  • Online ISBN: 978-981-16-1967-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics