Search

This article focuses on the vibration reducing and angle tracking problems of a flexible unmanned spacecraft system subject to input nonlinearity, asymmetric output constraint, and system parameter uncertainties. Using the backstepping technique, a boundary control scheme is designed to suppress the vibration and regulate the angle of the spacecraft. A modified asymmetric barrier Lyapunov function is utilized to ensure that the output constraint is never transgressed. Considering the system robustness, neural networks are used to handle the system parameter uncertainties and compensate for the effect of input nonlinearity. With the proposed adaptive neural network control law, the stability of the closed-loop system is proved based on the Lyapunov analysis, and numerical simulations are carried out to show the validity of the developed control scheme.

A significant number of the planned on-orbit servicing and active debris removal missions will be performed by a spacecraft equipped with a robotic arm. In this paper we propose a new method for the path planning of the robotic arm mounted on the free-floating unmanned spacecraft. In the proposed approach the path of the arm is described in the joint space by a spline function. The coordinates of spline knots form the vector of decision variables. The constrained nonlinear optimization problem is formulated and solved with an active-set algorithm. The proposed method generates a collision-free path of the arm that results in the desired position and orientation of the gripper and the desired attitude of the spacecraft. The possibility of achieving all these goals at the same time is the major advantage of the proposed approach. The practical applicability of the presented method is demonstrated in experiments performed on the planar air-bearing microgravity simulator (for a planar case) and using numerical simulations performed with the Monte Carlo method (for a spatial case). In the planar case the optimal path is compared with the path obtained using the bi-directional Rapidly-exploring Random Trees (RRT) algorithm. It is shown that the path obtained using the proposed method is shorter and smoother than the RRT path.