Skip to content

Latest commit

 

History

History
6 lines (4 loc) · 306 Bytes

README.md

File metadata and controls

6 lines (4 loc) · 306 Bytes

#Path Planning Algorithms

In this assignment you need to implement:

  1. A Star Search Algorithm - To find an efficient path from the starting position to the goal.
  2. Value Iteration (Markov Decision Process) - To find the optimal policy at each point in the grid, maximizing based on the rewards.