MT461 – Path Planning for Mobile Robots

Individual Assignment 4
Class: F-18 – A, B Due Date: 30-12-2020

Marks: 40 CLO: 2

Instructions:
• All questions are to be solved by hand. Show complete working and all steps.
• Submit the assignment in a single PDF file on google classroom before the deadline. Name
your pdf file as per the given format in the file ‘FileName Template’.
• Late or plagiarized work will result in zero marks.
• Copied assignments with fellow students will result in zero marks for the copy provider as
well.
• Use the title page given at the end as the title page of your assignment. 05 marks will be
deducted from the obtained marks for not using the provided title page.
Question 1

For a mobile robot to go from point A to B through the possible link points given in the above figure,
apply a recursive algorithm for determining the shortest route using Bellman’s Dynamic Programming.

Question 2
Summarize the principle of optimality in Dynamic Programming.
Question 3
Select two problems (other than traveling salesman problem) that can be solved using Dynamic
Programming. Summarize the stages and states for the selected problems.
Question 4
For the problem given in question 1, how would you apply Genetic Algorithms to solve the problem?
 MT461 – Path Planning for Mobile Robots

Assignment No 04
Name
University ID
Section
Semester Fall 2020
Date

Completed/Non-Completed, difficulty faced and solution if

Question Marks
any.
1 20
2 5
3 10

4 5

Department of Mechatronics and Biomedical Engineering