Heuristic search in artificial intelligence
โ Scribed by Weixiong Zhang; Rina Dechter; Richard E. Korf
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 41 KB
- Volume
- 129
- Category
- Article
- ISSN
- 0004-3702
No coin nor oath required. For personal study only.
โฆ Synopsis
In his 1950 paper entitled, "Programming a Computer to Play Chess" [3], Shannon laid out the theory of minimax search with bounded lookahead and static heuristic evaluation, the basis of almost all subsequent work on two-player games. Along with Allen Newell, Herbert Simon established the idea of heuristic search in a problem space as one of the fundamental paradigms of problem solving in artificial intelligence [1]. We feel a deep sorrow for the loss of these two giants of our field. Both men are also known for their deep scientific contributions to other fields as well. Shannon was the father of information and communication theory, and Simon was a founding father of organizational behavior and the information processing model of cognitive psychology. Although Simon and Shannon are no longer with us, their work continues as a source of inspiration in virtually every field they touched. We dedicate this special issue on heuristic search in artificial intelligence to Claude Shannon and Herbert Simon.
Heuristic search remains as a core area of artificial intelligence (AI). The use of a good search algorithm is often a critical factor in the performance of an intelligent system. As with most areas of AI, there has been steady progress in heuristic search research over the years. This progress can be measured by several different yardsticks, including finding optimal solutions to larger problems, making higher quality decisions in fixedsize problems, handling more complex domains including dynamic environments with incomplete and uncertain information, being able to analyze and predict the performance of heuristic search algorithms, and the increasing deployment of real-world applications of search algorithms. The success of the Deep Blue Chess machine in defeating Gary Kasparov, the human world champion, in an exhibition match in 1997 was a landmark in the field of AI, the achievement of a goal that had been pursued for almost 50 years.
By coincidence, this special issue contains the same number of papers as the Artificial Intelligence Journal special issue on Search and Heuristics, published in 1983. What Judea
๐ SIMILAR VOLUMES
Two powerful techniques from AI-the use of heuristics, and state space analysis-are currently influencing the practice of pedagogy, particularly in mathematics. The current study compared the performance of college students on a mathematics task as a function of their exposure to each of these techn
All approaches to automatic pattern recognition or machine perception involve the initial assignment of a description to the pattern by the machine system in accordance with some predetermined rules or measurement procedures. The justification for adopting any particular set of rules or measurement
Thts paper presents heurlsttc search algortthms whtch work wtthm memory constramts These algortthms, MA\* (for ordinary graphs) and MAO\* (for AND~OR graphs) guarantee admtsstble soluttons wlthm spectfied memory hmltattons (above the rnmtmum requtred) The memory versus node expanstons tradeoff ts an