Evaluating the Constant Weight in WA
Abstract
WA*, which has been widely used in computer science and AI applications is a search method based on A*. This method dose not guaranty to find optimal solutions, but with the appropriate determination of the weights, nearly optimal solutions can be efficiently found. Generally, the systems that use WA* as their search mechanism, use a constant weight for all problems in various domains, while different domains have different characteristics. In this paper, we show that using a constant weight for all domains and problems is inappropriate. We also introduce a novel search strategy named GBFS* as an upper bound of the WA* performance.
Keywords
Artificial Intelligence, Heuristic Search, A* Search Strategy, WA* Search Strategy
