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
- Named after
- A* search algorithm
- Based on
- A* search algorithm
Show 4 more facts
- computes solution to
- shortest path problem
- described by source
- Artificial Intelligence: A Modern Approach
- time of discovery or invention
- 1992-00-00
- discoverer or inventor
- Stuart J. Russell
Sources (3)
via Wikidata · CC0
~3 min read
Encyclopedic overview
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 ==
Excerpted from Wikipedia’s “Simplified Memory-Bounded A*” article, available under the CC BY-SA 4.0 licence.