2023
DOI: 10.3390/math11214552
|View full text |Cite
|
Sign up to set email alerts
|

Mobile Robot Path Planning Based on Kinematically Constrained A-Star Algorithm and DWA Fusion Algorithm

Yanjie Liu,
Chao Wang,
Heng Wu
et al.

Abstract: Path-planning research has been the key to mobile-robot-navigation technology. However, traditional path-planning algorithms have some shortcomings. To solve these problems, this paper proposes a fusion algorithm that combines the kinematical constrained A* algorithm with the Dynamic Window Approach (DWA) algorithm. The kinematical constrained A* algorithm can plan the global path, and then the DWA algorithm can plan the local path under the global path’s guidance. Firstly, combined with robot kinematics, we i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
3
3
2

Relationship

1
7

Authors

Journals

citations
Cited by 13 publications
(4 citation statements)
references
References 35 publications
0
4
0
Order By: Relevance
“…The existing path planning methods can be divided into global path planning [26] and local path planning [27] . Commonly used algorithms include ant colony algorithm [28] , A* algorithm [29] , random number algorithm [30] and greedy algorithm, etc. In this paper, five evaluation indexes that are more important in the medical environment are used as the scoring criteria for the algorithm radar map.…”
Section: Selection Of Path Planning Algorithmmentioning
confidence: 99%
“…The existing path planning methods can be divided into global path planning [26] and local path planning [27] . Commonly used algorithms include ant colony algorithm [28] , A* algorithm [29] , random number algorithm [30] and greedy algorithm, etc. In this paper, five evaluation indexes that are more important in the medical environment are used as the scoring criteria for the algorithm radar map.…”
Section: Selection Of Path Planning Algorithmmentioning
confidence: 99%
“…Based on this, the algorithm needs to convert the sparse critical path points into denser equidistant path points. In this paper, key point densification is based on the B-spline curve [22][23][24][25][26].…”
Section: Key Point Density Strategymentioning
confidence: 99%
“…In addition, utilizing actions close to the target to train the action policy results in a better way for the robot to reach the target point and in a better overall action effect of the agent, and it also improves the sampling efficiency of the training. When the robot is in a dangerous area, the robot is controlled to "extrication" using a fast path-generation algorithm, which is provided directly by the ROS (Robot Operating System) navigation package and is a fusion of the traditional A* and DWA algorithms [21], so it will not be introduced here. The data generated by the above fast path-generation algorithm are recorded as expert data, and the blue trajectory in Figure 1 is the expert trajectory for "extrication", and when it is out of the danger zone, the intervention is ended and is changed to the agent method to control the robot movement.…”
Section: Sac Reinforcement-learning Navigation Policy Incorporating E...mentioning
confidence: 99%
“…Remote Sens. 2024, 16,2072 4 of 29 by the ROS (Robot Operating System) navigation package and is a fusion of the traditional A* and DWA algorithms [21], so it will not be introduced here. The data generated by the above fast path-generation algorithm are recorded as expert data, and the blue trajectory in Figure 1 is the expert trajectory for "extrication", and when it is out of the danger zone, the intervention is ended and is changed to the agent method to control the robot movement.…”
Section: Sac Reinforcement-learning Navigation Policy Incorporating E...mentioning
confidence: 99%