Multi-State Commitment search

Yasuhiko Kitamura, Makoto Yokoo, Tomohisa Miyaji, Shoji Tatsumi

研究成果: ジャーナルへの寄稿Conference article

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
外部発表Yes
イベントProceedings of the 1998 IEEE 10th International Conference on Tools with Artificial Intelligence - Taipei, China
継続期間: 11 10 199811 12 1998

Fingerprint

Data storage equipment
Recovery
Experiments

All Science Journal Classification (ASJC) codes

  • Software

これを引用

Multi-State Commitment search. / Kitamura, Yasuhiko; Yokoo, Makoto; Miyaji, Tomohisa; Tatsumi, Shoji.

:: Proceedings of the International Conference on Tools with Artificial Intelligence, 01.12.1998, p. 431-439.

研究成果: ジャーナルへの寄稿Conference article

Kitamura, Yasuhiko ; Yokoo, Makoto ; Miyaji, Tomohisa ; Tatsumi, Shoji. / Multi-State Commitment search. :: Proceedings of the International Conference on Tools with Artificial Intelligence. 1998 ; pp. 431-439.
@article{d5c9a7203df643d18249747ab703bde6,
title = "Multi-State Commitment search",
abstract = "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.",
author = "Yasuhiko Kitamura and Makoto Yokoo and Tomohisa Miyaji and Shoji Tatsumi",
year = "1998",
month = "12",
day = "1",
language = "English",
pages = "431--439",
journal = "Proceedings of the International Conference on Tools with Artificial Intelligence",
issn = "1063-6730",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Multi-State Commitment search

AU - Kitamura, Yasuhiko

AU - Yokoo, Makoto

AU - Miyaji, Tomohisa

AU - Tatsumi, Shoji

PY - 1998/12/1

Y1 - 1998/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0032280835&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032280835&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0032280835

SP - 431

EP - 439

JO - Proceedings of the International Conference on Tools with Artificial Intelligence

JF - Proceedings of the International Conference on Tools with Artificial Intelligence

SN - 1063-6730

ER -