Using MATLAB: find the shortest path between the initial point till the target point with Dynamic Programming method
$10-30 USD
Pagado a la entrega
The assignment is to implement the Dynamic Programming technique with 2d area to find the shortest path for an agent that will move from the initial point till the destination point, as it shown in the picture.
- I have already done the main part of the assignment but still there are some adjustments...
Nº del proyecto: #33993963
Sobre el proyecto
16 freelancers están ofertando un promedio de $51 por este trabajo
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>.
Hi.Dear... Nice to meet you. I saw your project details carefully. Thanks for your posting. I am expert in Python and Matlab programming. I am working in this this field for 5 years. I have many experiences and I think Más
Dear Employer, I have extensive experience in Matlab programming and Dynamic programming implementation of the Shortest Path Problem. Please let me know if you are interested and I would be more than happy to assist Más
Hello This is Erick , a graduate engineer and MATLAB expert. I have gone through your documents and requiremets and i can confirm that i will deliver quality work and on time. Lets have a discussion on the chat. Rgs E Más
Hello, I read your job details and I can figure out the requirements. please contact me to share more information and start to work on it.
sir, I have more the 15 years of experience in Matlab. Its an easy one so that I can deliver in 4 days. I expect you give me an opportunity to serve you. thank you
hi, I am a phd student in algorithm design, and I am pretty familiar with shortest path problem, please let me know if you need me help
I will do it my work sincerely. Because i need money . I am very expect my project sir. So kindly give the work for me
Hello, how are you? I read your project detail and understand that you need a controller algorithm to implement the dynamic programming. It’s not always about winning, also for fun with control engineering projects. Ho Más
I have already worked on a similar project in which I made an algorithm for trajectory generation and collision avoidance using A* search method which works from node to node to find the shortest path. I implemented it Más