Abstract
ABSTRACTThis 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
