Cosmic ResearchCosmic ResearchКосмические исследования0023-42063034-5502The Russian Academy of Sciences69671610.31857/S0023420625050023ArticlesСтатьиResearch ArticleMethods of a satellite formation orbital motion control based on consensus algorithmsМетодика управления орбитальным движением спутниковой группировки на основе алгоритмов обеспечения консенсусаDadashevR. R.ДадашевР. Р.shestakov@keldysh.ruShestakovS. A.ШестаковС. А.shestakov@keldysh.ruKeldysh Institute of Applied Mathematics, Russian Academy of SciencesИнститут прикладной математики им. М.В. Келдыша РАН15092025635VOL 63, NO5 (2025)ТОМ 63, №5 (2025)47148121112025Copyright ©; 2025, Russian Academy of SciencesCopyright ©; 2025, Российская академия наук2025Russian Academy of SciencesРоссийская академия наукhttps://journals.eco-vector.com/0023-4206/article/view/696716

Methods for synthesizing control of the relative motion of a group of spacecraft are considered. The main goal is to develop a control strategy that compensates for the disintegration of the group caused by relative orbital drift. The control design employs techniques based on various types of graphs to describe satellite interactions. A proof is provided demonstrating the feasibility of eliminating relative satellite drift using a method based on directed graphs. The resulting algorithm is adapted to scenarios where one or more spacecraft in the group may malfunction. To derive the control in such cases, a modified version of the Raft protocol for achieving consensus in multi-agent systems is used. In addition to analytical derivations and the general methodology, the work presents results from numerical simulations.

Рассматриваются методы синтеза управления относительным движением группы космических аппаратов. Основной целью является построение управления, компенсирующего распад группы вследствие относительного орбитального дрейфа. При построении управления используется техника, основанная на применении графов различного типа для описания взаимодействия спутников. Представлено доказательство возможности устранения относительного дрейфа спутников с помощью метода, основанного на использовании ориентированного графа. Полученный алгоритм адаптирован к случаю, когда один или несколько аппаратов группы могут выйти из строя. Для получения управления в этом случае используется модифицированный вариант Raft-протокола обеспечения консенсуса в многоагентной системе. Помимо аналитических выкладок и построения общей методики, в работе приведены результаты численного моделирования.

Исследование выполнено за счет гранта Российского научного фонда No 23-71-01048, https://rscf.ru/project/23-71-01048/Mesbahi M., Egerstedt M. Graph theoretic methods in multiagent networks. Princeton University Press, 2010. 424 p.Mesbahi M., Egerstedt M. Graph theoretic methods in multiagent networks. Princeton University Press, 2010. 424 p.Mesbahi M., Egerstedt M. Graph theoretic methods in multiagent networks. Princeton University Press, 2010. 424 p.Mesbahi M., Egerstedt M. Graph Theoretic Methods in Multiagent Networks. Princeton University Press, 2010. 424 p.Mesbahi M., Egerstedt M. Graph theoretic methods in multiagent networks. Princeton University Press, 2010. 424 p.Monakhova U., Ivanov D., Mashtakov Y. et al. Communication area estimation for decentralized control of nanosatellites swarm // Acta Astronautica. 2023. V. 211. P. 49-59. https://doi.org/10.1016/j.actaastro.2023.06.003Monakhova U., Ivanov D., Mashtakov Y. et al. Communication area estimation for decentralized control of nanosatellites swarm // Acta Astronautica. 2023. V. 211. P. 49-59. https://doi.org/10.1016/j.actaastro.2023.06.003Monakhova U., Ivanov D., Mashtakov Y. et al. Communication area estimation for decentralized control of nanosatellites swarm // Acta Astronautica. 2023. V. 211. P. 49-59. https://doi.org/10.1016/j.actaastro.2023.06.003Monakhova U., Ivanov D., Mashtakov Y. et al. Communication area estimation for decentralized control of nanosatellites swarm // Acta Astronautica. 2023. V. 211. P. 49–59. https://doi.org/10.1016/j.actaastro.2023.06.003Monakhova U., Ivanov D., Mashtakov Y. et al. Communication area estimation for decentralized control of nanosatellites swarm // Acta Astronautica. 2023. V. 211. P. 49-59. https://doi.org/10.1016/j.actaastro.2023.06.003Дадашев Р.Р., Шестаков С.А. Методика управления группой спутников на основе коммуникационных графов // Препринты ИПМ им. М.В. Келдыша. 2022. No 90. С. 1-31. https://doi.org/10.20948/prepr-2022-90Дадашев Р.Р., Шестаков С.А. Методика управления группой спутников на основе коммуникационных графов // Препринты ИПМ им. М.В. Келдыша. 2022. No 90. С. 1-31. https://doi.org/10.20948/prepr-2022-90Дадашев Р.Р., Шестаков С.А. Методика управления группой спутников на основе коммуникационных графов // Препринты ИПМ им. М.В. Келдыша. 2022. No 90. С. 1-31. https://doi.org/10.20948/prepr-2022-90Дадашев Р.Р., Шестаков С.А. Методика управления группой спутников на основе коммуникационных графов // Препринты ИПМ им. М.В. Келдыша. 2022. № 90. С. 1–31. https://doi.org/10.20948/prepr-2022-90Дадашев Р.Р., Шестаков С.А. Методика управления группой спутников на основе коммуникационных графов // Препринты ИПМ им. М.В. Келдыша. 2022. No 90. С. 1-31. https://doi.org/10.20948/prepr-2022-90Clohessy W.H., Wiltshire R.S. Terminal Guidance System for Satellite Rendezvous // J. Aerospace Sciences. 1960. V. 27. Iss. 9. P. 653-658. https://doi.org/10.2514/8.8704Clohessy W.H., Wiltshire R.S. Terminal Guidance System for Satellite Rendezvous // J. Aerospace Sciences. 1960. V. 27. Iss. 9. P. 653-658. https://doi.org/10.2514/8.8704Clohessy W.H., Wiltshire R.S. Terminal Guidance System for Satellite Rendezvous // J. Aerospace Sciences. 1960. V. 27. Iss. 9. P. 653-658. https://doi.org/10.2514/8.8704Clohessy W.H., Wiltshire R.S. Terminal guidance system for satellite rendezvous // J. Aerospace Sciences. 1960. V. 27. Iss. 9. P. 653–658. https://doi.org/10.2514/8.8704Clohessy W.H., Wiltshire R.S. Terminal Guidance System for Satellite Rendezvous // J. Aerospace Sciences. 1960. V. 27. Iss. 9. P. 653-658. https://doi.org/10.2514/8.8704Fischer M.J., Lynch N.A., Paterson M.S. Impossibility of distributed consensus with one faulty process // J. Association for Computing Machinery. 1985. V. 32. Iss. 2. P. 374-382. https://doi.org/10.1145/3149.214121Fischer M.J., Lynch N.A., Paterson M.S. Impossibility of distributed consensus with one faulty process // J. Association for Computing Machinery. 1985. V. 32. Iss. 2. P. 374-382. https://doi.org/10.1145/3149.214121Fischer M.J., Lynch N.A., Paterson M.S. Impossibility of distributed consensus with one faulty process // J. Association for Computing Machinery. 1985. V. 32. Iss. 2. P. 374-382. https://doi.org/10.1145/3149.214121Fischer M.J., Lynch N.A., Paterson M.S. Impossibility of distributed consensus with one faulty process // J. Association for Computing Machinery. 1985. V. 32. Iss. 2. P. 374–382. https://doi.org/10.1145/3149.214121Fischer M.J., Lynch N.A., Paterson M.S. Impossibility of distributed consensus with one faulty process // J. Association for Computing Machinery. 1985. V. 32. Iss. 2. P. 374-382. https://doi.org/10.1145/3149.214121Lamport L. The part-time parliament // ACM Transactions on Computer Systems. 1998. V. 16. Iss. 2. P. 133-169. https://doi.org/10.1145/279227.279229Lamport L. The part-time parliament // ACM Transactions on Computer Systems. 1998. V. 16. Iss. 2. P. 133-169. https://doi.org/10.1145/279227.279229Lamport L. The part-time parliament // ACM Transactions on Computer Systems. 1998. V. 16. Iss. 2. P. 133-169. https://doi.org/10.1145/279227.279229Lamport L. The part-time parliament // ACM Transactions on Computer Systems. 1998. V. 16. Iss. 2. P. 133–169. https://doi.org/10.1145/279227.279229Lamport L. The part-time parliament // ACM Transactions on Computer Systems. 1998. V. 16. Iss. 2. P. 133-169. https://doi.org/10.1145/279227.279229Lamport L. Lower bounds for asynchronous consensus // Distributed Computing. 2006. V. 19. Iss. 2. P. 104-125. https://doi.org/10.1007/s00446-006-0155-xLamport L. Lower bounds for asynchronous consensus // Distributed Computing. 2006. V. 19. Iss. 2. P. 104-125. https://doi.org/10.1007/s00446-006-0155-xLamport L. Lower bounds for asynchronous consensus // Distributed Computing. 2006. V. 19. Iss. 2. P. 104-125. https://doi.org/10.1007/s00446-006-0155-xLamport L. Lower bounds for asynchronous consensus // Distributed Computing. 2006. V. 19. Iss. 2. P. 104–125. https://doi.org/10.1007/s00446-006-0155-xLamport L. Lower bounds for asynchronous consensus // Distributed Computing. 2006. V. 19. Iss. 2. P. 104-125. https://doi.org/10.1007/s00446-006-0155-xOki B.M., Liskov B.H. Viewstamped replication: a general primary copy // Proc. 7th annual ACM Symposium on Principles of distributed computing - PODC'88. 1988. P. 8-17. https://doi.org/10.1145/62546.62549Oki B.M., Liskov B.H. Viewstamped replication: a general primary copy // Proc. 7th annual ACM Symposium on Principles of distributed computing - PODC'88. 1988. P. 8-17. https://doi.org/10.1145/62546.62549Oki B.M., Liskov B.H. Viewstamped replication: a general primary copy // Proc. 7th annual ACM Symposium on Principles of distributed computing - PODC'88. 1988. P. 8-17. https://doi.org/10.1145/62546.62549Oki B.M., Liskov B.H. Viewstamped replication: A general primary copy // Proc. 7th Annual ACM Symposium on Principles of Distributed Computing – PODC’88. 1988. P. 8–17. https://doi.org/10.1145/62546.62549Oki B.M., Liskov B.H. Viewstamped replication: a general primary copy // Proc. 7th annual ACM Symposium on Principles of distributed computing - PODC'88. 1988. P. 8-17. https://doi.org/10.1145/62546.62549Skeen D. A Quorum-Based Commit Protocol // Proc. 6th Berkeky Workshop. 1982. P. 69-80.Skeen D. A Quorum-Based Commit Protocol // Proc. 6th Berkeky Workshop. 1982. P. 69-80.Skeen D. A Quorum-Based Commit Protocol // Proc. 6th Berkeky Workshop. 1982. P. 69-80.Skeen D. A quorum-based commit protocol // Proc. 6th Berkeley Workshop. 1982. P. 69–80.Skeen D. A Quorum-Based Commit Protocol // Proc. 6th Berkeky Workshop. 1982. P. 69-80.Junqueira F.P., Reed B.C., Serafini M. Zab: High-performance broadcast for primary-backup systems // IEEE/IFIP 41st International Conference on Dependable Systems & Networks (DSN). 2011. P. 245-256. https://doi.org/10.1109/DSN.2011.5958223Junqueira F.P., Reed B.C., Serafini M. Zab: High-performance broadcast for primary-backup systems // IEEE/IFIP 41st International Conference on Dependable Systems & Networks (DSN). 2011. P. 245-256. https://doi.org/10.1109/DSN.2011.5958223Junqueira F.P., Reed B.C., Serafini M. Zab: High-performance broadcast for primary-backup systems // IEEE/IFIP 41st International Conference on Dependable Systems & Networks (DSN). 2011. P. 245-256. https://doi.org/10.1109/DSN.2011.5958223Junqueira F.P., Reed B.C., Serafini M. Zab: High-performance broadcast for primary-backup systems // IEEE/IFIP 41st International Conference on Dependable Systems & Networks (DSN). 2011. P. 245–256. https://doi.org/10.1109/DSN.2011.5958223Junqueira F.P., Reed B.C., Serafini M. Zab: High-performance broadcast for primary-backup systems // IEEE/IFIP 41st International Conference on Dependable Systems & Networks (DSN). 2011. P. 245-256. https://doi.org/10.1109/DSN.2011.5958223Ongaro D., Ousterhout J. In search of an understandable consensus algorithm // USENIX Annual Technical Conference (USENIX ATC 14). 2014. P. 305-319. https://doi.org/10.5555/2643634.2643666Ongaro D., Ousterhout J. In search of an understandable consensus algorithm // USENIX Annual Technical Conference (USENIX ATC 14). 2014. P. 305-319. https://doi.org/10.5555/2643634.2643666Ongaro D., Ousterhout J. In search of an understandable consensus algorithm // USENIX Annual Technical Conference (USENIX ATC 14). 2014. P. 305-319. https://doi.org/10.5555/2643634.2643666Ongaro D., Ousterhout J. In search of an understandable consensus algorithm // USENIX Annual Technical Conference (USENIX ATC 14). 2014. P. 305–319. https://doi.org/10.5555/2643634.2643666Ongaro D., Ousterhout J. In search of an understandable consensus algorithm // USENIX Annual Technical Conference (USENIX ATC 14). 2014. P. 305-319. https://doi.org/10.5555/2643634.2643666Tariverdi A., Torresen J. Rafting Towards Consensus: Formation Control of Distributed Dynamical Systems. 2023. https://doi.org/10.48550/arXiv.2308.10097Tariverdi A., Torresen J. Rafting Towards Consensus: Formation Control of Distributed Dynamical Systems. 2023. https://doi.org/10.48550/arXiv.2308.10097Tariverdi A., Torresen J. Rafting Towards Consensus: Formation Control of Distributed Dynamical Systems. 2023. https://doi.org/10.48550/arXiv.2308.10097Tariverdi A., Torresen J. Rafting Towards Consensus: Formation Control of Distributed Dynamical Systems. 2023. https://doi.org/10.48550/arXiv.2308.10097Tariverdi A., Torresen J. Rafting Towards Consensus: Formation Control of Distributed Dynamical Systems. 2023. https://doi.org/10.48550/arXiv.2308.10097