EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Improved A* Algorithm-Based Optimal Path Planning of Rescue Robots Within Multi-Environment Maps

Jingrui Zhang, Senpeng Wu, Houde Liu, Xiaojun Zhu, Bin Lan

Machines · 27.11.2025 · 13 (12) · 1099

DOI: 10.3390/machines13121099 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Machines, online erschienen am 27.11.2025. Verfasst von Jingrui Zhang und 4 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 30 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Dreams Foundation of Jianghuai Advance Technology Center of China, National Natural Science Foundation of China under Grant, Shenzhen Science Fund for Distinguished Young Scholars.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The traditional A* algorithm performs well in single-map environments, but it is prone to path redundancy and obstacle handling delays in complex multi-map collaborative scenarios, making it unsuitable for the characteristics of multi-environment maps. To address these challenges of traditional A* algorithms, this paper proposes a multi-environment map rescue robot path planning method based on an improved A* algorithm. This method introduces an expected cost evaluation function to achieve weighted fusion of path costs and heuristic values from multiple maps, allowing the algorithm to integrate obstacle distributions and weight information across different environments. A random obstacle replacement mechanism is further designed to maintain path feasibility by locally substituting blocked nodes with adjacent accessible nodes, thereby ensuring continuity without global replanning. Through the combination of multi-map information fusion and local obstacle handling, the algorithm generates a globally optimized path that balances planning efficiency, robustness, and adaptability in uncertain rescue scenarios. Experiment results for a 50 × 50 map scenario show that the improved algorithm significantly outperforms single-map planning results in terms of path redundancy, total length, and turning characteristics. The expansion experiments demonstrate that the paths planned by the proposed algorithm are highly consistent with the optimal paths in terms of direction and local deviations, verifying its good feasibility and effectiveness.

Förderung

  • Dreams Foundation of Jianghuai Advance Technology Center of China
  • National Natural Science Foundation of China under Grant
  • Shenzhen Science Fund for Distinguished Young Scholars

Zitieren

APA

Zhang, J., Wu, S., Liu, H., Zhu, X., & Lan, B. (2025). Improved A* Algorithm-Based Optimal Path Planning of Rescue Robots Within Multi-Environment Maps. Machines, 13(12), 1099. https://doi.org/10.3390/machines13121099

Vancouver

Zhang J, Wu S, Liu H, Zhu X, Lan B. Improved A* Algorithm-Based Optimal Path Planning of Rescue Robots Within Multi-Environment Maps. Machines. 2025;13(12):1099. doi:10.3390/machines13121099

BibTeX
@article{Zhang2025,
  author = {Zhang, Jingrui and Wu, Senpeng and Liu, Houde and Zhu, Xiaojun and Lan, Bin},
  title = {Improved A* Algorithm-Based Optimal Path Planning of Rescue Robots Within Multi-Environment Maps},
  journal = {Machines},
  year = {2025},
  volume = {13},
  number = {12},
  pages = {1099},
  doi = {10.3390/machines13121099}
}
Kostenlos starten →