Anyone has implemented SMA* search algorithm?

Question

I find the algorithm description in AIMA (Artificial Intelligence: A Modern Approach) is not correct at all. What does 'necessary' mean? What is the memory limit? The queue size or processed nodes? What if the current node has no children at all?

I am wondering if this algorithm itself is correct or not. Because I searched the Internet and nobody has implemented it yet.

Thanks.

Answer 1

SMA* also known as the Simplified Memory Bounded A* which is the 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. And all the other characteristics of SMA* are inherited from A*.

For the implementation of the algorithm, refer to the following link: https://metacpan.org/pod/AI::Pathfinding::SMAstar

If you are looking to learn more about Artificial Intelligence then you visit Artificial Intelligence Tutorial. Also, if you are appearing for job profiles of AI Engineer then you can prepare for the interviews on Artificial Intelligence Interview Questions.