2020 ◽  
Vol 17 (4) ◽  
pp. 2063-2073 ◽  
Author(s):  
Jiankun Wang ◽  
Max Q.-H. Meng ◽  
Oussama Khatib

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.


2019 ◽  
Vol 16 (3) ◽  
pp. 1271-1288 ◽  
Author(s):  
Wenzheng Chi ◽  
Chaoqun Wang ◽  
Jiankun Wang ◽  
Max Q.-H. Meng

Robotica ◽  
2020 ◽  
pp. 1-20
Author(s):  
Run Mao ◽  
Hongli Gao ◽  
Liang Guo

SUMMARY This paper presents a Chebyshev Pseudospectral (PS) method for solving the motion planning problem of nonholonomic mobile robots with kinematic and dynamic constraints. The state and control variables are expanded in the Chebyshev polynomial of order N, and Chebyshev–Gauss–Lobatto (CGL) nodes are provided for approximating the system dynamics, boundary conditions, and performance index. For the lack of enough nodes nearby the obstacles, the interpolation of trajectory may violate the obstacles and the multiple-interval strategy is proposed to deal with the violation. Numerical examples demonstrate that multiple-interval strategy yields more accurate results than the single-interval Chebyshev PS method.


Sign in / Sign up

Export Citation Format

Share Document