Sampling-based path planning is a popular methodology for robot path planning.With a uniform sampling strategy to explore the state space,a feasible path can be found without the complex geometric modeling of the conf...Sampling-based path planning is a popular methodology for robot path planning.With a uniform sampling strategy to explore the state space,a feasible path can be found without the complex geometric modeling of the configuration space.However,the quality of the initial solution is not guaranteed,and the convergence speed to the optimal solution is slow.In this paper,we present a novel image-based path planning algorithm to overcome these limitations.Specifically,a generative adversarial network(GAN)is designed to take the environment map(denoted as RGB image)as the input without other preprocessing works.The output is also an RGB image where the promising region(where a feasible path probably exists)is segmented.This promising region is utilized as a heuristic to achieve non-uniform sampling for the path planner.We conduct a number of simulation experiments to validate the effectiveness of the proposed method,and the results demonstrate that our method performs much better in terms of the quality of the initial solution and the convergence speed to the optimal solution.Furthermore,apart from the environments similar to the training set,our method also works well on the environments which are very different from the training set.展开更多
Recent advancements in robotics have transformed industries such as manufacturing,logistics,surgery,and planetary exploration.A key challenge is developing efficient motion planning algorithms that allow robots to nav...Recent advancements in robotics have transformed industries such as manufacturing,logistics,surgery,and planetary exploration.A key challenge is developing efficient motion planning algorithms that allow robots to navigate complex environments while avoiding collisions and optimizing metrics like path length,sweep area,execution time,and energy consumption.Among the available algorithms,sampling-based methods have gained the most traction in both research and industry due to their ability to handle complex environments,explore free space,and offer probabilistic completeness along with other formal guarantees.Despite their widespread application,significant challenges still remain.To advance future planning algorithms,it is essential to review the current state-of-the-art solutions and their limitations.In this context,this work aims to shed light on these challenges and assess the development and applicability of sampling-based methods.Furthermore,we aim to provide an in-depth analysis of the design and evaluation of ten of the most popular planners across various scenarios.Our findings highlight the strides made in sampling-based methods while underscoring persistent challenges.This work offers an overview of the important ongoing research in robotic motion planning.展开更多
Sampling-based planning algorithms play an important role in high degree-of-freedom motion planning(MP)problems,in which rapidly-exploring random tree(RRT)and the faster bidirectional RRT(named RRT-Connect)algorithms ...Sampling-based planning algorithms play an important role in high degree-of-freedom motion planning(MP)problems,in which rapidly-exploring random tree(RRT)and the faster bidirectional RRT(named RRT-Connect)algorithms have achieved good results in many planning tasks.However,sampling-based methods have the inherent defect of having difficultly in solving planning problems with narrow passages.Therefore,several algorithms have been proposed to overcome these drawbacks.As one of the improved algorithms,Rapidlyexploring random vines(RRV)can achieve better results,but it may perform worse in cluttered environments and has a certain environmental selectivity.In this paper,we present a new improved planning method based on RRT-Connect and RRV,named adaptive RRT-Connect(ARRT-Connect),which deals well with the narrow passage environments while retaining the ability of RRT algorithms to plan paths in other environments.The proposed planner is shown to be adaptable to a variety of environments and can accomplish path planning in a short time.展开更多
Sampling-based path planning is widely used in robotics,particularly in high-dimensional state spaces.In the path planning process,collision detection is the most time-consuming operation.Therefore,we propose a learni...Sampling-based path planning is widely used in robotics,particularly in high-dimensional state spaces.In the path planning process,collision detection is the most time-consuming operation.Therefore,we propose a learning-based path planning method that reduces the number of collision checks.We develop an efficient neural network model based on graph neural networks.The model outputs weights for each neighbor based on the obstacle,searched path,and random geometric graph,which are used to guide the planner in avoiding obstacles.We evaluate the efficiency of the proposed path planning method through simulated random worlds and real-world experiments.The results demonstrate that the proposed method significantly reduces the number of collision checks and improves the path planning speed in high-dimensional environments.展开更多
基金This work was partially supported by National Key R&D Program of China(2019YFB1312400)Shenzhen Key Laboratory of Robotics Perception and Intelligence(ZDSYS20200810171800001)+1 种基金Hong Kong RGC GRF(14200618)Hong Kong RGC CRF(C4063-18G).
文摘Sampling-based path planning is a popular methodology for robot path planning.With a uniform sampling strategy to explore the state space,a feasible path can be found without the complex geometric modeling of the configuration space.However,the quality of the initial solution is not guaranteed,and the convergence speed to the optimal solution is slow.In this paper,we present a novel image-based path planning algorithm to overcome these limitations.Specifically,a generative adversarial network(GAN)is designed to take the environment map(denoted as RGB image)as the input without other preprocessing works.The output is also an RGB image where the promising region(where a feasible path probably exists)is segmented.This promising region is utilized as a heuristic to achieve non-uniform sampling for the path planner.We conduct a number of simulation experiments to validate the effectiveness of the proposed method,and the results demonstrate that our method performs much better in terms of the quality of the initial solution and the convergence speed to the optimal solution.Furthermore,apart from the environments similar to the training set,our method also works well on the environments which are very different from the training set.
基金support by the Bavarian State Ministry for Economic Affairs,Regional Development and Energy(StMWi)for the Lighthouse Initiative KI.FABRIK(Phase 1:Infrastructure and the research and development program under grant no.DIK0249).
文摘Recent advancements in robotics have transformed industries such as manufacturing,logistics,surgery,and planetary exploration.A key challenge is developing efficient motion planning algorithms that allow robots to navigate complex environments while avoiding collisions and optimizing metrics like path length,sweep area,execution time,and energy consumption.Among the available algorithms,sampling-based methods have gained the most traction in both research and industry due to their ability to handle complex environments,explore free space,and offer probabilistic completeness along with other formal guarantees.Despite their widespread application,significant challenges still remain.To advance future planning algorithms,it is essential to review the current state-of-the-art solutions and their limitations.In this context,this work aims to shed light on these challenges and assess the development and applicability of sampling-based methods.Furthermore,we aim to provide an in-depth analysis of the design and evaluation of ten of the most popular planners across various scenarios.Our findings highlight the strides made in sampling-based methods while underscoring persistent challenges.This work offers an overview of the important ongoing research in robotic motion planning.
基金supported in part by the National Science Foundation of China(61976175,91648208)the Key Project of Natural Science Basic Research Plan in Shaanxi Province of China(2019JZ-05)。
文摘Sampling-based planning algorithms play an important role in high degree-of-freedom motion planning(MP)problems,in which rapidly-exploring random tree(RRT)and the faster bidirectional RRT(named RRT-Connect)algorithms have achieved good results in many planning tasks.However,sampling-based methods have the inherent defect of having difficultly in solving planning problems with narrow passages.Therefore,several algorithms have been proposed to overcome these drawbacks.As one of the improved algorithms,Rapidlyexploring random vines(RRV)can achieve better results,but it may perform worse in cluttered environments and has a certain environmental selectivity.In this paper,we present a new improved planning method based on RRT-Connect and RRV,named adaptive RRT-Connect(ARRT-Connect),which deals well with the narrow passage environments while retaining the ability of RRT algorithms to plan paths in other environments.The proposed planner is shown to be adaptable to a variety of environments and can accomplish path planning in a short time.
基金This work is supported by Shenzhen Science and Technology Program,China(RCBS20221008093305007 and 20231115141459001)Young Elite Scientists Sponsorship Program by CAST(2023QNRC001),China.
文摘Sampling-based path planning is widely used in robotics,particularly in high-dimensional state spaces.In the path planning process,collision detection is the most time-consuming operation.Therefore,we propose a learning-based path planning method that reduces the number of collision checks.We develop an efficient neural network model based on graph neural networks.The model outputs weights for each neighbor based on the obstacle,searched path,and random geometric graph,which are used to guide the planner in avoiding obstacles.We evaluate the efficiency of the proposed path planning method through simulated random worlds and real-world experiments.The results demonstrate that the proposed method significantly reduces the number of collision checks and improves the path planning speed in high-dimensional environments.
