Search

The high-precision trajectory tracking and chatter-free performance of the manipulators are of great significance to the improvement of the automation level. Therefore, in view of the problems of chattering and tracking performance degradation of multi-joint manipulators caused by uncertain factors such as external disturbances and modeling errors, an adaptive fuzzy sliding mode control of the manipulator based on an improved super-twisting algorithm is proposed. First, fuzzy control is chosen to approximate the uncertainty of the manipulator model, which reduces the influence of unknown disturbances on the system, and then the adaptive law is utilized to automatically modify and improve the fuzzy rules to enhance the approximation capability; Second, an improved super-twisting algorithm is used on this basis to put the discontinuous term into the integral term to avoid chattering and eliminate the approximation error; Finally, a comparative simulation experiment is carried out with the 3-DOF manipulator as the research object. The experimental results show that the method in this paper improves the convergence speed by up to 69.74% and the tracking error accuracy by up to 85.11% over the fuzzy control based on adaptive reaching law with no chattering and little difference in control inputs, thus verifying the feasibility and superiority of the method.

Among the shortcomings of the A* algorithm, for example, there are many search nodes in path planning, and the calculation time is long. This article proposes a three-neighbor search A* algorithm combined with artificial potential fields to optimize the path planning problem of mobile robots. The algorithm integrates and improves the partial artificial potential field and the A* algorithm to address irregular obstacles in the forward direction. The artificial potential field guides the mobile robot to move forward quickly. The A* algorithm of the three-neighbor search method performs accurate obstacle avoidance. The current pose vector of the mobile robot is constructed during obstacle avoidance, the search range is narrowed to less than three neighbors, and repeated searches are avoided. In the matrix laboratory environment, grid maps with different obstacle ratios are compared with the A* algorithm. The experimental results show that the proposed improved algorithm avoids concave obstacle traps and shortens the path length, thus reducing the search time and the number of search nodes. The average path length is shortened by 5.58%, the path search time is shortened by 77.05%, and the number of path nodes is reduced by 88.85%. The experimental results fully show that the improved A* algorithm is effective and feasible and can provide optimal results.