Path-Planning

Path-Planning

zhaohaojie1998

路径规划算法,A*,A-star启发搜索,Hybrid-A*,混合A*算法,Dijkstra迪杰斯特拉算法,GBFS贪婪最佳优先搜索算法,DFS深度优先搜索,BFS广度优先搜索算法等,车辆路径规划算法,小黑子路径规划

465 Stars
41 Forks
3 Watchers
Python Language
100 SrcLog Score
Cost to Build
$33.1K
Market Value
$66.0K

Growth over time

6 data points  ·  2025-06-01 → 2026-10-01
Stars Forks Watchers
💬

How do you feel about this project?

Ask AI about Path-Planning

Question copied to clipboard

What is the zhaohaojie1998/Path-Planning GitHub project? Description: "路径规划算法,A*,A-star启发搜索,Hybrid-A*,混合A*算法,Dijkstra迪杰斯特拉算法,GBFS贪婪最佳优先搜索算法,DFS深度优先搜索,BFS广度优先搜索算法等,车辆路径规划算法,小黑子路径规划". Written in Python. Explain what it does, its main use cases, key features, and who would benefit from using it.

Question is copied to clipboard — paste it after the AI opens.

How to clone Path-Planning

Clone via HTTPS

git clone https://github.com/zhaohaojie1998/Path-Planning.git

Clone via SSH

[email protected]:zhaohaojie1998/Path-Planning.git

Download ZIP

Download master.zip

Found an issue?

Report bugs or request features on the Path-Planning issue tracker:

Open GitHub Issues