Dynamic obstacle avoidance and path planning based on modified genetic algorithm

2005 ◽  
Author(s):  
Huahua Chen
Keyword(s):  
Genetic Algorithm ◽  
Path Planning ◽  
Obstacle Avoidance ◽  
Modified Genetic Algorithm ◽  
Dynamic Obstacle Avoidance ◽  
Dynamic Obstacle

Delaunay Graph Based Path Planning of Dynamic Obstacle Avoidance Method for Mobile

2011 ◽  
Vol 217-218 ◽  
pp. 1775-1780
Author(s):  
Hui Ying Dong ◽  
Yang Song ◽  
Yu Zhao
Keyword(s):  
Genetic Algorithm ◽  
Path Planning ◽  
Mobile Robot ◽  
Obstacle Avoidance ◽  
Shortest Path ◽  
Working Space ◽  
Optimum Path ◽  
Dynamic Obstacle Avoidance ◽  
Dynamic Obstacle ◽  
Approximate Shortest Path

This paper is about dynamic obstacle avoidance. Delaunay Graph is used for modeling the working space, an approximate shortest path of mobile robot is determined by using floyd algorithm. Path can be found easily with genetic algorithm. Then genetic algorithm is used for obtaining the optimum path. It may meet which dynamic obstacle when robot follows optimum path. so it should avoid it. Results of simulation show that this path planning method is simple and realized easily.

scholarly journals An Improved VFF Approach for Robot Path Planning in Unknown and Dynamic Environments

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Jianjun Ni ◽  
Wenbo Wu ◽  
Jinrong Shen ◽  
Xinnan Fan
Keyword(s):  
Path Planning ◽  
Obstacle Avoidance ◽  
Dynamic Environments ◽  
Minimum Problem ◽  
Robot Path Planning ◽  
Virtual Force ◽  
Dynamic Obstacle Avoidance ◽  
Dynamic Obstacle ◽  
Local Minimum Problem ◽  
Robot Path

Robot path planning in unknown and dynamic environments is one of the hot topics in the field of robot control. The virtual force field (VFF) is an efficient path planning method for robot. However, there are some shortcomings of the traditional VFF based methods, such as the local minimum problem and the higher computational complexity, in dealing with the dynamic obstacle avoidance. In this paper, an improved VFF approach is proposed for the real-time robot path planning, where the environment is unknown and changing. An area ratio parameter is introduced into the proposed VFF based approach, where the size of the robot and obstacles are considered. Furthermore, a fuzzy control module is added, to deal with the problem of obstacle avoidance in dynamic environments, by adjusting the rotation angle of the robot. Finally, some simulation experiments are carried out to validate and demonstrate the efficiency of the proposed approach.

Online Heuristically Planning for Relative Optimal Paths Using a Stochastic Algorithm for USVs

2019 ◽  
Vol 73 (2) ◽  
pp. 485-508
Author(s):  
Naifeng Wen ◽  
Rubo Zhang ◽  
Guanqun Liu ◽  
Junwei Wu
Keyword(s):  
Path Planning ◽  
Obstacle Avoidance ◽  
Optimal Path ◽  
Stochastic Algorithm ◽  
Proportional Navigation ◽  
Reference Information ◽  
International Regulations ◽  
Dynamic Obstacle Avoidance ◽  
Dynamic Obstacle ◽  
Local Path

This paper attempts to solve a challenge in online relative optimal path planning of unmanned surface vehicles (USVs) caused by current and wave disturbance in the practical marine environment. The asymptotically optimal rapidly extending random tree (RRT*) method for local path optimisation is improved. Based on that, an online path planning (OPP) scheme is proposed according to the USV's kinematic and dynamic model. The execution efficiency of RRT* is improved by reduction of the sampling space that is used for randomly learning environmental knowledge. A heuristic sampling scheme is proposed based on the proportional navigation guidance (PNG) method that is used to enable the OPP procedure to utilise the reference information of the global path. Meanwhile, PNG is used to guide RRT* in generating feasible paths with a small amount of gentle turns. The dynamic obstacle avoidance problem is also investigated based on the International Regulations for Preventing Collisions at Sea. Case studies demonstrate that the proposed method efficiently plans paths that are relatively easier to execute and lower in fuel expenditure than traditional schemes. The dynamic obstacle avoidance ability of the proposed scheme is also attested.

Dynamic obstacle avoidance path planning

2014 ◽  
Author(s):  
Shun-Feng Su ◽  
Ming-Chang Chen ◽  
Chung-Ying Li ◽  
Wei-Yen Wang ◽  
Wen-June Wang
Keyword(s):  
Path Planning ◽  
Obstacle Avoidance ◽  
Dynamic Obstacle Avoidance ◽  
Dynamic Obstacle
Sign in / Sign up

Export Citation Format

Share Document