Topic: Find the minimum path of an agent on the production floor when obstacles exist
A project that use A* or Greedy Algorithm to find the min path between two points (start and final)
On the grid there are some obstacles (place in random each run)
Simple illustration of the grid requires with the obstacles and the points
Priority to java or python
Obvious writing description on the code
13 фрилансеров(-а) в среднем готовы выполнить эту работу за $73
Hello, I am Oracle certified professional java programmer and have Bsc.IT. I am ready to help you. Please provide more details , ie: GUI needed. So I can give you accurate cost and time frame. Thank you.
Looks like another Dynamic Programming problem. I just won a contest for solving the Cutting Stocks problem using Dynamic Programming method. Please let me know if I can help. Thank you.