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 条
  • [21] Solving the Graph Coloring Problem Using Cuckoo Search
    Aranha, Claus
    Toda, Keita
    Kanoh, Hitoshi
    ADVANCES IN SWARM INTELLIGENCE, ICSI 2017, PT I, 2017, 10385 : 552 - 560
  • [22] Models for solving the travelling salesman problem
    Williams, HP
    INTEGRATION OF AI AND OR TECHNIQUES IN CONSTRAINT PROGRAMMING FOR COMBINATORIAL OPTIMIZATION PROBLEMS, 2005, 3524 : 17 - 18
  • [23] Solving graph partitioning problem using genetic algorithms
    Shazely, S
    Baraka, H
    Abdel-Wahab, A
    1998 MIDWEST SYMPOSIUM ON CIRCUITS AND SYSTEMS, PROCEEDINGS, 1999, : 302 - 305
  • [24] SOLVING THE SINGLE STEP GRAPH SEARCHING PROBLEM BY SOLVING THE MAXIMUM 2-INDEPENDENT SET PROBLEM
    HSIAO, JY
    TANG, CY
    CHANG, RS
    INFORMATION PROCESSING LETTERS, 1991, 40 (05) : 283 - 287
  • [25] METHODS OF SOLVING A PROBLEM OF WEIGHTED COLORING OF A GRAPH.
    Ryzhkov, A.P.
    Engineering Cybernetics (English translation of Tekhnicheskaya Kibernetika), 1978, 16 (05): : 89 - 95
  • [26] MTPSO algorithm for solving planar graph coloring problem
    Hsu, Ling-Yuan
    Horng, Shi-Jinn
    Fan, Pingzhi
    Khan, Muhammad Khurram
    Wang, Yuh-Rau
    Run, Ray-Shine
    Lai, Jui-Lin
    Chen, Rong-Jian
    EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (05) : 5525 - 5531
  • [27] Deep Graph Reinforcement Learning for Solving Multicut Problem
    Li, Zhenchen
    Yang, Xu
    Zhang, Yanchao
    Zeng, Shaofeng
    Yuan, Jingbin
    Liu, Jiazheng
    Liu, Zhiyong
    Han, Hua
    IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2024,
  • [28] Solving the Telecommunication Network Problem using Vague Graph
    Lin, Lihua
    Zhang, Meichun
    Ma, Li
    ENGINEERING LETTERS, 2020, 28 (04) : 1213 - 1219
  • [29] Solving the graph-isomorphism problem with a quantum annealer
    Hen, Itay
    Young, A. P.
    PHYSICAL REVIEW A, 2012, 86 (04):
  • [30] Human Problem Solving in 2010
    Pizlo, Zygmunt
    JOURNAL OF PROBLEM SOLVING, 2012, 4 (01): : 52 - 61