翻訳と辞書 Words near each other ・ Small article monitor ・ Small Asian mongoose ・ Small Asian sheath-tailed bat ・ Small Astronomy Satellite 2 ・ Small Astronomy Satellite 3 ・ Small Aten Temple ・ Small Avalanches and Other Stories ・ Small Axe ・ Small ball ・ Small ball (baseball) ・ Small ball (basketball) ・ Small Basilica, Plovdiv ・ Small Batch (EP) ・ Small batch whiskey ・ Small Bay (South Georgia) ・ SMA* ・ SMA-Segnalamento marittimo ed aereo ・ SMA1 ・ SMA2 ・ SMA3 ・ SMA4 ・ SMAA ・ Smaaland Cove ・ Smaalenene Bridge ・ Smaalenene Medier ・ Smaalenenes Amtstidende ・ Smaalenenes Avis ・ Smaart ・ Smaato ・ SMAC Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク SMA* ： ウィキペディア英語版 SMA* SMA * or Simplified Memory Bounded A * is a 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. All other characteristics of SMA * are inherited from A *. == Process == Like A *, it expands the most promising branches according to the heuristic. What sets SMA * apart is that it prunes nodes whose expansion has revealed less promising than expected. The approach allows the algorithm to explore branches and backtrack to explore other branches. Expansion and pruning of nodes is driven by keeping two values of $f$ for every node. Node $x$ stores a value $f(x)$ which estimates the cost of reaching the goal by taking a path through that node. The lower the value, the higher the priority. As in A * this value is initialized to $h(x)+g(x)$, but will then be updated to reflect changes to this estimate when its children are expanded. A fully expanded node will have an $f$ value at least as high as that of its successors. In addition, the node stores the $f$ value of the best forgotten successor. This value is restored if the forgotten successor is revealed to be the most promising successor. Starting with the first node, it maintains OPEN, ordered lexicographically by $f$ and depth. When choosing a node to expand, it chooses the best according to that order. When selecting a node to prune, it chooses the worst. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「SMA*」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.