抄録
Linear-space search algorithms such as IDA* (Iterative Deepening A*) cache only those nodes on the current search path, but may revisit the same node again and again. This causes IDA* to take an impractically long time to find a solution. In this paper, we propose a simple and effective algorithm called Stochastic Node Caching (SNC) for reducing the number of revisits. SNC caches a node with the best estimate, which is currently known of the minimum estimated cost from the node to the goal node. Unlike previous related research such as MREC, SNC caches nodes selectively, based on a fixed probability. We demonstrate that SNC can effectively reduce the number of revisits compared to MREC, especially when the state-space forms a lattice.
| 本文言語 | English |
|---|---|
| ページ | 450-456 |
| ページ数 | 7 |
| 出版ステータス | Published - 1998 1月 1 |
| 外部発表 | はい |
| イベント | Proceedings of the 1998 15th National Conference on Artificial Intelligence, AAAI - Madison, WI, USA 継続期間: 1998 7月 26 → 1998 7月 30 |
Other
| Other | Proceedings of the 1998 15th National Conference on Artificial Intelligence, AAAI |
|---|---|
| City | Madison, WI, USA |
| Period | 98/7/26 → 98/7/30 |
ASJC Scopus subject areas
- ソフトウェア
- 人工知能