scholarly journals 3D Vision-Based Local Path Planning System of a Humanoid Robot for Obstacle Avoidance

2013 ◽  
Vol 8 (4) ◽  
pp. 879-888 ◽  
Author(s):  
Tae-Koo Kang ◽  
Myo-Taeg Lim ◽  
Gwi-Tae Park ◽  
Dong W. Kim
2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Qisong Song ◽  
Shaobo Li ◽  
Jing Yang ◽  
Qiang Bai ◽  
Jianjun Hu ◽  
...  

The purpose of mobile robot path planning is to produce the optimal safe path. However, mobile robots have poor real-time obstacle avoidance in local path planning and longer paths in global path planning. In order to improve the accuracy of real-time obstacle avoidance prediction of local path planning, shorten the path length of global path planning, reduce the path planning time, and then obtain a better safe path, we propose a real-time obstacle avoidance decision model based on machine learning (ML) algorithms, an improved smooth rapidly exploring random tree (S-RRT) algorithm, and an improved hybrid genetic algorithm-ant colony optimization (HGA-ACO). Firstly, in local path planning, the machine learning algorithms are used to train the datasets, the real-time obstacle avoidance decision model is established, and cross validation is performed. Secondly, in global path planning, the greedy algorithm idea and B-spline curve are introduced into the RRT algorithm, redundant nodes are removed, and the reverse iteration is performed to generate a smooth path. Then, in path planning, the fitness function and genetic operation method of genetic algorithm are optimized, the pheromone update strategy and deadlock elimination strategy of ant colony algorithm are optimized, and the genetic-ant colony fusion strategy is used to fuse the two algorithms. Finally, the optimized path planning algorithm is used for simulation experiment. Comparative simulation experiments show that the random forest has the highest real-time obstacle avoidance prediction accuracy in local path planning, and the S-RRT algorithm can effectively shorten the total path length generated by the RRT algorithm in global path planning. The HGA-ACO algorithm can reduce the iteration number reasonably, reduce the search time effectively, and obtain the optimal solution in path planning.


2013 ◽  
Vol 61 (12) ◽  
pp. 1392-1405 ◽  
Author(s):  
Huili Yu ◽  
Rajnikant Sharma ◽  
Randal W. Beard ◽  
Clark N. Taylor

2007 ◽  
Author(s):  
Tae-Seok Oh ◽  
Yun-Su Shin ◽  
Sung-Yong Yun ◽  
Wang-Heon Lee ◽  
Il-Hwan Kim

Sensors ◽  
2020 ◽  
Vol 20 (5) ◽  
pp. 1488
Author(s):  
Federico Peralta ◽  
Mario Arzamendia ◽  
Derlis Gregor ◽  
Daniel G. Reina ◽  
Sergio Toral

Local path planning is important in the development of autonomous vehicles since it allows a vehicle to adapt their movements to dynamic environments, for instance, when obstacles are detected. This work presents an evaluation of the performance of different local path planning techniques for an Autonomous Surface Vehicle, using a custom-made simulator based on the open-source Robotarium framework. The conducted simulations allow to verify, compare and visualize the solutions of the different techniques. The selected techniques for evaluation include A*, Potential Fields (PF), Rapidly-Exploring Random Trees* (RRT*) and variations of the Fast Marching Method (FMM), along with a proposed new method called Updating the Fast Marching Square method (uFMS). The evaluation proposed in this work includes ways to summarize time and safety measures for local path planning techniques. The results in a Lake environment present the advantages and disadvantages of using each technique. The proposed uFMS and A* have been shown to achieve interesting performance in terms of processing time, distance travelled and security levels. Furthermore, the proposed uFMS algorithm is capable of generating smoother routes.


Sign in / Sign up

Export Citation Format

Share Document