Sampling-based methods are popular in the motion planning of robots, especially in high-dimensional spaces. Among the many such methods, the Rapidly-exploring Random Tree (RRT) algorithm has been widely used in multi-degree-of-freedom manipulators and has yielded good results. However, existing RRT planners have low exploration efficiency and slow convergence speed and have been unable to meet the requirements of the intelligence level in the Industry 4.0 mode. To solve these problems, a general autonomous path planning algorithm of Node Control (NC-RRT) is proposed in this paper based on the architecture of the RRT algorithm. Firstly, a method of gradually changing the sampling area is proposed to guide exploration, thereby effectively improving the search speed. In addition, the node control mechanism is introduced to constrain the extended nodes of the tree and thus reduce the extension of invalid nodes and extract boundary nodes (or near-boundary nodes). By changing the value of the node control factor, the random tree is prevented from falling into a so-called “local trap” phenomenon, and boundary nodes are selected as extended nodes. The proposed algorithm is simulated in different environments. Results reveal that the algorithm greatly reduces the invalid exploration in the configuration space and significantly improves planning efficiency. In addition, because this method can efficiently use boundary nodes, it has a stronger applicability to narrow environments compared with existing RRT algorithms and can effectively improve the success rate of exploration.
In this paper, we propose a new path planning algorithm based on the probabilistic roadmaps method (PRM), in order to effectively solve the autonomous path planning of mobile robots in complex environments with multiple narrow channels. The improved PRM algorithm mainly improves the density and distribution of sampling points in the narrow channel, through a combination of the learning process of the PRM algorithm and the APF algorithm. We also shortened the required time and path length by optimizing the query process. The first key technology to improve the PRM algorithm involves optimizing the number and distribution of free points and collision-free lines in the free workspace. To ensure full visibility of the narrow channel, we extend the obstacles through the diagonal distance of the mobile robot while ignoring the safety distance. Considering the safety distance during movement, we re-classify the all sampling points obtained by the quasi-random sampling principle into three categories: free points, obstacle points, and adjacent points. Next, we transform obstacle points into the free points of the narrow channel by combining the APF algorithm and the characteristics of the narrow channel, increasing the density of sampling points in the narrow space. Then, we include potential energy judgment into the construction process of collision-free lines shortening the required time and reduce collisions with obstacles. Optimizing the query process of the PRM algorithm is the second key technology. To reduce the required time in the query process, we adapt the bidirectional A* algorithm to query these local paths and obtain an effective path to the target point. We also combine the path pruning technology with the potential energy function to obtain a short path without collisions. Finally, the experimental results demonstrate that the new PRM path planning technology can improve the density of free points in narrow spaces and achieve an optimized, collision-free path in complex environments with multiple narrow channels.
The motion control of robot manipulators is a crucial problem concerning automatically controlled robots. In this work, the model predictive control method with an integral compensation (MPC-I), which compensates for the matched uncertainties due to unmodeled dynamics, is proposed to solve the trajectory tracking problem of robot manipulators in joint and task spaces. First, this paper decouples the joint variables of the robot manipulator using a computed torque control method. The MPC-I method is, thereafter, derived to realize the motion control of the robot manipulators in joint space. To realize the motion control of the robot manipulator in task space, the task space is, thereafter, converted into the joint space, in which the MPC-I method is executed, afterward, to control the robot. Furthermore, an MPC-I variation, in which the inverse kinematics is calculated indirectly, is proposed to achieve the motion control in task space. The novelty of this paper is to propose the MPC-I method and the method of converting task space to joint space with indirect inverse kinematics calculation. The former is suitable for the dynamic control of the robot manipulators in the joint space, and the latter can extend the MPC-I method to dynamic control in task space. To evaluate the performance of the proposed control method, motion control simulations are performed in the task and joint spaces, respectively. Simulation results and comparisons verify the effectiveness of the proposed control approach for the dynamic control of the UR5 robot manipulator.
A novel robot capable of performing maintenance and inspection tasks for railway bridges is proposed in this paper. Termed CMBOT (climbing manipulator robot), the robot is a combination of a five-degrees-of-freedom (5-Dof) biped climbing robot with two electromagnetic feet and a redundant manipulator with 7-Dof. This capability offers important advantages for performing maintenance and inspection tasks for railway bridges. Several fundamental issues of the CMBOT, such as robotic system development and motion planning algorithms, are addressed in this paper. A series of simulations and prototype experiments were conducted to validate the proposed robotic systems and motion planning algorithm. The results of the experiments show the reliability of the robotic systems and the efficiency of the motion planning algorithm.
Dynamic-stability criteria are crucial for robot’s motion planning and balance recovery. Nevertheless, few studies focus on the motion stability of quadruped robots with dynamic gait, none of which have accurately evaluated the robots’ stability. To fill the gaps in this field, this paper presents a new stability criterion for the motion of quadruped robots with dynamic gaits running over irregular terrain. The traditional zero-moment point (ZMP) is improved to analyze the motion on irregular terrain precisely for dynamic gaits. A dynamic-stability criterion and measurement are proposed to determine the stability state of the robot and to evaluate its stability. The simulation results show the limitations of the existing stability criteria for dynamic gaits and indicate that the criterion proposed in this paper can accurately and efficiently evaluate the stability of a quadruped robot using such gaits.