Faculty of Informatics Vienna University of Technology Institute of Computer Aided Automation PRIP Home PRIP Home
Personal tools
You are here: Home Teaching PRIP-Talks Wieland Zellinger: TSP in 3D: A Computational Model for Human Performance on Surfaces?

Wieland Zellinger: TSP in 3D: A Computational Model for Human Performance on Surfaces?

Bachelor Spezifikationsvortrag

  • Presentation
When May 20, 2009
from 04:15 pm to 04:35 pm
Where Sem 183/2
Add event to calendar vCal
Recent computational models with hierarchical pyramid
architectures[1,2,3,4,5,6] have shown their ability to adequately model
human performance on the Euclidean traveling salesman problem (E-TSP).
We are extending the scope of the state-of-the-art model from 2D to
surfaces in 3D in order to find out, if there is further evidence
supporting the current model and thus potentially increasing its
plausibility. However, further data from psychophysical experiments will
be needed for confirmation and won't be part of the present study.

[1] S.M. Graham, A. Joshi, Z. Pizlo, The traveling salesman problem: a
hierarchical model, Memory & Cognition 28 (7)(2000) 1191-1204.
[2] B.J. Best, H.A. Simon, Simulating Human Performance on the Traveling
Salesman Problem, Proceedings of the Third International Conference on
Cognitive Modeling (2000) 42-49
[3] B.J. Best, A Model of Fast Human Performance on a Computationally
Hard Problem, Proceedings of the Twenty-seventh Annual Conference of the
Cognitive Science Society (2005)
[4] Z. Pizlo, E. Stefanov, J.Saalweachter, Z. Li, Y. Haxhimusa, W.G.
Kropatsch, Traveling salesman problem: a foveating model, Journal of
Problem Solving 1 (1) (2006) 83-101
[5] X. Kong, C.D. Schunn, Global vs. local information processing in
visual/spatial problem solving: The case of traveling salesman problem,
Cognitive Systems Research 8 (2007) 192-207
[6] Y.Haxhimusa, W.G. Kropatsch, Z. Pizlo, A. Ion, Approximative graph
pyramid solution of the E-TSP, Image and Vision Computing Volume 27 (7)
(2009) 887-896
Document Actions