Kim Myoung Jae, Chung Tae Choong

The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 10, pp. 2477-2484, Oct. 1997
10.3745/KIPSTE.1997.4.10.2477,   PDF Download:

Abstract

Best-first heuristic search algorithm, such as A* algorithm, are one of the most important techniques used to solve many problems in artificial intelligence. A common feature of heuristic search is its high computational complexity, which prevents the search from being applied to problems is practical domains such as route-finding in road map with significantly many nodes. In this paper, several heuristic search algorithms are concerned. A new dynamic weighting heuristic method called the pat-sensitive heuristic is proposed. It is based on a dynamic weighting heuristic, which is used to improve search effort in practical domain such as admissible heuristic is not available or heuristic accuracy is poor. It's distinctive feature compared with other dynamic weighting heuristic algorithms is path-sensitive, which means that %u03C9(weight) is adjusted dynamically during search process in state-space search domain. For finding an optimal path, randomly scattered road-map is used as an application area.

Statistics
Cite this article