CodingTrain / CodingTrain/Suggestion-Box

Path planning using wavefront propagation

Open
#1,786 0 comments 1 reaction 0 assignees View on GitHub
Dominant language
No language data
Stars
570
Forks
85
PR merge metrics
No merged PRs in 30d

Description

The basic idea is to traverse all possible neighboring cells and calculating the minimum cost (represented by their d-value) and find the shortest path that can be used to traverse between the source and the destination
[This video can be used for reference](https://youtu.be/0ihciMKlcP8)
[Here's my implementation of this algorithm](https://github.com/DarkMortal/Processing-Projects/tree/main/Wave_Propagation)

![IMG](https://user-images.githubusercontent.com/67017303/212312761-b4b1d844-c1d3-47c5-b92a-f385c2cfa48f.png)
![Polymap22](https://user-images.githubusercontent.com/67017303/212312920-bf2b1911-23af-4002-9938-91d184581082.gif)
![Polymap23](https://user-images.githubusercontent.com/67017303/212312908-0e7df8c1-f75b-4dea-b151-6966358106bf.gif)

Contributor guide

No contributing guide indexed for this repository

Assessment

This issue has not been assessed yet.

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.