Robotics (Lab work)

• Basic theoretical knowledge about graphs and

Dijkstra's algorithm is required.

• Path search using Dijkstra’s algorithm in

Matlab
 Goals:

1. To understand the adjacency and cost matrices

2. Learn to make a graph

3. Use Dijkstra’s algorithm to find minimum cost (shortest) path in the graph

4. Plot the results for visualization

 Dijkstra’s algorithm Matlab code
The code can be downloaded at following link:

https://www.mathworks.com/matlabcentral/fileexchange/20025-dijkstra-s-minimum-cost-
path-algorithm?s_tid=FX_rc3_behav

Coded by:
Joseph Kirk (2021). Dijkstra's Minimum Cost Path Algorithm
(https://www.mathworks.com/matlabcentral/fileexchange/20025-dijkstra-s-minimum-cost-
path-algorithm), MATLAB Central File Exchange. Retrieved April 28, 2021.
 To Do

• Find shortest path in following graph using

Dijkstra’s algorithm
4,8 8,8
1
start 2
goal
5 8
1,4
12,4
3 7
9
4,1 8,1