Exercise 2: Discrete motion planning

Paper Exercises

In this exercise we will:

• Practice modelling problems as graphs of states and actions
• Compare the A*- and Dijkstra's-algorithms on different problems
• Determine admissibility and consistency of heuristic functions

Paper exercises and solutions can be found in the exercise compendium.

It is recommended that you complete this paper exercise before moving on to the computer exercise.

Computer Exercises

In this exercise you will:

• Write a Dijkstra-algorithm
• Write an A*-algorithm THIS IS A PREREQUISITE FOR LAB 1
• Try your algorithms on a 2d-moving robot example
• (Optional) try your algorithms on the tower of hanoi

As always you can find instructions on how to connect at Connecting to Jupyter Hub.