Heuristic Searching: A* Search
نویسندگان
چکیده
منابع مشابه
Searching for Real-Time Heuristic Search Algorithms
Heuristic search is a core area of Artificial Intelligence with applications to planning, scheduling and game playing. Realtime heuristic search applies to search problems where plan execution needs to start before a complete solution can be computed. Since the inception of real-time heuristic search in the early 1990s a great number of algorithms have been proposed and evaluated. In this paper...
متن کاملSearching with a Corrupted Heuristic
Memory-based heuristics are a popular and effective class of admissible heuristic functions. However, corruptions to memory they use may cause these heuristics to become inadmissible. Corruption can be caused by the physical environment due to radiation and network errors, or it can be introduced voluntarily in order to decrease energy consumption. We introduce memory error correction schemes t...
متن کاملPSEUDO-RANDOM DIRECTIONAL SEARCH: A NEW HEURISTIC FOR OPTIMIZATION
Meta-heuristics have already received considerable attention in various fields of engineering optimization problems. Each of them employes some key features best suited for a specific class of problems due to its type of search space and constraints. The present work develops a Pseudo-random Directional Search, PDS, for adaptive combination of such heuristic operators. It utilizes a short term...
متن کاملMulti-Dimensional Heuristic Searching
A heuristic improvement technique referred to as multi-dimensional heuristics is presented. Instead of only applying the heuristic between two states X 1 and X 2 , when a distance esti mate of X 1 X 2 is needed, this technique uses a reference state R and applies the heuristic func tion to {X 1 ,R) and (X' 2 ,R) and compares the resulting values. If two states are close to each other, then th...
متن کاملHeuristic Search vs. Exhaustive Search
A theorem proving system embodying a systematic search procedure is de sen bed. Al though the search spaces are usually infinite, and not even locally finite, the asymmetric way in which thev are generated results in a speed that is es 11ma-ted to be one to two orders of magnitude faster than the theorem provers of Quinlan and Hunt, and Chang and the problem-solver of Kikes, to whi c h this sys...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOSR Journal of Computer Engineering
سال: 2012
ISSN: 2278-8727,2278-0661
DOI: 10.9790/0661-0420105