scholarly journals A Grid-Based Motion Planning Approach for Coherent Groups

2014 ◽  
Vol 2014 ◽  
pp. 1-12
Author(s):  
Yue-wen Fu ◽  
Meng Li ◽  
Jia-hong Liang ◽  
Xiao-qian Hu

This paper presents a novel motion planning approach for coherent groups with constant area, and it integrates C-L method into the probabilistic roadmap algorithm with sampling on the medial axis (MAPRM). In the preprocessing phase, the group is discretized into a grid-set which represents the configuration of the group. Then, a number of samples are generated on workspace by medial axis technique. These samples are extended into group’s configuration nodes of the roadmap using an extending strategy. Also, the group's deformation degree relative to the desired shape is introduced to improve the evaluation function. It gives users more flexibility to determine the respective weights of the group’s deformation degree and its distance to the goal in the query phase. After that, a novel local planner is constructed to connect any two neighbor configurations by using C-L method and the improved evaluation function. Experiments show that our approach is able to find paths for the coherent group efficiently and keep its area invariant when moving toward the goal.

2019 ◽  
Vol 39 (2-3) ◽  
pp. 266-285 ◽  
Author(s):  
Kiril Solovey ◽  
Michal Kleinbort

We develop a new analysis of sampling-based motion planning in Euclidean space with uniform random sampling, which significantly improves upon the celebrated result of Karaman and Frazzoli and subsequent work. In particular, we prove the existence of a critical connection radius proportional to [Formula: see text] for n samples and d dimensions: below this value the planner is guaranteed to fail (similarly shown by Karaman and Frazzoli). More importantly, for larger radius values the planner is asymptotically (near-)optimal. Furthermore, our analysis yields an explicit lower bound of [Formula: see text] on the probability of success. A practical implication of our work is that asymptotic (near-)optimality is achieved when each sample is connected to only [Formula: see text] neighbors. This is in stark contrast to previous work that requires [Formula: see text] connections, which are induced by a radius of order [Formula: see text]. Our analysis applies to the probabilistic roadmap method (PRM), as well as a variety of “PRM-based” planners, including RRG, FMT*, and BTT. Continuum percolation plays an important role in our proofs. Lastly, we develop similar theory for all the aforementioned planners when constructed with deterministic samples, which are then sparsified in a randomized fashion. We believe that this new model, and its analysis, is interesting in its own right.


2020 ◽  
Vol 357 (13) ◽  
pp. 8299-8320 ◽  
Author(s):  
Huimin Ouyang ◽  
Zheng Tian ◽  
Lili Yu ◽  
Guangming Zhang

2015 ◽  
Vol 799-800 ◽  
pp. 1078-1082
Author(s):  
Bashra Kadhim Oleiwi ◽  
Hubert Roth ◽  
Bahaa I. Kazem

In this study, modified genetic algorithm (MGA) and A* search method (A*) is proposed for optimal motion planning of mobile robots. MGA utilizes the classical search and modified A* to establish a sub-optimal collision-free path as initial solution in simple and complex static environment. The enhancements for the proposed approach are presented in initialization stage and enhanced operators. Five objective functions are used to minimize traveling length, time, smoothness, security and trajectory and to reduce the energy consumption for mobile robots by using Cubic Spline interpolation curve fitting for optimal planned path. The purpose of this study is to evaluate the proposed approach performance by taking into consideration the effect of changing the number of iteration (it) and the size of population (pop) on its performance index. The simulation results show the effectiveness of proposed approach in governing the robot’s movements successfully from start to goal point after avoiding all obstacles its way in all tested environment. In addition, the results indicate that the proposed approach can find the optimal solution efficiently in a single run. This approach has been carried out by GUI using a popular engineering programming language, MATLAB.


Sign in / Sign up

Export Citation Format

Share Document