A* algorithm in vehicular network
4 views (last 30 days)
Show older comments
I just want to use A* algorithm for finding the shortest path. Can you please help me
0 Comments
Answers (1)
Vidip
on 15 May 2024
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 –
0 Comments
See Also
Categories
Find more on Motion Planning in Help Center and File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!