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.
|Number of pages||9|
|Journal||Proceedings of the International Conference on Tools with Artificial Intelligence|
|Publication status||Published - 1998|
|Event||Proceedings of the 1998 IEEE 10th International Conference on Tools with Artificial Intelligence - Taipei, China|
Duration: Nov 10 1998 → Nov 12 1998
All Science Journal Classification (ASJC) codes