Multi-State Commitment search

Yasuhiko Kitamura, Makoto Yokoo, Tomohisa Miyaji, Shoji Tatsumi

研究成果: ジャーナルへの寄稿会議記事査読

5 被引用数 (Scopus)

抄録

We propose the Multi-State Commitment (MSC) method to speed-up heuristic search algorithms for semi-optimal solutions. The Real-Time A* (RTA*) and the Weighted A* (WA*) are representative heuristic search algorithms for semi-optimal solutions and can be viewed as a single-state and an all-state commitment search algorithms respectively. In these algorithms, there is a tradeoff between the risk of making wrong choices in search process and the amount of memory for the recovery, with RTA* and WA* being the extremes. The MSC method introduces a moderate and flexible characteristic into these algorithms and can increase the performance dramatically in problems such as the N-puzzle. In this paper, by introducing a commitment list, we show a modification of RTA* and WA* to their MSC versions without violating their completeness. Then, we experiment with their performance in maze and N-puzzle problems, and discuss conditions that the MSC method is effective.

本文言語英語
ページ(範囲)431-439
ページ数9
ジャーナルProceedings of the International Conference on Tools with Artificial Intelligence
出版ステータス出版済み - 12月 1 1998
外部発表はい
イベントProceedings of the 1998 IEEE 10th International Conference on Tools with Artificial Intelligence - Taipei, China
継続期間: 11月 10 199811月 12 1998

!!!All Science Journal Classification (ASJC) codes

  • ソフトウェア

フィンガープリント

「Multi-State Commitment search」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル