A* algorithm in vehicular network

2022 11 11
1 个回答
更新时间：2024 5 15
10 次查看（30 天）

0 个投票

I just want to use A* algorithm for finding the shortest path. Can you please help me

请先登录，再回答此问题。

回答（1 个）

Vidip
Vidip 2024-5-15

0 个投票

I understand that you want to use A* algorithm for finding the shortest path, you can use ‘plannerAStarGrid’, it creates an A* path planner. The planner performs an A* search on an occupancy map and finds shortest obstacle-free path between the specified start and goal grid locations as determined by heuristic cost.
For more information, you can refer to the documentation link below –

类别

在 帮助中心 和 File Exchange 中查找有关 Motion Planning 的更多信息

产品

版本

R2018a

标签

回答：

Vidip
Vidip
2024-5-15

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by