Next: Example Previous: Analysis

SMA*

Note: this material is also optional

Simplified Memory-Bounded A*

Perform A* search
When memory is full, discard the worst leaf (greatest f value)
Back value of removed node to parent
Optimal if solution fits in memory