Scribd
Upload
43 views7 pages

Robotics (Lab Work)

This document provides an overview of using Dijkstra's algorithm in Matlab to find the shortest path between nodes in a graph. It outlines the basic theoretical knowledge required, describes using adjacency and cost matrices to define a graph, and explains how to apply Dijkstra's algorithm to find the minimum cost path. It also provides a link to download sample Matlab code and presents an example graph to find the shortest path using the algorithm.

Uploaded by

SAMRA YOUSAF
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
43 views7 pages

Robotics (Lab Work)

This document provides an overview of using Dijkstra's algorithm in Matlab to find the shortest path between nodes in a graph. It outlines the basic theoretical knowledge required, describes using adjacency and cost matrices to define a graph, and explains how to apply Dijkstra's algorithm to find the minimum cost path. It also provides a link to download sample Matlab code and presents an example graph to find the shortest path using the algorithm.

Uploaded by

SAMRA YOUSAF
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 7

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

You might also like