1
|
Qiao L, Luo X, Luo Q. An Optimized Probabilistic Roadmap Algorithm for Path Planning of Mobile Robots in Complex Environments with Narrow Channels. SENSORS (BASEL, SWITZERLAND) 2022; 22:8983. [PMID: 36433584 PMCID: PMC9699578 DOI: 10.3390/s22228983] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Figures] [Subscribe] [Scholar Register] [Received: 10/25/2022] [Revised: 11/12/2022] [Accepted: 11/16/2022] [Indexed: 06/16/2023]
Abstract
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.
Collapse
Affiliation(s)
- Lijun Qiao
- School of Mechatronical Engineering, Beijing Institute of Technology, Beijing 100081, China
| | - Xiao Luo
- School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China
| | - Qingsheng Luo
- School of Mechatronical Engineering, Beijing Institute of Technology, Beijing 100081, China
| |
Collapse
|
2
|
Huang CM, Hsu SH. Efficient Path Planning for a Microrobot Passing through Environments with Narrow Passages. MICROMACHINES 2022; 13:1935. [PMID: 36363956 PMCID: PMC9694047 DOI: 10.3390/mi13111935] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Figures] [Subscribe] [Scholar Register] [Received: 09/15/2022] [Revised: 10/27/2022] [Accepted: 11/03/2022] [Indexed: 06/16/2023]
Abstract
This paper presents an efficient path-planning algorithm for microrobots attempting to pass through environments with narrow passages. Because of the extremely small size of a microrobot, it is suitable for work in this kind of environment. The rapidly exploring random tree (RRT) algorithm, which uses random sampling points, can quickly explore an entire environment and generate a sub-optimal path for a robot to pass through it; however, the RRT algorithm, when used to plan a path for a microrobot passing through an environment with narrow passages, has the problem of being easily limited to local solutions when it confronts with a narrow passage and is unable to find the final path through it. In light of this, the objectives of the considered path planning problem involve detecting the narrow passages, leading the path toward an approaching narrow passage, passing through a narrow passage, and extending the path search more efficiently. A methodology was proposed based on the bidirectional RRT in which image processing is used to mark narrow passages and their entrances and exits so that the bidirectional RRT can be quickly guided to them and combined with the deterministic algorithm to find paths through them. We designed the methodology such that RRT generates the sampling points for path growth. The multiple importance sampling technique is incorporated with bidirectional RRT, named MIS-BiRRT, to make the path grow faster toward the target point and narrow passages while avoiding obstacles. The proposed algorithm also considers multiple candidate paths simultaneously to expand the search range and then retain the best one as a part of the planning path. After validation from simulation, the proposed algorithm was found to generate efficient path planning results for microrobots to pass through narrow passages.
Collapse
|
3
|
Abstract
One of the fundamental fields of research is motion planning. Mobile manipulators present a unique set of challenges for the planning algorithms, as they are usually kinematically redundant and dynamically complex owing to the different dynamic behavior of the mobile base and the manipulator. The purpose of this article is to systematically review the different planning algorithms specifically used for mobile manipulator motion planning. Depending on how the two subsystems are treated during planning, sampling-based, optimization-based, search-based, and other planning algorithms are grouped into two broad categories. Then, planning algorithms are dissected and discussed based on common components. The problem of dealing with the kinematic redundancy in calculating the goal configuration is also analyzed. While planning separately for the mobile base and the manipulator provides convenience, the results are sub-optimal. Coordinating between the mobile base and manipulator while utilizing their unique capabilities provides better solution paths. Based on the analysis, challenges faced by the current planning algorithms and future research directions are presented.
Collapse
|
4
|
Nottensteiner K, Sachtler A, Albu-Schäffer A. Towards Autonomous Robotic Assembly: Using Combined Visual and Tactile Sensing for Adaptive Task Execution. J INTELL ROBOT SYST 2021. [DOI: 10.1007/s10846-020-01303-z] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/22/2022]
Abstract
AbstractRobotic assembly tasks are typically implemented in static settings in which parts are kept at fixed locations by making use of part holders. Very few works deal with the problem of moving parts in industrial assembly applications. However, having autonomous robots that are able to execute assembly tasks in dynamic environments could lead to more flexible facilities with reduced implementation efforts for individual products. In this paper, we present a general approach towards autonomous robotic assembly that combines visual and intrinsic tactile sensing to continuously track parts within a single Bayesian framework. Based on this, it is possible to implement object-centric assembly skills that are guided by the estimated poses of the parts, including cases where occlusions block the vision system. In particular, we investigate the application of this approach for peg-in-hole assembly. A tilt-and-align strategy is implemented using a Cartesian impedance controller, and combined with an adaptive path executor. Experimental results with multiple part combinations are provided and analyzed in detail.
Collapse
|
5
|
Affiliation(s)
- Yajue Yang
- Department of Biomedical Engineering City University of Hong Kong Hong Kong SAR People's Republic of China
| | - Jia Pan
- Department of Computer Science The University of Hong Kong Hong Kong SAR People's Republic of China
| | - Weiwei Wan
- Graduate School of Engineering Science Osaka University Japan
| |
Collapse
|
6
|
Pek C, Manzinger S, Koschi M, Althoff M. Using online verification to prevent autonomous vehicles from causing accidents. NAT MACH INTELL 2020. [DOI: 10.1038/s42256-020-0225-y] [Citation(s) in RCA: 24] [Impact Index Per Article: 6.0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/09/2022]
|
7
|
Multiple-Target Homotopic Quasi-Complete Path Planning Method for Mobile Robot Using a Piecewise Linear Approach. SENSORS 2020; 20:s20113265. [PMID: 32521754 PMCID: PMC7308836 DOI: 10.3390/s20113265] [Citation(s) in RCA: 5] [Impact Index Per Article: 1.3] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 05/04/2020] [Revised: 05/22/2020] [Accepted: 05/27/2020] [Indexed: 11/18/2022]
Abstract
The ability to plan a multiple-target path that goes through places considered important is desirable for autonomous mobile robots that perform tasks in industrial environments. This characteristic is necessary for inspection robots that monitor the critical conditions of sectors in thermal, nuclear, and hydropower plants. This ability is also useful for applications such as service at home, victim rescue, museum guidance, land mine detection, and so forth. Multiple-target collision-free path planning is a topic that has not been very studied because of the complexity that it implies. Usually, this issue is left in second place because, commonly, it is solved by segmentation using the point-to-point strategy. Nevertheless, this approach exhibits a poor performance, in terms of path length, due to unnecessary turnings and redundant segments present in the found path. In this paper, a multiple-target method based on homotopy continuation capable to calculate a collision-free path in a single execution for complex environments is presented. This method exhibits a better performance, both in speed and efficiency, and robustness compared to the original Homotopic Path Planning Method (HPPM). Among the new schemes that improve their performance are the Double Spherical Tracking (DST), the dummy obstacle scheme, and a systematic criterion to a selection of repulsion parameter. The case studies show its effectiveness to find a solution path for office-like environments in just a few milliseconds, even if they have narrow corridors and hundreds of obstacles. Additionally, a comparison between the proposed method and sampling-based planning algorithms (SBP) with the best performance is presented. Furthermore, the results of case studies show that the proposed method exhibits a better performance than SBP algorithms for execution time, memory, and in some cases path length metrics. Finally, to validate the feasibility of the paths calculated by the proposed planner; two simulations using the pure-pursuit controlled and differential drive robot model contained in the Robotics System Toolbox of MATLAB are presented.
Collapse
|
8
|
|
9
|
Collision-Free Path Planning Method for Robots Based on an Improved Rapidly-Exploring Random Tree Algorithm. APPLIED SCIENCES-BASEL 2020. [DOI: 10.3390/app10041381] [Citation(s) in RCA: 22] [Impact Index Per Article: 5.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/17/2022]
Abstract
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.
Collapse
|
10
|
|
11
|
Affiliation(s)
- Rahul Kala
- Robotics and Machine Intelligence LaboratoryIndian Institute of Information Technology Allahabad India
| |
Collapse
|
12
|
Jiang R, Zhou H, Wang H, Ge SS. Maximum entropy searching. CAAI TRANSACTIONS ON INTELLIGENCE TECHNOLOGY 2019. [DOI: 10.1049/trit.2018.1058] [Citation(s) in RCA: 13] [Impact Index Per Article: 2.6] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/20/2022] Open
Affiliation(s)
- Rui Jiang
- Institute for Future (IFF)Qingdao UniversityQingdao266071People's Republic of China
| | - Hui Zhou
- School of Electrical and Electronic EngineeringNanyang Technological UniversitySingapore639798Singapore
| | - Han Wang
- School of Electrical and Electronic EngineeringNanyang Technological UniversitySingapore639798Singapore
| | - Shuzhi Sam Ge
- Institute for Future (IFF)Qingdao UniversityQingdao266071People's Republic of China
- Department of Electrical and Computer EngineeringNational University of SingaporeSingapore117583Singapore
| |
Collapse
|
13
|
Ye B, Tang Q, Yao J, Gao W. Collision-Free Path Planning and Delivery Sequence Optimization in Noncoplanar Radiation Therapy. IEEE TRANSACTIONS ON CYBERNETICS 2019; 49:42-55. [PMID: 29990095 DOI: 10.1109/tcyb.2017.2763682] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.6] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/08/2023]
Abstract
Radiation therapy is among the top three cancer treatments in current medical services. The novel noncoplanar radiation therapy which claimed the best characteristics in almost all dosimetric properties encountered the challenges of the potential collision and the long time delivering. In this paper, we proposed a brand new scheme which uses a combined method of the collision avoidance path planning based on an improved probability roadmap method (PRM) and the delivery sequence optimization based on a modified genetic algorithm (GA) to solve the problems in noncoplanar radiation therapy. A uniform sampling strategy, an improved connection strategy, and an efficient local planner are introduced to optimize the roadmap result and accelerate the roadmap construction. The GA is improved by the elitist selection, the local search strategy, and the similar substitution strategy to achieve a better performance both in convergence rate and optimal solution. Experiments are carried out on the simulation platform with typical therapy system models. The results show that our proposed methods work well with the radiation therapy system in a compact working area. Collision is avoided and time consumption is reduced. We believe that our proposed algorithms could solve the problems in current radiation therapy and promote their clinic applications.
Collapse
|
14
|
Abstract
SummaryPath planning under 2D map is a key issue in robot applications. However, most related algorithms rely on point-by-point traversal. This causes them usually cannot find the strict shortest path, and their time cost increases dramatically as the map scale increases. So we proposed RimJump to solve the above problem, and it is a new path planning method that generates the strict shortest path for a 2D map. RimJump selects points on the edge of barriers to form the strict shortest path. Simulation and experimentation prove that RimJump meets the expected requirements.
Collapse
|
15
|
|
16
|
Wang W, Zuo L, Xu X. A Learning-based Multi-RRT Approach for Robot Path Planning in Narrow Passages. J INTELL ROBOT SYST 2017. [DOI: 10.1007/s10846-017-0641-3] [Citation(s) in RCA: 38] [Impact Index Per Article: 5.4] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/30/2022]
|
17
|
Zhong C, Liu H. A Region-Specific Hybrid Sampling Method for Optimal Path Planning. INT J ADV ROBOT SYST 2017. [DOI: 10.5772/63031] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/08/2022] Open
Abstract
Finding high quality paths within a limited time in configuration space is a challenging issue for path planning. Recently, an asymptotically optimal method called fast marching tree (FMT*) has been proposed. This method converges significantly faster than its state-of-the-art counterparts when addressing a wide range of problems. However, FMT* appears unable to solve the narrow passage problem in optimal path planning, since it is based on uniform sampling. Aiming at solving this problem, a novel region-based sampling method integrating global scenario information and local region information is proposed in this paper. First, global information related to configuration space is extracted from an initial sample set obtained via hybrid sampling. Then, local regions are constructed and local region information is captured to make intelligent decisions regarding regions that are difficult and need to be boosted. Finally, the initial sample set is sent to FMT* using a modified locally optimal one-step connection strategy in order to find an initial and feasible solution. If no solution is found and time permits, the guided hybrid sampling will be adopted in order to add more useful samples to the sample set until a solution is found or the time for doing so runs out. Simulation results for six benchmark scenarios validate that our method can achieve significantly better results than other state-of-the-art methods when applied in challenging scenarios with narrow passages.
Collapse
Affiliation(s)
- Chengcheng Zhong
- Key Laboratory of Machine Perception (Ministry of Education), Shenzhen Graduate School, Peking University, China
| | - Hong Liu
- Key Laboratory of Machine Perception (Ministry of Education), Shenzhen Graduate School, Peking University, China
| |
Collapse
|
18
|
Pan J, Manocha D. Fast probabilistic collision checking for sampling-based motion planning using locality-sensitive hashing. Int J Rob Res 2016. [DOI: 10.1177/0278364916640908] [Citation(s) in RCA: 30] [Impact Index Per Article: 3.8] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/17/2022]
Abstract
We present a novel approach to perform fast probabilistic collision checking in high-dimensional configuration spaces to accelerate the performance of sampling-based motion planning. Our formulation stores the results of prior collision queries, and then uses such information to predict the collision probability for a new configuration sample. In particular, we perform an approximate k-NN ( k-nearest neighbor) search to find prior query samples that are closest to the new query configuration. The new query sample’s collision status is then estimated according to the collision checking results of these prior query samples, based on the fact that nearby configurations are likely to have the same collision status. We use locality-sensitive hashing techniques with sub-linear time complexity for approximate k-NN queries. We evaluate the benefit of our probabilistic collision checking approach by integrating it with a wide variety of sampling-based motion planners, including PRM (Probabilistic roadmaps), lazyPRM, RRT Rapidly exploring random trees, and RRT*. Our method can improve these planners in various manners, such as accelerating the local path validation, or computing an efficient order for the graph search on the roadmap. Experiments on a set of benchmarks demonstrate the performance of our method, and we observe up to 2x speedup in the performance of planners on rigid and articulated robots.
Collapse
Affiliation(s)
- Jia Pan
- Department of Mechanical and Biomedical Engineering, City University of Hong Kong, Hong Kong
| | - Dinesh Manocha
- Department of Computer Science, University of North Carolina, Chapel Hill, USA
| |
Collapse
|
19
|
Abstract
SUMMARYAn effective algorithm for path planning is introduced based on a novel concept, the distorted configuration space (DC-space), where all obstacles deform into dimensionless geometric objects. Path planning in this space can be conducted by simply connecting the starting position and ending position with a straight line. This linear path in the DC-space is then mapped back into a feasible in the original C-space. The advantage of this approach is that no trial-and-error or iteration is needed while a feasible path can be found directly if it exists. An algorithm with general formulas is derived. Examples in 2D and 3D are provided to validate this concept and algorithm.
Collapse
|
20
|
Abbadi A, Matousek R. Hybrid rule-based motion planner for mobile robot in cluttered workspace. Soft comput 2016. [DOI: 10.1007/s00500-016-2103-4] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/22/2022]
|
21
|
|
22
|
|
23
|
Lee J, Kwon OS, Zhang L, Yoon SE. A Selective Retraction-Based RRT Planner for Various Environments. IEEE T ROBOT 2014. [DOI: 10.1109/tro.2014.2309836] [Citation(s) in RCA: 22] [Impact Index Per Article: 2.2] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/09/2022]
|
24
|
Polden J, Pan Z, Larkin N, Van Duin S. Path Planning with a Lazy Significant Edge Algorithm (LSEA). INT J ADV ROBOT SYST 2013. [DOI: 10.5772/53516] [Citation(s) in RCA: 6] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/08/2022] Open
Abstract
Probabilistic methods have been proven to be effective for robotic path planning in a geometrically complex environment. In this paper, we propose a novel approach, which utilizes a specialized roadmap expansion phase, to improve lazy probabilistic path planning. This expansion phase analyses roadmap connectivity information to bias sampling towards objects in the workspace that have not yet been navigated by the robot. A new method to reduce the number of samples required to navigate narrow passages is also proposed and tested. Experimental results show that the new algorithm is more efficient than the traditional path planning methodologies. It was able to generate solutions for a variety of path planning problems faster, using fewer samples to arrive at a valid solution.
Collapse
Affiliation(s)
- Joseph Polden
- Defence Material Technology Centre, Faculty of Engineering, University of Wollongong, Australia
| | - Zengxi Pan
- Defence Material Technology Centre, Faculty of Engineering, University of Wollongong, Australia
| | - Nathan Larkin
- Defence Material Technology Centre, Faculty of Engineering, University of Wollongong, Australia
| | - Stephen Van Duin
- Defence Material Technology Centre, Faculty of Engineering, University of Wollongong, Australia
| |
Collapse
|
25
|
Wang W, Xu X, Li Y, Song J, He H. Triple RRTs: An Effective Method for Path Planning in Narrow Passages. Adv Robot 2012. [DOI: 10.1163/016918610x496928] [Citation(s) in RCA: 19] [Impact Index Per Article: 1.6] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/19/2022]
Affiliation(s)
- Wei Wang
- a Institute of Automation, College of Mechatronics and Automation, National University of Defense Technology, Changsha, Hunan 410073, P. R. China
| | - Xin Xu
- b Institute of Automation, College of Mechatronics and Automation, National University of Defense Technology, Changsha, Hunan 410073, P. R. China
| | - Yan Li
- c Institute of Automation, College of Mechatronics and Automation, National University of Defense Technology, Changsha, Hunan 410073, P. R. China
| | - Jinze Song
- d Institute of Automation, College of Mechatronics and Automation, National University of Defense Technology, Changsha, Hunan 410073, P. R. China
| | - Hangen He
- e Institute of Automation, College of Mechatronics and Automation, National University of Defense Technology, Changsha, Hunan 410073, P. R. China
| |
Collapse
|
26
|
|
27
|
|
28
|
|
29
|
Peng Cheng, Frazzoli E, LaValle S. Improving the Performance of Sampling-Based Motion Planning With Symmetry-Based Gap Reduction. IEEE T ROBOT 2008. [DOI: 10.1109/tro.2007.913993] [Citation(s) in RCA: 24] [Impact Index Per Article: 1.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/08/2022]
|