With the manipulator performs fixed-point tasks, it becomes adversely affected by external disturbances, parameter variations, and random noise. Therefore, it is essential to improve the robust and accuracy of the controller. In this article, a self-tuning particle swarm optimization (PSO) fuzzy PID positioning controller is designed based on fuzzy PID control. The quantization and scaling factors in the fuzzy PID algorithm are optimized by PSO in order to achieve high robustness and high accuracy of the manipulator. First of all, a mathematical model of the manipulator is developed, and the manipulator positioning controller is designed. A PD control strategy with compensation for gravity is used for the positioning control system. Then, the PID controller parameters dynamically are minute-tuned by the fuzzy controller 1. Through a closed-loop control loop to adjust the magnitude of the quantization factors–proportionality factors online. Correction values are outputted by the modified fuzzy controller 2. A quantization factor–proportion factor online self-tuning strategy is achieved to find the optimal parameters for the controller. Finally, the control performance of the improved controller is verified by the simulation environment. The results show that the transient response speed, tracking accuracy, and follower characteristics of the system are significantly improved.

Gesture recognition technology is widely used in the flexible and precise control of manipulators in the assisted medical field. Our MResLSTM algorithm can effectively perform dynamic gesture recognition. The result of surface EMG signal decoding is applied to the controller, which can improve the fluency of artificial hand control. Much current gesture recognition research using sEMG has focused on static gestures. In addition, the accuracy of recognition depends on the extraction and selection of features. However, Static gesture research cannot meet the requirements of natural human-computer interaction and dexterous control of manipulators. Therefore, a multi-stream residual network (MResLSTM) is proposed for dynamic hand movement recognition. This study aims to improve the accuracy and stability of dynamic gesture recognition. Simultaneously, it can also advance the research on the smooth control of the Manipulator. We combine the residual model and the convolutional short-term memory model into a unified framework. The architecture extracts spatiotemporal features from two aspects: global and deep, and combines feature fusion to retain essential information. The strategy of pointwise group convolution and channel shuffle is used to reduce the number of network calculations. A dataset is constructed containing six dynamic gestures for model training. The experimental results show that on the same recognition model, the gesture recognition effect of fusion of sEMG signal and acceleration signal is better than that of only using sEMG signal. The proposed approach obtains competitive performance on our dataset with the recognition accuracies of 93.52%, achieving state-of-the-art performance with 89.65% precision on the Ninapro DB1 dataset. Our bionic calculation method is applied to the controller, which can realize the continuity of human-computer interaction and the flexibility of manipulator control.

The continuous development of deep learning improves target detection technology day by day. The current research focuses on improving the accuracy of target detection technology, resulting in the target detection model being too large. The number of parameters and detection speed of the target detection model are very important for the practical application of target detection technology in embedded systems. This article proposed a real-time target detection method based on a lightweight convolutional neural network to reduce the number of model parameters and improve the detection speed. In this article, the depthwise separable residual module is constructed by combining depthwise separable convolution and non–bottleneck-free residual module, and the depthwise separable residual module and depthwise separable convolution structure are used to replace the VGG backbone network in the SSD network for feature extraction of the target detection model to reduce parameter quantity and improve detection speed. At the same time, the convolution kernels of 1 × 3 and 3 × 1 are used to replace the standard convolution of 3 × 3 by adding the convolution kernels of 1 × 3 and 3 × 1, respectively, to obtain multiple detection feature graphs corresponding to SSD, and the real-time target detection model based on a lightweight convolutional neural network is established by integrating the information of multiple detection feature graphs. This article used the self-built target detection dataset in complex scenes for comparative experiments; the experimental results verify the effectiveness and superiority of the proposed method. The model is tested on video to verify the real-time performance of the model, and the model is deployed on the Android platform to verify the scalability of the model.

Intelligent vehicles were widely used in logistics handling, agriculture, medical service, industrial production, and other industries, but they were often not smooth enough in planning the path, and the number of turns was large, resulting in high energy consumption. Aiming at the unsmooth path planning problem of four-wheel intelligent vehicle path planning algorithm, this article proposed an improved genetic and ant colony hybrid algorithm, and the physical model of intelligent vehicle was established. This article first improved ant colony optimization algorithm about heuristic function with the adaptive change of evaporation factor. Then, it improved the genetic algorithm on fitness function, adaptive adjustment of crossover factor, and mutation factor. Last, this article proposed the improved hybrid algorithm with the addition of a deletion operator, adoption of an elite retention strategy, and addition of suboptimal solutions obtained from the improved ant colony algorithm to improved genetic algorithm to obtain optimized new populations. The simulation environment for this article is windows 10, the processor is Intel Core i5-5257U, the running memory is 4GB, the compilation environment is MATLAB2018b, the number of ant samples is 50, the maximum number of iterations is 100, the initial population size of the genetic algorithm is 200, and the maximum number of iterations is 50. Simulation and physical experiments show that the improved hybrid algorithm is effective. Compared with the traditional hybrid algorithm, the improved hybrid algorithm reduced by 46% in the average number of iterations and 75% in the average number of turns in a simple grid. The improved hybrid algorithm reduced by 47% in the average number of iterations and 21% in the average number of turns in a complex grid. The improved hybrid algorithm works better to reduce the number of turns in simple maps.

The analysis of robot inverse kinematic solutions is the basis of robot control and path planning, and is of great importance for research. Due to the limitations of the analytical and geometric methods, intelligent algorithms are more advantageous because they can obtain approximate solutions directly from the robot’s positive kinematic equations, saving a large number of computational steps. Particle Swarm Algorithm (PSO), as one of the intelligent algorithms, is widely used due to its simple principle and excellent performance. In this paper, we propose an improved particle swarm algorithm for robot inverse kinematics solving. Since the setting of weights affects the global and local search ability of the algorithm, this paper proposes an adaptive weight adjustment strategy for improving the search ability. Considering the running time of the algorithm, this paper proposes a condition setting based on the limit joints, and introduces the position coefficient k in the velocity factor. Meanwhile, an exponential product form modeling method (POE) based on spinor theory is chosen. Compared with the traditional DH modeling method, the spinor approach describes the motion of a rigid body as a whole and avoids the singularities that arise when described by a local coordinate system. In order to illustrate the advantages of the algorithm in terms of accuracy, time, convergence and adaptability, three experiments were conducted with a general six-degree-of-freedom industrial robotic arm, a PUMA560 robotic arm and a seven-degree-of-freedom robotic arm as the research objects. In all three experiments, the parameters of the robot arm, the range of joint angles, and the initial attitude and position of the end-effector of the robot arm are given, and the attitude and position of the impact point of the end-effector are set to verify whether the joint angles found by the algorithm can reach the specified positions. In Experiments 2 and 3, the algorithm proposed in this paper is compared with the traditional particle swarm algorithm (PSO) and quantum particle swarm algorithm (QPSO) in terms of position and direction solving accuracy, operation time, and algorithm convergence. The results show that compared with the other two algorithms, the algorithm proposed in this paper can ensure higher position accuracy and orientation accuracy of the robotic arm end-effector. the position error of the algorithm proposed in this paper is 0 and the maximum orientation error is 1.29 × 10^–8. while the minimum position error of the other two algorithms is −1.64 × 10^–5 and the minimum orientation error is −4.03 × 10^–6. In terms of operation time, the proposed algorithm in this paper has shorter operation time compared with the other two algorithms. In the last two experiments, the computing time of the proposed algorithm is 0.31851 and 0.30004s respectively, while the shortest computing time of the other two algorithms is 0.33359 and 0.30521s respectively. In terms of algorithm convergence, the proposed algorithm can achieve faster and more stable convergence than the other two algorithms. After changing the experimental subjects, the proposed algorithm still maintains its advantages in terms of accuracy, time and convergence, which indicates that the proposed algorithm is more applicable and has certain potential in solving the multi-arm inverse kinematics solution. This paper provides a new way of thinking for solving the multi-arm inverse kinematics solution problem.

Complete trajectory planning includes path planning, inverse solution solving and trajectory optimization. In this paper, a highly smooth and time-saving approach to trajectory planning is obtained by improving the kinematic and optimization algorithms for the time-optimal trajectory planning problem. By partitioning the joint space, the paper obtains an inverse solution calculation based on the partitioning of the joint space, saving 40% of the inverse kinematics solution time. This means that a large number of computational resources can be saved in trajectory planning. In addition, an improved sparrow search algorithm (SSA) is proposed to complete the solution of the time-optimal trajectory. A Tent chaotic mapping was used to optimize the way of generating initial populations. The algorithm was further improved by combining it with an adaptive step factor. The experiments demonstrated the performance of the improved SSA. The robot’s trajectory is further optimized in time by an improved sparrow search algorithm. Experimental results show that the method can improve convergence speed and global search capability and ensure smooth trajectories.