Case-based reasoning approach for heuristic search

Srinivas Krovvidy; William G. Wee; Chia Yung Han

doi:10.1117/12.45467

1 March 1991 Case-based reasoning approach for heuristic search

Srinivas Krovvidy, William G. Wee, Chia Yung Han

Proceedings Volume 1468, Applications of Artificial Intelligence IX; (1991) https://doi.org/10.1117/12.45467
Event: Orlando '91, 1991, Orlando, FL, United States

Abstract

Case Based Reasoning (CBR) is one of the recently emerging paradigms for designing intelligent systems. The preliminary studies indicate that the area is ripe for theoretical advances and innovative applications. Heuristic search is one of the most widely used techniques to solve many real world problems for obtaining optimal solutions. In this paper we identify some necessary properties of the heuristic functions to be solved in the CBR paradigm. We designed a CBR system based on these observations and performed several experiments for a heuristic search problem. We also provide an analysis to compare the performance of the CBR system with the A* search algorithm.

Citation Download Citation

Srinivas Krovvidy, William G. Wee, and Chia Yung Han "Case-based reasoning approach for heuristic search", Proc. SPIE 1468, Applications of Artificial Intelligence IX, (1 March 1991); https://doi.org/10.1117/12.45467

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available