Research on path planning for construction robots based on improved A* algorithm

An improved A* algorithm was proposed to address the problem of planning a safe and obstacle-free path for construction robots on construction sites. Firstly, by optimizing the search point selection strategy of the A* algorithm, on the basis of the 8-neighborhood node search used in the traditional algorithms, it was extended to 24-neighborhoods for search and partially discarded. At the same time, obstacles were inflated to leave enough safe distance to avoid collisions during motion. Then, the heuristic function in the evaluation function was improved by introducing the obstacle ratio K. Finally, for the inflection points in the path, Bezier curves were used to smooth the path and improve its continuity. The experimental simulation results show that the search node count, path length, and planning efficiency of improved A* algorithm are higher than those of traditional A* algorithm, and the path is smoother. The proposed algorithm effectively improves the search efficiency of paths and enhances the feasibility of global routes for construction robots, providing reference for path planning of construction robots.

Institutions

Publication Details

Journal
SHILAP Revista de lepidopterología
Published
2024-12-01
DOI
https://doi.org/10.7535/hbkd.2024yx06010
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Research on path planning for construction robots based on improved A* algorithm

SHILAP Revista de lepidopterología
Robotic Path Planning Algorithms
article

Research on path planning for construction robots based on improved A* algorithm

article en

Abstract

An improved A* algorithm was proposed to address the problem of planning a safe and obstacle-free path for construction robots on construction sites. Firstly, by optimizing the search point selection strategy of the A* algorithm, on the basis of the 8-neighborhood node search used in the traditional algorithms, it was extended to 24-neighborhoods for search and partially discarded. At the same time, obstacles were inflated to leave enough safe distance to avoid collisions during motion. Then, the heuristic function in the evaluation function was improved by introducing the obstacle ratio K. Finally, for the inflection points in the path, Bezier curves were used to smooth the path and improve its continuity. The experimental simulation results show that the search node count, path length, and planning efficiency of improved A* algorithm are higher than those of traditional A* algorithm, and the path is smoother. The proposed algorithm effectively improves the search efficiency of paths and enhances the feasibility of global routes for construction robots, providing reference for path planning of construction robots.

SHILAP Revista de lepidopterología
Hebei University of Science and Technology (CN)
Sustainable cities and communities
Openalex Percentile: Top 66%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.