Distributed optimal formation algorithm for multi-satellites system with time-varying performance function

This paper studies a fully distributed optimal formation flying problem for a multi-satellite system with a chief satellite and some deputy satellites, in order to seek the optimal formation via simple local information exchange. A distributed algorithm is proposed such that the satellites team perf...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of control Vol. 93; no. 5; pp. 1015 - 1026
Main Authors Hu, Zilun, Yang, Jianying
Format Journal Article
LanguageEnglish
Published Abingdon Taylor & Francis 03.05.2020
Taylor & Francis Ltd
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:This paper studies a fully distributed optimal formation flying problem for a multi-satellite system with a chief satellite and some deputy satellites, in order to seek the optimal formation via simple local information exchange. A distributed algorithm is proposed such that the satellites team performance is optimised in finite time while all of the satellites meet the formation constraint. To achieve the optimal flight, the performance functions for each deputy satellite that can describe the satellite's contribution to the task are introduced. Here, the performance functions can be time varying, which generally changes the problem from finding the fixed optimal point to tracking the optimal trajectory. Theoretical studies indicate that the proposed algorithm will optimise the satellites flight and all of the satellites can keep the desired communication distance. Finally, simulation examples are presented to show the validity of the theoretical results.
ISSN:0020-7179
1366-5820
DOI:10.1080/00207179.2018.1486512