Abstract
This paper addresses connectivity preservation and collision avoidance problem of spacecraft formation flying with multiple obstacles and parametric uncertainties under a proximity graph. In the proximity graph, each spacecraft can only get the states of the neighbor spacecraft within its sensing region. Connectivity preservation of a graph means that the connectivity of the graph should be preserved at all times during spacecraft formation flying. We consider two cases: (i) the obstacles are static, and (ii) the obstacles are dynamic. In the first case, a distributed continuous control algorithm based on artificial potential function and equivalent certainty principle is proposed to account for the unknown parameters and the static obstacles. In the second case, a sliding surface combined with a distributed adaptive control algorithm is proposed to tackle the influence of the dynamic obstacles and the unknown parameters at the same time. With the distributed control algorithms, the desired formation configuration can be achieved while the connectivity of the graph is preserved and the collisions between the spacecraft and the obstacles are avoided. Numerical simulations are presented to illustrate the theoretical results.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.