Simplified Memory-Bounded A*
Sign in to saveAlso known as SMA*
SMA* or Simplified Memory Bounded A* is a shortest path algorithm based on the A* algorithm. The main advantage of SMA* is that it uses a bounded memory, while the A* algorithm might need exponential memory. All other characteristics of SMA* are inherited from A*.
Wikidata facts
Show 1 more fact
- time of discovery or invention
- 1992-00-00
Sources (3)
via Wikidata · CC0
~3 min read
Article
5 sectionsContents
- Process
- Properties
- Implementation
- External links
- References
SMA* or Simplified Memory Bounded A* is a shortest path algorithm based on the A* algorithm. The main advantage of SMA* is that it uses a bounded memory, while the A* algorithm might need exponential memory. All other characteristics of SMA* are inherited from A*.
== Process ==
Connections
Bellman–Ford algorithm
Entity
shortest path problem
Entity
heuristic
Entity
Dijkstra's algorithm
Entity
depth-first search
Entity
breadth-first search
Entity
Prim's algorithm
Entity
A* search algorithm
Entity
minimum spanning tree
Entity
Kruskal's algorithm
Entity
Floyd–Warshall algorithm
Entity
list of algorithms
Entity
CiteSeerX
Entity
alpha–beta pruning
Entity
tree traversal
Entity
Borůvka's algorithm
Entity
Johnson's algorithm
Entity
best-first search
Entity
iterative deepening depth-first search
Entity
beam search
Entity