2021
DOI: 10.1007/s10846-021-01437-8
|View full text |Cite
|
Sign up to set email alerts
|

Enhanced Center Constraint Weighted A* Algorithm for Path Planning of Petrochemical Inspection Robot

Abstract: In many practical applications of robot path planning, finding the shortest path is critical, while the response time is often overlooked but important. To address the problems of search node divergence and long calculation time in the A* routing algorithm in the large scenario, this paper presents a novel center constraint weighted A* algorithm (CCWA*). The heuristic function is modified to give different dynamic weights to nodes in different positions, and the node weights are changed in the specified direct… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
13
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
8
1
1

Relationship

0
10

Authors

Journals

citations
Cited by 31 publications
(13 citation statements)
references
References 44 publications
0
13
0
Order By: Relevance
“…The initial position of AMR is taken as I = (12,350) and the end point of AMR, E =(650,7). The performance of the proposed ABCDLR model has been compared with other existing path planning approaches such as VFH [40], FLC [41], A* [42], and ASGDLR [3]. Simulation environment has been created on MATLAB 2022a, considering all real time scenarios.…”
Section: Avoidance Of Single Obstaclementioning
confidence: 99%
“…The initial position of AMR is taken as I = (12,350) and the end point of AMR, E =(650,7). The performance of the proposed ABCDLR model has been compared with other existing path planning approaches such as VFH [40], FLC [41], A* [42], and ASGDLR [3]. Simulation environment has been created on MATLAB 2022a, considering all real time scenarios.…”
Section: Avoidance Of Single Obstaclementioning
confidence: 99%
“…D represents the minimum distance between the simulated track and the obstacle, and D represents the preset maximum distance value. The farther the simulated trajectory is from the obstacle, the greater the value of this index and the greater the value of the evaluation function [ 15 ]; then, the path is suitable for the current motion direction of the robot. Finally, the velocity vector size of the simulated path is calculated as shown in Formula (14): where v represents the linear velocity of the current motion track, and represents the maximum linear velocity in the dynamic window.…”
Section: Mapping and Navigationmentioning
confidence: 99%
“…In recent years, a large number of research results have been achieved in the path planning of mobile robots. e conventional methods have been widely used such as the grid method [2], A * algorithm [3], and arti cial potential eld method [4]. In order to adapt mobile robots to di erent application elds and complex and changing industrial environments, various intelligent algorithms have emerged to provide new solutions for mobile robot path planning.…”
Section: Introductionmentioning
confidence: 99%