Research on path planning in complex environment based on improved A<sup>*</sup> algorithm
ObjectiveThe global path planning algorithm for mobile robots currently faces challenges such as excessive inflection points, prolonged computation time, and inefficiency in complex environments. To address these issues, an improved A<sup>*</sup> algorithm was proposed and experimentally...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | Chinese |
| Published: |
Editorial Office of Journal of Mechanical Transmission
2025-07-01
|
| Series: | Jixie chuandong |
| Subjects: | |
| Online Access: | http://www.jxcd.net.cn/thesisDetails#10.16578/j.issn.1004.2539.2025.07.003 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1839630911634669568 |
|---|---|
| author | KANG Kaishen HUANG Hailong |
| author_facet | KANG Kaishen HUANG Hailong |
| author_sort | KANG Kaishen |
| collection | DOAJ |
| description | ObjectiveThe global path planning algorithm for mobile robots currently faces challenges such as excessive inflection points, prolonged computation time, and inefficiency in complex environments. To address these issues, an improved A<sup>*</sup> algorithm was proposed and experimentally validated under complex environmental conditions.MethodsFirstly, the traditional 8-neighborhood search of the A<sup>*</sup> algorithm was expanded to a 12-neighborhood search. Subsequently, based on the collision model derived from environmental heuristic information processing, the searched paths were categorized into four cost types, with the least-cost path selected as the optimal trajectory for the mobile robot. Finally, the optimal path obtained from the planning was smoothed using the cubic spline interpolation method.ResultsTest results demonstrate that, compared to the traditional A<sup>*</sup> algorithm, the improved A<sup>*</sup> algorithm achieves search speed improvements of 32.68%, 33.40% and 20.17% in simple, moderate and complex environments, respectively. Additionally, the number of severe path deflections is reduced by 35.71%, 43.67% and 47.58% in these environments. The obtained path has the advantages of fewer nodes, a shorter distance, and a smoother trajectory. |
| format | Article |
| id | doaj-art-3de922de4b494cc8bddde7af516b1aed |
| institution | Matheson Library |
| issn | 1004-2539 |
| language | zho |
| publishDate | 2025-07-01 |
| publisher | Editorial Office of Journal of Mechanical Transmission |
| record_format | Article |
| series | Jixie chuandong |
| spelling | doaj-art-3de922de4b494cc8bddde7af516b1aed2025-07-12T19:00:04ZzhoEditorial Office of Journal of Mechanical TransmissionJixie chuandong1004-25392025-07-01492230115735630Research on path planning in complex environment based on improved A<sup>*</sup> algorithmKANG KaishenHUANG HailongObjectiveThe global path planning algorithm for mobile robots currently faces challenges such as excessive inflection points, prolonged computation time, and inefficiency in complex environments. To address these issues, an improved A<sup>*</sup> algorithm was proposed and experimentally validated under complex environmental conditions.MethodsFirstly, the traditional 8-neighborhood search of the A<sup>*</sup> algorithm was expanded to a 12-neighborhood search. Subsequently, based on the collision model derived from environmental heuristic information processing, the searched paths were categorized into four cost types, with the least-cost path selected as the optimal trajectory for the mobile robot. Finally, the optimal path obtained from the planning was smoothed using the cubic spline interpolation method.ResultsTest results demonstrate that, compared to the traditional A<sup>*</sup> algorithm, the improved A<sup>*</sup> algorithm achieves search speed improvements of 32.68%, 33.40% and 20.17% in simple, moderate and complex environments, respectively. Additionally, the number of severe path deflections is reduced by 35.71%, 43.67% and 47.58% in these environments. The obtained path has the advantages of fewer nodes, a shorter distance, and a smoother trajectory.http://www.jxcd.net.cn/thesisDetails#10.16578/j.issn.1004.2539.2025.07.003Mobile robotGlobal path planningA<sup>*</sup> algorithmCost pathCubic spline interpolation method |
| spellingShingle | KANG Kaishen HUANG Hailong Research on path planning in complex environment based on improved A<sup>*</sup> algorithm Jixie chuandong Mobile robot Global path planning A<sup>*</sup> algorithm Cost path Cubic spline interpolation method |
| title | Research on path planning in complex environment based on improved A<sup>*</sup> algorithm |
| title_full | Research on path planning in complex environment based on improved A<sup>*</sup> algorithm |
| title_fullStr | Research on path planning in complex environment based on improved A<sup>*</sup> algorithm |
| title_full_unstemmed | Research on path planning in complex environment based on improved A<sup>*</sup> algorithm |
| title_short | Research on path planning in complex environment based on improved A<sup>*</sup> algorithm |
| title_sort | research on path planning in complex environment based on improved a sup sup algorithm |
| topic | Mobile robot Global path planning A<sup>*</sup> algorithm Cost path Cubic spline interpolation method |
| url | http://www.jxcd.net.cn/thesisDetails#10.16578/j.issn.1004.2539.2025.07.003 |
| work_keys_str_mv | AT kangkaishen researchonpathplanningincomplexenvironmentbasedonimprovedasupsupalgorithm AT huanghailong researchonpathplanningincomplexenvironmentbasedonimprovedasupsupalgorithm |