<s>
SMA*	B-Protocol
or	O
Simplified	O
Memory	O
Bounded	O
A*	B-Protocol
is	O
a	O
shortest	O
path	O
algorithm	O
based	O
on	O
the	O
A*	B-Protocol
algorithm	I-Protocol
.	O
</s>
<s>
The	O
main	O
advantage	O
of	O
SMA*	B-Protocol
is	O
that	O
it	O
uses	O
a	O
bounded	O
memory	O
,	O
while	O
the	O
A*	B-Protocol
algorithm	I-Protocol
might	O
need	O
exponential	O
memory	O
.	O
</s>
<s>
All	O
other	O
characteristics	O
of	O
SMA*	B-Protocol
are	O
inherited	O
from	O
A*	B-Protocol
.	O
</s>
<s>
The	O
implementation	O
of	O
Simple	O
memory	O
bounded	O
A*	B-Protocol
is	O
very	O
similar	O
to	O
that	O
of	O
A*	B-Protocol
;	O
the	O
only	O
difference	O
is	O
that	O
nodes	O
with	O
the	O
highest	O
f-cost	O
are	O
pruned	O
from	O
the	O
queue	O
when	O
there	O
is	O
n't	O
any	O
space	O
left	O
.	O
</s>
<s>
Because	O
those	O
nodes	O
are	O
deleted	O
,	O
simple	O
memory	O
bounded	O
A*	B-Protocol
has	O
to	O
remember	O
the	O
f-cost	O
of	O
the	O
best	O
forgotten	O
child	O
of	O
the	O
parent	O
node	O
.	O
</s>
