Graph pyramids as models of human problem solving

被引:6
|
作者
Pizlo, Z [1 ]
Li, Z [1 ]
机构
[1] Purdue Univ, Dept Psychol Sci, W Lafayette, IN 47907 USA
来源
COMPUTATIONAL IMAGING II | 2004年 / 5299卷
关键词
graph pyramids; traveling salesman problem; human problem solving;
D O I
10.1117/12.543423
中图分类号
TB8 [摄影技术];
学科分类号
0804 ;
摘要
Prior theories have assumed that human problem solving involves estimating distances among states and performing search through the problem space. The role of mental representation in those theories was minimal. Results of our recent experiments suggest that humans are able to solve some difficult problems quickly and accurately. Specifically, in solving these problems humans do not seem to rely on distances or on search. It is quite clear that producing good solutions without performing search requires a very effective mental representation. In this paper we concentrate on studying the nature of this representation. Our theory takes the form of a graph pyramid. To verify the psychological plausibility of this theory we tested subjects in a Euclidean Traveling Salesman Problem in the presence of obstacles. The role of the number and size of obstacles was tested for problems with 6-50 cities. We analyzed the effect of experimental conditions on solution time per city and on solution error. The main result is that time per city is systematically affected only by the size of obstacles, but not by their number, or by the number of cities.
引用
收藏
页码:205 / 215
页数:11
相关论文
共 50 条
  • [41] MODELS OF PROBLEM-SOLVING - A STUDY OF KINDERGARTEN CHILDRENS PROBLEM-SOLVING PROCESSES
    CARPENTER, TP
    ANSELL, E
    FRANKE, ML
    FENNEMA, E
    WEISBECK, L
    JOURNAL FOR RESEARCH IN MATHEMATICS EDUCATION, 1993, 24 (05) : 428 - 441
  • [42] KRAGEN: a knowledge graph-enhanced RAG framework for biomedical problem solving using large language models
    Matsumoto, Nicholas
    Moran, Jay
    Choi, Hyunjun
    Hernandez, Miguel E.
    Venkatesan, Mythreye
    Wang, Paul
    Moore, Jason H.
    BIOINFORMATICS, 2024, 40 (06)
  • [43] SIGNIFICANCE TESTING OF RULES IN RULE-BASED MODELS OF HUMAN PROBLEM SOLVING.
    Lewis, C.Michael
    Hammer, John M.
    IEEE Transactions on Systems, Man and Cybernetics, 1986, SMC-16 (01): : 154 - 158
  • [44] SIGNIFICANCE TESTING OF RULES IN RULE-BASED MODELS OF HUMAN PROBLEM-SOLVING
    LEWIS, CM
    HAMMER, JM
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1986, 16 (01): : 154 - 158
  • [45] Graph simplex algorithm for solving minimal flow problem of a network
    Ning, Xuanxi
    Daqing Shiyou Xueyuan Xuebao/Journal of Daqing Petroleum Institute, 21 (03): : 477 - 482
  • [46] Solving the Latin Square Completion Problem by Memetic Graph Coloring
    Jin, Yan
    Hao, Jin-Kao
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2019, 23 (06) : 1015 - 1028
  • [47] Fast Clustering by Directly Solving Bipartite Graph Clustering Problem
    Nie, Feiping
    Xue, Jingjing
    Wang, Rong
    Zhang, Liang
    Li, Xuelong
    IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2024, 35 (07) : 9174 - 9185
  • [48] 3 METHODS FOR SOLVING THE PROBLEM OF MAXIMAL CUT OF A NONPLANAR GRAPH
    ORLOVA, GI
    SOVIET JOURNAL OF COMPUTER AND SYSTEMS SCIENCES, 1989, 27 (02): : 155 - 157
  • [49] A local branching heuristic for solving a Graph Edit Distance Problem
    Darwiche, Mostafa
    Conte, Donatello
    Raveaux, Romain
    T'Kindt, Vincent
    COMPUTERS & OPERATIONS RESEARCH, 2019, 106 : 225 - 235
  • [50] Solving Graph Vertex Coloring Problem with Microfluidic DNA Computer
    Niu, Ying
    Zhang, Xuncai
    Cui, Guangzhao
    PROCEEDINGS OF THE 10TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA 2012), 2012, : 5061 - 5065