Title :
Generalized quicksearch for expert systems
Author :
Karnaugh, Maurice
Author_Institution :
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
Abstract :
Expert systems for applications that include the creation of a least-cost design or plan will frequently need built-in search procedures. Sometimes optimizing cannot terminate soon enough, and satisficing methods must be used. Quicksearch is a set of techniques for quickly obtaining good, but not necessarily optimal, solutions. These techniques are very specialized. The author simplifies and generalizes the quicksearch concept. Generalized quicksearch was tested, using the 15-puzzle as an example, and compared with the weighted heuristic method
Keywords :
expert systems; search problems; built-in search procedures; expert systems; least-cost design; quicksearch concept; satisficing methods; weighted heuristic method; Algorithm design and analysis; Artificial intelligence; Cost function; Expert systems; Hoses; Optimization methods; State-space methods; Testing; Tree graphs; Vehicles;
Conference_Titel :
Artificial Intelligence for Applications, 1992., Proceedings of the Eighth Conference on
Conference_Location :
Monterey, CA
Print_ISBN :
0-8186-2690-9
DOI :
10.1109/CAIA.1992.200007
