A Methodology for Solving Problems: Problem Modeling and Heuristic Generation

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 10, Issue 5, 1988, Pages 676-686

  Irani, Keki B ^a   Yoo, Suk I ^b  

^a UNIVERSITY OF MICHIGAN   (United States)

^b Seoul National University   (South Korea)

Author keywords

A algorithm; heuristic; model; problem solving; search

Indexed keywords

MATHEMATICAL TECHNIQUES -- SET THEORY; ROBOTICS;

EIGHT-PUZZLE PROBLEM; PROBLEM SOLVING; PROBLEM-ORIENTED HEURISTICS; ROBOT MOTION PLANNING; TRAVELING SALESMAN PROBLEM;

SYSTEMS SCIENCE AND CYBERNETICS;

EID: 0024069481     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.6776     Document Type: Article

References (15)

1. J. Gaschnig, “Exactly how good are heuristics?: Towards a real predictive theory of best first search”, in Proc. 1JCAI, Aug. 1977, pp. 434-441.
2. J. Gaschnig, “A problem similarity approach to devising heuristics: First results”, in Proc. IJCAI, 1979.
3. G. Guida and M. Somalvico, “A method for computing heuristics in problem solving”, Inform. Sci., vol. 19, pp. 251–259, 1979.
4. L. Harris, “The heuristic search under conditions of error”, Artif. Inteli, vol. 5, 1974.
5. P. Hart, N. Nilsson, and B. Raphael, “A formal basis for the heuristic determination of minimum cost paths”, IEEE Trans. Syst. Sci. Cybernet., vol. 4, no. 2, 1968.
6. R. Haralick and L. Daviosenfeld, “Reduction operations for constraint satisfaction”, Inform. 5c/., vol. 14, pp. 199–219, 1978.
7. R. Haralick and L. Shapiro, “The consistent labeling problem: Part I”, IEEE Trans. Pattern Anal. Mach. Intell., vol. PAMI-1, Apr. 1979.
8. M. Held and R. Karp, “The traveling salesman problem and minimum spanning tree”, Oper. Res., vol. 19, 1971.
9. A. K. Mackworth, “Consistency in networks of relations”, Artif. Intel!., vol. 8, pp. 99–118, 1977.
10. N. Nilsson, Principles of Artificial Intelligence. Palo Alto, CA: Tioga, 1980.
11. J. Pearl, “On the discovery and generation of certain heuristics”, AI Mag., vol. 4, no. 1, winter-spring 1983.
12. J. Pearl, Heuristics: Intelligent Search Strategy for Computer Problem Solving. Reading, MA: Addison-Wesley, 1984.
13. I. Pohl, “The avoidance of ‘relative’ catastrophe, heuristic competence, genuine dynamic weighting and computational issues in heuristic problem-solving”, in Proc. IJCAI, 1973.
14. L. Rendell, “A new basis for state-space learning systems and a successful implementation”, Artif. Inteli., vol. 21, 1983.
15. S. Yoo, “A methodology for solving problems in artificial intelligence”, Ph.D. dissertation, Dep. Elec. Eng. Comput. Sci., Univ. Mich., Ann Arbor, MI, July 1985.