Low-Energy Path Planning Method of Electrically Driven Heavy-Duty Six-Legged Robot Based on Improved A* Algorithm

Compared to the traditional non-load-bearing multi-legged robots, the heavy-duty multi-legged robots typically not only have larger body weight, larger volume, and larger load ratio but also require greater energy dissipation. Traditional path planning often focuses on the problem of finding the shortest path. However, the substantial load capacity and multi-jointed structure of heavy-duty multi-legged robots impose stringent requirements on path smoothness. Consequently, the smoothness requirement makes the traditional A* algorithm unsuitable for applications where low-energy operation is critical. An improved low-energy path planning method based on the A* algorithm is presented for an electrically driven heavy-duty six-legged robot. Then, the environment is discretized by using the grid method to facilitate path searching. To address the path zigzagging problem caused by the traditional A* algorithm, the Bézier curve smoothing technique is adopted. The continuous curvature transitions are employed to significantly improve the smoothness of path. The heuristic function in the A* algorithm is enhanced through a dynamic weight adjustment mechanism. The nonlinear suppression strategy is introduced to prevent data changes and improve the robustness of the algorithm. The effectiveness of the proposed method is verified through the MATLAB simulation platform system. The simulation experiments show that, in various environments with different obstacle densities (0.17–0.37%), compared with the traditional A* algorithm, the method proposed in this paper reduces the average path length by 7.2%, the number of turning points by 25.9%, and the energy consumption by 5.75%. The proposed improved A* algorithm can significantly overcome the problem of insufficient smoothness in traditional A* algorithms and reduce the number of nodes generated by the control data stack, which improves the optimization efficiency during path planning. As a result, the heavy-duty six-legged robots can walk farther and operate for longer periods of time while carrying the limited energy sources.

Institutions

Publication Details

Journal
Applied Sciences
Published
2025-12-12
DOI
https://doi.org/10.3390/app152413113
Primary Topic
Robotic Locomotion and Control
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Low-Energy Path Planning Method of Electrically Driven Heavy-Duty Six-Legged Robot Based on Improved A* Algorithm

Applied Sciences
Robotic Locomotion and Control
article

Low-Energy Path Planning Method of Electrically Driven Heavy-Duty Six-Legged Robot Based on Improved A* Algorithm

article en

Abstract

Compared to the traditional non-load-bearing multi-legged robots, the heavy-duty multi-legged robots typically not only have larger body weight, larger volume, and larger load ratio but also require greater energy dissipation. Traditional path planning often focuses on the problem of finding the shortest path. However, the substantial load capacity and multi-jointed structure of heavy-duty multi-legged robots impose stringent requirements on path smoothness. Consequently, the smoothness requirement makes the traditional A* algorithm unsuitable for applications where low-energy operation is critical. An improved low-energy path planning method based on the A* algorithm is presented for an electrically driven heavy-duty six-legged robot. Then, the environment is discretized by using the grid method to facilitate path searching. To address the path zigzagging problem caused by the traditional A* algorithm, the Bézier curve smoothing technique is adopted. The continuous curvature transitions are employed to significantly improve the smoothness of path. The heuristic function in the A* algorithm is enhanced through a dynamic weight adjustment mechanism. The nonlinear suppression strategy is introduced to prevent data changes and improve the robustness of the algorithm. The effectiveness of the proposed method is verified through the MATLAB simulation platform system. The simulation experiments show that, in various environments with different obstacle densities (0.17–0.37%), compared with the traditional A* algorithm, the method proposed in this paper reduces the average path length by 7.2%, the number of turning points by 25.9%, and the energy consumption by 5.75%. The proposed improved A* algorithm can significantly overcome the problem of insufficient smoothness in traditional A* algorithms and reduce the number of nodes generated by the control data stack, which improves the optimization efficiency during path planning. As a result, the heavy-duty six-legged robots can walk farther and operate for longer periods of time while carrying the limited energy sources.

Applied SciencesVol. 15(24)
Tianjin University of Technology and Education (CN), Harbin Institute of Technology (CN), State Key Laboratory of Robotics and Systems (CN)
National Natural Science Foundation of China, Tianjin Municipal Education Commission
Affordable and clean energy
Openalex Percentile: Top 44%
Robotic Locomotion and Control
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.