| Memory-Bounded Search |
|
|
|
|
|
|
|
|
|
| • | Space-complexity
the main drawback with |
|||||||
| A* |
||||||||
| • | IDA*
- Iterative deepening search along f |
|||||||
| contours |
||||||||
| • | Good
for simple problems with few |
|||||||
| contours. What to do if there are many |
||||||||
| unique
path-cost values? |
||||||||
