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 条
  • [1] SOLVING PROIZVOLOV PROBLEM OF COVERING A MULTIDIMENSIONAL POLYHEDRON WITH PYRAMIDS - GENERALIZATIONS OF THE PROBLEM
    GALPERIN, GA
    DOKLADY AKADEMII NAUK SSSR, 1987, 293 (02): : 283 - 288
  • [2] Vision by graph pyramids
    Kropatsch, WG
    SENSORS AND SENSING IN BIOLOGY AND ENGINEERING, 2003, : 275 - 287
  • [3] On Solving the Queen Graph Coloring Problem
    Vasquez, Michel
    Vimont, Yannick
    COMBINATORIAL ALGORITHMS, IWOCA 2017, 2018, 10765 : 244 - 251
  • [4] Intruder alert! Optimization models for solving the mobile robot graph-clear problem
    Morin, Michael
    Castro, Margarita P.
    Booth, Kyle E. C.
    Tran, Tony T.
    Liu, Chang
    Beck, J. Christopher
    CONSTRAINTS, 2018, 23 (03) : 335 - 354
  • [5] Intruder alert! Optimization models for solving the mobile robot graph-clear problem
    Michael Morin
    Margarita P. Castro
    Kyle E. C. Booth
    Tony T. Tran
    Chang Liu
    J. Christopher Beck
    Constraints, 2018, 23 : 335 - 354
  • [6] SOLVING GRAPH PROBLEMS ON VLSI MODELS
    DJIDJEV, HN
    DOKLADI NA BOLGARSKATA AKADEMIYA NA NAUKITE, 1985, 38 (12): : 1623 - 1625
  • [7] Graphical models for problem solving
    Alberola, C
    Tardón, L
    Ruiz-Alzola, J
    COMPUTING IN SCIENCE & ENGINEERING, 2000, 2 (04) : 46 - 57
  • [8] METHODS OF SOLVING A PROBLEM OF WEIGHTED COLORING OF A GRAPH
    RYZHKOV, AP
    ENGINEERING CYBERNETICS, 1978, 16 (05): : 89 - 95
  • [9] Genetic algorithms in solving graph partitioning problem
    Shazely, S
    Baraka, H
    Abdel-Wahab, A
    Kamal, H
    MULTIPLE APPROACHES TO INTELLIGENT SYSTEMS, PROCEEDINGS, 1999, 1611 : 155 - 164
  • [10] Parallel Algorithm for Solving the Graph Isomorphism Problem
    V. V. Vasilchikov
    Automatic Control and Computer Sciences, 2021, 55 : 617 - 622