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 collision-free 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. 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 multi-joint 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.
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.
Multi-region planning of the missions of a satellite swarm is regarded as a critical step in cooperative observations involving remote sensing. Given the individual differences between satellites and the constraints of task allocation, an objective function is used in this paper to achieve a balance between benefits and costs. To ensure the observation of a large area, the rate of region coverage is regarded as the basic benefit. To encourage the satellite swarm to finish its exhaustive cover as early as possible, the time consumed to complete the observation is regarded as an extra benefit. Furthermore, by punishing satellite storage and maneuvering, the overall observation scheme evolves toward low cost. A region-splitting technique is proposed herein. Each of a satellite's observation opportunities generates two candidate strips at the edge of the region. Once the strips have been confirmed to meet the mission constraints, the original region is reconstructed. Subsequently, the satellite swarm gradually envelops the region through several iterations. A simulated-annealing algorithm is also introduced in this paper. To achieve satellite swarm scheduling for multiple regions, optimization variables are established, and a neighborhood search method is used. Simulation results revealed that the proposed technique devised an observation scheme with high coverage, high timeliness, and low cost and also confirmed that the proposed algorithm had an excellent evolution speed of objective function value.