Aeronautical and Space-Rocket Engineering
Ground complexes, launching equipment, flying vehicle operation
Аuthors
*, **University of Technology, 42, Gagarin str, Korolev, Moscow region, 141070, Russia
*e-mail: artuschenko@mail.ru
**e-mail: boris.ku4erov@gmail.com
Abstract
A number of tasks of various resources scheduling should be solved to ensure spacecrafts mission control. One of such tasks is tracking, telemetry and command (TT&C) ground stations scheduling. That task is performed under strict resource restrictions. These restrictions include both restrictions on the resource being scheduled and temporal restrictions being imposed on the operativeness of the ground stations distribution plan developing. To ensure operative and qualitative TT&C, accounting for all these restrictions is required.
The restrictions on employing ground stations include the ones on applying separate ground stations as well as restrictions on various ones simultaneous employing. Restrictions stipulated by mission control centers capabilities to perform communication sessions with spacecraft are also a part of the restrictions on TT&C ground stations application.
The restrictions on employing a separate ground station include radio-visibility zones, a set of ground stations network for each spacecraft, a set of service operations to be done for ground station (during which it cannot be used to perform communication sessions with spacecraft) and a set of operation modes supported by each ground station. The restrictions on simultaneous application of different ground stations include ones caused by electromagnetic compatibility and restrictions caused by necessity of employing same resources. The restrictions caused by electromagnetic compatibility can be defined through the sets of two communication sessions characteristics, which cannot be performed simultaneously. These definitions can be used to identify conflict situations while TT&C ground stations scheduling. The resources which simultaneous application may be limited can be sharable or non- sharable. Demands for such resources can be associated with ground stations or their models. It will allow, in is turn, identify conflict situations while ground stations scheduling. Another restriction, which should be regarded while identifying conflict situations during ground stations scheduling, is the maximal number of communication sessions, which each mission control center can perform concurrently. The presented restrictions can be considered as the system of resource restrictions to be accounted for while TT&C ground stations scheduling. The proposed mathematical task formulation of accounting for the system of restrictions can be employed in future development of methodical support for ground stations scheduling.
Keywords:
ground-based automated control complex, schedule of means distribution, conflict situation, electromagnetic compatibility of spacecraft control means, restrictions on shared resources employingReferences
-
J., Kaparis K., Khosravi B. Operations research in the space industry. European Journal of Operational Research, 2012, vol. 217, no. 2, pp. 233-240. DOI: 10.1016/j.ejor.2011.06.035
-
Vazquez A.J., Erwin R.S. On the tractability of satellite range scheduling. Optimization Letters, 2015, vol. 9, no. 2, pp. 311-327. DOI: 10.1007/s115 90 -014-0744-8
-
Darnopykh V.V., Malyshev V.V., Usovik I.V. Multicriteria optimization of efficiency of earth remote sensing systems constellations target functioning on the basis of operative planning. Aerospace MAI Journal, 2014, vol. 21, no. 5, pp. 37-52.
-
Skobelev P.O. Informatsionnye tekhnologii, 2013, no. S1, pp. 1-32.
-
Zhigastova O.K., Pochukayev V.N. Method of automated planning of automatic near-Earth spacecrafts. Aerospace MAI Journal, 2012, vol. 19, no. 3, pp. 97-103.
-
Zhigastova O.K., Pochukayev V.N. Flight plan development language allowing automatic flight planning for automated spacecraft. Aerospace MAI Journal, 2016, vol. 23, no. 1, pp. 136-146.
-
Kucherov B.A. Informatsionno-tekhnologicheskii vestnik, 2018, no. 4(18), pp. 32-43.
-
Kucherov B.A. Materialy IVMezhdunarodnoi nauchno- tekhnicheskoi konferentsii (05 April 2019) “Evolyutsionnyeprotsessy informatsionnykh tekhnologii”. Sbornik statei. Moscow, Nauchnyi konsul’tant, 2019, pp. 43-47.
-
Kolpin M.A., Protsenko P.A., Slashchev A.V. Trudy MAI, 2017, no. 92. URL: http://trudymai.ru/eng/published.php?ID=77144
-
Skobelev P.O., Travin V.S., Zhilyaev A.A., Simonova E.V., Ivanov A.B. Materialy VII Rossiiskoi mul’tikonferentsii po problemam upravleniya ITU-2014 (Saint Petersburg, 07-09 October 2014) “Informatsionnye tekhnologii v upravlenii”. Sbornik statei. St. Petersburg, Kontsern “TsNII “Elektropribor”, 2014, pp. 701-709.
-
Solov’ev V.A., Lyubinskii V.E., Matyushin M.M. Vestnik Moskovskogo gosudarstvennogo tekhnicheskogo universiteta im. N.E. Baumana. Seriya: Mashinostroenie, 2013, no. 3(92), pp. 39-54.
-
Yuqing L., Rixin W., Minqiang X. Satellite range scheduling with the priority constraint: An improved genetic algorithm using a station ID encoding method. Chinese Journal of Aeronautics, 2015, vol. 28, no. 3, pp. 789-803. DOI: 10.1016/j.cja.2015.04.012
-
Li Z., Li J., Mu W. Space-Ground TT&C Resources Integrated Scheduling Based on the Hybrid Ant Colony Optimization. Proceedings of the 28th Conference of Spacecraft TT&C Technology in China: Openness, Integration and Intelligent Interconnection. Singapore, Springer Singapore, 2018, pp. 179-196. DOI: 10.1007/ 978-981-10-4837-1_15
-
Barbulescu L., Howe A., Whitley D. AFSCN scheduling: How the problem and solution have evolved. Mathematical and Computer Modelling, 2006, vol. 43, no. 9-10, pp. 1023-1037. DOI: 10.1016/ j.mcm.2005.12.004
-
Vazquez R., Perea F., Galan Vioque J. Resolution of an Antenna-Satellite assignment problem by means of Integer Linear Programming. Aerospace Science and Technology, 2014, vol. 39, pp. 567-574. DOI: 10.1016/ j.ast.2014.06.002
-
Song Y.-J., Zhang Z.-S., Song B.-Y., Chen Y.-W. Improved Genetic Algorithm with Local Search for Satellite Range Scheduling System and its Application in Environmental monitoring. Sustainable Computing: Informatics and Systems, 2019, vol. 21, pp. 19-27. DOI: 10.1016/j.suscom.2018.11.009
-
Lee J., Wang S., Chung D., Hyun C., Choi S., Ko K., Ahn H., Jung O. Visibility conflict resolution for multiple antennae and multi-satellites via genetic algorithm. IEEE Aerospace Conference (Big Sky, Montana, USA, 2-9 March 2013), 10 p. DOI: 10.1109/ AERO.2013.6496849
-
Marinelli F., Nocella S., Rossi F., Smriglio S. A Lagrangian heuristic for satellite range scheduling with resource constraints. Computers & Operations Research, 2011, vol. 38, no. 11, pp. 1572-1583. DOI: 10.1016/ j.cor.2011.01.016
-
Xhafa F., Sun J.Z., Barolli A., Biberaj A., Barolli L. Genetic algorithms for satellite scheduling problems. Mobile Information Systems, 2012, vol. 8, no. 4, pp. 351-377. DOI: 10.3233/MIS-2012-00153
-
Barbulescu L., Howe A.E., Watson J.P., Whitley L.D. Satellite Range Scheduling: A Comparison of Genetic, Heuristic and Local Search. Parallel Problem Solving from Nature (PPSN VII). Berlin, Springer Berlin Heidelberg, 2002, pp. 611-620. DOI: 10.1007/3-540-45712-7_59
-
mai.ru — informational site of MAI Copyright © 1994-2024 by MAI |