The Paths that Groups Make Robert Goldstone Indiana University Department of Psychology Program in Cognitive Science Collaborators Ben Ashpole Andy Jones.

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks
Advertisements

Modeling Maze Navigation Consider the case of a stationary robot and a mobile robot moving towards a goal in a maze. We can model the utility of sharing.
Data and Computer Communications Ninth Edition by William Stallings Chapter 12 – Routing in Switched Data Networks Data and Computer Communications, Ninth.
NUS CS5247 Motion Planning for Camera Movements in Virtual Environments By Dennis Nieuwenhuisen and Mark H. Overmars In Proc. IEEE Int. Conf. on Robotics.
Rumor Routing in Sensor Networks David Braginsky and Deborah Estrin Presented By Tu Tran 1.
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
CONNECTIVITY “The connectivity of a network may be defined as the degree of completeness of the links between nodes” (Robinson and Bamford, 1978).
PEDESTRAIN CELLULAR AUTOMATA AND INDUSTRIAL PROCESS SIMULATION Alan Jolly (a), Rex Oleson II (b), Dr. D. J. Kaup (c) (a,b,c) Institute for Simulation and.
C++ Programming: Program Design Including Data Structures, Third Edition Chapter 21: Graphs.
John S Gero Agents – Agent Simulations AGENT-BASED SIMULATIONS.
Presenter: Robin van Olst. Prof. Dr. Dirk Helbing Heads two divisions of the German Physical Society of the ETH Zurich Ph.D. Péter Molnár Associate Professor.
Approximation Algorithms: Combinatorial Approaches Lecture 13: March 2.
1 Greedy Algorithms. 2 2 A short list of categories Algorithm types we will consider include: Simple recursive algorithms Backtracking algorithms Divide.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Mobile Ad Hoc Networks Mobility (II) 11th Week
Graphs & Graph Algorithms 2 Nelson Padua-Perez Bill Pugh Department of Computer Science University of Maryland, College Park.
Chapter 7 Network Flow Models.
Randomized Planning for Short Inspection Paths Tim Danner Lydia E. Kavraki Department of Computer Science Rice University.
Continuum Crowds Adrien Treuille, Siggraph 王上文.
Chapter 11 Network Models. What You Need to Know For each of the three models: –What is the model? (what are given and what is to calculate) –What is.
Network Flow Models Chapter 7.
Navigability of Networks Dmitri Krioukov CAIDA/UCSD M. Boguñá, M. Á. Serrano, F. Papadopoulos, M. Kitsak, A. Vahdat, kc claffy May, 2010.
MNG221 - Management Science
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
Introduction to Management Science
(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Oct 16th, 2012.
Lecture 23. Greedy Algorithms
7-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Network Flow Models Chapter 7.
Programming for Geographical Information Analysis: Advanced Skills Online mini-lecture: Introduction to Networks Dr Andy Evans.
1 Pertemuan 20 Teknik Routing Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
Lecture 4 Transport Network and Flows. Mobility, Space and Place Transport is the vector by which movement and mobility is facilitated. It represents.
Chapter 3 Vectors. Coordinate Systems Used to describe the position of a point in space Coordinate system consists of a fixed reference point called the.
1 Heterogeneity in Multi-Hop Wireless Networks Nitin H. Vaidya University of Illinois at Urbana-Champaign © 2003 Vaidya.
Chapter 3 Vectors. Coordinate Systems Used to describe the position of a point in space Coordinate system consists of a fixed reference point called the.
Network Optimization Problems
Part 2. Culture region: area within a particular system Culture trait : single attribute of a culture Culture Complex: all the cultural traits that exist.
Data Communications and Networking Chapter 11 Routing in Switched Networks References: Book Chapters 12.1, 12.3 Data and Computer Communications, 8th edition.
Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.
InterConnection Network Topologies to Minimize graph diameter: Low Diameter Regular graphs and Physical Wire Length Constrained networks Nilesh Choudhury.
CSE 589 Part VI. Reading Skiena, Sections 5.5 and 6.8 CLR, chapter 37.
Yongqin Gao, Greg Madey Computer Science & Engineering Department University of Notre Dame © Copyright 2002~2003 by Serendip Gao, all rights reserved.
Most of contents are provided by the website Graph Essentials TJTSD66: Advanced Topics in Social Media.
1 Real-Time Parking Information on Parking-Related Travel Cost TRIP Internship Presentation 2014 Kory Harb July 24, 2014 Advisor: Dr. Yafeng Yin Coordinator:
Logging roads in the Amazon Basin: building process and modeling challenges Eugenio Arima Robert Walker Stephen Perz Marcellus Caldas Department of Geography.
Agent-Based Modeling of Crowd Behaviors Pedestrian crowds assembling at a concert arena Presented by: J. Randy Hancock.
Spring 2015 Mathematics in Management Science Network Problems Networks & Trees Minimum Networks Spanning Trees Minimum Spanning Trees.
Advanced Science and Technology Letters Vol.32 (Architecture and Civil Engineering 2013), pp A Study on.
EXCURSIONS IN MODERN MATHEMATICS SIXTH EDITION Peter Tannenbaum 1.
Human Collective Behavior as a Complex Adaptive System Robert Goldstone Indiana University Department of Psychology Program in Cognitive Science Collaborators.
Autonomous Robots Robot Path Planning (3) © Manfred Huber 2008.
Biologically Inspired Computation Ant Colony Optimisation.
Urban Traffic Simulated From A Dual Perspective Hu Mao-Bin University of Science and Technology of China Hefei, P.R. China
7-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Network Flow Models Chapter 7.
The Propagation of Innovations in Social Networks Robert Goldstone Indiana University Department of Psychological and Brain Sciences Program in Cognitive.
Construction of Optimal Data Aggregation Trees for Wireless Sensor Networks Deying Li, Jiannong Cao, Ming Liu, and Yuan Zheng Computer Communications and.
Spanning Trees Dijkstra (Unit 10) SOL: DM.2 Classwork worksheet Homework (day 70) Worksheet Quiz next block.
Introduction In modern age Geographic Information systems (GIS) has emerged as one of the powerful means to efficiently manage and integrate numerous types.
Geographic Routing without Location Information. Assumption by Geographic Routing Each node knows its own location.  outdoor positioning device: GPS:
The simultaneous evolution of author and paper networks
Excursions in Modern Mathematics Sixth Edition
Topics In Social Computing (67810)
Structural Properties of Networks: Introduction
I206: Lecture 15: Graphs Marti Hearst Spring 2012.
Graphs Chapter 11 Objectives Upon completion you will be able to:
Department of Computer Science University of York
Data and Computer Communications
Advanced Analysis of Algorithms
   Storage Space Allocation at Marine Container Terminals Using Ant-based Control by Omor Sharif and Nathan Huynh Session 677: Innovations in intermodal.
traveling salesman problem
Chapter 6 Network Flow Models.
by Riccardo Gallotti, Mason A. Porter, and Marc Barthelemy
Presentation transcript:

The Paths that Groups Make Robert Goldstone Indiana University Department of Psychology Program in Cognitive Science Collaborators Ben Ashpole Andy Jones Marco Janssen Allen Lee Winter Mason Michael Roberts

Collective Behavior as a Complex System Individual versus group perspectives Collective phenomena: creation of currency, transportation systems, rumors, the web, resource harvesting, crowding, scientific communities Compare group behavior experiments with agent-based computational models Concrete and abstract path forging and following –Collective path formation –The dissemination of innovations in a social network

Group Choice Collective Behavior as a Complex System People in groups often times make similar choices –People in a group are similar –Normative conformity (Deutsch & Gerard, 1955) –Early choosers change the environment for later choosers Taking advantage of predecessors’ choices –Advantages to choosing popular choices: VHS, Microsoft, QWERTYIOP –Standing on the shoulders of giants: Moore’s law –Evolution of path systems: activity facilitates further activity

Technological advances build on previous advances

Emergence of Path Systems What trails do people spontaneously create? Dwight Eisenhower’s “grassroots” architectural philosophy Previous paths are attractive: easier, low cognitive cost “Traveler, there is no path. Paths are made by walking.” -- Antonio Machado

Activity leads to more Activity

Comparison to optimal path systems Minimal Steiner Tree (MST) = the set of paths that connects a set of nodes using the minimal amount of total path length Steiner points = nodes added to original set of nodes –Always have 3 pathways, with each pair of adjacent pathways at 120 o angle (Fermat, 17th century) Applications in integrated circuit design, airport hub locations, internet routing, cable layout Finding MST solutions is an NP-hard problem –Yet soap film naturally approximate MST solutions –Can people approximate MSTs too?

A B C Minimal Spanning Tree X Form equilateral triangle Find circle uniquely determined by {B, C, X} Steiner point S is where the line AX intersects the circle S ASB= ASC= BSC=120 o Constructing Steiner Points

Minimal Steiner Trees Minimal Spanning Tree Minimal Steiner Tree Minimal Spanning Tree Minimal Steiner Tree

Soap Film MSTs

Group Path Formation Experiment Interactive, multi-participant experiment –34 Groups of 7-12 subjects –Instructed to move to randomly selected cities to earn points Points earned for each destination city reached –Points deducted for each traveled spot Travel cost for each spot inversely related to number of times spot was previously visited by all participants Steps on a spot also diffuse to neighboring spots Influence of previous steps decays with time Cost of each spot visually coded by brightness –6 configurations of cities –5-minutes of travel for each configuration

Participants see themselves as green triangles. Navigate by changing heading direction with left and right arrows Cities shown in blue, destination in green Other participants shown as yellow dots The brighter a path, the lower its cost

Video Viewer

- Isosceles triangle shows more pro-Steiner deviation from bee-line pathways compared to equilateral triangle. - The largest distance savings of MST over spanning tree is for equilateral triangle - Having a large advantage of an optimal path is no guarantee that a group will find it. Isosceles Equilateral

- Small rectangle shows more pro-Steiner deviation than large rectangle, despite having the same proportions. - Deviations from bee-line path may be produced if two paths are close enough to influence one another. Large rectangleSmall rectangle

- High diffusion shows more pro-Steiner deviation than low diffusion. - High diffusion allows two paths to influence/overlap each other more. High diffusion Low diffusion

- If include Steiner point, all other paths deviate toward the Steiner path. TriangleTriangle with Steiner point

- Rotated obtuse shows more pro-Steiner deviation for long path than canonical obtuse. - People may be influenced by canonical directions, with horizontal paths more salient/attractive than angled paths (Regier & Carlson, 2001) Canonical Obtuse Rotated Obtuse

-If include Steiner points, all other paths deviate toward the Steiner path. Rectangle Rectangle with Steiner points

Does not take into account intended destination   For every trip of each participant, integrate deviations from bee-line paths 

-Greater pro-Steiner deviations from bee-line paths for Isosceles - Asymmetries in paths: deviations from bee-line paths preferred at end of trip than at beginning (Bailenson, Shum, & Uttal, 1998, 2000)

-Greater pro-Steiner deviations for long path of rotated obtuse angle than canonical obtuse. - Asymmetries in paths: deviations from bee-line paths preferred at end of trip than at beginning

-Greater pro-Steiner deviations from bee-line paths for small compared to large rectangle.

- Greater pro-Steiner deviations from bee-line paths when the Steiner point is also a destination - Strong evidence for path re-use

- Greater pro-Steiner deviations from bee-line paths when early travel is low- cost -Early low-cost travel promotes more optimal path systems, perhaps through greater exploration RectangleRectangle with early low- cost travel

- Walkers move to destinations, affecting their environment locally as they walk, facilitating subsequent travel for others. - Walkers compromise between taking the shortest way to their destination and using existing, strong trails. - Agent-based model using the Langevin equation for Brownian motion in a potential. Active Walker Model (Helbing, Keltsch, & Molnár, 1997)

G(r,t)= Ground potential at location r at time t, reflecting comfort of walking G 0 = natural ground condition T(r)= Durability of trails from regrowth I(r) = Intensity of vegetation clearing G max = maximum comfort of a location  = Dirac’s delta function. Only count agents  at location r

Active Walker Model (Helbing, Keltsch, & Molnár, 1997) V tr (r ,t)= trail potential = Attractiveness for agent   (r  ) = visibility at agent’s location Attractiveness based on ground potential and distance of location to agent  Integrate to find spatial average of ground potentials

Active Walker Model (Helbing, Keltsch, & Molnár, 1997) e  (r ,t)= Walking direction of agent  d  = next destination r  = gradient of the trail potential Direction determined by destination and the attractiveness of all locations

Active walker model correctly predicts more pro-steiner deviation for isosceles than equilateral triangle, and greater deviation with passing time. For isosceles, the model correctly predicts the most deviation near the triangle point with the smallest angle.

Model predicts greater deviation from bee-line paths if Steiner point is included as a destination.

Active walker model predicts greater deviation from bee-line paths for small than large rectangle.

Active walker model does not predict an influence of rotation on bee-line path deviations

Incorporating Rotational Sensitivity by changing distance function: S=1, not 2

Model can predict path asymmetries, but predicts them in opposite direction as actual results. It predicts great deviation from bee-line paths going from yellow to blue (or red) rather than going from blue to yellow.

Modeling human-like asymmetries: increase visibility, , as distance to destination decreases Original ModelRevised Model

Conclusion Group behavior from a complex adaptive systems perspective –People take advantage of trails left by others Group behavior, to a first approximation, is well modeled by an Active Walker Model –Accounts for differences in scales and topologies of destinations, influence of time, and approximate distribution of steps –Can fix discrepancies: direction of asymmetries, rotation invariance –Essential insight: people’s movements are a compromise between going to their destinations and going where the path is attractive

Humans Groups as Complex Systems Controlled, data-rich methods for studying human group behavior as complex adaptive systems –Less messy than real world data, but still rich enough to find emergent group phenomena –Bridge between modeling work and empirical tests Future Applications –Resource allocation –Group coordination –Coalition formation –Social dilemmas and common pool resource problems –Group polarization and creation of sub-groups in matters of taste –Social specialization and division of labor –