The attitude synchronization problem for multiple spacecraft with input constraints is investigated in this paper. Two distributed control laws are presented and analyzed. First, by intro- ducing bounded function, a d...The attitude synchronization problem for multiple spacecraft with input constraints is investigated in this paper. Two distributed control laws are presented and analyzed. First, by intro- ducing bounded function, a distributed asymptotically stable control law is proposed. Such a con- trol scheme can guarantee attitude synchronization and the control inputs of each spacecraft can be a priori bounded regardless of the number of its neighbors. Then, based on graph theory, homoge- neous method, and Lyapunov stability theory, a distributed finite-time control law is designed. Rig- orous proof shows that attitude synchronization of multiple spacecraft can be achieved in finite time, and the control scheme satisfies input saturation requirement. Finally, numerical simulations are presented to demonstrate the effectiveness and feasibility of the oroDosed schemes.展开更多
基金supported by the Natural Science Foundation of Heilongjiang Province (No. F201326)
文摘The attitude synchronization problem for multiple spacecraft with input constraints is investigated in this paper. Two distributed control laws are presented and analyzed. First, by intro- ducing bounded function, a distributed asymptotically stable control law is proposed. Such a con- trol scheme can guarantee attitude synchronization and the control inputs of each spacecraft can be a priori bounded regardless of the number of its neighbors. Then, based on graph theory, homoge- neous method, and Lyapunov stability theory, a distributed finite-time control law is designed. Rig- orous proof shows that attitude synchronization of multiple spacecraft can be achieved in finite time, and the control scheme satisfies input saturation requirement. Finally, numerical simulations are presented to demonstrate the effectiveness and feasibility of the oroDosed schemes.
