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.
Mobile manipulator robots have become important pieces of equipment due to the high mobility of mobile subsystems and the high flexibility of manipulator subsystems. Considering the increasing degrees of freedom and the need to avoid singular locations, one of the most challenging problems is solving the inverse kinematics problem of mobile manipulator robots (IKMM). Of all the popular optimization algorithms, the differential evolution (DE) algorithm is the most effective method for quickly solving the IKMM problem with sufficient solutions. Currently, many strategies have been proposed for DE algorithms to improve the performance of solving mathematical problems; some symmetry strategies or symmetry functions have been introduced to DE algorithms. However, the effects of various DE algorithms on solving the actual IKMM lack a comprehensive explanation. Therefore, we divide various DE algorithms into three categories considering the control parameter selection and compare the specific optimization of various DE algorithms. Then, we compare the performance of various DE algorithms when solving the inverse kinematics problems of mobile manipulators with different degrees of freedom. Considering the effectiveness and the speed of the DE algorithm on the IKMM problem, we determine the best DE algorithm by comparing the error and time required to reach 100 random mission points and tracking the typical trajectories. Finally, the best-performing DE method is further improved by studying the selection of fundamental parameters in the best DE algorithm. Valuable conclusions are obtained from these experimental simulations, which can help with choosing an algorithm that is suitable for solving the inverse kinematics problem of mobile manipulator robots in practice.
Differential evolution is a popular algorithm for solving global optimization problems. When tested, it has reportedly outperformed both robotic problems and benchmarks. However, it may have issues with local optima or premature convergence. In this paper, we present a novel BODE-CS (Bidirectional Opposite Differential Evolution–Cuckoo Search) algorithm to solve the inverse kinematics problem of a six-DOF EOD (Explosive Ordnance Disposal) robot manipulator. The hybrid algorithm was based on the differential evolution algorithm and Cuckoo Search algorithm. To avoid any local optimum and accelerate the convergence of the swarm, various strategies were introduced. Firstly, a forward-kinematics model was established, and the objective function was formulated according to the structural characteristics of the robot manipulator. Secondly, a Halton sequence and an opposite search strategy were used to initialize the individuals in the swarm. Thirdly, the optimization algorithms applied to the swarm were dynamically allocated to the Differential Evolution algorithm or the Cuckoo algorithm. Fourthly, a composite differential algorithm, which consisted of a dynamically opposite differential strategy, a bidirectional search strategy, and two other typically used differential strategies were introduced to maintain the diversity of the swarm. Finally, two adaptive parameters were introduced to optimize the amplification factor F and cross-over probability Cr. To verify the performance of the BODE-CS algorithm, two different tasks were tested. The experimental results of the simulation showed that the BODE-CS algorithm had high accuracy and a fast convergence rate, which met the requirements of an inverse solution for the manipulator.
In this paper, we propose an optimized differential evolution algorithm based on kinematic limitations and structural complexity constraints to solve the trajectory tracking problem for a mobile manipulator robot. The traditional method mainly involves obtaining the speed of the control variable based on the Jacobian inverse or linearization of the robot’s kinematic model, which cannot avoid the singularity position and/or self-collision phenomena. To address these problems, we directly design an optimized differential evolution algorithm to solve the trajectory planning problem for mobile manipulator robots. First, we analyze various constraints on the actual movement and describe them specifically using various equations or inequalities, including non-holonomic constraints on the mobile platform, the physical limitations of the driving motors, self-collision avoidance restriction, and smoothly traversing the singularity position. Next, we re-define the trajectory tracking of a mobile manipulator robot as an optimization problem under multiple constraints, including the trajectory tracking task and various constraints simultaneously. Then, we propose a new differential evolution (DE) algorithm by optimizing some critical operations to solve the optimization problem, such as improving the population’s distribution, limiting the population distribution range, and adding a success index. Additionally, we design two simple trajectories and two complex trajectories to determine the performance of the optimized DE algorithm in solving the trajectory tracking problem. The results demonstrate that the optimized DE algorithm can effectively realize the high-precision trajectory tracking task of a differential wheeled mobile manipulator robot through the consideration of kinematic limitations and self-collision avoidance.
In order to protect people’s lives and property, increasing numbers of explosive disposal robots have been developed. It is necessary for an explosive ordinance disposal (EOD) robot to quickly detect all explosives, especially when the location of the explosives is unknown. To achieve this goal, we propose a bidirectional dynamic weighted-A star (BD-A*) algorithm and a learn memory-swap sequence particle swarm optimization (LM-SSPSO) algorithm. Firstly, in the BD-A* algorithm, our aim is to obtain the shortest distance path between any two goal positions, considering computation time optimization. We optimize the computation time by introducing a bidirectional search and a dynamic OpenList cost weight strategy. Secondly, the search-adjacent nodes are extended to obtain a shorter path. Thirdly, by using the LM-SSPSO algorithm, we aim to plan the shortest distance path that traverses all goal positions. The problem is similar to the symmetric traveling salesman problem (TSP). We introduce the swap sequence strategy into the traditional PSO and optimize the whole PSO process by imitating human learning and memory behaviors. Fourthly, to verify the performance of the proposed algorithm, we begin by comparing the improved A* with traditional A* over different resolutions, weight coefficients, and nodes. The hybrid PSO algorithm is also compared with other intelligent algorithms. Finally, different environment maps are also discussed to further verify the performance of the algorithm. The simulation results demonstrate that our improved A* algorithm has superior performance by finding the shortest distance with less computational time. In the simulation results for LM-SSPSO, the convergence rate significantly improves, and the improved algorithm is more likely to obtain the optimal path.
In this paper, an optimized kinematic modeling method to accurately describe the actual structure of a mobile manipulator robot with a manipulator similar to the universal robot (UR5) is developed, and an improved self-collision detection technology realized for improving the description accuracy of each component and reducing the time required for approximating the whole robot is introduced. As the primary foundation for trajectory tracking and automatic navigation, the kinematic modeling technology of the mobile manipulator has been the subject of much interest and research for many years. However, the kinematic model established by various methods is different from the actual physical model due to the fact that researchers have mainly focused on the relationship between driving joints and the end positions while ignoring the physical structure. To improve the accuracy of the kinematic model, we present a kinematic modeling method with the addition of key points and coordinate systems to some components that failed to model the physical structure based on the classical method. Moreover, self-collision detection is also a primary problem for successfully completing the specified task of the mobile manipulator. In traditional self-collision detection technology, the description of each approximation is determined by the spatial transformation of each corresponding component in the mobile manipulator robot. Unlike the traditional technology, each approximation in the paper is directly established by the physical structure used in the kinematic modeling method, which significantly reduces the complicated analysis and shortens the required time. The numerical simulations prove that the kinematic model with the addition of key point technology is similar to the actual structure of mobile manipulator robots, and the self-collision detection technology proposed in the article effectively improves the performance of self-collision detection. Additionally, the experimental results prove that the kinematic modeling method and self-collision detection technology outlined in this paper can optimize the inverse kinematics solution.