22:
124:
236:
The implementation of Simple memory bounded A* is very similar to that of A*; the only difference is that nodes with the highest f-cost are pruned from the queue when there isn't any space left. Because those nodes are deleted, simple memory bounded A* has to remember the f-cost of the best forgotten
188:
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*.
994:
215:
It is optimal if the allowed memory is high enough to store the shallowest optimal solution, otherwise it will return the best solution that fits in the allowed memory
142:
987:
1095:
1243:
980:
1073:
160:
105:
237:
child of the parent node. When it seems that all explored paths are worse than such a forgotten path, the path is regenerated.
1160:
43:
1078:
1150:
1233:
1140:
86:
1238:
58:
1228:
1183:
1198:
65:
1145:
1117:
181:
32:
1024:
1188:
1155:
1036:
956:
1175:
1132:
227:
When enough memory is available to contain the entire search tree, then calculation has an optimal speed
72:
39:
1068:
1063:
1041:
961:
932:
Simplified Memory
Bounded A Star Search Algorithm | SMA* Search | Solved Example in by Mahesh Huddar
1193:
1029:
185:
54:
1209:
1090:
1165:
1112:
1053:
1016:
1003:
1007:
972:
1222:
1107:
951:
Russell, S. (1992). "Efficient memory-bounded search methods". In
Neumann, B. (ed.).
212:
It is complete if the allowed memory is high enough to store the shallowest solution
79:
1058:
21:
931:
224:
Enlarging the memory bound of the algorithm will only speed up the calculation
206:
955:. Vienna, Austria: John Wiley & Sons, New York, NY. pp. 1–5.
953:
Proceedings of the 10th
European Conference on Artificial intelligence
740:// all children have already been added to the queue via a shorter way
557:// there is no memory left to go past s, so the entire path is useless
635:// heuristic of the successor + path length to the successor
1122:
976:
218:
It avoids repeated states as long as the memory bound allows it
117:
15:
1102:
1085:
138:
392://there is no solution that fits in the given memory
1174:
1131:
1015:
133:
may be too technical for most readers to understand
46:. Unsourced material may be challenged and removed.
988:
629:// f-value of the successor is the maximum of
8:
995:
981:
973:
960:
161:Learn how and when to remove this message
145:, without removing the technical details.
106:Learn how and when to remove this message
943:
143:make it understandable to non-experts
7:
44:adding citations to reliable sources
632:// f-value of the parent and
201:SMA* has the following properties
14:
221:It will use all memory available
122:
20:
1210:List of graph search algorithms
31:needs additional citations for
1:
1244:Game artificial intelligence
178:Simplified Memory Bounded A*
1260:
1207:
242:
1118:Monte Carlo tree search
182:shortest path algorithm
1176:Minimum spanning tree
1161:Shortest path faster
1069:Breadth-first search
1064:Bidirectional search
1010:traversal algorithms
40:improve this article
1096:Iterative deepening
1234:Routing algorithms
1091:Depth-first search
416:// min-f-cost-node
1239:Search algorithms
1216:
1215:
1113:Jump point search
1054:Best-first search
171:
170:
163:
116:
115:
108:
90:
1251:
1229:Graph algorithms
997:
990:
983:
974:
967:
966:
964:
948:
921:
918:
915:
912:
909:
906:
903:
900:
897:
894:
891:
888:
885:
882:
879:
876:
873:
870:
867:
864:
861:
858:
855:
852:
849:
846:
843:
840:
837:
834:
831:
828:
825:
822:
819:
816:
813:
810:
807:
804:
801:
798:
795:
792:
789:
786:
783:
780:
777:
774:
771:
768:
765:
762:
759:
756:
753:
750:
747:
744:
741:
738:
735:
732:
729:
726:
723:
720:
717:
714:
711:
708:
705:
702:
699:
696:
693:
690:
687:
684:
681:
678:
675:
672:
669:
666:
663:
660:
657:
654:
651:
648:
645:
642:
639:
636:
633:
630:
627:
624:
621:
618:
615:
612:
609:
606:
603:
600:
597:
594:
591:
588:
585:
582:
579:
576:
573:
570:
567:
564:
561:
558:
555:
552:
549:
546:
543:
540:
537:
534:
531:
528:
525:
522:
519:
516:
513:
510:
507:
504:
501:
498:
495:
492:
489:
486:
483:
480:
477:
474:
471:
468:
465:
462:
459:
456:
453:
450:
447:
444:
441:
438:
435:
432:
429:
426:
423:
420:
417:
414:
411:
408:
405:
402:
399:
396:
393:
390:
387:
384:
381:
378:
375:
372:
369:
366:
363:
360:
357:
354:
351:
348:
345:
342:
339:
336:
333:
330:
327:
324:
321:
318:
315:
312:
309:
306:
303:
300:
297:
294:
291:
288:
285:
282:
279:
276:
273:
270:
267:
264:
261:
258:
255:
252:
249:
246:
205:It works with a
166:
159:
155:
152:
146:
126:
125:
118:
111:
104:
100:
97:
91:
89:
48:
24:
16:
1259:
1258:
1254:
1253:
1252:
1250:
1249:
1248:
1219:
1218:
1217:
1212:
1203:
1170:
1127:
1011:
1001:
971:
970:
962:10.1.1.105.7839
950:
949:
945:
940:
928:
923:
922:
919:
916:
913:
910:
907:
904:
901:
898:
895:
892:
889:
886:
883:
880:
877:
874:
871:
868:
865:
862:
859:
856:
853:
850:
847:
844:
841:
838:
835:
832:
829:
826:
823:
820:
817:
814:
811:
808:
805:
802:
799:
796:
793:
790:
787:
784:
781:
778:
775:
772:
769:
766:
763:
760:
757:
754:
751:
748:
745:
742:
739:
736:
733:
730:
727:
724:
721:
718:
715:
712:
709:
706:
703:
700:
697:
694:
691:
688:
685:
682:
679:
676:
673:
670:
667:
664:
661:
658:
655:
652:
649:
646:
643:
640:
637:
634:
631:
628:
625:
622:
619:
616:
613:
610:
607:
604:
601:
598:
595:
592:
589:
586:
583:
580:
577:
574:
571:
568:
565:
562:
559:
556:
553:
550:
547:
544:
541:
538:
535:
532:
529:
526:
523:
520:
517:
514:
511:
508:
505:
502:
499:
496:
493:
490:
487:
484:
481:
478:
475:
472:
469:
466:
463:
460:
457:
454:
451:
448:
445:
442:
439:
436:
433:
430:
427:
424:
421:
418:
415:
412:
409:
406:
403:
400:
397:
394:
391:
388:
385:
382:
379:
376:
373:
370:
367:
364:
361:
358:
355:
352:
349:
346:
343:
340:
337:
334:
331:
328:
325:
322:
319:
316:
313:
310:
307:
304:
301:
298:
295:
292:
289:
286:
283:
280:
277:
274:
271:
268:
265:
262:
259:
256:
253:
250:
247:
244:
234:
199:
194:
167:
156:
150:
147:
139:help improve it
136:
127:
123:
112:
101:
95:
92:
49:
47:
37:
25:
12:
11:
5:
1257:
1255:
1247:
1246:
1241:
1236:
1231:
1221:
1220:
1214:
1213:
1208:
1205:
1204:
1202:
1201:
1199:Reverse-delete
1196:
1191:
1186:
1180:
1178:
1172:
1171:
1169:
1168:
1163:
1158:
1153:
1151:Floyd–Warshall
1148:
1143:
1137:
1135:
1129:
1128:
1126:
1125:
1120:
1115:
1110:
1105:
1100:
1099:
1098:
1088:
1083:
1082:
1081:
1076:
1066:
1061:
1056:
1051:
1050:
1049:
1044:
1039:
1027:
1021:
1019:
1013:
1012:
1002:
1000:
999:
992:
985:
977:
969:
968:
942:
941:
939:
936:
935:
934:
927:
926:External links
924:
243:
233:
232:Implementation
230:
229:
228:
225:
222:
219:
216:
213:
210:
198:
195:
193:
190:
169:
168:
130:
128:
121:
114:
113:
28:
26:
19:
13:
10:
9:
6:
4:
3:
2:
1256:
1245:
1242:
1240:
1237:
1235:
1232:
1230:
1227:
1226:
1224:
1211:
1206:
1200:
1197:
1195:
1192:
1190:
1187:
1185:
1182:
1181:
1179:
1177:
1173:
1167:
1164:
1162:
1159:
1157:
1154:
1152:
1149:
1147:
1144:
1142:
1139:
1138:
1136:
1134:
1133:Shortest path
1130:
1124:
1121:
1119:
1116:
1114:
1111:
1109:
1108:Fringe search
1106:
1104:
1101:
1097:
1094:
1093:
1092:
1089:
1087:
1084:
1080:
1077:
1075:
1074:Lexicographic
1072:
1071:
1070:
1067:
1065:
1062:
1060:
1057:
1055:
1052:
1048:
1045:
1043:
1040:
1038:
1035:
1034:
1033:
1032:
1028:
1026:
1023:
1022:
1020:
1018:
1014:
1009:
1005:
998:
993:
991:
986:
984:
979:
978:
975:
963:
958:
954:
947:
944:
937:
933:
930:
929:
925:
241:
240:Pseudo code:
238:
231:
226:
223:
220:
217:
214:
211:
208:
204:
203:
202:
196:
191:
189:
187:
184:based on the
183:
179:
175:
165:
162:
154:
151:November 2009
144:
140:
134:
131:This article
129:
120:
119:
110:
107:
99:
88:
85:
81:
78:
74:
71:
67:
64:
60:
57: –
56:
52:
51:Find sources:
45:
41:
35:
34:
29:This article
27:
23:
18:
17:
1141:Bellman–Ford
1046:
1030:
952:
946:
239:
235:
209:, just as A*
200:
177:
173:
172:
157:
148:
132:
102:
93:
83:
76:
69:
62:
50:
38:Please help
33:verification
30:
1059:Beam search
1025:α–β pruning
1223:Categories
1146:Dijkstra's
938:References
827:successors
770:shallowest
707:successors
653:successors
512:&&
197:Properties
96:March 2015
66:newspapers
1189:Kruskal's
1184:BorĹŻvka's
1156:Johnson's
957:CiteSeerX
689:ancestors
530:max_depth
470:successor
207:heuristic
1079:Parallel
245:function
812:parents
779:highest
488:problem
452:success
422:problem
386:failure
332:problem
299:ordered
269:problem
254:bounded
192:Process
137:Please
80:scholar
1194:Prim's
1017:Search
959:
899:insert
872:parent
866:insert
854:needed
833:remove
821:parent
797:parent
746:memory
725:remove
695:needed
659:update
449:return
383:return
326:insert
251:memory
248:simple
82:
75:
68:
61:
55:"SMA*"
53:
1166:Yen's
1004:Graph
917:while
893:queue
860:queue
818:begin
758:begin
719:queue
713:queue
680:those
515:depth
407:begin
401:queue
374:empty
368:queue
362:begin
353:while
320:queue
317:begin
293:nodes
281:queue
180:is a
87:JSTOR
73:books
1123:SSS*
1047:SMA*
1042:LPA*
1037:IDA*
1008:tree
1006:and
857:then
842:Node
806:Node
788:cost
776:with
773:node
764:Node
755:then
752:full
731:node
716:then
701:node
674:node
668:cost
656:then
650:more
590:node
560:else
533:then
500:goal
476:node
464:next
446:then
440:node
434:goal
395:node
380:then
356:True
344:node
338:root
311:cost
278:path
263:star
174:SMA*
59:news
920:end
914:end
887:end
884:for
881:end
839:bad
803:bad
794:for
761:bad
686:its
677:and
638:end
578:max
551:inf
287:set
176:or
141:to
42:by
1225::
1103:D*
1086:B*
1031:A*
890:if
851:if
815:do
800:in
767::=
749:is
743:if
698:if
692:if
683:of
671:of
647:no
644:if
641:if
623:))
575::=
548::=
527:==
494:is
482:if
461::=
428:is
419:if
410:()
398::=
377:()
365:if
359:do
302:by
290:of
260:*-
186:A*
996:e
989:t
982:v
965:.
911:;
908:)
905:s
902:(
896:.
878:;
875:)
869:(
863:.
848:;
845:)
836:(
830:.
824:.
809:.
791:;
785:-
782:f
737:;
734:)
728:(
722:.
710:⊆
704:.
665:-
662:f
626:;
620:s
617:(
614:h
611:+
608:)
605:s
602:(
599:g
596:,
593:)
587:(
584:f
581:(
572:)
569:s
566:(
563:f
554:;
545:)
542:s
539:(
536:f
524:)
521:s
518:(
509:)
506:s
503:(
497:-
491:.
485:!
479:)
473:(
467:-
458:s
455:;
443:)
437:(
431:-
425:.
413:;
404:.
389:;
371:.
350:;
347:)
341:-
335:.
329:(
323:.
314:;
308:-
305:f
296:,
284::
275::
272:)
266:(
257:A
164:)
158:(
153:)
149:(
135:.
109:)
103:(
98:)
94:(
84:·
77:·
70:·
63:·
36:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
