A Dynamic Local Path Planning Method for Outdoor Robot Based on Characteristics Extraction of Laser Rangefinder and Extended Support Vector Machine

Author(s):  
Lingli Yu ◽  
Kaijun Zhou

For dynamic path planning problem under unstructured environment, firstly, successive edge following and least squares method (SEF-LSM) is adopted to extract environment characteristics of laser rangefinder data, and SEF-LSM with logical reasoning (SEF-LSM-LR) is proposed for dynamic obstacles characteristics detection. Furthermore, the perpendicularity (PERP) algorithm is utilized to identify dynamic vehicle, according to the perpendicularity attribute of vehicle. Secondly, all the laser rangefinder scanning points are marked as negative ([Formula: see text]) or positive ([Formula: see text]1), and the scanning points of one dynamic obstacle are marked as the same label. Thirdly, extended support vector machine (ESVM) is designed for outdoor robot local path planning under unstructured environment, which consider the practical start-goal position and heading constraints, robot kinematic constraint, and curvature constraint, moreover, the emergency obstacle is regarded as disturbances during planning processing. Finally, the optimal path is chosen by the shortest distance evaluation function. Lots of outdoor simulations show that the proposed method solve the dynamic planning problem under unstructured environment, and their effectiveness performance are verified for outdoor robot path planning.

Robotica ◽  
2014 ◽  
Vol 33 (4) ◽  
pp. 1017-1031 ◽  
Author(s):  
Yingchong Ma ◽  
Gang Zheng ◽  
Wilfrid Perruquetti ◽  
Zhaopeng Qiu

SUMMARYThis paper presents a path planning algorithm for autonomous navigation of non-holonomic mobile robots in complex environments. The irregular contour of obstacles is represented by segments. The goal of the robot is to move towards a known target while avoiding obstacles. The velocity constraints, robot kinematic model and non-holonomic constraint are considered in the problem. The optimal path planning problem is formulated as a constrained receding horizon planning problem and the trajectory is obtained by solving an optimal control problem with constraints. Local minima are avoided by choosing intermediate objectives based on the real-time environment.


2019 ◽  
Vol 9 (4) ◽  
pp. 672 ◽  
Author(s):  
Yiqing Huang ◽  
Zhikun Li ◽  
Yan Jiang ◽  
Lu Cheng

The cooperative path planning problem of multiple mobile robots in an unknown indoor environment is considered in this article. We presented a novel obstacle avoidance and real-time navigation algorithm. The proposed approach consisted of global path planning and local path planning via HAFSA (hybrid artificial fish swarm algorithm) and an expansion logic strategy. Meanwhile, a kind of scoring function was developed, which shortened the time of local path planning and improved the decision-making ability of the path planning algorithm. Finally, using STDR (simple two dimensional robot simulator) and RVIZ (robot operating system visualizer), a multiple mobile robot simulation platform was designed to verify the presented real-time navigation algorithm. Simulation experiments were performed to validate the effectiveness of the proposed path planning method for multiple mobile robots.


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.


2021 ◽  
Vol 193 ◽  
pp. 107913
Author(s):  
Yuan Tang ◽  
Yiming Miao ◽  
Ahmed Barnawi ◽  
Bander Alzahrani ◽  
Reem Alotaibi ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document