Saved in:
Bibliographic Details
Main Authors: Wang, Siyuan, Zhang, Shuyi, Tian, Zhen, Yao, Yuheng, Wang, Gongsen, Zhao, Yu
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2509.05701
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915593180938240
author Wang, Siyuan
Zhang, Shuyi
Tian, Zhen
Yao, Yuheng
Wang, Gongsen
Zhao, Yu
author_facet Wang, Siyuan
Zhang, Shuyi
Tian, Zhen
Yao, Yuheng
Wang, Gongsen
Zhao, Yu
contents Robot path planning plays a pivotal role in enabling autonomous systems to navigate safely and efficiently in complex and uncertain environments. Despite extensive research on classical graph-based methods and sampling-based planners, achieving an optimal balance between global optimality, computational efficiency, and adaptability to dynamic environments remains an open challenge. To address this issue, this paper proposes a hybrid path planning framework, which integrates heuristic-driven search with probabilistic roadmap construction under a dynamic weighting scheme. By coupling the global guidance of A* with the stochastic exploration of PRM, the method achieves a synergistic balance between search optimality and computational tractability. Comprehensive experiments in diverse simulated environments demonstrate that the proposed method consistently yields smoother and shorter paths while significantly reducing computational overhead compared with conventional approach and other hybrid planners. These results highlight the potential of the proposed framework as an effective and generalizable solution for real-time robotic navigation in complex environments.
format Preprint
id arxiv_https___arxiv_org_abs_2509_05701
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle DW-A-PRM: A Dynamic Weighted Planner
Wang, Siyuan
Zhang, Shuyi
Tian, Zhen
Yao, Yuheng
Wang, Gongsen
Zhao, Yu
Robotics
Robot path planning plays a pivotal role in enabling autonomous systems to navigate safely and efficiently in complex and uncertain environments. Despite extensive research on classical graph-based methods and sampling-based planners, achieving an optimal balance between global optimality, computational efficiency, and adaptability to dynamic environments remains an open challenge. To address this issue, this paper proposes a hybrid path planning framework, which integrates heuristic-driven search with probabilistic roadmap construction under a dynamic weighting scheme. By coupling the global guidance of A* with the stochastic exploration of PRM, the method achieves a synergistic balance between search optimality and computational tractability. Comprehensive experiments in diverse simulated environments demonstrate that the proposed method consistently yields smoother and shorter paths while significantly reducing computational overhead compared with conventional approach and other hybrid planners. These results highlight the potential of the proposed framework as an effective and generalizable solution for real-time robotic navigation in complex environments.
title DW-A-PRM: A Dynamic Weighted Planner
topic Robotics
url https://arxiv.org/abs/2509.05701