Real-time Dynamic Path Planning for Dubins' Nonholonomic Robot

2006 ◽  
Author(s):  
Chao Yong ◽  
Eric J. Barth
Keyword(s):  
Path Planning ◽  
Real Time ◽  
Time Dynamic ◽  
Dynamic Path Planning ◽  
Dynamic Path

scholarly journals Real-Time Dynamic Path Planning of Mobile Robots: A Novel Hybrid Heuristic Optimization Algorithm

Sensors ◽  
2019 ◽  
Vol 20 (1) ◽  
pp. 188 ◽  
Author(s):  
Qing Wu ◽  
Zeyu Chen ◽  
Lei Wang ◽  
Hao Lin ◽  
Zijing Jiang ◽  
...  
Keyword(s):  
Path Planning ◽  
Mobile Robots ◽  
Real Time ◽  
Potential Field ◽  
Optimization Method ◽  
Artificial Potential Field ◽  
Planning Time ◽  
Time Dynamic ◽  
Dynamic Path Planning ◽  
Dynamic Path

Mobile robots are becoming more and more widely used in industry and life, so the navigation of robots in dynamic environments has become an urgent problem to be solved. Dynamic path planning has, therefore, received more attention. This paper proposes a real-time dynamic path planning method for mobile robots that can avoid both static and dynamic obstacles. The proposed intelligent optimization method can not only get a better path but also has outstanding advantages in planning time. The algorithm used in the proposed method is a hybrid algorithm based on the beetle antennae search (BAS) algorithm and the artificial potential field (APF) algorithm, termed the BAS-APF method. By establishing a potential field, the convergence speed is accelerated, and the defect that the APF is easily trapped in the local minimum value is also avoided. At the same time, by setting a security scope to make the path closer to the available path in the real environment, the effectiveness and superiority of the proposed method are verified through simulative results.

scholarly journals New Algorithm for Autonomous Dynamic Path Planning in Real-Time Intelligent Robot Car

2017 ◽  
Vol 14 (11) ◽  
pp. 5499-5507
Author(s):  
Aqeel A. Mohammed ◽  
Ishak Aris ◽  
Mohd Khair Hassan ◽  
Noor Ain Kamsani
Keyword(s):  
Path Planning ◽  
Real Time ◽  
Intelligent Robot ◽  
Dynamic Path Planning ◽  
Dynamic Path

scholarly journals Research on Local Dynamic Path Planning Method for Intelligent Vehicle Lane-Changing

2019 ◽  
Vol 2019 ◽  
pp. 1-10 ◽  
Author(s):  
Zhi-qiang Liu ◽  
Teng Zhang ◽  
Yi-fan Wang
Keyword(s):  
Path Planning ◽  
Real Time ◽  
Planning Method ◽  
Local Dynamic ◽  
Vehicle Speed ◽  
Lane Changing ◽  
Dynamic Path Planning ◽  
Dynamic Path ◽  
Real Time Information ◽  
Time Information

A local dynamic path planning method is proposed to compensate for the lack of consideration of the movement state of surrounding vehicles, the poor comfort, and the low traffic efficiency when the existing vehicle changes lanes automatically. Firstly, the cubic polynomial is predefined, and the optimal track path is solved. According to the real-time information of environment perception, the model is continuously modified by acquiring real-time information in the course of path planning, and the regional safety of the vehicle is realized. The Carsim and simulink simulation results and actual vehicle verification show that, compared with the traditional nondynamic research method, this method can effectively solve the problem that the vehicle speed variation and the sudden intrusions of the vehicle leading to the compulsory operation of the vehicle during the course of lane-changing. The safety is also improved. In order to ensure the vehicle comfort and stability, the lane-changing time is shortened by 20%, and the efficiency of lane-changing is improved obviously.

scholarly journals Dynamic Path Planning for Bevel-Tip Flexible Needle Insertion into Soft Tissue Based on a Real-Time Finite Element Model

2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Murong Li ◽  
Dedong Gao ◽  
Yong Lei ◽  
Tian Xu
Keyword(s):  
Finite Element ◽  
Soft Tissue ◽  
Path Planning ◽  
Finite Element Model ◽  
Real Time ◽  
Ccd Camera ◽  
Element Model ◽  
Online Planning ◽  
Dynamic Path Planning ◽  
Dynamic Path

This paper presents a novel dynamic path planning methodology for needle steering into the soft tissue. A real-time finite element model is used to simulate the procedure of a flexible needle into the homogeneous soft tissue, which provides the dynamic deformation information for the path planning. The relationship between needle base and tip is formulated as the transformations of homogeneous matrix with quasi-static assumptions. Based on the reachability of the flexible needle, the real-time motions of obstacles and target are considered through the dynamic needle-tissue interactions. A testbed including a XY linear stage, one rotator, and a CCD camera is constructed, and the experiments are designed to validate the proposed method. The 23G PTC needle was inserted into the PVA phantom with markers, and the CCD camera was utilized to record the needle trajectories and motions of target and obstacles. The targeting errors between the experimental and planned paths are less than 1.20 mm, and the distance from the obstacle to needle is not smaller than 1.16 mm. The results demonstrate that the proposed algorithm is effective for online planning the paths in the needle-tissue interactive environment.

scholarly journals A New Hybrid Method in Global Dynamic Path Planning of Mobile Robot

2018 ◽  
Vol 13 (6) ◽  
pp. 1032-1046 ◽  
Author(s):  
Xiaoru Song ◽  
Song Gao ◽  
C.B. Chen ◽  
Kai Cao ◽  
Jiaoru Huang
Keyword(s):  
Path Planning ◽  
Mobile Robot ◽  
Real Time ◽  
Obstacle Avoidance ◽  
A Algorithm ◽  
Fusion Algorithm ◽  
Global Dynamic ◽  
Dynamic Path Planning ◽  
Dynamic Path ◽  
Dynamic Obstacle

Path planning and real-time obstacle avoidance is the key technologies of mobile robot intelligence. But the efficiency of the global path planning is not very high. It is not easy to avoid obstacles in real time. Aiming at these shortcomings it is proposed that a global dynamic path planning method based on improved A* algorithm and dynamic window method. At first the improved A* algorithm is put forward based on the traditional A* algorithm in the paper. Its optimized heuristic search function is designed. They can be eliminated that the redundant path points and unnecessary turning points. Simulation experiment 1 results show that the planned path length is reduced greatly. And the path transition points are less, too. And then it is focused on the global dynamic path planning of fusion improved A* Algorithm and Dynamic Window Method. The evaluation function is constructed taking into account the global optimal path. The real time dynamic path is planning. On the basis of ensuring the optimal global optimization of the planning path, it is improved that the smoothness of the planning path and the local real-time obstacle avoidance ability. The simulation experiments results show that the fusion algorithm is not only the shorter length, but also the smoother path compared the traditional path planning algorithms with the fusion algorithm in the paper. It is more fit to the dynamics of the robot control. And when a dynamic obstacle is added, the new path can be gained. The barrier can be bypass and the robot is to reach the target point. It can be guaranteed the global optimality of the path. Finally the Turtlebot mobile robot was used to experiment. The experimental results show that the global optimality of the proposed path can be guaranteed by the fusion algorithm. And the planned global path is smoother. When the random dynamic obstacle occurs in the experiment, the robot can be real-time dynamic obstacle avoidance. It can re-plan the path. It can bypass the random obstacle to reach the original target point. The outputting control parameters are more conducive to the robot’s automatic control. The fusion method is used for global dynamic path planning of mobile robots in this paper. In summary the experimental results show that the method is good efficiency and real-time performance. It has great reference value for the dynamic path planning application of mobile robot.

scholarly journals Application of Angle Related Cost Function Optimization for Dynamic Path Planning Algorithm

Algorithms ◽  
2018 ◽  
Vol 11 (8) ◽  
pp. 127 ◽  
Author(s):  
Mingbin Zeng ◽  
Xu Yang ◽  
Mengxing Wang ◽  
Bangjiang Xu
Keyword(s):  
Path Planning ◽  
Real Time ◽  
Intelligent Transportation Systems ◽  
Optimal Solution ◽  
Transportation Systems ◽  
Function Optimization ◽  
Dynamic Path Planning ◽  
Planning Algorithm ◽  
Dynamic Path ◽  
Path Planning Algorithm

In recent years, Intelligent Transportation Systems (ITS) have developed a lot. More and more sensors and communication technologies (e.g., cloud computing) are being integrated into cars, which opens up a new design space for vehicular-based applications. In this paper, we present the Spatial Optimized Dynamic Path Planning algorithm. Our contributions are, firstly, to enhance the effective of loading mechanism for road maps by dividing the connected sub-net, and building a spatial index; and secondly, to enhance the effect of the dynamic path planning by optimizing the search direction. We use the real road network and real-time traffic flow data of Karamay city to simulate the effect of our algorithm. Experiments show that our Spatial Optimized Dynamic Path Planning algorithm can significantly reduce the time complexity, and is better suited for use as a real-time navigation system. The algorithm can achieve superior real-time performance and obtain the optimal solution in dynamic path planning.

scholarly journals Research on Global Dynamic Path Planning Method Based on Improved A ∗ Algorithm

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Chuanhu Niu ◽  
Aijuan Li ◽  
Xin Huang ◽  
Wei Li ◽  
Chuanyan Xu
Keyword(s):  
Path Planning ◽  
Real Time ◽  
Obstacle Avoidance ◽  
Planning Method ◽  
Intelligent Vehicle ◽  
Global Dynamic ◽  
Dynamic Path Planning ◽  
Dynamic Obstacle Avoidance ◽  
Dynamic Path ◽  
Dynamic Obstacle

Aiming at the optimal path and planning efficiency of global path planning for intelligent driving, this paper proposes a global dynamic path planning method based on improved A ∗ algorithm. First, this method improves the heuristic function of the traditional A ∗ algorithm to improve the efficiency of global path planning. Second, this method uses a path optimization strategy to make the global path smoother. Third, this method is combined with the dynamic window method to improve the real-time performance of the dynamic obstacle avoidance of the intelligent vehicle. Finally, the global dynamic path planning method of the proposed improved A ∗ algorithm is verified through simulation experiments and real vehicle tests. In the simulation analysis, compared with the modified A ∗ algorithm and the traditional A ∗ algorithm, the method in this paper shortens the path distance by 2.5%∼3.0%, increases the efficiency by 10.3%∼13.6% and generates a smoother path. In the actual vehicle test, the vehicle can avoid dynamic obstacles in real time. Therefore, the method proposed in this paper can be applied on the intelligent vehicle platform. The path planning efficiency is high, and the dynamic obstacle avoidance is good in real time.

scholarly journals A Multimetric Ant Colony Optimization Algorithm for Dynamic Path Planning in Vehicular Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Zhen Wang ◽  
Jianqing Li ◽  
Manlin Fang ◽  
Yang Li
Keyword(s):  
Path Planning ◽  
Ant Colony Optimization ◽  
Real Time ◽  
Optimization Algorithm ◽  
Vehicular Networks ◽  
Urban Transportation ◽  
Ant Colony ◽  
Ant Colony Optimization Algorithm ◽  
Dynamic Path Planning ◽  
Dynamic Path

With the rapid growth in the number of vehicles, energy consumption and environmental pollution in urban transportation have become a worldwide problem. Efforts to reduce urban congestion and provide green intelligent transport become a hot field of research. In this paper, a multimetric ant colony optimization algorithm is presented to achieve real-time dynamic path planning in complicated urban transportation. Firstly, four attributes are extracted from real urban traffic environment as the pheromone values of ant colony optimization algorithm, which could achieve real-time path planning. Then Technique for Order Preference by Similarity to Ideal Solution methods is adopted in forks to select the optimal road. Finally, a vehicular simulation network is set up and many experiments were taken. The results show that the proposed method can achieve the real-time planning path more accurately and quickly in vehicular networks with traffic congestion. At the same time it could effectively avoid local optimum compared with the traditional algorithms.

Sign in / Sign up

Export Citation Format

Share Document