Search

Existing studies on rehabilitation robots are generally devoted to robot-assisted active rehabilitation training, which is conducive to facilitating muscle and nerve regeneration. However, human–robot interaction (HRI) requires imposing a limit on the workspace within which the robot operates, so as to ensure patient safety. A safe admittance boundary algorithm for a rehabilitation robot is proposed based on the space classification model which works by constructing a virtual boundary for the HRI workspace in the control layer. First, point cloud isodensification is performed for the workspaces within which the human body and the robot operate. Next, the nearest neighbor density is determined for the point cloud, and the space classification model is built on this basis. Finally, the space classification model is integrated with admittance control to derive the safe admittance boundary algorithm, which can be used for safety control. This algorithm is then subjected to space verification experiments and out–of–bounds experiments using a dynamic arm simulator (DAS). As indicated by the experimental results, when the side length of the voxel grid for voxel center filtering is set to 0.06 m, the accuracy of space definition is 98.40%. The average maximum response time for out–of–bounds behaviors is 165.62 ms. The safe admittance boundary algorithm can impose reasonable virtual constraints on the robot workspace, thereby improving HRI safety.

Tracking and grasping a moving target is currently a challenging topic in the field of robotics. The current visual servo grasping method is still inadequate, as the real-time performance and robustness of target tracking both need to be improved. A target tracking method is proposed based on improved geometric particle filtering (IGPF). Following the geometric particle filtering (GPF) tracking framework, affine groups are proposed as state particles. Resampling is improved by incorporating an improved conventional Gaussian resampling algorithm. It addresses the problem of particle diversity loss and improves tracking performance. Additionally, the OTB2015 dataset and typical evaluation indicators in target tracking are adopted. Comparative experiments are performed using PF, GPF and the proposed IGPF algorithm. A dynamic target tracking and grasping method for the robot is proposed. It combines an improved Gaussian resampling particle filter algorithm based on affine groups and the positional visual servo control of the robot. Finally, the robot conducts simulation and experiments on capturing dynamic targets in the simulation environment and actual environment. It verifies the effectiveness of the method proposed in this paper.

A global path planning method is proposed based on improved ant colony optimization according to the slow convergence speed in mobile service robot path planning. The distribution of initial pheromone is determined by the critical obstacle influence factor. The influence factor is introduced into the heuristic information to improve the convergence speed of the algorithm at an early stage. A new pheromone update rule is presented using fuzzy control to change the value of pheromone heuristic factor and expectation heuristic factor, adjusting the evaporation rate in stages. The method achieves fast convergence and guarantees global search capability. Finally, the simulation results show that the improved algorithm not only shortens the running time of global path planning, but also has a higher probability of obtaining a global optimal solution. The convergence speed of the algorithm is better than the traditional ant colony algorithm.

A re-entry path planning method in omitting areas for service robots is suggested based on dynamic Inver-Over evolutionary algorithms after the robot automatically avoids obstacles. The complete coverage path planning is researched for cleaning service robots. Combined with features of dynamic travelling salesmen problem (DTSP), a local operator is employed for the path planning to enhance real-time dynamic properties of the Inver-Over algorithm. The method addresses the path planning problem that a number of cells undergo dynamic changes over time under work environment of cleaning robots. With simulations and experiments performed, it is discovered that the average relative error is 2.2% between the re-entry path planning and the best path, which validates the effectiveness and feasibility of the method.