Downloaded 39 times
HK
Uploaded byHema Kashyap
PPTX, PDF2,365 views
Lecture 18 simplified memory bound a star algorithm
This document presents the Simplified Memory Bound A* algorithm, an extension of the A* pathfinding algorithm. It describes the algorithm and provides an example of how it works to find the shortest path between two nodes on a graph. The example shows the algorithm exploring nodes, updating priority queues, and returning the lowest cost path once the goal is reached.
Related topics:
In this document
Powered by AI
Introduction to the Simplified Memory Bound A* Algorithm, which is an extension of the A* algorithm.
Reference to the date (4 September 2015) and the presenter (Hema Kashyap) but no specific content.
Presentation of an example to explain how the Simplified Memory Bound A* Algorithm works in practice.
Continuation of the presentation with multiple slides but without any specific content detailed.
Lecture 18 simplified memory bound a star algorithm
- 1. Simplified Memory BoundA* Algorithm (Extension of A*) Lecture-18 Hema Kashyap 4 September 2015 1
- 2.
- 3.
- 4.
- 5.
- 6. Simplified Memory BoundA* Algorithm -Example 4 September 2015 6
- 7.
- 8.
- 9.
- 10.
- 11.
- 12.
- 13.
- 14.
- 15.
- 16.
- 17.
- 18.