• Wrong document? Swap it for free
  • Written by students who passed
  • Immediately available after payment
  • Read online or as PDF
Sell
Where do you study
Your language
Document preview thumbnail
Preview 1 out of 3 pages
Class notes

CO2412 Computational Thinking Lecture 12 Notes

Document preview thumbnail
Preview 1 out of 3 pages

This document contains detailed notes from Lecture 12 of the CO2412 course on Computational Thinking. The lecture focuses on pathfinding algorithms, essential tools in computer science for determining the shortest or most efficient path between two points within a graph structure. These algorithms have broad applications, including robotics, logistics, game development, and network routing.

Content preview

CO2412: Computational Thinking
Lecture 12

Introduction to Pathfinding Algorithms
1. What is Pathfinding?
o Pathfinding algorithms are used to determine the shortest or most
efficient path between two points, often within a graph structure.
o These algorithms have applications in various domains including
robotics, logistics, game development, and network routing.
Universal Cost Search (UCS)
1. What is UCS?
o Universal Cost Search (UCS), also known as Dijkstra's algorithm,
is a graph traversal algorithm used to find the shortest path
between a starting node and a target node in a weighted graph.
o UCS explores all possible paths, expanding the least costly path
first.
2. UCS Algorithm
o Step-by-Step Process:

1. Start at the root node and initialize the cost to reach each
node as infinity, except for the starting node which is set to
zero.
2. Expand the node with the lowest cost.
3. Update the cost of reaching neighboring nodes.
4. Repeat the process until the target node is reached or all
nodes have been expanded.
3. Characteristics of UCS
o UCS guarantees finding the shortest path in a graph with non-
negative weights.
o It explores paths based on cumulative cost, ensuring that the path
with the lowest total cost is selected.

Document information

Study
Unknown
Uploaded on
August 20, 2024
Number of pages
3
Written in
2023/2024
Type
Class notes
Professor(s)
Amin amini
Contains
All classes
$5.38

Wrong document? Swap it for free Within 14 days of purchase and before downloading, you can choose a different document. You can simply spend the amount again.
Written by students who passed
Immediately available after payment
Read online or as PDF

Seller avatar
Reputation scores are based on the amount of documents a seller has sold for a fee and the reviews they have received for those documents. There are three levels: Bronze, Silver and Gold. The better the reputation, the more your can rely on the quality of the sellers work.
BpoBpo
3.7
(73)
Sold
312
Followers
250
Items
78
Last sold
6 months ago




Why students choose Stuvia

Created by fellow students, verified by reviews

Quality you can trust: written by students who passed their tests and reviewed by others who've used these notes.

Didn't get what you expected? Choose another document

No worries! You can instantly pick a different document that better fits what you're looking for.

Pay as you like, start learning right away

No subscription, no commitments. Pay the way you're used to via credit card and download your PDF document instantly.

Student with book image

“Bought, downloaded, and aced it. It really can be that simple.”

Alisha Student

Working on your references?

Create accurate citations in APA, MLA and Harvard with our free citation generator.

Working on your references?

Frequently asked questions