Exploring a Novel Multiple-Query Resistive Grid-Based Planning Method Applied to High-DOF Robotic Manipulators

Abstract

The applicability of the path planning strategy to robotic manipulators has been an exciting topic for researchers in the last few decades due to the large demand in the industrial sector and its enormous potential development for space, surgical, and pharmaceutical applications. The automation of high-degree-of-freedom (DOF) manipulator robots is a challenging task due to the high redundancy in the end-effector position. Additionally, in the presence of obstacles in the workspace, the task becomes even more complicated. Therefore, for decades, the most common method of integrating a manipulator in an industrial automated process has been the demonstration technique through human operator intervention. Although it is a simple strategy, some drawbacks must be considered: first, the path’s success, length, and execution time depend on operator experience; second, for a structured environment with few objects, the planning task is easy. However, for most typical industrial applications, the environments contain many obstacles, which poses challenges for planning a collision-free trajectory. In this paper, a multiple-query method capable of obtaining collision-free paths for high DOF manipulators with multiple surrounding obstacles is presented. The proposed method is inspired by the resistive grid-based planner method (RGBPM). Furthermore, several improvements are implemented to solve complex planning problems that cannot be handled by the original formulation. The most important features of the proposed planner are as follows: (1) the easy implementation of robotic manipulators with multiple degrees of freedom, (2) the ability to handle dozens of obstacles in the environment, (3) compatibility with various obstacle representations using mathematical models, (4) a new recycling of a previous simulation strategy to convert the RGBPM into a multiple-query planner, and (5) the capacity to handle large sparse matrices representing the configuration space. A numerical simulation was carried out to validate the proposed planning method’s effectiveness for manipulators with three, five, and six DOFs on environments with dozens of surrounding obstacles. The case study results show the applicability of the proposed novel strategy in quickly computing new collision-free paths using the first execution data. Each new query requires less than 0.2 s for a 3 DOF manipulator in a configuration space free-modeled by a 7291 × 7291 sparse matrix and less than 30 s for five and six DOF manipulators in a configuration space free-modeled by 313,958 × 313,958 and 204,087 × 204,087 sparse matrices, respectively. Finally, a simulation was conducted to validate the proposed multiple-query RGBPM planner’s efficacy in finding feasible paths without collision using a six-DOF manipulator (KUKA LBR iiwa 14R820) in a complex environment with dozens of surrounding obstacles.

A Comprehensive Overview of Classical and Modern Route Planning Algorithms for Self-Driving Mobile Robots

“…As a result, a static environment assumption is often used in research articles [14]. Allowing the robot to compute its own setup sequence would allow it to broaden its applications and accomplish more than one activity in a fixed area [15]. This would allow the robot to be more versatile.…”

“…The advantages of APF are that it is fast to compute, and it generates a collision-free path [23]. However, the technique had several flaws, such as local minima, unreachable goals, and narrow passages [15]. As illustrated in Fig.…”

Reactive Neural Path Planning with Dynamic Obstacle Avoidance in a Condensed Configuration Space

“…Especially for dynamic obstacles and real-time applications, this mapping must be very fast and highly efficient. Lookup tables have proven to fulfill these requirements [13], [14], [15]. During the generation of the lookup table, the neurons are associated with the corresponding robot task space coverage.…”

“…Besides common issues with narrow passages, random sampling in a high-dimensional search space is computationally quite inefficient. Another fast approach for projecting obstacles from Cartesian to C-space is a bidirectional lookup table [13], [14], [15]. This method allows a very fast mapping from the task to the C-space, however, the amount of memory increases exponentially with the DOF of the robot and especially for many DOF the discretization must be very sparse to allow the storage of the whole C-space.…”

Research on Kinematics Analysis and Trajectory Planning of Novel EOD Manipulator

“…The British "trolley" [2,3] series, the German "TEODOR" [4] series and the American "Andros" [5,6] series have been developed and applied in battlefields or terrorist activities. In China, there are also the "Lizards" [7,8] series of EOD robots, designed by the Institute of Automation of the Chinese Academy of Sciences, and the "Super-D" [9,10] series of EOD robots developed by Shanghai Jiao Tong University, equipped in various subway stations, parks and other densely populated areas.…”