Using Dynamic Programming technique route the shortest path between the initial point till the target point..
Budget: $10 – $30 USD
The assignment is to implement the Dynamic Programming technique with 2d area to find the shortest path for an Unmanned Surface Vehicle USV that will move from the initial point till the destination point, as it shown in the picture.
- We will use the import command for importing the prior data that we got from the European Atlas of the Seas. Then, the USV will be able to route through the area avoiding the obstacles (red node) based on the previous data.
- The data file is provide in this link ( https://github.com/smar-git/SM-data-merging/blob/main/code/intensity.dat )
- every color present a cell and every cell has a certain value according to its color.
- We will use the import command for importing the prior data that we got from the European Atlas of the Seas. Then, the USV will be able to route through the area avoiding the obstacles (red node) based on the previous data.
- The data file is provide in this link ( https://github.com/smar-git/SM-data-merging/blob/main/code/intensity.dat )
- every color present a cell and every cell has a certain value according to its color.