Method of Scheduling Optoelectronic Space Situational Awareness Facility Deployment

The purpose of our method is to increase the efficiency of non-coordinate data collection by optoelectronic space situational awareness facilities. In its core, our method uses a branch-and-bound algorithm to plan the operation of a virtual optoelectronic facility integrating all the geospace monitoring assets of the optoelectronic facilities involved in the scheduling routine. Introducing this virtual optoelectronic facility ensures that we obtain specific quasi-optimal results of solving the scheduling problem. These results describe the upper bound of the solution to the discrete optimisation problem of scheduling collection of non-coordinate data on resident space objects. According to these specific results of solving the problem for a virtual optoelectronic facility, we designed the final implementation plan for the whole set of facilities, using the frontal dynamic planning algorithm we consider. This algorithm allows the routine to be accounted not only for the static ranking of a resident space object, but also for the potential of controlling the object via monitoring facilities. We present results of applying the method developed. We evaluated the quality of the scheduling results that it allowed us to obtain as compared to the results of employing pre-existing algorithms. We also estimated the time complexity of our method

References

[1] Samotokhin A.S., Khutorovskiy Z.N. Method for initial determining Earth satellites orbits on base of three angular observations. Preprinty IPM im. M.V. Keldysha [Keldysh Institute Preprints], 2014, pp. 1–31 (in Russ.).

[2] Sokolov B.V. Dynamic models and algorithms of comprehensive scheduling for ground-based facilities communication with navigation spacecraft. Trudy SPIIRAN [SPIIRAS Proceedings], 2010, no. 2 (13), pp. 7–44 (in Russ.).

[3] Zimin I.N., Ivanilov Yu.P. Solution of network planning problems by reducing them to optimal control problems. USSR Computational Mathematics and Mathematical Physics, 1971, vol. 11, iss. 3, pp. 113–124. DOI: 10.1016/0041-5553(71)90133-9

[4] Stotter R., Thompson R. Globally optimized scheduling for space object tracking. Infotech Aerospace, 2011, art. AIAA 2011-1411. DOI: 10.2514/6.2011-1411

[5] Rubinshteyn M.I. Algorithms for solution of the assignment problem. Automation and Remote Control, 1981, vol. 42, iss. 7, pp. 970–976.

[6] Martello S., Toth P. Algorithms for knapsack problems. North-Holland Mathematics Studies, 1987, vol. 132, pp. 213–257. DOI: 10.1016/S0304-0208(08)73237-7

[7] Toporkov V.V., Emelyanov D.M., Potekhin P.A. Job batch generation and scheduling in distributed computing environments. Vestnik YuUrGU. Ser. Vych. matem. inform. [Bulletin of the SUSU. Ser. Computational Mathematics and Software Engineering], 2015, vol. 4, no. 2, pp. 44–57 (in Russ.). DOI: 10.14529/cmse150204

[8] Reda I., Andreas A. Solar position algorithm for solar radiation applications. National renewable energy laboratory: website. Available at: https://www.nrel.gov/docs/fy08osti/34302.pdf (accessed: 23.12.2017).

[9] Kolpakov R.M., Posypkin M.A., Sigal I.Kh. On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method. Automation and Remote Control, 2010, vol. 71, iss. 10, pp. 2152–2161. DOI: 10.1134/S0005117910100140

[10] Krishnamoorthy B. Bounds on the size of branch-and-bound proofs for integer knapsacks. OR Letters, 2008, vol. 36, iss. 1, pp. 19–25. DOI: 10.1016/j.orl.2007.04.011