.png){kind=icon}
Return
A BIT* algorithm with dilated vertices-based path stretching strategy
.png){kind=icon}
PRE
AI
DOI：10.1016/j.rineng.2025.106710.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• A dilated vertices-based path stretching BIT* (DS-BIT*) method is proposed. • Modeled by rectangular, triangular, and circular, the obstacles are dilated and then the dilated vertices are obtained. • A bidirectional implementing mechanism of the DS-BIT* is proposed, which can further reduce the path cost.
Keywords:
Path planning
Dilated vertices
BIT*
Journal
IF:
7.9
Papers:
1.2W
Citations:
1.7W
Organization
No organization information available
Cited Papers
An improved weighted sum-fuzzy Dijkstra's algorithm for shortest path problem (iWSFDA).png)
SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
ShareSaveShareSaveShareSave no more
no more