This paper investigates the robust finite-time rendezvous maneuver control for spacecraft via sliding mode control technology. Two control architectures are devised for realizing the control objective, where a novel-developed sliding mode surface (SMS) is designed by resorting to the hyperbolic tangent function. Without considering the chattering problem inherent in sliding mode control, a basis control scheme is constructed to force the tracking errors entering a compact set in finite time. To reduce the effect of the chattering phenomenon, a modified controller is established by resorting to the well-designed adaptive laws. Both of these two controllers can ensure finite-time convergence for the entire system. Theoretical analysis and numerical simulations have shown the effectiveness and superiorities of the proposed methods. INDEX TERMS Spacecraft rendezvous maneuver, finite-time control, sliding mode control, chattering problem, adaptive control.
An obstacle avoidance and path planning algorithm for a multi-joint manipulator in a space robot is presented in this paper. In this paper, the end-effector of the manipulator is used to capture some special target in a space environment with obstacles. To ensure the safety of the operation, a collisionfree path from the initial position to the target position is essential. Therefore, an obstacle avoidance and path planning algorithm based on the Rapidly-Exploring Random Tree (RRT) algorithm and the Forward and Backward Reaching Inverse Kinematics (FABRIK) algorithm is presented in this paper. First, a path planning algorithm based on the Rapidly-Exploring Random Tree (RRT) algorithm is designed for the multi-joint manipulator. Further, a method to generate a random point by artificial guidance is introduced for a higher searching speed. The RRT algorithm can effectively explore the entire workspace and find a feasible path without collision for the end-effector. To calculate the positions of each joint, the Forward and Backward Reaching Inverse Kinematics (FABRIK) algorithm is introduced and improved for the problem of inverse kinematics. The FABRIK algorithm avoids the use of rotational angles or matrices, and instead finds each joint position by locating a point on a line, and thus, it has a low computational cost. Therefore, the improved obstacle avoidance and path planning algorithm can quickly plan a feasible path for the multijoint manipulator in a space environment with obstacles. A numerical simulation is carried out to analyze the proposed obstacle avoidance and path planning method. It is observed that the method finds a feasible path without collision for the multi-joint manipulator with a low computational cost. These results validated the effectiveness of the proposed method for path planning to avoid the obstacles. INDEX TERMS FABRIK, multi-joint manipulator, obstacle avoidance, path planning, rapidly-exploring random tree.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.