Lecture Notes in Computer Science Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen
Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Alfred Kobsa University of California, Irvine, CA, USA Friedemann Mattern ETH Zurich, Switzerland John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen TU Dortmund University, Germany Madhu Sudan Microsoft Research, Cambridge, MA, USA Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbruecken, Germany
6899
Max Egenhofer Nicholas Giudice Reinhard Moratz Michael Worboys (Eds.)
Spatial Information Theory 10th International Conference, COSIT 2011 Belfast, ME, USA, September 12-16, 2011 Proceedings
13
Volume Editors Max Egenhofer Nicholas Giudice Reinhard Moratz Michael Worboys University of Maine Orono, ME 04469, USA E-mail: {max, giudice, moratz, worboys}@spatial.maine.edu
ISSN 0302-9743 e-ISSN 1611-3349 e-ISBN 978-3-642-23196-4 ISBN 978-3-642-23195-7 DOI 10.1007/978-3-642-23196-4 Springer Heidelberg Dordrecht London New York Library of Congress Control Number: 2011934621 CR Subject Classification (1998): E.1, H.2.8, J.2, I.5.3, I.2, F.1 LNCS Sublibrary: SL 1 – Theoretical Computer Science and General Issues
© Springer-Verlag Berlin Heidelberg 2011 This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com)
Preface
The Conference on Spatial Information Theory—COSIT—was established in 1993 as a biennial interdisciplinary conference. The COSIT conference series focuses on innovation in spatial information theory across the disciplines. It caters to researchers in such fields as anthropology, artificial intelligence, cognitive neuroscience, computer science, geography, linguistics, mathematics, psychology, and spatial cognition who are concerned with models of space and time. Of particular interest are perspectives that cut across multiple domains or those that leverage established methods common in one field so that new insights about space are gained in another field or discipline. COSIT 2011 marked the 10th time that COSIT convened. The 2011 conference was held September 12-16, 2011 at the Hutchinson Center in Belfast, Maine, on the Penobscot Bay. Late September was an excellent time to enjoy the stunning beauty of Maine’s coast since fall is New England’s most picturesque time of year. The foliage brings a crisp chill and vibrant leaf colorations. All COSIT submissions were fully refereed by three or four members of the Program Committee, who were asked to write substantial appraisals analyzing the submissions’ relevance to the conference, their intellectual merit, their scientific significance, novelty, relation to previously published literature, and clarity of presentation. Out of the 55 submissions, the Program Committee selected 23 papers for oral presentation. The three keynote speakers for COSIT 2011 were Ernest Davis, Department of Computer Science, New York University, Nora Newcombe, Department of Psychology at Temple University and Spatial Intelligence and Learning Center (SILC), and Thomas Wolbers, Centre for Cognitive and Neural Systems, University of Edinburgh. In addition to the technical program, COSIT 2011 had a poster session, four workshops, two tutorials, and a doctoral colloquium. We thank the many people who made COSIT 2011 such a success: all those who submitted work and participated at the meeting, the reviewers, the Program Committee, the local Organizing Committee, and the staff of the Hutchinson Center. September 2011
Max Egenhofer Nicholas Giudice Reinhard Moratz Mike Worboys
Organization
General Chairs Nicholas Giudice Mike Worboys
University of Maine, USA University of Maine, USA
Program Chairs Max Egenhofer Reinhard Moratz
University of Maine, USA University of Maine, USA
Steering Committee Christophe Claramunt Anthony Cohn Michel Denis Matt Duckham Max Egenhofer Andrew Frank Christian Freksa Stephen Hirtle Werner Kuhn Benjamin Kuipers David Mark Dan Montello Kathleen Stewart Sabine Timpf Barbara Tversky Stephan Winter Michael Worboys
Naval Academy Research Institute, France University of Leeds, UK LIMSI-CNRS, Paris, France University of Melbourne, Australia University of Maine, USA Technical University Vienna, Austria University of Bremen, Germany University of Pittsburgh, USA University of M¨ unster, Germany University of Michigan, USA SUNY Buffalo, USA UCSB, USA University of Iowa, USA University of Augsburg, Germany Stanford University, USA University of Melbourne, Australia University of Maine, USA
Program Committee Pragya Agarwal Brandon Bennett Moulin Bernard Sven Bertel Michela Bertolotto
Mehul Bhatt Thomas Bittner Gilberto Cˆ amara Christophe Claramunt Eliseo Clementini
VIII
Organization
Helen Couclelis Leila De Floriani Matt Duckham Geoffrey Edwards Carola Eschenbach Sara Fabrikant Andrew Frank Christian Freksa Mark Gahegan Antony Galton Stephen Hirtle Christopher Jones Marinos Kavouras Alexander Klippel Christian Kray Barry Kronenfeld Werner Kuhn Lars Kulik Damir Medak Daniel R. Montello
Nora Newcombe Martin Raubal Jochen Renz Kai-Florian Richter Andrea Rodriguez Christoph Schlieder Angela Schwering John Stell Kathleen Stewart Sabine Timpf Barbara Tversky David Uttal Nico Van De Weghe Jan Oliver Wallgr¨ un Robert Weibel Stephan Winter Thomas Wolbers Diedrich Wolter May Yuan
Table of Contents
Maps and Navigation How Do Decision Time and Realism Affect Map-Based Decision Making? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Jan Wilkening and Sara Irina Fabrikant
1
Towards Cognitively Plausible Spatial Representations for Sketch Map Alignment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Malumbo Chipofya, Jia Wang, and Angela Schwering
20
Scalable Navigation Support for Crowds: Personalized Guidance via Augmented Signage . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Fathi Hamhoum and Christian Kray
40
Information on the Consequence of a Move and Its Use for Route Improvisation Support . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Takeshi Shirabe
57
The Effect of Activity on Relevance and Granularity for Navigation . . . . Stephen C. Hirtle, Sabine Timpf, and Thora Tenbrink I Can Tell by the Way You Use Your Walk: Real-Time Classification of Wayfinding Performance . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Makoto Takemiya and Toru Ishikawa
73
90
Spatial Change From Video to RCC8: Exploiting a Distance Based Semantics to Stabilise the Interpretation of Mereotopological Relations . . . . . . . . . . . . . Muralikrishna Sridhar, Anthony G. Cohn, and David C. Hogg
110
Decentralized Reasoning about Gradual Changes of Topological Relationships between Continuously Evolving Regions . . . . . . . . . . . . . . . . Lin-Jie Guan and Matt Duckham
126
Spatio-temporal Evolution as Bigraph Dynamics . . . . . . . . . . . . . . . . . . . . . John Stell, G´eraldine Del Mondo, Remy Thibaud, and Christophe Claramunt
148
Spatial Reasoning On Optimal Arrangements of Binary Sensors . . . . . . . . . . . . . . . . . . . . . . . . Parvin Asadzadeh, Lars Kulik, Egemen Tanin, and Anthony Wirth
168
X
Table of Contents
A Hybrid Geometric-Qualitative Spatial Reasoning System and Its Application in GIS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Giorgio De Felice, Paolo Fogliaroni, and Jan Oliver Wallgr¨ un CLP(QS): A Declarative Spatial Reasoning Framework . . . . . . . . . . . . . . . Mehul Bhatt, Jae Hee Lee, and Carl Schultz
188
210
Spatial Cognition and Social Aspects of Space The Social Connection in Mental Representations of Space: Explicit and Implicit Evidence . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Holly A. Taylor, Qi Wang, Stephanie A. Gagnon, Keith B. Maddox, and Tad T. Bruny´e Revisiting the Plasticity of Human Spatial Cognition . . . . . . . . . . . . . . . . . Linda Abarbanell, Rachel Montana, and Peggy Li Linguistic and Cultural Universality of the Concept of Sense-of-Direction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Daniel R. Montello and Danqing Xiao Towards a Formalization of Social Spaces for Socially Aware Robots . . . . Felix Lindner and Carola Eschenbach
231
245
264 283
Perception and Spatial Semantics Finite Relativist Geometry Grounded in Perceptual Operations . . . . . . . . Simon Scheider and Werner Kuhn Linking Spatial Haptic Perception to Linguistic Representations: Assisting Utterances for Tactile-Map Explorations . . . . . . . . . . . . . . . . . . . . Kris Lohmann, Carola Eschenbach, and Christopher Habel Analyzing the Spatial-Semantic Interaction of Points of Interest in Volunteered Geographic Information . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Christoph M¨ ulligann, Krzysztof Janowicz, Mao Ye, and Wang-Chien Lee
304
328
350
Space and Language A Model of Spatial Reference Frames in Language . . . . . . . . . . . . . . . . . . . Thora Tenbrink and Werner Kuhn Universality, Language-Variability and Individuality: Defining Linguistic Building Blocks for Spatial Relations . . . . . . . . . . . . . . . . . . . . . . Kristin Stock and Claudia Cialone
371
391
Table of Contents
The Semantics of Farsi be: Applying the Principled Polysemy Model . . . . Narges Mahpeykar and Andrea Tyler
XI
413
On the Explicit and Implicit Spatiotemporal Architecture of Narratives of Personal Experience . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Blake Stephen Howald and E. Graham Katz
434
Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
455
How Do Decision Time and Realism Affect Map-Based Decision Making? Jan Wilkening and Sara Irina Fabrikant Geographic Information Visualization & Analysis Group (GIVA), Department of Geography, University of Zurich, Winterthurerstrasse 190, 8057 Zurich, Switzerland {jan.wilkening,sara.fabrikant}@geo.uzh.ch
Abstract. We commonly make decisions based on different kinds of maps, and under varying time constraints. The accuracy of these decisions often can decide even over life and death. In this study, we investigate how varying time constraints and different map types can influence people’s visuo-spatial decision making, specifically for a complex slope detection task involving three spatial dimensions. We find that participants’ response accuracy and response confidence do not decrease linearly, as hypothesized, when given less response time. Assessing collected responses within the signal detection theory framework, we find that different inference error types occur with different map types. Finally, we replicate previous findings suggesting that while people might prefer more realistic looking maps, they do not necessarily perform better with them. Keywords: time pressure, slope maps, shaded relief maps, empirical map evaluation.
1 Introduction Many people have used maps for spatio-temporal decision-making under varying time constraints. For instance, commuters must choose alternative driving routes with road maps, depending on rapidly changing traffic situations. Hikers might need to rapidly select a different trail using a topographic map, when the weather suddenly deteriorates in the mountains, or a sailor might have to quickly consult a nautical chart when navigating in an area with sudden wind and water level changes. Time available for such kinds of map-based decisions can vary enormously. Sometimes the decision time window might consist merely of a few seconds, and the decision might decide over life and death. With increasing human mobility, and respective increased availability of mobile map devices, it seems crucial to investigate how decision time constraints and display types might affect the quality of map-based decision making under rapidly changing conditions. We have been investigating this rather under researched issue with a series of prior controlled experiments, which we review with other relevant research in the related work section. In this study, involving a map-based slope detection task under varying time pressure scenarios, we specifically investigate decision-making within a three-dimensional context M. Egenhofer et al. (Eds.): COSIT 2011, LNCS 6899, pp. 1–19, 2011. © Springer-Verlag Berlin Heidelberg 2011
2
J. Wilkening and S.I. Fabrikant
and different display types, and analyze collected responses (i.e., accuracy) within the signal detection theory framework.
2 Related Work Our research program lies at the intersection of time pressure and decision-making research, mainly carried out in psychology and economics, including empirical map design research in cartography. In the following, we review related work from these cognate research fields. 2.1 Decision Making under Time Pressure Many external factors and cognitive biases impair optimal human decision-making (Simon, 1959; Payne, 1982; Gigerenzer, 2002). The effect of time constraints on decision making has been evaluated systematically by cognitive, developmental, and personality psychologists, as well as by human resources researchers, or economists (see Förster et al., 2003 for an extensive review). It is widely accepted that decision time influences the quality of decisions (Svenson et al., 1990), and that the negative effect of time pressure on decision making is robust and consistent (Pew, 1969; Ahituv et al., 1998). Two concepts from the psychological literature on time pressure and decisionmaking seem relevant for our study: Firstly, the speed-accuracy trade-off concept (Wickelgren, 1977) suggests that time pressure can reduce the overall quality of a decision, and, secondly, the speed-confidence trade-off (Smith et al., 1982) suggests that the confidence with which people make decisions might decrease with increasing time pressure. The characteristics of the speed-accuracy trade-off depend on task complexity: The more complex a task, the more likely the occurrence of the speed-accuracy trade-off (Johnson et al., 1993). However, there are also instances when time pressure has a beneficial effect on decision-making. For example, in a long-term time pressure study with NASA scientists and engineers Andrews and Farris (1972) found that decision performance actually increased with increased time pressure, but only to a certain tipping point. Beyond that point, decision performance decreased again. Peters et al. (1984) replicated these findings in a related study involving commercial bankers as decision makers. Hwang (1994) argues that perhaps the best way to describe the interaction between decision performance and time pressure is not a linear relationship, but an inverted U-shaped curve: “Increasing time pressure leads to better performance up to a certain point, beyond that point more time pressure reduces, rather than increases, performance.” (Hwang, 1994, p. 198). A still open question remains whether map-based decisions follow a linear speedaccuracy trade-off relation, or an inverted U-shaped curve as found in previous research outside of GIScience, which would imply that time pressure could also have a positive effect on map-based decisions. At this point, it is also unclear how map design and task complexity might interact with map-based decision making under time pressure. In empirical cartographic research, response time is typically employed as a dependent variable (i.e., efficiency measure) to evaluate cartographic design
How Do Decision Time and Realism Affect Map-Based Decision Making?
3
principles (Lloyd and Bunch, 2003; Garlandini and Fabrikant, 2009; Dillemuth, 2009). However, little work has been done until now to study the effect of time pressure (i.e., as a controlled, independent variable or factor) on map based decisionmaking. Baus, Krüger and Wahlster (2002) suggest to consider time pressure when designing displays of mobile devices for pedestrian navigation. They argue that changing travelling speeds during navigation create varying time pressure situations, which in turn should lead to different user requirements for navigation displays. They contend that different content should be displayed on a map used in different time pressure conditions. In another study involving user motivation in navigation, Srinivas and Hirtle (2010) offered a reward to one participant group as an incentive for faster task completion, while the other “control” group was not given any incentive to reduce task completion time. Indeed, the “more motivated” participants completed the routes significantly faster than the participants in the “control” group. 2.2 Map Design Issues in Decision Making Numerous prior empirical studies in cartography have investigated how map design might influence human visuo-spatial inference and decision making, typically depending on a specific map use task (Fabrikant and Lobben, 2009). For our study on slope detection, research comparing 2D and 3D-looking maps for a task involving three spatial dimensions seems particularly relevant. For example, studying aviator navigation performance, Smallman et al. (2001) have shown that users’ search time for selecting aircraft which meet certain criteria was significantly faster with 2D maps than with 3D-looking map displays. In related work on the design of cockpit displays, Thomas and Wickens (2006) found no significant performance differences in participants’ accuracy and response times between 2D co-planar or 3D perspective displays. Coors et al. (2005) evaluated small-screen 3D and 2D mobile navigation aids, and found that the majority of the participants had a positive attitude towards 3D. Participants found that 3D maps were generally a “good idea”, but also that 2D was already “sufficient” for mobile navigation. However, participants’ response times were significantly slower with 3D maps compared to 2D maps. This suggests that 3D displays in the context of navigation might be more suitable when having more time available for decision-making, but less useful under time pressure. In this context, the potential discrepancy between user preferences and actual task performance is also relevant. For instance, Canham, Smallman and Hegarty (2007) and Hegarty et al. (2009) have shown that users tend to prefer more realistic, 3D-looking weather maps that on the surface seem to contain more information for the decision-making task at hand than more abstract 2D maps. However, while users prefer 3D, these displays do not necessarily seem to positively influence users’ task performance. In fact, Hegarty and colleagues (2009) found that performance was generally better with the less realistic-looking maps, while users’ preference ratings indicated just the opposite. They interpret these results as “another good, empirically validated illustration of the common-sense notion that what people think they want is not always what is best for them” (Fabrikant and Lobben, 2009). According to Hegarty and colleagues, “naïve cartographers” seem to prefer 3D displays to 2D displays, and also seem to prefer more realistic depictions to simpler, more abstract ones. Cartographic design theories and principles, however, aim for reducing graphic
4
J. Wilkening and S.I. Fabrikant
complexity (Bertin, 1967). Similarly, the claims by designers for maximizing the data-ink ratio and for minimizing chart junk (Tufte, 1983), or the empirically validated clutter principle by Rosenholtz and colleagues (2007) also call for more abstraction, and less gratuitous realism to facilitate visuo-spatial decision making. From these related studies, we can derive an initial research hypothesis that users prefer more realistic-looking maps (e.g., satellite image maps) and 3D maps (e.g., shaded relief maps), but might perform better with traditional 2D cartographic maps (i.e., topographic maps). While on the surface it might seem obvious that certain map types are suitable for certain kinds of tasks, it is less obvious how variations of map display designs might influence the quality of map-based decisions under varying temporal usage constraints.
3 Previous Own Work: Experiments and Expert Interviews In order to fill the existing research gap between time pressure research and empirical map design and map use studies, we have been conducting a series of controlled experiments on map-based decision making under time pressure. We complemented these studies by expert interviews with professionals in the field of map-based decision-making under time pressure. In the following, we summarize the main findings of this work which set the context for the slope detection experiment reported in Section 4. In a first experiment on map use preferences for a road selection task under various time pressure conditions, we found that participants preferred realisticlooking orthographic satellite image maps and perspective views with hill shaded relief when they were not under time pressure (Wilkening, 2009). However, these preferred image maps were rated significantly less useful when under time pressure. In contrast, preference ratings for the more abstract looking topographic or road maps (i.e., without hill shading) were not affected by time pressure. In a second experiment, we assessed users’ road selection task performance in flat urban terrain. The roads were depicted either on a satellite image map or on a standard road map, under varying time pressure scenarios (Wilkening, 2010). The map display type did not affect participants’ accuracy scores. However, participants reported a significantly higher confidence in their performance with satellite images compared to the more abstract road maps. This over-confidence in realistic depictions has been discovered in prior work (Hegarty et al., 2009; Smallman and St. John, 2005; Fabrikant and Boughman, 2006). In our road selection experiment, shorter decision time limits resulted in a significant decrease in participants’ confidence, but not in accuracy. In other words, while we did find a speed-confidence trade-off effect, we did not find strong evidence for a speed-accuracy trade-off. After having obtained some first insights on map type preferences and task performance under time pressure by non expert map users, we were interested in interviewing professionals who perform map-based decisions under time pressure on a daily basis, specifically within a more complex three-dimensional context. For this reason we interviewed, amongst others, search and rescue helicopter pilots and
How Do Decision Time and Realism Affect Map-Based Decision Making?
5
professionally trained mountain guides. Both professional groups mentioned that they were generally satisfied with using the “classic” 2D topographic map for their routine work. In the age of 3D interactive globe viewers, and location-aware mobile displays, we found that the static, two-dimensional topographic map on paper is still the stateof-the-art for professionals dealing with real world emergency situations under time pressure. One reason could be that the majority of search and rescue personnel have been specifically trained with these maps, can read them well, and thus are generally comfortable with using them. These interviews confirm findings from our first experiment that familiarity (and training) with a display can positively influence usage preference, especially when under time pressure (Wilkening, 2009). For both helicopter flying and mountaineering activities, accurate slope identification is very important. For example, a helicopter must assess the steepness of the terrain for landing (Bloom, 2007), and for a mountain guide the steepness of a slope needs to be regularly assessed for determining the avalanche potential when on a ski tour during the snow season (Suter, 2007). As the depiction style of the thematically relevant third dimension might be important for these kinds of tasks, we specifically chose a slope detection task for our next experiment, which is described in detail the next sections.
4 Experiment As mentioned earlier, in own prior work we discovered a significant effect of time pressure on user preferences and response confidence for realistic 3D-looking maps in a 2D task context, while actual performance did not seem to be affected by the verisimilitude of the display. In this study, we are interested how 3D realism might affect participants’ response accuracy and confidence for a task under time pressure that specifically involves decision-making within a 3D context. We asked task domain novices, that is, people who might be familiar with maps, but have never used maps for landing a helicopter, to identify locations on various map stimuli where a helicopter could land. The previously interviewed professional helicopter pilots had mentioned inclines of less than 14% (or 8 degrees) for safe helicopter landing. This threshold seems to be a standard in the literature (e.g., Bloom, 2007). We again selected three time pressure scenarios with time limits what were identified through pilot testing. The experiment follows a within-subject design, where each participant was exposed to all time constraints and display types. 4.1 Participants Fifty-five (32 male and 23 female) participants took part in this study. Participants were either students or staff at the Department of Geography at the University of Zurich and the Institute of Cartography at the Swiss Federal Institute of Technology in Zurich. The majority of participants stated to be “rather familiar” with topographic maps (58.2%) and 3D displays (61.8%), while 32.7% reported to be “very familiar” with topographic maps, and 14.5% to be very familiar with 3D depictions. While our sample represents the more experienced map designer and user, the participants are not experts in the slope detection task domain, and do not represent experts in map-based decision making under time pressure.
6
J. Wilkening and S.I. Fabrikant
4.2 Materials We created twelve map displays in total, depicting mountainous areas in Switzerland. All maps were of identical size (389x355 pixels), and included a scale bar on the upper right of the display (see Figure 1). The elevation data for the stimuli were derived from the SRTM3 Digital Elevation Model (Jarvis et al., 2008). Slope information could be identified with two pieces of information depicted in the stimulus: the scale bar next to the map and the contour lines in the map. The map scale was held constant at 1:20,000 (run), and the contour line interval was held constant at 100m (rise). The twelve maps represent the elevation data in four different ways: 1. 2. 3. 4.
Contour lines only (map a) Contour lines plus light hill shading (map b) Contour lines plus dark hill shading (map c) Contour lines plus colored slope classes (map d)
While all map types are suitable for identifying slope, the depiction methods systematically vary in the degree of the depicted realism (i.e., shaded relief vs. contour line maps), in the apparent visual clutter (i.e., contour line vs. shaded relief maps), and in the information content for detecting slope suitability (slope vs. contour line maps). In other words, the maps are neither computationally nor informationally equivalent (Simon and Larkin, 1987; Fabrikant et al., 2008). Map (a) in Figure 1, containing only contour lines, represents the most abstract of the tested map types, and with the least amount of information (i.e., implicit slope information). Maps (b) and (c) additionally contain a shaded relief (i.e., explicit relative slope information), thus more information than map (a). Users can obtain slope information not only (implicitly) from the distance between the contour lines (a), but also from the relative darkness of the pixels (maps b+c). The steeper the slope, the darker is the appearance of the relief. To investigate the potential effect of the graphic quality of the hill shading, we created a lighter version (b) and a darker version (c) of the hill shaded relief maps. We employed the hill shade function available with the 3D Analyst Toolbox in ESRI’s ArcGIS. The light source for the hill shading was set to a 45° angle for the lighter relief (map b) and to a 22° angle for the dark relief (map c), respectively. Based on Simon and Larkin (1987), we hypothesize that the more implicit the depiction of the task relevant information (i.e., map a), and the higher the amount of task irrelevant information (i.e., maps b+c) the more reasoning effort is needed when making decisions with these maps. While our interviewed map-based decision-making professionals did not use slope maps (map d) for their daily work, they considered them as “nice-to-have”, so we included them in our study. The slope maps contain most task-relevant information in our tested maps. They show slope information explicitly in the map, and the respective information is explained in the accompanying legend, thus, should be easiest to use for task domain novices. Slope was calculated in ESRI’s ArcGIS and depicted in a diverging color scheme, employing the traffic light metaphor (green = go, red = stop). Slopes that are flat enough for a helicopter to land (i.e., below 14% steepness) are depicted with green shades, while slopes that are too steep for landing (i.e., above 14%) are shown in magenta shades (Figure 1d). We define amount of
How Do Decision Time and Realism Affect Map-Based Decision Making?
7
realism as a degree of verisimilitude with the real world (Zanola et al., 2009). We thus contend that shaded relief maps (b+c in Figure 1) look more realistic than a contour map (Figure 1a), because contours cannot be seen in the real world.
Fig. 1. Reduced examples of employed map stimuli: only contour line map (a), light hill shaded relief map (b), dark hill shaded relief map (c), and slope map (d)
Finally, the four tested map types also vary in graphic quality, or negatively put, in their degree of visual clutter. In Rosenholtz et al. (2007)’s terminology, clutter relates to the degree of perceptual organization of information in a display. The more organized a display, the less visual clutter (detracting information) it contains for a given task. We quantitatively assessed this purely bottom-up vision concept in our test displays by means of the Subband Entropy clutter measure, proposed by Rosenholtz and colleagues. This measure, also empirically validated with map displays, is “based on the notion of clutter as related to the efficiency with which the image can be encoded and inversely related to the amount of redundancy and grouping in the image” (Rosenholtz et al., 2007, p. 18). Subband entropy seems to be a good predictor for human map-reading performance under time pressure. The higher the subband entropy measure for a display (i.e., the more clutter), the less computationally efficient the extraction of information encoded in the image (Simon and Larkin 1987). To exemplify this measure, we computed subband entropy for the four stimuli shown in Figure 1, and find most clutter in the slope map (3.75), followed by the dark hill shaded relief (3.31), the light hill shaded relief (3.27), and lastly, the contour map (3.25). While the slope map is graphically more cluttered than the others (e.g., it includes an additional visual variable color), it shows the task relevant information
8
J. Wilkening and S.I. Fabrikant
explicitly (i.e., in the legend), thus despite perceptual clutter one would expect this map to need less reasoning effort to extract the task relevant information. The investigated factors are summarized in Table 1 below. Table 1. Comparison of the map types used in the slope detection experiment. The amount of information is indicated with + (low) to +++ (very high). contour map
shaded relief maps
slope map
degree of realism
(+)
depiction type (elevation information)
lines of equal elevation (absolute)
slope information type (amount) visual clutter (Subband Entropy) reasoning effort
implicit (+) (+)
(++) lines of equal elevation (absolute) & shaded relief (relative) implicit (++) (++)
(+) lines of equal elevation (absolute) & slope classes (absolute) explicit (+++) (+++)
(+++)
(++)
(+)
The locations participants had to assess for potential helicopter landing were represented with black labels (numbers) on a yellow background to maximize saliency. Each stimulus contained six such locations for assessment. No other pieces of information (such as labels of place names) were contained in the map. We ran a saliency model (Itti and Koch, 2001) on our test stimuli, to make sure that the saliency of the decision points was not significantly influenced by the tested map types. 4.3 Procedure The experiment took place in a lab equipped with standard personal computers connected to the Internet. The experiment was carried out digitally in a web browser displayed on a 17-inch computer screen set to 1280x768 pixel screen resolution. After filling out a background questionnaire, participants were then asked to safely land a helicopter on slopes not steeper than 14%. To assure that participants all had the necessary background to complete the task, they were first introduced to the slope concept and how slope can be calculated. They were shown how slope can be identified in a contour line map using the elevation information displayed with labels on the contour lines, and the ground distance information contained in the map scale bar. No other task relevant information was given to the participants. Participants were then asked to solve two warm-up tasks, which were identical to the actual experiment, which is described below. Then, they were shown the sequence of twelve maps described in the previous section. The order of the stimuli was systematically rotated to prevent learning biases due to potential ordering effects. For each map, participants had to select one or more locations that were flat enough for a helicopter to land, by clicking the respective checkbox below the map. For each map, six locations had to be assessed. The number of correct locations varied randomly from 1 to 5 per map. Overall, 50% of the labeled slopes were too steep to land a helicopter.
How Do Decision Time and Realism Affect Map-Based Decision Making?
9
Subjects had to solve the slope detection task under all three time constraint conditions, including 20s (most severe), 40s (moderate), and 60s (least severe) time limits and for all map display types described earlier. After completing each task, participants were asked to rate their confidence of response on a scale from “1 – not confident at all” to “4 – very confident”. Participants were not under time pressure when asked to rate their response confidence. Responses were collected digitally and included participants’ accuracy (percentage of correct answers) as well as (self-reported) confidence as success measures. After completing the digital portion of the experiment, participants were debriefed, and given a meal voucher for the university cafeteria in return for their participation. The experiment took approximately 15 minutes to complete. 4.4 Signal Detection Analysis The conceptual framework of signal detection theory (SDT), which was originally developed for research on visual perception (Tanner and Swets, 1954), can generally be employed for decision-making under uncertainty, and especially when decisions have to be made based on two or more alternatives. The benefits of using this framework for our research context is that response accuracy can be assessed with more analytical depth than just comparing correct and false answers. In SDT correct answers are coined “hits” or “correct rejects”, and errors are called “misses” or “false alarms”, respectively. This analysis framework can especially help us to identify which kinds of errors participants might make, due to varying time constraints and map display types, and thus if errors might follow a particular pattern. Applying this concept to our slope detection experiment, correctly selected locations per question are classified as “hits” (<14% steepness), and thus those (correctly) not selected locations are classified as “correct rejects” (>14%, see Table 2 below). Participant answers that are incorrect are classified as either “misses” or “false alarms”, respectively. A miss indicates a location that was not selected, even though it is correct (<14% steepness), and a false alarm occurs when participants incorrectly selected a location with a slope that is too steep (>14%). In other words, a miss is an overestimation of slope, while a false alarm represents the underestimation of a slope. Table 2 illustrates how we classify four possible types of responses within the data analysis framework of Signal Detection Theory. Table 2. Classification of correct and false answers according to Signal Detection Theory Reality Participants’ decisions Slope too steep (> 14%) Slope flat enough (<14%)
Slope too steep (> 14%) correct reject (true) false alarm (false)
Slope flat enough (<14%) miss (false) hit (true)
5 Results We first present the results regarding time pressure, followed by the results for the different map types, and finally, we report on the interaction of time pressure with map types on participants’ accuracy and confidence ratings.
10
J. Wilkening and S.I. Fabrikant
5.1 Time Pressure Effect Overall participants’ average response accuracy and confidence ratings shown in Figure 2 reveal a surprising and counterintuitive pattern. Participants are most accurate with the moderate time limit of 40s (M=82.8%, SD=11.4%), followed by the most generous time limit with 60s (M=72.2%, SD=15.2%), and lastly, as expected, the most severe time limit of 20s (M=66.7%, SD=20.4%). Similarly, participants’ self-reported confidence is also highest for the moderate 40s time limit (M=2.86, SD=0.44), followed by the least severe 60s limit (M=2.73, SD=0.15) and, lowest, again as expected, for the most severe 20s limit (M=2.67, SD=0.20). The performance increase from the 20s time limit to the 40s limit, and the performance decrease from the 40s to the 60s time limit are all significant for both accuracy and confidence (p< .001).
Fig. 2. Average accuracy and confidence per time pressure limit. Error bars: ±2 Standard Error (SE).
How Do Decision Time and Realism Affect Map-Based Decision Making?
11
5.2 Map Type Effect As expected, participants’ accuracy was significantly better with the slope map (M=83.6%, SD=14.8%) compared to all other maps, as shown in Figure 3. However, accuracy was not better as predicted, but even worse with the shaded relief maps compared to all other maps. Participants’ mean accuracy for the light hill shaded relief map is 73.1% (SD=16.8%), and with 65.4% (SD=18.5%) it is lowest overall for the dark hill shaded relief map. Surprisingly, participants perform even worse with the hill shaded relief maps that look more realistic, and contain more information than the most abstract contour map (M=73.5%, SD=13%). The difference between the contour map and the light hill shaded relief map is significant (p< .01), as well as the difference between the slope map and all other maps (p< .001). As can be seen in Figure 3, in congruence with the accuracy response pattern, participants’ confidence ratings are also highest for the slope map (M=3.13,
Fig. 3. Accuracy and confidence ratings for tested map display types (± 2 SE)
12
J. Wilkening and S.I. Fabrikant
SD=0.55), and higher for the contour maps (M=2.67, SD=0.47), compared to the lowest scoring hill shaded relief maps (dark: M=2.64, SD=0.47 and light: M=2.52, SD=0.47). Surprisingly again, participants have significantly higher confidence in their performance with the contour map, compared to the light hill shaded relief map (p< .05) that contains more information. The power of signal detection theory lets us analyze response accuracy in more detail. Overall, regardless of map type, misses (i.e., slope overestimation) occur more frequently than false alarms. Misses occur also more frequently than false alarms, independent of the tested time limits. The “correct rejection” is overall the more frequent correct answer than the “hit”, also for all map types and all temporal conditions. As expected, the number of false alarms (i.e., slope underestimation) shown in Figure 4 is significantly higher for the light hill shaded relief map (M=2.00, SD=1.75) than for the dark hill shaded relief map (M=1.18, SD=1.23). In contrast, the number of misses (i.e., slope overestimation) is, again as expected, higher with the darker hill shaded relief map (M=2.67, SD=1.77) compared to the light shaded relief (M=2.05, SD=1.69). As shown in Figure 4, SDT provides additional insights on what kinds of decision errors might have specifically contributed to the unexpectedly low accuracy for the shaded relief maps. Similar to the other map types, participants seem to overestimate the steepness of the slopes more frequently with the dark hill shaded relief maps (i.e., higher number of misses) compared to the light shaded relief maps. Hence, a map with a lighter shaded relief might help reduce this potential source of error. However, one can also see in Figure 4 that one drawback of light hill shaded relief maps might be their relatively high rate of false alarms.
Fig. 4. Misses and false alarms with shaded relief maps (± 2 SE). The maximum number of possible errors is 9 per map type.
5.3 Interaction of Map Type and Time Pressure We now turn to the research question how map types might support participants in their decision-making under varying time pressure scenarios. Participants gave most
How Do Decision Time and Realism Affect Map-Based Decision Making?
13
accurate answers with the (explicit) slope map under all time constraint conditions (see Figure 5). In the most severe time limit condition (20s), participants scored better with the most abstract contour map (M=71.2%, SD=30.5%), containing least amount of information, compared to the more realistic looking shaded relief maps (dark: M=63.9%, SD=27.9% and light: M=53.3%, SD=40.1%). For this shortest time limit, the overall differences between tested map types are significant (p< .01 for both shaded relief maps). Accuracy scores generally increase from the most severe (20s) to the moderate (40s) time limit condition. The accuracy differences between maps are not significant in the moderate condition. Overall, accuracy scores drop again for the highest scoring slope and contour maps under the least severe time constraint condition (60s), while accuracy scores for the hill shaded relief maps do not change much for the 40s and 60s limit conditions. In other words, participants’ accuracy with hill shaded relief maps only reaches the higher level of the other more abstract map types when participants are not under severe time pressure.
Fig. 5. Participant average accuracy per map display type and time limit
A very similar response pattern can be observed in Figure 6, when looking at participants’ confidence ratings. Again, mirroring accuracy scores, participants are most confident in their responses with the slope map, regardless of the given time limit. Participants’ confidence is also consistently high with the contour line map. The difference between the average confidence ratings for the slope map and the shaded relief maps is only significant at the 20s time limit. For this shortest time limit, the average confidence rating with the contour map is 2.58 (SD=0.08) and 2.30 (SD=0.07) with the shaded relief map. The rating difference between the contour map and both hill shaded relief maps is significant (p< .001). Only in the moderate time limit condition (40s), confidence ratings for the hill shaded relief maps are higher than for the contour map. This is in contrast to participants’ accuracy scores shown in Figure 5 earlier, where participant performance is better with the contour map that the shaded relief maps.
14
J. Wilkening and S.I. Fabrikant
Fig. 6. Participant average confidence per map display and time limit
6 Discussion Summarizing our results, we find that indeed, response accuracy and confidence ratings are worst when under highest time pressure, but best when participants are under a moderate response time limit. Both scores decrease significantly when participants have more decision time available. These results, which seem somewhat counterintuitive, do resemble the previously discovered inverted U-shaped response curve found by Hwang (1994), but not related to map-based decision making. Based on Johnson et al.’s (1993) and Hwang’s (1994) research results reviewed earlier, changes in speed-accuracy and speed-confidence trade-offs might be a consequence of task difficulty. As both response accuracy and confidence decreased with a time limit more severe than 40s, this slope detection task might have become significantly more difficult when participants had less than 40s to respond. As a result, we do find a clear speed-accuracy and speed-confidence trade-off effect. Participant performance did not further increase from the moderate to the least severe time limit, thus the slope detection task is not getting easier with more available decision time beyond the 40s time limit. In this study, the tipping point to which time pressure actually increases performance seems to be in the vicinity of 40s decision time. This pattern is in contrast to our previous road selection task study, where we did not find a time pressure effect on response accuracy, even with overall shorter decision time limits, down to even 10s decision time. One could argue that the road selection task on flat terrain is significantly less complex than a 3D slope detection task, and thus speed-accuracy and speed-confidence trade-offs are generally harder to find. This difference in task complexity might be one of the main reasons for the nonrepeatability of the results of Experiment I. Regarding the decision performance differences due to different the map types, surprisingly, participants’ accuracy and response confidence was unexpectedly low with the shaded relief maps. This result supports prior work by Hegarty and colleagues (Hegarty et al., 2008; Hegarty et al., 2009), who have shown that more
How Do Decision Time and Realism Affect Map-Based Decision Making?
15
realistic, 3D-looking displays while often preferred by “naïve users”, do not necessarily increase performance. While three-dimensional shaded reliefs provide more task-relevant (but implicit) information, compared to the more abstract contour map, this more on information does not lead to more effective (accurate) or efficient (faster) decision-making. One reason for this is might, arguably, be that the implicit thematically relevant information is not presented in a cognitively and perceptually adequate and inspired way (Swienty et al., 2008; Fabrikant et al., 2010). While the hill shaded relief maps might contain more explicit task-related information than the contour maps, they are also more cluttered (Rosenholtz et al., 2007), and thus might require more time for participants to visually parse. As Tufte (1983) would put it, the task-relevant data to graphic ink ratio in the visuo-spatial display is not optimized for the task at hand. On the other hand, while the slope maps exhibit the highest clutter values of the tested displays (see Table 1), the task-relevant data to graphic ink-ratio is indeed optimized for the task at hand. In fact, running a saliency model (Itti and Koch, 2001) on the stimuli, we find only one significant difference between the slope map and the other three tested map types (see Figure 1). The area along the bottom edge of the maps, where the density of the elevation contours is highest (i.e., the steepest area in the map), the slope map also shows darkest magenta shades between the contour lines. Moreover, the visual variable color hue seems not to have much influence on this saliency map pattern, as running the saliency model on a gray scale version of the slope maps (i.e., removing color hue) yields an identical saliency map pattern. Another possibility why the more abstract maps could have performed better under time pressure is that our 3D maps with high graphic density might have a general relative disadvantage when shown at smaller screen sizes with lower spatial display resolution than the 2D maps. However, participants do perform better with the shaded relief maps compared to the more abstract contour line map when they have more decision time available, and also seem to be more confident in their responses when under less time pressure. In this case, participant performance and confidence seem to reflect participant preferences, when we compare results from this study with the results from a prior map use preference experiment (see previous work Section 3), in which more realistic 3D looking satellite image maps obtained higher preference ratings when participants have more decision time available. In other words, we did not find strong evidence for a “naïve realism” effect (Smallman and St. John, 2005), or over-confidence in realistic-looking maps in this experiment, as low accuracy scores co-occurred with equally low confidence ratings for the tested shaded relief maps. This could be due to the fact that our participant sample consisted mainly of cartographic (design) professionals, and thus not “naïve” cartographers. Not surprisingly, the 2D slope maps, containing most of the thematically relevant information, outperformed all other map types with respect to effectiveness (i.e., accuracy) and efficiency (i.e., under all time limits), including participant confidence. In this case, in contrast to the shaded relief maps, the information increase had a positive effect on response accuracy and confidence, even though perceptually these maps appeared to be most cluttered (see Table 1). Reasons for this could be that the slope map already explicitly contains an intrinsic reasoning step (i.e., slope computation). This more on thematically relevant information is communicated in a cognitively adequate (explicit), and perceptually salient way, using empirically
16
J. Wilkening and S.I. Fabrikant
validated cartographic design principles (Fabrikant, Rebich-Hespanha and Hegarty 2010). In other words, participants can perform well and be confident in their decisions even with an abstract (but computationally efficient) depiction method, but only when thematically relevant information is communicated explicitly and rendered in a perceptually salient manner. It would be thus interesting to further investigate how different ways of representing slope information might affect the outcomes of map-based decision making tasks under time pressure. Although slope maps are not commonly known or used by map-based decision-making experts under time pressure, or the general public, our expert interviewees did find them useful, and had no problem in detecting the relevant information without any training.
7 Summary and Outlook In this study, we investigated how display types might affect people’s decision making when solving a complex slope detection task under varying time pressure conditions. Replicating previous work (Andrews and Farris, 1972; Hwang, 1994) we discovered an inverted U-shaped accuracy response curve which implies that moderate time pressure can have a positive effect on map-based decision-making, but only up to a certain tipping point, which seems to be around 40s in our study. Moreover, confirming long-standing (but rarely empirically validated) cartographic design theory (Bertin, 1967), we found that more abstract, but well designed contour and slope maps outperform more preferred realistic, 3D-looking hill shaded relief maps for the 3D slope detection task in our study. This might suggest that the benefit of explicitly communicating thematic relevant information, even in a graphically abstract way (i.e., higher cognitive cost), is greater for efficient and effective mapbased decision-making, than adding preferred and attractive, but visually more cluttered realism (i.e., higher perceptual cost). Low participant performance with shaded relief maps—even lower than the more abstract contour maps, containing even less information—suggest that visual realism might negatively influence decisionmaking, especially when under time pressure. Future experiments in varying map-based decision making contexts with different task complexity levels should be conducted to further investigate the generalizability of these somewhat counterintuitive findings, involving 1) performance decreases with more available decision time, and 2) surprisingly poor performance with shaded relief maps. For example, one could vary display sizes and the ways of representing slope information, in order to investigate the robustness of our findings. It is unclear at this point how performance is affected by user background and training. In future related studies, participants with less cartography training could be tested in similar time pressure contexts, in order to compare previous results by Hegarty and colleagues (2009), who have found higher preferences for 3D maps among “naïve cartographers”. Finally, we also encourage like minded researchers in GIScience and cartography to more often try to analyze response accuracy with the signal detection approach and to explore in which context misses or false alarms are the dominant types of errors, and how individual and group differences might influence hit and false alarm rates. For example, we found a higher number of misses compared to the number of false
How Do Decision Time and Realism Affect Map-Based Decision Making?
17
alarms in our experiment. One explanation for this play-safe strategy in this safetycritical task context could be that our participants, not trained in helicopter landing, might have rather preferred to miss a suitable landing spot, than landing on unsuitable terrain, with potentially life-threatening consequences (e.g., see the work of Hofer and Schwaninger (2005) relating to baggage screening tasks). Future empirical map design and map use studies could thus focus more on the question of what kinds of errors might result in low accuracy rates, and this might in turn lead to more focused map design guidelines. Acknowledgements. We would especially like to thank all our participants who were willing to participate in this study. We are also indebted to Christian Häberling from the Institute of Cartography at the Swiss Federal Institute of Technology Zurich, who gave us the opportunity to conduct our experiments in his cartography classes. Finally, we are grateful to our interviewees at Protection & Rescue (Schutz & Rettung) and Swiss Air Rescue (Rega) in Zurich, and at the Institute for Snow and Avalanche Research (SLF) in Davos, Switzerland, for sharing their expert insights on map-based decision making under time pressure.
References Ahituv, N., Igbaria, M., Sella, A.: The Effects of Time Pressure and Completeness of Information on Decision Making. Journal of Management Information Systems 15(2), 153–172 (1998) Andrews, F.M., Farris, G.F.: Time Pressure and Performance of Scientists and Engineers: A Five-Year Panel Study. Organizational Behavior and Human Performance 8(2), 185–200 (1972) Baus, J., Krüger, A., Wahlster, W.: A resource-adaptive mobile navigation system. In: Proceedings of the 7th International Conference on Intelligent User Interfaces, pp. 15–22. ACM, New York (2002) Bertin, J.: Semiologie graphique, Mouton, Paris (1967) Bloom, G.S.: Helicopters: How They Work (2007), http://www.helicopterpage.com/html/forces.html (last accessed June 16, 2011) Canham, M., Smallman, H., Hegarty, M.: Using Complex Visual Displays: When Users Want More than is Good for Them. In: Mosier, K., Fischer, U. (eds.) Proceedings of the Eighth International NDM Conference, Pacific Grove, CA (2007) Coors, V., Elting, C., Kray, C., Laakso, K.: Presenting Route Instructions on Mobile Devices: From Textual Directions to 3D Visualization. In: Dykes, J., Kraak, M.J., MacEachren, A.M. (eds.) Exploring Visualization, pp. 529–550. Elsevier, Oxford (2005) Dillemuth, J.: Navigation Tasks with Small-Display Maps: The Sum of the Parts Does Not Equal the Whole. Cartographica 44(3), 187–200 (2009) Fabrikant, S.I., Boughman, T.: Communicating Data Quality through Realism. In: Proceedings of GIScience 2006, pp. 59–60. Münster, Germany (2006) Fabrikant, S.I., Lobben, A.: Introduction: Cognitive Issues in Geographic Information Visualization. Cartographica 44(3), 139–143 (2009) Fabrikant, S.I., Rebich-Hespanha, H., Hegarty, M.: Cognitively Inspired and Perceptually Salient Graphic Displays for Efficient Spatial Inference Making. Annals of the Association of American Geographers 100(1), 13–29 (2010)
18
J. Wilkening and S.I. Fabrikant
Fabrikant, S.I., Rebich-Hespanha, H., Andrienko, N., Andrienko, G., Montello, D.R.: Novel Method to Measure Inference Affordance in Static Small-Multiple Map Displays Representing Dynamic Processes. The Cartographic Journal 45(3), 201–215 (2008) Förster, J., Higgins, E.T., Taylor Bianco, A.: Speed/accuracy decisions in task performance: Built-in trade-off or separate strategic concerns? Organizational Behaviour and Human Decision Processes 90, 148–164 (2003) Garlandini, S., Fabrikant, S.I.: Evaluating the Effectiveness and Efficiency of Visual Variables for Geographic Information Visualization. In: Hornsby, K.S., Claramunt, C., Denis, M., Ligozat, G. (eds.) COSIT 2009. LNCS, vol. 5756, pp. 195–211. Springer, Heidelberg (2009) Gigerenzer, G.: The Adaptive Toolbox. In: Gigerenzer, G., Selten, R. (eds.) Bounded Rationality: The Adaptive Toolbox, Dahlem Workshop Reports, pp. 37–50 (2002) Hegarty, M., Smallman, H.S., Stull, A.T.: Decoupling of Intuitions and Performance in the Use of Complex Visual Displays. In: Love, B., McRae, K., Sloutsky, V. (eds.) Proceedings of the 30th Annual Conference of the Cognitive Science Society, Washington, DC, pp. 881–886 (2008) Hegarty, M., Smallman, H.S., Stull, A.T., Canham, M.: Naive Geography: How Intuitions about Display Configuration Can Hurt Performance. Cartographica 44(3), 171–186 (2009) Hofer, F., Schwaninger, A.: Using threat image projection data for assessing individual screener performance. In: Brebbia, C.A., Bucciarelli, T., Garzia, F., Guarascio, M. (eds.) WIT Transactions on the Built Environment (82), Safety and Security Engineering, vol. 82, pp. 417–426. WIT Press, Wessex (2005) Hwang, M.I.: Decision making under time pressure: a model for information systems research. Information and Management 27, 197–203 (1994) Itti, L., Koch, C.: Computational Modelling of Visual Attention. Nature Reviews Neuroscience 2(3), 194–203 (2001) Jarvis, A., Reuter, H.I., Nelson, A., Guevara, E: Hole-filled seamless SRMT data V4: International Centre for Tropical Agriculture, CIAT (2008) Johnson, E.J., Payne, J.W., Bettman, J.R.: Adapting to Time Constraints. In: Svenson, O., Maule, J. (eds.) Time Pressure and Stress in Human Judgment and Devision Making, pp. 103–1116. Plenum Press, New York (1993) Lloyd, R.E., Bunch, R.L.: Technology and Map-Learning: Users, Methods and Symbols. Annals of the Association of American Geographers 93(4), 828–850 (2003) Payne, J.: Contingent decision behavior. Psychological Bulletin 93, 382–402 (1982) Peters, L.H., O’Connor, E.J., Pooyon, A., Quick, J.C.: The Relationship between Time Pressure and Performance: A Field Test of Parkinson’s Law. Journal of Occupational Behaviour 5, 293–999 (1984) Pew, R.W.: The speed-accuracy operating characteristics. In: Koster, W.G. (ed.) Acta Psychologica 30: Attention and Performance, vol. II, pp. 16–26. North-Holland Publishing Company, Amsterdam (1969) Rosenholtz, R., Li, Y., Nakano, L.: Measuring Visual Clutter. Journal of Vision 7(2), 1–22 (2007) Simon, H.: Theories of decision making in economics and behavioural science. American Economic Review 49(3), 253–283 (1959) Simon, H.A., Larkin, J.H.: Why a diagram is (sometimes) worth then thousand words. Cognitive Science 11, 65–100 (1987) Smallman, H.S., St. John, M.: Naive Realism: Misplaced Faith in Realistic Displays. Ergonomics in Design 13(3), 6–13 (2005) Smallman, H.S., St. John, M., Oonk, H.M., Cowen, M.B.: Information Availabity in 2D and 3D Displays. Applied Perception 21(5), 51–57 (2001)
How Do Decision Time and Realism Affect Map-Based Decision Making?
19
Smith, J.F., Mitchell, T.R., Beach, L.R.: A cost-benefit mechanism for selecting problemsolving strategies: Some extensions and empirical tests. Organizational Behaviour and Human Performance 29(3), 370–396 (1982) Srinivas, S., Hirtle, S.C.: The Role of Motivation and Complexity on Wayfinding Performance. In: Purves, R., Weibel, R. (eds.) GIScience 2010 Extended Abstracts Volume, Zurich, Switzerland (2010) Suter, C.: Lawinenausbildung mit mobilen Systemen. In: Unpublished Diploma Thesis at the Department of Geography, University of Zurich, Switzerland (2007) Svenson, O., Edland, A., Slovic, P.: Choices and judgments of incompletely described decision alternatives under time pressure. Acta Psychologica 75, 153–169 (1990) Swienty, O., Reichenbacher, T., Reppermund, S., Zihl, J.: The Role Of Relevance and Cognition in Attention-guiding Geovisualization. The Cartographic Journal 45(3), 227–238 (2008) Tanner, W.P., Swets, J.A.: A Decision-Making Theory of Visual Detections. Psychological Review 61, 401–409 (1954) Thomas, L.C., Wickens, C.D.: Display Dimensionality, Conflict Geometry, and Time Pressure Effects on Conflict Detection and Resolution Performance Using Cockpit Displays of Traffic Information. The International Journal of Aviation Psychology 16(3), 321–342 (2006) Tufte, E.R.: The Visual Display of Quantitative Information. Graphics Press, Cheshire (1983) Wickelgren, W.A.: Speed-accuracy tradeoff and information processing dynamics. Acta Psychologica 41(1), 67–85 (1977) Wilkening, J.: User Preferences for Map-Based Decision Making Under Time Pressure. In: COSIT 2009 Doctoral Colloquium Proceedings, Aber Wrac’h, France, pp. 91–98 (2009) Wilkening, J.: Map Users’ Preferences and Performance under Time Pressure. In: Purves, R., Weibel, R. (eds.) GIScience 2010 Extended Abstracts Volume, Zurich, Switzerland (2010) Zanola, S., Fabrikant, S.I., Çöltekin, A.: The Effect of Realism on the Confidence in Spatial Data Quality in Stereoscopic 3D Displays. In: Proceedings of the 24th International Cartography Conference (ICC 2009), Santiago, Chile, November 15-21 (2009) (on CD-ROM)
Towards Cognitively Plausible Spatial Representations for Sketch Map Alignment Malumbo Chipofya, Jia Wang, and Angela Schwering Institute for Geoinformatics, University of Muenster, Germany {mchipofya,jia.wang,schwering}@uni-muenster.de
Abstract. Over the past years user-generated content has gained increasing importance in the area of geographic information science. Private citizens collect environmental data of their neighborhoods and publish it on the web. The wide success of volunteered geographic information relies on the simplicity of such systems. We propose to use sketch maps as a visual user interface, because sketch maps are intuitive, easy to produce for humans and commonly used in human-to-human communication. Sketch maps reflect users’ spatial knowledge that is based on observations rather than on measurements. However, sketch maps, often considered as externalizations of cognitive maps, are distorted, schematized, incomplete, and generalized. Processing spatial information from sketch maps must therefore account for these cognitive aspects. In this paper, we suggest a set of qualitative spatial aspects that should be captured in representations of sketch maps and give empirical evidence that these spatial aspects are robust against typical schematizations and distortions in human spatial knowledge. We propose several existing qualitative spatial calculi to formally represent the spatial aspects, suggest appropriate methods for applying them, and evaluate the proposed representations for alignment of sketch maps and metric maps. Keywords: cognitive qualitative representation, sketch map, qualitative spatial reasoning, sketch alignment.
1 Introduction Sketch maps are an intuitive way to express human spatial knowledge about the environment. They contain objects which represent real world geographic features, relations between these objects, and oftentimes symbolic and textual annotations [4]. These elements enable us to use sketch maps to communicate about our environments and to reason about our actions in those environments. In this way, sketch maps provide an intuitive user interaction modality for some geospatial computer applications [9]. Especially with the advent of Volunteered Geographic Information (VGI) [13], sketch maps may be the key to removing some of the barriers imposed by the technical requirements of traditional Geographic Information Systems (GIS) as noted by [27]. Sketch maps, however, do not have a georeferenced coordinate system. Therefore, in order to allow users to contribute and query geographic information using sketch maps, an automated system must be able to analyze them and establish correct M. Egenhofer et al. (Eds.): COSIT 2011, LNCS 6899, pp. 20–39, 2011. © Springer-Verlag Berlin Heidelberg 2011
Towards Cognitively Plausible Spatial Representations for Sketch Map Alignment
21
correspondences between elements of a sketch map and elements of other spatial data sources [35], be they sketch maps or metric maps. The analysis involves extracting and characterizing useful information, such as depicted objects, from a sketch map and establishing correspondences involves describing the relationship between elements of the sketch map and elements of the other data source. This is also known as alignment if the spatial relations among the elements are of primary interest. For a system to perform the tasks described above it must have models that support cognitively plausible sketch map representations. Because human spatial thinking is inherently qualitative [12], such representations may also be expected to be qualitative in nature. Indeed many approaches to sketch map representation [9, 11, 16, 28] attempt to capture some qualitative aspects of the sketch maps by abstracting away from the geometric information. Qualitative representation of spatial knowledge involves representing only the relevant distinctions in a spatial configuration. For example, orientations with a predominantly northerly heading can all be regarded as belonging to the qualitative orientation “North”. Qualitative representations together with logical and algebraic mechanisms for performing some useful computations on them form what are known as qualitative calculi [8] and their study as Qualitative Spatial Reasoning (QSR). It has been noted that the most useful aspects of space from a QSR perspective are topology, orientation, and distance [25]. However the cognitive reality of sketch maps requires consideration of the reliability of every aspect of space used. For instance, it is known that sketch maps have inconsistent scale and perspective [4]. This is in part due to omissions, simplifications, exaggerations and other types of distortions introduced at the different stages of observation, perception and memorization of spatial information [33, 34]. These factors must therefore be taken into account. This paper proposes a set of formal qualitative spatial representations for sketch maps that minimizes the effects of cognitive distortions during alignment. Each representation captures an aspect of sketch maps that is likely to be represented correctly with respect to a metric city map. Only sketch maps of urban areas were considered in the studies reported in this paper. The next section briefly reviews sketch map representation and alignment methods. In section 3 results of an empirical study into criteria for obtaining a cognitively plausible sketch map alignment are presented. Based on the identified criteria five qualitative calculi have been used to formalize the spatial configuration information of objects in sketch maps. The resulting representations are discussed in section 4 and an evaluation of their application on three sample sketch maps is discussed in section 5. Section 6 concludes the paper with a summary and outlook on future work.
2 Background 2.1 Alignment of Spatial Information from Sketch Maps Alignment of spatial information requires identifying two spatial configurations or so called scenes [23] that are similar. The central question in spatial scene similarity is how to establish the associations between the elements of one scene and those of another scene. Here, we describe two approaches developed recently. Both were proposed for alignment of spatial sketches or sketch maps with metric maps.
22
M. Chipofya, J. Wang, and A. Schwering
Spatial scene similarity [22, 23] applies spatial alignment as part of a query procedure. They seek to align the structure of a query scene with that of another scene. A spatial scene query comprises a set of spatial objects and relations between the objects. A query is formulated as a spatial constraint satisfaction problem (CSP). The evaluation of the query then involves finding configurations in the database that satisfy all the constraints of the query. This is achieved by constructing an association graph which consists of a set of pairs of variables (objects in the query and database). The set of pairs are the nodes of the association graph, while the set of combined constraints become the edges of the graph. The final solutions to the query comprise all maximal complete subgraphs (maximal cliques) of the association graphs. Qualitative Matching is a similar approach suggested in Wallgrün et al. [35]. It represents a sketch map as a set of qualitative constraint networks (QCN) aspect by aspect. Each QCN is based on a specific qualitative spatial calculus. A matching problem is then defined as follows: for each possible pairing of nodes from one QCN with those from the other, find all consistent combined QCNs that satisfy the constraints from both original QCNs. 2.2 Formal Representation of Sketch Maps Both of the above methods can be used to align sketch maps over several aspects of space and suitable representations of the sketches are required for the alignments to be performed. In [9] Egenhofer used topological and directional relations in sketches to formulate geospatial queries for real spatial databases. Additional semantics of the spatial relations in the sketch can be obtained by a quantification of the extents to which pairs of objects interact with respect to each given relation [10]. Forbus et al. [11] consider a sketch as being composed of logical units called glyphs. A glyph has two components, the geometry, which is what the user draws, and a conceptual entity which refers to the concept implied by the geometry. The model considers three main types of spatial relations: positional relations given by cardinal directions (South, East, North, and West), adjacency relations captured by the Voronoi diagram of the outer contours of the glyphs, and topological relations computed between bounding boxes of the glyphs. This information can then be used, for a specific domain, to infer other information such as visibility (camouflaged or contrasted from background). In Kopczynski and Sester [16] concepts such as “street” or “park” represent objects in the sketch map. Objects and spatial relations are embedded in a conceptual graph structure and used to generate spatial queries. 2.3 Cognitive Aspects of Spatial Knowledge All the above cited methods attempt to capture some abstract, qualitative aspects of the sketch maps by abstracting away from the geometric information. However, they ignore the influences from human spatial cognition on sketch maps, and as a result fail to explicitly account for schematizations and distortions from cognitive errors [33, 34]. In general, sketch maps are characterized by inconsistent spatial scale and perspective and contain schematizations and distortions from human spatial cognition. The following gives an overview of important findings about how humans observe and perceive their environments: people make systematic errors in judging orientation of spatial objects that are located in different geographical or political units [29];
Towards Cognitively Plausible Spatial Representations for Sketch Map Alignment
23
distortions due to perspective and due to landmarks are common in spatial judgments, e.g., distances between near spatial objects are considered relatively longer that distances between far away objects [14]; ordinary buildings are judged closer to landmarks than the other way around [18, 26]; routes are judged longer with more turns, more landmarks [31] or more intersections; spatial information is simplified in the cognition process: angles tend to be perceived more rectangular [15] and curved features are perceived straighter [6, 19]. While sketch maps are used for representing spatial information from human memories, such cognitive errors appear very often and have negative influences on sketch map accuracy [36] making direct sketch map alignment unreliable. In addition, omission of information and inclusion of extra information in the form of symbols and annotations occurs quite often [32] and contributes to the difficulty of automating sketch map alignment. Thus, a cognitively plausible representation for sketch maps is necessary. The abovementioned representations of sketch maps do not provide empirical evidence for the qualitative or quantitative aspects reflected in the representations and also do not evaluate the cognitive adequacy of the chosen representational formalisms. In contrast, the representation proposed in this paper is motivated by cognitive insights into human spatial cognition and thinking obtained in the empirical study described below.
3 Empirical Study: Criteria for Sketch Map Alignment To succeed in aligning a sketch map and its corresponding metric map, relevant sketch aspects for alignment are required. A list of such sketch aspects might constitute sufficient criteria for performing sketch map alignment with some success. To this end, an empirical study 1 was conducted to investigate relevant aspects of sketch maps. The study was divided into two phases: first, during the experiment, participants were asked to draw three locations from their memory on the paper; second, sketch maps were compared with metric maps while six sketch aspects were analyzed. In the end, a list of sketch aspects was concluded as the criteria for sketch map alignment and used to develop suitable formal representations for the task. 3.1 Experiment Participants. There were in total 25 university students joined the experiment with the age range between 19 and 29 (average age of 23 years with a standard deviation of 2.4 years). Among these 25 participants, 14 are male and 11 are female. All the participants joined the experiment gratuitously and assured to have no specific knowledge in cartography and geography and also no particular advanced skills in art. Though none of the participants are residents of the locations, all of them are familiar with the areas sketched by frequent visit by foot or vehicle. During the experiment, participants were asked to produce sketch maps with as much detail as possible but only from memory. There was no time limit during the sketching task, since this might pressure the participants and could influence the final sketch map quality. 1
This experiment was conducted in the Spatial Intelligence Lab at the Institute for Geoinformatics, University of Muenster. For a detailed description of the experiment we refer the reader to [5].
24
M. Chipofya, J. Wang, and A. Schwering
Materials. Each participant was given a piece of DIN-A4 sized sheet of paper and a black pen. Rules and other assisting drawing and measuring tools were not allowed. Before participants producing sketch maps, a sample sketch map was shown to give an example of how a sketch map could look like. Locations. There were three locations that participants were asked to sketch. All locations were urban areas with paved and built up regions. Besides straight and curved main streets, side streets and various types of buildings as shops and restaurants, the locations also contain natural areas as lakes or grasslands. The area of location I is a part of the inner city of Brueggen with landmarks such as lakes like “Laarer See” and “steep hill” as the sketching boundary; the area of location II is along the route which is across the pedestrian zone of Brueggen from the south to the north; the area of location III is in the city of Muenster which has the “LudgeriKreisel” as its center and with a radius of approximately 1km. Location I and III are with the similar size of 1.5km2 and they were sketched as survey maps. Location II has a route with an overall length of 700m and was sketched as a route map. The time that participants spent and the sketch maps that we received are shown in Table 1. Table 1. Time that participants spent and the sketch maps received in the experiment Location I Time Ave (StdDev) 21.7min (11.4) Total sketch maps analysed 12
Location II 16.3min (9.9) 12
Location III 14.8min (4.6) 5
3.2 Methodology of Sketch Map Comparison Sketch maps of each location were analyzed and compared with the corresponding metric map 2 . Six sketch aspects were analyzed during the comparison procedure. These sketch aspects were derived from the former studies of sketch map analysis and comparison [36], and they are related to sketched objects such as landmarks and street segments as well as binary relations sketched such as the topological, directional and order relations of sketched objects. In the context of sketch maps, sketched objects and sketched relations refer to: Objects Sketched. Landmarks are defined as subjective points of interests, which are the most memorable spatial elements to the participants [5]. So, landmarks could be any spatial objects people draw except for streets. Street network refers to a collection of street segments that connect pairs of junctions. A street segment is a piece of a street which is a linear feature for the means of travelling by foot, bike or vehicle whereas a junction is a specific location with which one or more street segments connect. Furthermore, the city block is defined separately out of the street network. A city block is a part of a street network and it provides more possibilities during sketch map alignment. It can be defined as either an open or a closed area that are surrounded by connected street segments. Relations Sketched. During sketch map comparison, topological relations were calculated between a landmark and a city block. The street network orientation refers 2
The Deutsch Grundkarte 1:5000 (DGK 5) was used as the metric map source.
Towards Cognitively Plausible Spatial Representations for Sketch Map Alignment
25
to directional relations of pairs of adjacent street segments. Order relations refer to two kinds of relations: one is the order of landmarks along a linear reference frame, which can be a street or a path-extent like water body; the other is the cyclic order of the adjacent landmarks around a junction. In detail, the six sketch aspects are: topology of street network, street network orientation, order relations of landmarks along a street, order relations of landmarks around a junction, topology of city blocks and containment of landmarks in a city block. 3.3 Resulting Alignment Criteria The valid sketch maps of three locations were analyzed manually. All the calculations were conducted between adjacent spatial objects. We got a larger set of sketch aspects, which might be the criteria for alignment. Among them, the six sketch aspects that we defined are with the highest accuracy rate (see Table 2). Topology of street network represents the pattern of interconnection of street segments and junctions of a street network. The street network sketched is usually simplified and incomplete while it is much more complicated in the reality. This sketch aspect was calculated in the extracted street network graph with nodes representing junctions and edges representing street segments. Despite the missing and extra junctions and street segments, the connectivity of street segment and junctions sketched was with 100% accuracy for all three locations. Street network orientation was calculated between a reference street segment and its adjacent street segments, i.e., the adjacent street segments and the reference street segment share the same junctions. A qualitative orientation model that divides the space into two regions, which are right and left, was applied in the calculation. This directional model is built in a way that it has its reference orientation line formed by a pair of two points, which are the start point3 and the end point4 derived from of the pair of two junctions of the reference street segment. The oriented reference line is always pointing from the start point to the end point. In our case, accuracy rate of direction relations was calculated separately of participants depending on what street segments they drew. Table 2. Results of sketch map comparison Accuracy rate Location I Location II Location III Street network topology 100% 100% 100% Street network orientation 100% 100% 100% Order along a route 100% 94% 100% Order around a junction 100% City block topology 100% 100% 100% City block containment 100% 99% 100% To calculate order of landmarks around a junction, at least two adjacent landmarks being around a junction is required. Location II and III do not fit this basic requirement.
3
The definition of the start and end points is not arbitrary. In route map, for each street segment, the start point is close to the origin while the end point is close to the destination. In survey map, the definition is varied depending on the calculation.
26
M. Chipofya, J. Wang, and A. Schwering
The order of landmarks along a street shows high similarity with the metric maps. For both location I and III, 100% of all the landmarks sketched along the selected streets were placed in a correct order. For location II, along the route sketched, 94% of all the landmarks were correctly placed. In our case, missing landmarks were exclusive in the calculation of order relations. During the experiment, we found that most of the landmarks were sketched either along the main streets or around junctions. Order relations of landmarks around junctions could also provide possibility for sketch map alignment. Location I was analyzed for this order relation and showed 100% match with its corresponding metric map. The topology of city blocks is also represented in a high accuracy for all three locations. City blocks appear quite often while sketching. Although no participant sketched the complete street network, for the sketched street network, nearly 100% of the city blocks were represented by correctly connected junctions and street segments. In the end, the containment of landmarks in city blocks also shows its reliability for sketch map alignment. For containment analysis, the experiment locations were split up into city blocks that have their scales varied among participants. Though smallscale city blocks formed by side streets were not sketched by all the participants, landmarks were still correctly placed in the relatively large-scale city blocks formed by aggregated street segments. For location I and III, 100% of the landmarks were placed correctly in the city blocks, and for location II, this accuracy rate is 99%.The results show that all the above six sketch aspects always show high similarity (>90%) with the corresponding aspects in metric maps. Also they appear quite often in sketch maps. The six sketch aspects were proofed in this empirical study that participants seldom made mistakes while sketching these aspects and they can be reliable criteria for sketch map alignment.
4 Formal Representations of Sketch Maps for Alignment In order to reason about sketch maps, spatial information corresponding to the six criteria described above is represented using formal qualitative spatial calculi developed by the QSR community. A quick look at the six criteria indicates that the street network is of primary importance because all the other criteria depend on it. So the first step is to characterize the street network topology and relative orientations of street segments. Formal representations for the remaining four criteria are based on this characterization of the street network as a collection of street segments with some of their end-points coinciding at junctions to form a network topology. Wherever necessary, the end-points of a street segment will be distinguished as the start-point and end-point with regard to one of its two orientations. 4.1 Street Network Topology The topology of street network can be captured using the connectivity information of the corresponding graph as is usually done in GIS [17]. However, a more explicit structure, DRA7 which is a coarsened version of the dipole relation algebra (DRA) of Moratz et al. [20], was introduced in Wallgrün et al. [35] and captures the topology of sets of oriented line segments. The oriented line segments are also known as dipoles
Towards Cognitively Plausible Spatial Representations for Sketch Map Alignment
27
[20]. A dipole is an ordered pair of points in ℝ2 which can be written as a = (as, ae), where as and ae are the start- and end-point of a respectively. A basic DRA relation between two dipoles A and B is represented by a 4-tuple of facts sBeBsAeA where sB is the position of the start-point of dipole B with respect to dipole A. The other three elements of the relation eB, sA, and eA are defined analogously. For DRA7 the possible positions of the start-/end-point of one dipole with respect to another dipole are s (coincides with the start-point), e (coincides with the end-point), and x (coincides with neither start-point nor end-point). In the proposed representations, the start- and end-points of street segments are used to define the dipoles. For example in Figure 1 the junctions B, C, D, E, and G define the dipoles BC, CB, GC, CG, DC, CD, DE, and ED. The relations for (BC, CG), (CG, BC), (CB, CG), and (BC, DE) are exxs, xsex, sxsx, and xxxx respectively. Note that in this example the dipole relations can be derived directly from the labeling of junctions. The seven basic relations of DRA7 include the four listed above, sese, eses, and xexe. Together the DRA7 basic relations capture the connectivity information of street segments and therefore the topology of the street network in sketch maps.
Fig. 1. Dipole representation of the street network: (a) identified junctions in the sketch map are connected with straight lines, and (b) the result is a graph that partitions the space into city blocks – see Section 4.5
4.2 Street Network Orientation (Relative Orientation of Street Segments) The relative orientations of street segments with respect to each other are locally more accurate between adjacent street segments. For a formal representation of this information the Oriented Point Relation Algebra (OPRAm) introduced in Moratz et al. [21] is used. OPRAm is an orientation calculus over which information can be represented at variable granularities determined by the parameter m; there are 4m possible distinctions between any two orientations. The primitive entities of OPRA are oriented points (o-points) in the plane defined as a pair (P, φ) where P is a point given by its Cartesian coordinates (x, y) and φ is an orientation in ℝ2. For two o-points A and B, an OPRAm relation is distinguished by the granularity of representation m,
28
M. Chipofya, J. Wang, and A. Schwering
the position j of A with respect to B, and the position i of B with respect to A written as A m<ji B. The points A and B have orientations given by φ (A) and φ (B) resp. such that the values of j and i encode both the relative positions and the point orientations of A and B with respect each other. Like other formal representations of relative point orientations, OPRAm is based on a partition of the full circular rotation in the ℝ2. The plane is partitioned into 2m planar sectors and 2m linear sectors. The main advantages of the OPRA calculi are that they take into account the orientations of the concerned points, they allow the distinction of relative orientations of collocated points, and they exist at different granularities. With the coarsest level, OPRA1, the relative positions of junctions and end-points of streets are encoded for each orientation along the street segments. That is, for every street segment end-point the orientation towards the opposite end-point of the street segment defines an o-point. At junctions, o-points corresponding to street segments incident on it are collocated o-points. OPRA1 has 20 basic relations and four possible relative positions front (0), left (1), back (2), and right (3) – see Figure 2c. The label of an o-point oriented along a street segment is given a superscript with the label of the street segment. For example, at junction C in Figures 2a, 2b, and 2c, the o-point oriented towards junction D is given the label CCD. A relation between a pair of o-points (e.g. BBC and CCD in Figure 2c), gives their relative locations based on their intrinsic orientation particularly distinguishing whether one is on the left or on the right side of the other. But to capture the relative orientation of an outgoing street segment requires the relative orientations with respect to both the preceding and succeeding segments.
Fig. 2. OPRA1 relations in sketch maps. The three o-points B and C in (a) and (b) have OPRA1 relations given in (c). OPRA1 is used to determine the relative orientations of outgoing street segments at junctions (a), (b), and (d).
Towards Cognitively Plausible Spatial Representations for Sketch Map Alignment
29
Given four junctions A, B, C, and D in general position, three o-points AAB, BBC, and DBD, and i, j, k integers. Let AAB<ji DBD and BBC< k BBD. We restrict the values of i to {0, 1, 3}. Then any assignment of values to the variables i, k describes the configuration of a junction with three incident street segments AB, BC, BD. To determine whether BD is oriented towards the left or right of ABC the four possible relations between AAB and BBC are considered separately. If AAB<00 BBC then it is impossible to decide whether BBD is located to right or left of ABC. For the other three relations, the orientation o of BD is given by: AAB <10 BBC then o = left if i = k = 1 and o = right otherwise A
AB
2
<0B
AB 3
A < 0B
BC
BC
then o = left if i = k = 1 and o = right if i = k = 3
then o = right if i = k = 3 and o = left otherwise
(1) (2) (3)
This information corresponds to how correctly people place junctions along a street. The devised representation is consistent with the results in section 3 which showed that for a given heading, people place out-going street segments at junctions along a street on the correct side of the street. 4.3 Order of Landmarks Along Streets Landmarks in the sketch map are vectorized and approximated by polygons. The Interval Algebra (IA) of Allen [1] is used to represent ordering information between landmarks along a specific path in the street network. The term path is used here analogously to the term simple path in graph theory, i.e. a sequence of junctions such that from each of junction in the sequence there is a street segment to it and the next junction in the sequence.
Fig. 3. Landmarks adjacent to street segments can be determined using the voronoi diagram of the street segments. Here dashed lines represent some edges of the voronoi diagram of some of the street segments in Figure 1.
Only landmarks adjacent to the path are considered. For this, it is only required that for a given path, landmarks proximal to the path include landmarks closer (or equally
30
M. Chipofya, J. Wang, and A. Schwering
close) to street segments of the path than to segments that are not part of that path. In particular, suppose S is the sketch map, N(S) a representation of the street network in sketch map S, and GV(N(S)) the Generalized Voronoi Diagram [2] generated by the street segments of N(S) and the border of S. Then, if a landmark is adjacent to a path P, some of the landmark’s points must lie in the Voronoi region r(t) ⊆ GV(N(S)) of some street segment t of P (Figure 3). As such, only landmarks that have some part of them close enough to the path are taken into account. There is a function l(x) which returns the distance of a point x on a path P from the path’s start point sP. So l(sP) = 0 and l(eP) = LP where eP and LP are the end-point and length of P respectively. For each point x of P (0 < l(x) < LP), if the perpendicular at x intersects a point belonging to the geometry of an adjacent landmark, say A, for the first time (no point of A was encountered by perpendiculars of P’s points lying before x), then mark l(x) as the start of the interval IA along P corresponding to A (l(x) = sA). If y is the last point on P whose perpendicular encountered a point of A, mark l(y) as the end point eA of IA. A simplifying condition employed for now is that whenever a start-point of a landmark is encountered, the most recent point of that landmark previously encountered, if any, must have been encountered in the immediately preceding street segment. In that case the previous interval corresponding to the landmark is extended to continue from the recently encountered point. The relations between the intervals corresponding to landmarks together with the path become the ordering information as shown in Figure 4.
Fig. 4. Landmarks are ordered as intervals defined by their perpendicular projection onto street segments. Disjoint intervals corresponding to a landmark at a junction are combined into a single interval.
Towards Cognitively Plausible Spatial Representations for Sketch Map Alignment
31
When traversing a path, the order of landmarks is established by observing the intersections between the line perpendicular to each point of the path and adjacent landmarks so that the ordering information is defined by the projection of adjacent landmarks onto the path (Figure 4). At the beginning of the path there are two choices. Either the perpendicular at the start-point intersects a landmark or it does not. If it does, then it has to be checked whether the landmark starts before or at the start of the path. The path end-point is handled analogously. 4.4 Order of Landmarks around Junctions Three possibilities were investigated for representing the order of landmarks around junctions. The first based on point ordering information was rejected because it does not account for the spatial extension of sketched objects. The second, based on representing the portion of an object lying in a certain orientation from an observation point takes into account more aspects than required. The representation selected explicitly accounts for the spatial and angular extensions of landmarks. It is based on the algebra of cyclic intervals [24]. The Cyclic Interval Algebra (CIA) expresses relations of intervals (called c-intervals) on a circle based on Allen’s IA relations. In addition to 12 of the 13 basic IA relations (before and after are merged into a single relation that is analogous to DC in RCC), CIA includes four more relations accounting for the cyclic nature of the embedding space. We use CIA to formally represent the order of landmarks around junctions.
Fig. 5. Cyclic intervals of two landmarks around a junction give the order in which one would see them standing at the junction and turning anti-clockwise around 360° (objects from the sketch map in Figure 1).
The approach taken is similar to the one given in the last section. The reference point is a junction j. For a landmark adjacent to a street segment incident to j, the cinterval of the landmark is its projection onto a (unit) circle centered at j. The projection is given by sweeping the 360° view at j in the counter-clockwise direction and recording the positions of the sweep line on the circle whenever a start- or endpoint of a landmark is encountered. The arc from the mark of the start-point to the
32
M. Chipofya, J. Wang, and A. Schwering
mark of the end-point is the c-interval of the corresponding landmark. The c-intervals are defined as closed intervals on a real circle. Figure 5 shows the c-intervals corresponding to two landmarks around a junction. 4.5 Topology of City Blocks Like landmarks, city blocks in the sketch map are stored as polygons and their topological relations are interpreted as relations in RCC-8 [7]. We use the procedure presented in Bennett et al [3] to evaluate the RCC-8 relations of the set of polygons derived from the sketch map. In that approach, polygons are represented as terms in a Closure Algebra 4 (CA). Each term is the intersection of finitely many half-planes formed by the lines passing through adjacent pairs of vertices of the polygon. The corresponding RCC-8 relations are derived from the terms of the CA by testing the emptiness of their intersections. City blocks are delineated by street segments. The outline of a city block is formed by street segments and sections of the border of the drawing surface adjacent to it. The city block is first represented as a polygon whose vertices include end-points of the street segments adjacent to it and any nodes at the border of the drawing surface. Because city blocks are defined based on street segments, and because the street network in a sketch map is generally incomplete, sketch maps do not contain many closed city blocks. In order to maximize the number of city blocks detected, street segments need to be extended to the border of the drawing surface. The procedure to do this extends all street segments with end-points oriented towards the border of the drawing surface and with no other objects in their path at the same rate. This is done until either the border is encountered or another street segment extension is encountered. The end-point of the extension becomes the new end-point for the extended street segment. It is worth noting at this point that while the street network defines the topology of city blocks, these two structures are not dual to each other since some street segments are not part of the city block topology. By their definition, no two city blocks can overlap and a city block is constituted by a connected region. The adjacency relations between city blocks are represented using an adjacency matrix [30]. Each boundary street segment in the sketch map corresponds to a value of 1 in the intersections of the rows and columns of the matrix for the city blocks which it borders. The adjacency matrix is important both for the alignment task and for determining when city blocks can be aggregated. When comparing sketch maps, it is common to encounter aggregated city blocks due to their incompleteness. Intuitively, two externally connected (EC) regions can only be aggregated if their intersection is not a single point (a 0-meet). 4.6 Containment of Landmarks in City Blocks: Topological Relations of Landmarks Landmarks are located in city blocks. The topological constraints on landmarks and city blocks together allow us to partially constrain the possible locations of the landmarks. While city blocks are non-overlapping, a landmark may overlap several 4
A CA is a Boolean Algebra augmented with a closure operator. For details refer to Bennett et al. [3].
Towards Cognitively Plausible Spatial Representations for Sketch Map Alignment
33
city blocks. The RCC-8 relations between landmarks are derived the same way as those for city blocks. The RCC-8 constraints between landmarks and city block form the QCN for topological information of a sketch map. A landmark can be part of a city block but not the other way around. Again this constraint is difficult to represent formally in a general theory like RCC.
5 Evaluation of the Formalization The evaluation of the proposed representational models was performed using a set of three test sketch maps (we will call them S1, S2, and S3 – Figures 7-9 at the end of this paper). All three sketch maps depict the same area. The qualitative representations derived from the sketch maps were compared with the same information derived from a metric map (RM) of the sketched area (Figure 10). For each sketch map, a hypothesis of the matching elements between the sketch map and RM was initially generated based on a visual analysis. A match hypothesis is an a priori mapping of objects in the sketch map to those in the metric map. The hypothesis was then used to compare the constraints in the sketch map representations to those in RM representations. The orientation of the street network (Section 4.2) was not evaluated because a visual analysis confirmed that the choices left or right were always correct. 5.1 Street Network Topology As expected, the sketch maps contained less information than RM. A total of 34 street segments and 17 junctions were identified in RM as compared to 11, 13, and 21 street segments and 5, 5, and 9 junctions for S1, S2, and S3 respectively. Table 3 shows a summary of the evaluation. In all but two cases the corresponding junctions were not present in the sketch maps because one or more street segments forming the junction were omitted. For the other two cases the junctions were omitted because the street segments forming the junction were not completed and therefore did not have a common end-point. For this same reason some street end points in the sketch maps could not be matched with street end points in RM. These corresponded to intermediate points of the matching street segments in the RM. A possible solution to representing the just stated fact is to include the DRA position i in the set of acceptable position labels of DRA7 during alignment. The label i says that the start/end point of a dipole lies inside another dipole (which point is being referred to depends on which of sB, eB, sA, or eA gets the label i). Table 3. Summary of alignment of dipoles generated from S1, S2, and S3 with dipoles from RM
No. of matched dipoles
S1 11
S2 10
S3 21
No. of conflicting dipole constraints No. of dipoles corresponding to aggregated street segments in RM Ave. No. of street segments per aggregated segment
0 1 3
0 2 2.5
2 3 2
34
M. Chipofya, J. Wang, and A. Schwering
Some street segments in the sketch maps matched an aggregated group of street segments in RM under the given match hypothesis. Aggregation of street segments was done by visual inspection. This cannot immediately be inferred in DRA7. Overall evaluation shows that there are very few conflicts between relations from the sketch maps and those from RM (see Table 3). The representations of the sketch maps were significantly accurate and suggest that the street network was an important part of the frame of reference used during sketching. 5.2 Order of Landmarks Along Streets Interval relations for landmarks along a path on a single street matched exactly for two of the three tested straight streets. On the other hand, for one path composed of segments from three different streets (with a sharp angle at the two junctions), the interval relations for landmarks were not entirely consistent with RM (Figure 6). But relations between non-adjacent landmarks were always consistent (intervals 1 and 3 in Figure 6). The inconsistent relations were always within a conceptual neighborhood distance of at most three relations with the largest distances occurring around the junction. The general the order of landmarks from one city block to another was always correct.
Fig. 6. Schematic of inteval relations of four landmarks (shown in Figure 4 for S1). The original intervals from Figure 4 correspond to intervals labeled 1 and 2 respectively.
5.3 Order of Landmarks around Junctions Interval relations for landmarks around a junction were tested for one junction (Figure 5) in RM, S1, and S2. S3 had no landmarks around the selected junction. Table 4 summarizes the results. For the tested junction there was only one conflict. It is likely that the distinguishable categories for this case are coarser than those of CIA because the positioning of landmarks around a junction depends on other factors as well. Table 4. Summary of alignment of order relations at a junction generated from S1, S2 with corresponding relations from RM No. of laandmarks arounnd junction No. of laandmarks match hed with RM No. of conflicting relatiions
RM 5 5 0
S1 4 3 0
S2 4 3 1
Towards Cognitively Plausible Spatial Representations for Sketch Map Alignment
35
5.4 Topology of City Blocks As with the street segments, fewer city blocks could be obtained from sketch maps than from the RM. This was the result of incomplete street information. But once the dipole extension strategy described in section 4.4 above was applied, there was a dramatic increase in the number of city blocks obtained from sketch maps (See table 5 below). Nonetheless, the number of city blocks in RM that were aggregated to match a city block in the sketch map was large. The one inconsistency between the adjacency matrices of S3 and RM was a result of street segments not meeting at a junction but both ending at the boundary of the drawing surface. Table 5. Summary of comparison of topological relations for S1, S2, S3, and RM
City blocks from original dipoles City blocks from extended dipoles Aggregated city blocks in RM based on match (Ave. no. of city blocks per aggregate) Conflicting adjacency relations
RM 13 17
S1 2 6
S2 2 5
S3 2 12
0 (0)
4 (3.8)
2 (7)
3 (2.7)
0
0
0
1
Fig. 7. Sketch map S1
5.5 Containment of Landmarks in City Blocks: Topological Relations of Landmarks The RCC-8 relation that could be obtained between landmarks was only DC and between landmarks and city blocks was NTTP. Relations between objects in the
36
M. Chipofya, J. Wang, and A. Schwering
sketch maps matched with the corresponding relations in RM in all cases. It is worth noting here that our definition of city blocks based straight lines connecting pairs of junctions represents an overly simplified view of sketch maps and may not be suitable for more complex sketches with curved street objects. It is in part due to this simplicity that there were no landmarks overlapping more than one city block.
Fig. 8. Sketch map S2
Fig. 9. Sketch map S3
Towards Cognitively Plausible Spatial Representations for Sketch Map Alignment
37
Fig. 10. Image of metric map RM. The original map was an extract from the Deutsch Grundkarte 1:5000 (DGK 5).
6 Conclusions and Future Work This paper presents a set of qualitative spatial representations for sketch maps to be used for aligning them with metric maps and possibly other sketch maps. Six aspects of sketch maps have identified as being robust against typical schematizations and distortions in sketch maps. For each aspect a representation has been proposed and five of these were evaluated. The evaluations show that all the proposed representations can be used reliably for making comparisons in some scenarios but they still lack the flexibility required to deal with sketched data. It was observed for example that sketch map data needs to be represented at a coarse level but at the same time for purposes of aligning them to other data those representations need to be expressive enough to introduce new distinctions when necessary. Matching of street segments is a case in point: incomplete street segments must be compared with complete and aggregated street segments. In the present work the focus was on resolving problems arising from cognitive distortion and schematization. But other problems exist that need to be addressed as well. Spatial aggregation of geographic features represented in sketch maps is particularly common during sketching. Every sketch map contains aggregated objects, perhaps, because as human beings we each tend to carve up the world in our own different ways. As such there is need to develop methods for explicitly expressing aggregation as an operator on primitive entities for the different spatial calculi. This forms part our future work. Then the effects of missing or additional information also need to be addressed. If a sketch omits a street segment, it may lead to the appearance of a new city block corresponding to the aggregate of the city blocks that were separated by the missing street segment. Another consideration for the future is to be
38
M. Chipofya, J. Wang, and A. Schwering
able to represent the curviness of a street and characterize turns at junctions as either straight on or some other turn direction within a formal theory. Currently we find that this is lacking. Finally in this work we considered only urban sketch maps. The last consideration we make looking forward is to investigate suitable representations for sketch maps in different settings such as rural areas.
References 1. Allen, J.F.: Maintaining knowledge about temporal intervals. J. Commun. ACM 26, 832–843 (1983) 2. Aurenhammer, F.: Voronoi diagrams – a survey of a fundamental geometric data structure. ACM Computing Surveys 23, 345–405 (1991) 3. Bennett, B., Isli, A., Cohn, A.: A system handling RCC-8 queries on 2D regions representable in the closure algebra of half-planes. In: Mira, J., del Pobil, A., Ali, M. (eds.) IEA/AIE 1998. LNCS, vol. 1415, pp. 281–290. Springer, Heidelberg (1998) 4. Blaser, A.: Geo-spatial Sketches. University of Maine, Department of Spatial Information Science and Engineering and National Center for Geographic Information and Analysis (1998) 5. Blut, C.: Spatial Analysis of Sketch Maps: The effect of Spatial Cognitive Distortions on Qualitative Mapping of Sketch Maps to Metric Maps. University of Muenster (2010) 6. Chase, W.G., Chi, M.T.H.: Cognitive skill: Implications for spatial skill in large-scale environments. University of Pittsburgh, Learning Research and Development Center (1979) 7. Cohn, A.G., Bennett, B., Gooday, J., Gotts, N.M.: Qualitative Spatial Representation and Reasoning with the Region Connection Calculus. GeoInformatica 1, 275–316 (1997) 8. Cohn, A.G., Hazarika, S.M.: Qualitative Spatial Representation and Reasoning: An Overview. Fundam. Inform. 46, 1–29 (2001) 9. Egenhofer, M.J.: Query processing in spatial-query-by-sketch. Journal of Visual Languages and Computing 8, 403–424 (1997) 10. Egenhofer, M.J., Dube, M.P.: Topological Relations from Metric Refinements (2009) 11. Forbus, K., Usher, J., Chapman, V.: Qualitative Spatial Reasoning About Sketch Maps. In: Proceedings of the Fifteenth Annual Conference on Innovative Applications of Artificial Intelligence (2003) 12. Freksa, C.: Qualitative spatial reasoning. In: Cognitive and Linguistic Aspects of Geographic Space, pp. 361–372. Kluwer, Dordrecht (1991) 13. Goodchild, M.F.: Citizens as sensors: The world of volunteered geography. Geo Journal 69, 211–221 (2007) 14. Holyoak, K.J., Mah, W.A.: Cognitive reference points in judgments of symbolic magnitude. Cognitive Psychology 14, 328–352 (1982) 15. Kahneman, D., Tversky, A.: Intuitive prediction: Biases and corrective procedures. Defense Technical Information Center (1977) 16. Kopczynski, M., Sester, M.: Representation of Sketch Data for Localisation in Large Data Sets. In: XXth Congress of the International Society for Photogrammetry and Remote Sensing (ISPRS), Istanbul, Turkey (2004) 17. Longley, P.A., Goodchild, M.F., Maguire, D.J., Rhind, D.W.: Geographic Information Systems and Science. John Wiley and Sons, West Sussex (2005) 18. McNamara, T.P., Diwadkar, V.A.: Symmetry and Asymmetry of Human Spatial Memory. Cognitive Psychology 34, 160–190 (1997)
Towards Cognitively Plausible Spatial Representations for Sketch Map Alignment
39
19. Milgram, S., Jodelet, D.: Psychological maps of Paris. Environmental Psychology, 104–124 (1976) 20. Moratz, R., Renz, J., Wolter, D.: Qualitative spatial reasoning about line segments, pp. 234–238 (2000) 21. Moratz, R., Dylla, F., Frommberger, L.: A relative orientation algebra with adjustable granularity (2005) 22. Nedas, K.: Semantic similarity of spatial scenes. University of Maine (2006) 23. Nedas, K., Egenhofer, M.: Spatial-Scene Similarity Queries. Transactions in GIS 12, 661–681 (2008) 24. Osmani, A.: Introduction to Reasoning about Cyclic Intervals. In: Imam, I., Kodratoff, Y., El-Dessouki, A., Ali, M. (eds.) IEA/AIE 1999. LNCS (LNAI), vol. 1611, pp. 698–706. Springer, Heidelberg (1999) 25. Renz, J., Nebel, B.: Qualitative Spatial Reasoning using Constraint Calculi. In: Aiello, M., Pratt-Hartmann, I., Benthem, J.V. (eds.) Handbook of Spatial Logics, pp. 161–215. Springer, Heidelberg (2007) 26. Sadalla, E.K., Staplin, L.J.: The Perception of Traversed Distance. Intersections. Environment & Behavior 12, 167–182 (1980) 27. Schwering, A., Wang, J.: Sketching as Interface for VGI Systems. In: Geoinformatik 2010, Kiel, Germany (2010) 28. Skubic, M., Blisard, S., Bailey, C., Adams, J.A., Matsakis, P.: Qualitative analysis of sketched route maps: translating a sketch into linguistic descriptions. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics 34, 1275–1282 (2004) 29. Stevens, A., Coupe, P.: Distortions in judged spatial relations. Cognitive Psychology 10, 422–437 (1978) 30. Theobald, D.M.: Topology revisited: representing spatial relations. International Journal of Geographical Information Science 15, 689–705 (2001) 31. Thorndyke, P.W.: Distance estimation from cognitive maps. Cognitive Psychology 13, 526–550 (1981) 32. Tversky, B.: Some Ways that Maps and Diagrams Communicate. In: Spatial Cognition II, Integrating Abstract Theories, Empirical Studies, Formal Methods, and Practical Applications, pp. 72–79. Springer, Heidelberg (2000) 33. Tversky, B.: Navigating by mind and by body. Spatial Cognition III, 1033–1033 (2003) 34. Tversky, B.: How to get around by mind and body: Spatial thought, spatial action. In: Cognition, Evolution, and Rationality: A Cognitive Science for the XXIst Century. Routledge, London (2005) 35. Wallgrün, J.O., Wolter, D., Richter, K.-F.: Qualitative matching of spatial information. In: 18th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (GIS 2010), pp. 300–309. ACM, New York (2010) 36. Wang, J.: How human schematization and systematic errors take effect on sketch map formalizations. Master Thesis, University of Münster (2009)
Scalable Navigation Support for Crowds: Personalized Guidance via Augmented Signage Fathi Hamhoum and Christian Kray Newcastle University, Newcastle upon Tyne, NE1 7RU, UK
[email protected]
Abstract. Navigating unfamiliar places is a common problem people face, and there is a wealth of commercial and research-based applications particularly for mobile devices that provide support in these settings. While many of these solutions work well on an individual level, they are less well suited for very crowded situations, e. g. sports matches, festivals and fairs, or events such as pilgrimages. In a large crowd, attending to a mobile device can be hazardous, the underlying technology might not scale well enough, and some people might be excluded due to not having access to a mobile device. Public signage does not suffer from these issues, and consequently, people frequently rely on signage in crowded settings. However, a key disadvantage of public signage is to not provide personalized navigation support. In this paper, we therefore investigate augmented signage as a means to provide navigation support for large crowds. We introduce a scalable signage-based approach and present results from a comparison study contrasting two designs for augmented signage with a base case. The results provide initial evidence that such a system could be easily useable, may help to reduce task load, and has the potential to improve navigation performance. Keywords: Augmented signage, navigation support, crowd interfaces, user studies.
1
Motivation
Navigating in an unfamiliar environment can be a daunting task regardless of the means of transportation. Pedestrians traditionally rely on a variety of tools to support them in this task, e. g. on maps, static signage or on other people familiar with the area. In this context, various types of computer-based guide systems have been proposed (cf. e. g. [6,22,24]) and commercialized (cf. e. g. [1]). Most frequently, such systems take the form of mobile guides that dynamically display maps enriched with information such as the user’s current location and the proposed route to a target location [1]. Dynamic (public) signage is an alternative approach that has been proposed to be used either in conjunction with mobile devices or without [23,14]. While these systems have been shown to work well on an individual level (e. g. a single user navigating urban environments), some settings pose significant challenges for such approaches. In particular, if users wish to navigate in areas that are very crowded, several key problems may arise: M. Egenhofer et al. (Eds.): COSIT 2011, LNCS 6899, pp. 40–56, 2011. c Springer-Verlag Berlin Heidelberg 2011
Scalable Navigation Support for Crowds
41
– Difficulty of using a mobile phone in a crowd. Depending on the density of the crowd, it can be difficult (or even hazardous) to take out a mobile phone and to interact with it since people need to pay close attention to what is going on around them. The movement of the crowd may interfere with the interaction as well. – Lack of scalability of the underlying technology. If a large number of people try to access a wireless network (e. g. BlueTooth, WiFi, GSM) in a very confined area, the frequency of errors, low bandwidth, high latency or loss of connection can increase dramatically – up to the point where the system may become unusable. – Exclusion of some users. It is quite likely that a percentage of the crowd will not have a mobile phone at all: they might not own one at all, or not have brought it for fear of it being stolen or lost. Certain events, such as pilgrimages, might also deter people from using a mobile phone. In order to address these problems and to provide a system that large numbers of people can use simultaneously to get personalized navigation support, we are investigating the use of (dynamic) public signage as a means to deliver this type of information. In this paper, we present an approach that uses a spatial partitioning in combination with standard signage (either static or dynamic), which we augment with additional information to enable users to extract personalized directions. As an added benefit, the approach provides means to influence the flow of people through space. We also report on a user study we conducted to investigate different designs of augmented signage for navigation support. In the following, we first review related work before describing the approach and the corresponding interface designs. We then report on the study we carried out to evaluate these designs, before discussing the results and their implications. The paper concludes by highlighting key contributions and future work.
2
Background
The way in which people navigate in situ and how navigational instructions can be conveyed is an integral part of spatial cognition research. Relevant topics covered in this area include how mental models of space relate to different representations of space [26,27] and the modelling of route knowledge in general [11]. Further key aspects relate to the role and type of landmarks [12] and spatial relations [13] as well as how to best integrate them into navigational instructions [21] that people find easy to follow. Static signage [2] remains the most common means to assist people in navigating unfamiliar environments. When designed well and placed appropriately [28] it can be very helpful, and there is also evidence that it can reduce the cognitive effort required to navigate an unfamiliar environment [10]. In addition, static signage scales well – provided it is of sufficient size and place appropriately – and can also provide some rudimentary means of flow control, which is particularly important in the context of very dense crowds [9]. However, issues such as illegibility, ambiguity, inaccuracy, and unreliability [2] can greatly reduce its
42
F. Hamhoum and C. Kray
usefulness. Either way, a key drawback of static signage (and static maps such as you-are-here maps [16] as well) is their lack of adaptability to individual users and changing circumstances. Mobile guides [1,3,6] do not suffer from this problem. Using location information (that can be sensed fairly accurately e. g. via GPS or RF-technologies), high resolution displays and possibly also information about the owner of a mobile device, they can provide dynamic navigation support that is adapted to the individual user [4,15]. These systems however do require people to carry a sensor-equipped mobile device capable of running the necessary software, and their users might also have to attend to them frequently (e. g. to retrieve the next set of directions). In contrast, static signage is embedded in the real world and thus does not distract the users’ attention from their environment. The use of public displays as dynamic signage is an alternative option that has been investigated as a means to support navigation. While some approaches (such as the GAUDI system [14]) rely solely on these displays to provide navigation support, others combine mobile devices with public displays (e. g. the Rotating Compass [23]) to enable ’eyes-free’ use based on cross-modal (tactile) cues [19]. In the context of a very crowded setting, the former suffer from a lack of scalability in terms of personalizing the display content, whereas the latter face issues with respect to perceiving tactile cues as well as with the scalability of the underlying technology if large numbers of users were to use it. In summary, while all of the approaches described above do offer some benefits, there are also some key drawbacks that put their usefulness in question when applied to crowded scenarios. In particular, the need for mobile phones, the reliance on vibro-tactile cueing, and the limitation to single users undermine their use for supporting navigation for large and heterogeneous crowds. In the following, we therefore outline a design for a public signage system that takes some cues from these systems but avoids the shortcomings identified above.
3
Personalized Navigation Support for Crowds
A number of key requirements quickly emerge when considering how to provide personalized navigation support to large crowds. Obviously, a feasible solution needs to be easy to use and learn, ideally with little to no training. In addition, it is clearly appropriate to design a system that enables the largest possible percentage of people to benefit from it rather than excluding particular groups (e. g. people who do not own a mobile phone, do not speak the local language, or cannot read well). Consequently, it is desirable to minimise technical requirements (e. g. the use of specific sensors) to enable the use at a large scale and also at sites without much technical infrastructure. Furthermore, such a system should not function at the expense of other people, who are not using the system (for example, by interfering with the standard use of the locations, where it is being deployed). Finally, it would be beneficial if the system would allow for some degree of flow management, e. g. to avoid people overcrowding particular areas.
Scalable Navigation Support for Crowds
43
Our solution is inspired by a signage system described in Ender’s Game, a novel by Orson Scott Card [5], which uses color-coded lines to provide directions to different groups in a large training facility. The basic principle of using color codes that map to areas and routes also underlies our approach but instead of this coding scheme replacing the traditional signs, we embed the code into standard signage in order to preserve the original artefact and its function. The two key components of the proposed system are a spatial partitioning (of the real world) with a corresponding mapping to color codes, and augmented signage that embeds color codes into standard signs used for navigation. 3.1
Spatial Partitioning
In order to provide large numbers of people with personalized directions, it is worthwhile to consider where they might want to go to. In principle, every single person in a crowd might want to go to a different destination but in practice the number of actual destinations is often much smaller. For example, after a football match the spectators might want to go to a relatively small number of parking areas or public transport hubs. Similarly, if a concert hall has to be evacuated, there will be a limited number of assembly spots and escape routes that people have to follow depending on where they are at the time of the emergency. Finally, at large events such Olympic Games or pilgrimages, large groups of people might have the same goal (e. g. a particular stadium or site). Consequently, in many cases it will be sufficient to provide guidance to a relatively small number of destinations. These destinations in turn can be used to partition space. Figure 1 shows an example, where an inner city area around a football stadium has been partitioned into six areas that were then mapped to specific colors. Such a mapping enables not only the augmentation of existing signage (see 3.2) but also facilitates navigation as users only need to remember a particular color code rather than a sequence of names of intermediate and final destinations. In order to increase the number of possible partitions beyond the number of clearly identifiable colors, it is possible to assign symbols to sub-partitions. Figure 2 shows an example, where the large red area has been further divided into four subregions. Each subregion has been mapped to a symbol (e. g. triangle, heart) and thus people will need to remember (and follow) a combination of color and symbol (e. g. red circle). While the number of clearly identifiable symbols is also limited, by combining them with colors it is possible to create mappings that are more fine-grained; for example, using eight colours and ten symbols it is possible to directly address 80 areas. Since people need to memorize these codes, it is important to ensure different combinations can be easily distinguished, which in turn imposes an upper limit of how many combinations are feasible in practical use. Either mapping (color only or colored symbols) can then be embedded into signage as described in the following.
44
F. Hamhoum and C. Kray
Fig. 1. Example partition of an inner city area around a football stadium (marked by an ‘X’ on the map) - map generated from openstreetmap [20]
Fig. 2. Example sub-partition using four symbols to divide area corresponding to one color - map generated from openstreetmap [20]
3.2
Augmented Signage Design
One key concern in designing the system to provide personalized guidance to large numbers of users was to preserve the main function that public signage provides to all nearby people. We thus chose to augment existing signage rather
Scalable Navigation Support for Crowds
45
than replacing it with something that would only be readable (and therefore usable) by people who have been taught how to use it. Consequently, we propose a system where people can use visual cues that are embedded into standard signage to extract personalized information (i. e. how to get to a specific target location resp. partition). By remembering a simple code, individuals can look at a sign and use the embedded visual cues to infer which way they need to go in order to get to their desired target destination. The visual cue is constructed based on the color mapping and spatial partitioning described above. The ‘individual’ code could initially be acquired in several different ways: it could be printed on entrance tickets, it could be agreed on by a group of people who want to meet up after an event, or it could be transmitted by a dynamic display at strategic locations (e. g. on the main paths leading to the event). In this paper we are mainly concerned with the augmentation of standard signage and scalability, and therefore, we assume that people will be in possession of the correct code when they are looking at the signs. We created two designs for the augmented signage. The first one adds colored circles to items shown on a sign (see Figure 3, top left). Each color corresponds to a specific destination, e. g. ‘red’ might correspond to a specific Metro Station or city area. In order to infer the direction to follow at a sign, a user would first have to remember the color, then find the red circle on the sign, and finally follow the arrow shown next to the entry near the circle (regardless of whether that entry reads ‘Metro Station’ or not). For example, given the color red and the sign shown at the top left of Figure 3, a user would have to walk straight ahead to reach their destination. The second design combines symbols and colors (see Figure 3, top right), so that a user needs to remember, for example, ‘green heart’ or ‘purple square’. The process of extracting individual information is the same as with the first design. Using the example sign shown at the top right of Figure 3, a user following ‘purple cross’ would thus have to walk straight ahead to reach their destination. In either design, the cues could be changed dynamically, e. g. to provide updated directions, to control the flow of people, to include new destinations, or to multiplex multiple destinations (see section 5 for more detail). The user study reported in section 4 evaluates and contrasts these two designs against a base case (Figure 3, bottom left). 3.3
Flow Management
Since flow control and crowd management play an important role in ensuring the safe running of large events, it makes sense to consider augmented signage in combination with a spatial partitioning in this context. Even when disregarding dynamic signage (see section 5), the approach described above provides some beneficial features to shape the flow of people. Figure 4 provides an example illustrating this. The gray areas correspond to streets (which are numbered from one to four) and colored arrows to routes suggested via augmented signage. Assuming the destinations corresponding to red, blue and yellow are all located
46
F. Hamhoum and C. Kray
Fig. 3. Augmented signage designs (top row), base case (bottom left) and study setup (bottom right)
to the North of the streets shown, then in principle, every person walking along street four from the West could turn into street one. If street one is narrow, this could potentially create congestions. Using the color coding it would be possible to control where people would turn. In the example shown, the augmented signage placed at the intersection of street one and four would annotate the North-pointing arrow with red and the East-pointing arrow with blue, yellow and purple. The sign placed at the intersection of street two and four would add a blue annotation for the North-pointing arrow as well as include yellow and purple annotations for the East-pointing arrow. Finally, the augmented signage placed at the intersection of street three and four would add yellow to the North-pointing arrow while the East-pointing one
Scalable Navigation Support for Crowds
1
2
47
3
4
Fig. 4. Example illustrating flow management using color coding
would solely be annotated with purple. Therefore, only people following the red color code would turn at street one, whereas those following blue would turn at street two and those following yellow at street three – thereby distributing the crowd more evenly among streets one to three despite three out of four destinations being located in the same direction. It is worth noting that this would be difficult to achieve with standard signage without compromising its regular use as it would require the removal or redirection of some destinations on a number of signs. In the example given in Figure 4 a sign placed at the intersection between street one and four would have to align destination names in such a way that only a certain number of people would take street one while the majority of people would keep following street four. Depending on the topology and arrangement of destinations this is likely to result in longer than necessary routes in every day usage (i. e. non-crowded situations) and could also cause confusion as signs no longer direct people along the shortest routes.
4
User Study
In order to determine whether the designs described in section 3.2 would be acceptable and also to gather feedback from potential end users, we conducted a lab-based study contrasting a base condition with the two designs. More specifically, we were interested in finding answers to the following two questions: – Can people ‘read’ the system and use it to infer the right direction reliably and quickly? – How do the three conditions (arrows only, colored circles, colored symbols) compare in terms of task completion time, errors, disorientation events, usability, satisfaction, and workload? 4.1
Participants
We recruited 18 participants (9 female and 9 male) from around the University. They were aged between 22 and 52 years with the mean age being 35 years.
48
4.2
F. Hamhoum and C. Kray
Stimuli
For each of the three conditions, we created 12 signs that each showed four to nine destinations; for each destination an arrow pointing in one of eight directions was included (cardinal and ordinal directions). In the first condition (Arrow), no augmentation was added to those signs (see Figure 3, bottom left). In the second condition (Color), the signs were augmented by a number of colored circles (see Figure 3, top left), and in the third condition (Symbol), the signs were augmented with a number of color symbols (see Figure 3, top right). We used nine different colors – Blue, Red, Yellow, Brown, Green, Black, Orange, Gray, and Pink – in condition two and three, and eight different symbols – Circle, Star, Triangle, Moon, Heart, Square, Cross, and Rectangle – in the third conditions. We chose those colors and symbols based on how easily they could be distinguished from one another and also based on whether they could be easily verbalized, which we hoped would facilitate remembering of them. The signs were played back via an automated slideshow that presented each sign for 20 seconds before turning the screen black. The signs were shown on a 50” plasma screen, and participants were instructed to stand at the center of a circular mat placed in front of the screen. The circular mat had a diameter of one meter and eight marks around the edge to indicate the cardinal and ordinal directions (see Figure 3, bottom right). 4.3
Procedure
After a brief introduction, each participant first received a short questionnaire that we asked them to fill in to gather some background information. We provided a maximum of ten minutes to do this, and everyone completed it within that timeframe. Next, each participant was exposed to the three conditions we were testing. Each condition consisted of a brief explanation of the task participants had to perform followed by twelve trials. After completing the final condition, participants were asked to fill in another short questionnaire, were debriefed and received a small payment. Each trial was structured as follows: the experimenter first verbally provided the participant with a target destination or visual code depending on the condition. In the Arrow condition, the experimenter would instruct participants by saying “Your destination is X”, where ‘X’ would be a destination such as “the general hospital” or “the civic center”. In the Colour and Symbol conditions, the instructions given would be “To get to your destination, you have to follow Y”, where ‘Y’ would be either a color (e. g. “blue”) or a colored symbol (e. g. “pink moon”, “yellow square”). Once participants indicated (verbally, by nodding or via a gesture) that they had understood the instructions, the experimenter triggered the display of the next sign on the plasma screen. Participants then had to scrutinize the sign to determine, in which direction they would have to move to reach the destination they were given just beforehand. When they had figured out the direction they should move to, they had to put one of their feet onto the mark around the edge
Scalable Navigation Support for Crowds
49
of the circular mat that corresponds to the direction. Once this was done, the experimenter moved on to the next trial by blanking the screen and providing the next instruction. Each sign was shown for a maximum of 20 seconds, after which the screen would go blank automatically. If people did not select a direction within that time, we classified this as a disorientation event. We recorded all trials on video, and used the footage to take the following measurements: disorientation events (no direction selected within the 20 seconds a sign is displayed), errors (selection of an incorrect direction) and completion time (time from the appearance of a sign until on foot made contact with one of the marks corresponding to the directions. 4.4
Results
As part of the initial questionnaire, participants filled in the Santa Barbara Sense of Direction questionnaire. The results revealed an average score of 3.55, which is very similar to the score of 3.6 that Hegarty et al. [8] reported for their 211 participants. Timing. When analyzing the task completion time (see Figure 5), we found significant differences between the three conditions. A one-way ANOVA analysis indicates that the average values for the three conditions are significantly different with a p-value of 0.001 (α <0.01). A post-hoc Tukey test revealed significant differences between all conditions with p-values of 0.001 (α <0.01). Overall, participants were fastest in the Color condition followed by the Symbol condition, with the Arrow condition being the slowest one.
Fig. 5. Average task completion time per condition (with confidence intervals)
50
F. Hamhoum and C. Kray
Errors and Disorientation. The overall number of errors and disorientation events we recorded was very low. In total only two errors occurred throughout the entire study. Both errors were observed in the symbol condition, whereas no errors at all were recorded in either the Color or Arrow condition. Disorientation events were counted when the participants failed to select a direction within the 20 seconds that each sign appeared on the screen. Overall, we only observed this once during the symbol condition. No disorientation events occurred during the Arrow and Color conditions. Usability, Satisfaction, Ease to use, and Learnability. The responses to the selected questions from the USE questionnaire [18,17] are depicted in Figure 6, which shows the average results for all participants. In all four categories, the Color condition is rated best followed by the Symbol condition, whereas the Arrow condition is consistently rated lowest. This indicates that participants found the Color condition to be the easiest to learn and use, and also rated it best in terms of usability and satisfaction. The Symbol condition was rated second best in all four conditions, and the Arrow condition worst (attracting particularly low scores in the usability and satisfaction categories). A one-way ANOVA analysis indicates that the average aggregated values for the three conditions are significantly different with a p-value of 0.001 (α <0.01). A post-hoc Tukey test revealed significant differences between all conditions with p-values of 0.001 (α <0.01).
Fig. 6. Average results for subset of USE questionnaire [18] using a 5-point Likert scale from 1 (strongly disagree) to 5 (strongly agree)
Workload. Individual results for different categories of the NASA Task Index Questionnaire [7] are depicted in Figure 7, which shows the mean results of all participants. The combined TLX scores for the different conditions were as follows: the Arrow condition has the highest average of 3.46 with standard deviation (SD) of 0.28, the Symbol condition has the second highest average value of 2.90 (SD = 0.37), and the Color condition has the lowest average value of 2.13 (SD = 0.16). Perceived task load was thus highest for the Arrow condition,
Scalable Navigation Support for Crowds
51
lowest for the Color condition and second lowest for the Symbol condition. A one-way ANOVA analysis indicates that the combined scores for the three conditions are significantly different with a p-value of 0.001 (α <0.01). A post-hoc Tukey test revealed significant differences between all conditions with p-values of 0.001 (α <0.01).
" !! # !! $ !! % !! & !!
Fig. 7. Mean results for NASA TLX questionnaire broken down by category and using a 5-point Likert scale from 1 (strongly disagree) to 5 (strongly agree)
Fig. 8. Box plot showing the median of each condition for the NASA TLX questionnaire
Preference. In the final questionnaire, the participants were asked to rank the conditions according to which ones they prefer. The results are depicted in Figure 9. The average rank for the Color condition was 1.4, and 2.2 for both the Arrow and the Symbol condition (using an unweighted rank average). 12 out of the 18 participants (67%) ranked the Color condition as their first choice, 6 out of the 18 participants (33%) ranked the Arrow condition as the second choice, and 9 out of 18 participants (50%) ranked the Symbol condition their
F. Hamhoum and C. Kray
Number of participants
52
Fig. 9. Post-study ranking of the three conditions
third choice. Overall, the Color condition was clearly the most preferred option, while the Arrow and Symbol conditions were ranked similarly (depending on how different ranks are weighted).
5
Discussion
While the study provides some initial insights into whether people can use augmented signage, there are some shortcomings that limit the generality of the results we obtained. One of these issues relates to the lack of realism: while participants had to physically move to select a direction, this movement was very small compared to the amount of walking that could be required if the system was deployed in the real world. Another issue related to this is the lack of crowdedness, which is hard to emulate in the lab without compromising the safety of participants. Finally, we varied the overall complexity of sign within very narrow boundaries (i. e. between four and nine items per sign), whereas in the real world, sign complexity can vary more widely, e. g. in terms of the layout, number of items and directional indicators being used. A real-world test with an actual deployment would overcome these issues but could also incur considerable safety implications in case of dense crowds. A more realistic simulation environment [25] could thus be a sensible intermediate step. Nevertheless, the results are generally quite encouraging in a number of ways: we recorded very few errors or disorientation events, which indicates that participants were able to use the augmented signage well. Completion times for both augmented signage conditions were lower than for the non-augmented case, and the ratings in the different USE categories were also higher. The same is true for the workload, which was lower for augmented signage than it was for non-augmented signage. In general, the Color condition scored higher than the Symbol condition in all these tests. In terms of overall preference, the Color condition was clearly the most favored one; in this case, the Arrow and the Symbol condition tied in second place. It is worth noting that the few errors and
Scalable Navigation Support for Crowds
53
disorientation events we recorded during the study occurred only in the Symbol condition, despite the workload being rated lower than the Arrow condition. Compared to existing systems (see section 2) and in the context of the requirements identified in section 3, the proposed approach offers a number of benefits. It does not require users to carry a mobile device, it works well with static signage, and it maintains the original purpose/function of the signs. The use of colors and/or symbols also makes the system accessible to people, who do not speak the local language or who cannot read at all. The study outcomes thus provide initial evidence that augmented signage is usable, easy to learn and enjoyable without incurring large penalties in terms of usage time, error rates or disorientation events. While both augmented signage designs can provide personalized directions to any number of users, their scalability is limited by the number of simultaneous destinations they support. The colored circle design allows for as many destinations as there are colors, which realistically limits it to about ten destinations (primary plus secondary colors, leaving out the background color), as it would be difficult for people to remember specific shades of colors or colors that they cannot reliably name. The colored symbol design significantly extends the number of simultaneous destinations, effectively multiplying it by the number of symbols used – we used eight symbols and nine colors in the study reported above, resulting in up to 72 concurrent destinations. However, to display that many destinations on a single sign, it would be necessary to rotate through them. If they were all displayed simultaneously, individual symbols might be too small to be recognized well. In order to further increase the number of destinations, hierarchical approaches or multi-color codes could be used, which would most likely have an impact on usability. Using dynamic augmented signage cannot only help with scalability, it can also provide means to assign visual codes to groups of people, e. g. by cycling through them over time so that passers-by pick up codes depending on when they walk past the sign. In addition, dynamic signage would enable real-time adaptations, which would be beneficial in terms of responding to changes in the environment or crowd behavior. For example, the size of target areas could be adjusted dynamically in response to how many people are assigned to it. Combining dynamic displays with various sensors (e. g. flow rate sensors, people counters, presence sensors) could potentially fully automate this process. Another interesting option would be to combine the two augmented signage designs presented in section 3. By collocating all destinations corresponding to a particular color, signage could be augmented hierarchically: signs outside the area corresponding to a specific color only include color codes, not symbols for that color. Signs inside an area corresponding to a color do include symbols for that color. This would simplify the signs without reducing the number of addressable destinations, and would also account for people’s overall preference of the Color condition by minimizing their exposure to the colored symbols.
54
6
F. Hamhoum and C. Kray
Conclusions
In this paper, we presented the design and initial evaluation of an approach to provide personalized navigation support to large crowds via augmented signage. The approach is based on a spatial partitioning and a mapping of destinations to visual codes, which are used to augment regular signage. People can use these codes to extract individual directions from signs. The proposed approach addresses several shortcomings of existing approaches such as the requirement for everyone to carry mobile phones or the limited scalability in terms of the number of simultaneous users. We presented two different designs for augmented signage, which we compared against a base condition in a lab-based user study. The outcomes of this study provide initial evidence that augmented signage can be used successfully with little training and without incurring large penalties in terms of delays, workload, errors or disorientation. In general, the color-only condition was preferred followed by the colored-symbol condition, which supports a considerably larger number of concurrent destinations. The base case (text and arrow only) was consistently rated lowest in almost all tests. We also reviewed the potential of our approach in terms of managing people flow, and discussed different ways to improve and expand the system. Based on these initial results, our next step will be to apply this approach to a specific scenario and to evaluate it under more realistic conditions. In order to achieve this, we intend to investigate its use in the context of the pilgrimage that brings many Muslims to Mecca every year. This scenario poses a number of challenges such as the scale and diversity of the crowd that will enable us to test and refine the approach further. As it is unlikely that a research prototype could be deployed at Mecca, we also plan to look into different ways to increase the realism of lab-based studies, e. g. by simulating movement in a more convincing way or by using semi-immersive imagery.
References 1. Arikawa, M., Konomi, S., Ohnishi, K.: Navitime: Supporting pedestrian navigation in the real world. IEEE Pervasive Computing 6(3), 21–29 (2007) 2. Arthur, P., Passini, R.: Wayfinding: People, Signs, and Architecture. McGraw-Hill, New York (1992) 3. Baus, J., Kray, C., Cheverst, K.: A survey of map-based mobile guides. In: Meng, L., Zipf, A., Reichenbacher, T. (eds.) Map-Based Mobile Services, pp. 197–216. Springer, Heidelberg (2005) 4. Baus, J., Kr¨ uger, A., Wahlster, W.: A resource-adaptive mobile navigation system. In: Gil, Y., Leake, D.B. (eds.) IUI 2002 – 2002 International Conference on Intelligent User Interfaces, pp. 15–22. ACM Press, San Francisco (2002) 5. Card, O.S.: Ender’s Game. Tor Books (1985) 6. Cheverst, K., Davies, N., Friday, A., Efstratiou, C.: Developing a context-aware electronic tourist guide: Some issues and experiences. In: Proceedings of CHI 2000, Netherlands, pp. 17–24 (2000) 7. Hart, S.G., Stavenland, L.E.: Development of NASA-TLX (Task Load Index): Results of empirical and theoretical research. In: Human Mental Workload, pp. 139–183. Elsevier, Amsterdam (1988)
Scalable Navigation Support for Crowds
55
8. Hegarty, M., Richardson, A.E., Montello, D.R., Lovelace, K., Subbiah, I.: Development of a self-report measure of environmental spatial ability. Intelligence 30(5), 425–447 (2002) 9. Helbing, D., Johansson, A., Al-Abideen, H.Z.: Dynamics of crowd disasters: An empirical study. Phys. Rev. E 75(4), 046109 (2007) 10. H¨ olscher, C., Br¨ osamle, M., Meilinger, T., Strube, G.: Signs and maps - cognitive economy in the use of external aids for indoor navigation. In: McNamara, D., Trafton, J. (eds.) Proceedings of the 29th Annual Cognitive Science Society, pp. 377–382. Cognitive Science Society, Austin (2007) 11. Klippel, A., Tappe, H., Kulik, L., Lee, P.U.: Wayfinding choremes–a language for modeling conceptual route knowledge. Journal of Visual Languages & Computing 16(4), 311–329 (2005) 12. Klippel, A., Winter, S.: Structural salience of landmarks for route directions. In: Cohn, A., Mark, D. (eds.) COSIT 2005. LNCS, vol. 3693, pp. 347–362. Springer, Heidelberg (2005) 13. Kray, C., Blocher, A.: Modeling the basic meanings of path relations. In: Proceedings of the 16th IJCAI, pp. 384–389. Morgan Kaufmann, San Francisco (1999) 14. Kray, C., Kortuem, G., Kr¨ uger, A.: Adaptive navigation support with public displays. In: Amant, R.S., Riedl, J., Jameson, A. (eds.) Proceedings of IUI 2005, pp. 326–328. ACM Press, New York (2005) 15. Kray, C., Laakso, K., Elting, C., Coors, V.: Presenting route instructions on mobile devices. In: Johnson, W.L., Andr´e, E., Domingue, J. (eds.) Proceedings of IUI 2003, pp. 117–124. ACM Press, Miami Beach (2003) 16. Levine, M.: You-are-here maps. psychological considerations. Environment and Behavior 14(2), 221–237 (1982) 17. Lewis, J.R.: Ibm computer usability satisfaction questionnaires: psychometric evaluation and instructions for use. Int. J. Hum.-Comput. Interact. 7(1), 57–78 (1995) 18. Lund, A.: USE questionnaire (2011), http://usesurvey.com (last accessed March 3, 2011) 19. Olivier, P., Cao, H., Gilroy, S.W., Jackson, D.G.: Crossmodal ambient displays. In: British Computer Society HCI: Engage. Queen Mary College, University of London, UK (2006) 20. Open Street Map Foundation: Open street map web site (2011), http://www.openstreetmap.org/ (last accessed March 4, 2011) 21. Richter, K.-F.: A uniform handling of different landmark types in route directions. In: Winter, S., Duckham, M., Kulik, L., Kuipers, B. (eds.) COSIT 2007. LNCS, vol. 4736, pp. 373–389. Springer, Heidelberg (2007) 22. Rohs, M., Sch¨ oning, J., Raubal, M., Essl, G., Kr¨ uger, A.: Map navigation with mobile devices: virtual versus physical movement with and without visual context. In: ICMI 2007: Proceedings of the 9th International Conference on Multimodal Interfaces, pp. 146–153. ACM, New York (2007) 23. Rukzio, E., Schmidt, A., Kr¨ uger, A.: The rotating compass: a novel interaction technique for mobile navigation. In: CHI 2005: CHI 2005 Extended Abstracts On Human Factors In Computing Systems, pp. 1761–1764. ACM, New York (2005) 24. Schmid, F., Kuntzsch, C., Winter, S., Kazerani, A., Preisig, B.: Situated local and global orientation in mobile you-are-here maps. In: Proc. of Mobile HCI 2010, pp. 83–92. ACM, New York (2010)
56
F. Hamhoum and C. Kray
25. Singh, P., Ha, H.N., Kuang, Z., Olivier, P., Kray, C., Blythe, P., James, P.: Immersive video as a rapid prototyping and evaluation tool for mobile and ambient applications. In: MobileHCI 2006: Proceedings of the 8th Conference On HumanComputer Interaction With Mobile Devices and Services, pp. 264–264. ACM Press, New York (2006) 26. Tversky, B.: Cognitive Maps, Cognitive Collages, and Spatial Mental Models. In: Campari, I., Frank, A.U. (eds.) COSIT 1993. LNCS, vol. 716, pp. 14–24. Springer, Heidelberg (1993) 27. Tversky, B., Lee, P.U.: Pictorial and verbal tools for conveying routes. In: Freksa, C., Mark, D.M. (eds.) COSIT 1999. LNCS, vol. 1661, pp. 37–50. Springer, Heidelberg (1999) 28. Xie, H., Filippidis, L., Gwynne, S., Galea, E.R., Blackshields, D., Lawrence, P.J.: Signage Legibility Distances as a Function of Observation Angle. Journal of Fire Protection Engineering 17(1), 41–64 (2007)
Information on the Consequence of a Move and Its Use for Route Improvisation Support Takeshi Shirabe School of Architecture and the Built Environment Royal Institute of Technology (KTH) SE-100 44, Stockholm, Sweden
[email protected]
Abstract. This paper proposes a new method of navigational assistance in unfamiliar environments. In such environments, major concerns would normally be how to find a good route to a selected destination and how to design and communicate directions to follow that route. This may not be the case, however, if route selection criteria are not complete or subject to change during a trip. To cope with such uncertainty, the proposed method calculates, for each possible move from the current position, a single value characterizing the consequence of that move, e.g., how long it will take to reach the destination if that move is made. The paper outlines a design of a route improvisation support system equipped with this method, and underlines the merit of letting the user build up a route progressively by taking into account highly local, temporary, or personal information that is not stored in the system but collected by the user while traveling.
1 Introduction Advances in digital information technology over the past several decades have had profound effects on the way people travel in unfamiliar or not-fully-familiar environments. It is increasingly common for drivers to use in-vehicle navigation systems to find a route to a destination and obtain a sequence of directions that help them follow that route. Also many modern mobile communication devices are equipped with the functionality of route search and guidance for pedestrians. Navigation is an activity most of us do routinely but can be an interesting subject of study. One starting point for its analysis is to recognize two aspects of the activity: “planning” (or “wayfinding”) and “execution of movements” (or “locomotion”) [14]. In a typical scenario of route planning with an existing navigation system, the user specifies a destination and selects a type of “cost” (e.g. travel time, travel distance, toll payment, or fuel consumption) in terms of which routes are evaluated, and then the system detects the current location and calculates a shortest (or minimum-cost) route to the specified destination. Some navigation systems present the user with multiple routes (one for each cost type) from which he chooses one prior to the trip. This functionality increases the quality of route decision and/or the user’s satisfaction with the selected route since multiple candidate routes can be compared from different M. Egenhofer et al. (Eds.): COSIT 2011, LNCS 6899, pp. 57–72, 2011. © Springer-Verlag Berlin Heidelberg 2011
58
T. Shirabe
perspectives. Some navigation systems suggest an alternative route to the user during the trip as soon as it finds that the currently selected route has become unavailable or suboptimal. This functionality increases the chance of arriving at the destination successfully and/or quickly. As the term planning implies, route planning deals with the future. Thus route planners should remember that the condition of a planned route may change while it is actually traversed. Methods are available for finding a shortest route through a “time-dependent” or “dynamic” network, whose topology (e.g. road opening/closure) or attribute (e.g. traffic volume) changes as a function of time [15, 10, 25, 5]. Obviously all future conditions cannot be predicted in a deterministic manner. So some researchers incorporated uncertainty into road networks in such a way that the travel time of each road segment follows a known probabilistic distribution and sought variations of shortest routes such as one that achieves the earliest expected arrival [21, 9] and one that maximizes the chance of arriving on time [7]. Whatever route planning method is employed, once a route is set, the remaining execution task seems trivial—just follow the set route. Nonetheless, humans often fail to do it for various reasons despite all kinds of navigational aids (see, e.g., [4]). The complexity of human navigation has been (at least partially) explained by theories and models developed through decades of interdisciplinary research involving, among others, psychology and cognitive science/engineering. Elements of good route directions have been identified (see, e.g., [13]), and techniques for enhancing the quality of route directions (e.g., automated landmark extraction [16], “chunking” of route elements [12], knowledge-based schematization [20], dialog-driven route direction generation [17]) have been developed. Though limited, our review of relevant literature suggests that existing navigation methods and systems rely on a common implicit assumption: one (and only one) route is considered at a time when route directions are given. It is this “one route at a time” assumption that makes it possible to place on the screen an arrow icon indicating the next move or to send a vocal message like “turn left at the next intersection.” This is, of course, nothing wrong or surprising because most users expect unambiguous route guidance. Now imagine a traveler who needs to depart from a selected route in response to unexpected events. A conventional navigation system would provides him with a new route only when a registered type of event occurs, e.g., he fails to stay on the selected route, he informs the system of his intension to make a detour, or the system finds the currently selected route no longer optimal. However, some events are simply too local, temporary, or personal to trigger the system to seek an alternative route. For instance, an unwelcome friend is approaching from ahead or a suspicious car is chasing from behind. Another case when a navigation system works less effectively is when a traveler is somewhat familiar with the environment and believes that she knows better than the navigation system. All she wants from the system may be an alert when there is a risk of making an unrecoverable mistake. There may be an even more chaotic situation such that an ultimate destination is fixed but route selection criteria are spontaneous or capricious during a trip. For example, a tourist needs to go back to his hotel by a certain time but wants to explore the area as long as time allows.
Information on the Consequence of a Move
59
Taking an unexpected or unplanned move without knowing its consequence would cause the risk of failing or delaying arrival at the destination. It is possible that a user of a conventional navigation system stops at every intersection to compute a new route starting with each possible move from there. This, however, would cost significant time and computing resources, which, in turn, would prevent the user from receiving timely route guidance and traveling smoothly. The examples illustrated above by no means imply a shortcoming of the current navigation technology. But they call for new concepts of en-route travel assistance. This paper proposes one relatively simple one, that is, to provide the traveler with information on the consequence of each possible move wherever he is and whenever he needs/wants it. Such information may be qualitative, e.g., “don’t turn left there” or quantitative, e.g., “if you turn left there, it will take extra 5 minutes.” This way, the traveler will not be told which way to go next but be let decide on the next move according to whatever preferences and/or constraints he currently has. This sort of travel support may be more appropriately regarded as relating to exploration or route improvisation1 rather than navigation. The remainder of the paper is organized as follows. Section 2 reviews a basic theory concerning the classic shortest path problem and its solution, which is utilized in Section 3 to develop a method of producing a simple piece of information representing the consequence of a move. Section 4 incorporates this method into a system that supports route improvisation. Section 5 concludes the paper.
2 Shortest Path Problem In this section we examine two closely-related concepts concerning the shortest path problem, namely, shortest path tree and reduced cost. Because the shortest path problem has been studied in a wide range of contexts with different terminologies, we first define some basic terms we use throughout this paper. A network is a set of nodes (representing, e.g., road intersections) and a set of arcs (representing, e.g. road segments), and assumed to be directed (i.e. every arc is defined by an ordered pair of nodes) unless otherwise stated. A path is a sequence of arcs, and assumed to be directed (i.e. all its arcs go the same direction) unless otherwise stated. Origin and destination are the first and last nodes of a path, respectively. A cycle is a sequence of arcs that begins and ends with the same node but repeats no other nodes. A tree is a network that has a path between any two nodes but no cycle (directed or not). The following notation is employed throughout this section. G = ( N , A) denotes a network consisting of a set, N, of n nodes and a set, A, of m arcs. Associated with each arc is a constant, l (i, j ) , representing its length. The length of a path is defined as the sum of the lengths of all arcs in that path, and d (i ) denotes the length of some path from node i to the destination.
1
Route improvisation may be regarded as a combination of “undirected wayfinding” and “directed wayfinding” according to Wiener’s taxonomy [23] since it may involve unplanned stops and detours before reaching a specific destination.
60
T. Shirabe
It is assumed that all networks considered in this paper contain no cycle with negative length in order to keep the problem from being computationally intractable (or NP-hard). 2.1 Shortest Path Tree It is useful, at least from a computational point of view, to classify the classical shortest path problem in three kinds: one-to-one, one-to-all (or all-to-one), and all-to-all. The one-to-one shortest path problem is to find a path from the origin to the destination that is shorter than or equal to any other path. The one-to-all (or all-to-one) shortest path problem is to find a shortest path from the origin to every other node (or to the destination from every other node). Both have the same degree of computational complexity, as a solution to the former is derived from a solution to the latter2. For instance, if all arc lengths are nonnegative, Dijkstra’s algorithm in its original form [6] and that with Fibonacci heaps [1] solve the problem in O(n2 ) time and in O(m + n log n) time, respectively. If some arcs have a negative cost, one can use “Bellman-Ford algorithm” [1] whose running time is O(mn) . Finally, the all-to-all shortest path problem seeks a shortest path from every node to every other node. It can be solved by executing a shortest path algorithm as many times as the number of nodes (once for each node as the destination), but more efficient algorithms (e.g. “Floyd-Warshall algorithm” [1]) exist. A solution to the (all-to-one) shortest path problem is not just a single path but a set of shortest paths. There may be more than one such set in some networks, but there is at least one that forms a tree (see Figure 1) in all networks. From this tree, one can construct a shortest path from any node to the destination simply by tracing down the tree until the destination is reached. It has been proven that the values of d (i) (for all i ∈ N ) that are determined by any shortest path tree satisfy the following relations [1]: d (i ) ≤ d ( j ) + l (i, j )
∀(i , j ) ∈ A
(1)
It is easy to see how this relation holds in a concrete network. For instance, in reference to Figure 1, Equation (1) is true for arc (1, 2) because d (1) = 8 , d (2) = 5 and l (1, 2) = 5 , as well as for arc (1,3) because d (1) = 8 , d (3) = 4 and l (1,3) = 4 . Notice that the latter case involves an arc belonging to a shortest path and satisfies Equation (1) as equality. This is true in general, that is: d (i ) = d ( j ) + l (i, j )
∀(i, j ) in any shortest path
(2)
Conversely, any path tree whose associated d (i ) (for all i ∈ N ) satisfy Equation (1) is a shortest path tree. Thus Equation (1) is generally referred to as the optimality conditions for the shortest path problem. 2
In practice, the one-to-one problem may be solved more efficiently by exploiting an obvious lower bound (e.g. the straight-line distance if the network is embedded in the Euclidean plane) on the length of a shortest path from each node to the destination [8].
Information on the Consequence of a Move
61
Fig. 1. A shortest path tree (shaded) rooted at the destination (node 8). The number associated with each arc represents its length, and the number associated with each node (also underlined) represents the length of a shortest path from that node to the destination.
2.2 Reduced Cost Consider another variable l (i, j) that is defined as:
l (i, j) = l(i, j) + d ( j) − d (i)
(3)
Then the optimality conditions are re-written as:
l (i, j) ≥ 0
∀(i, j ) ∈ A
(4)
The nonnegativity of the optimal l (i, j) has an important implication. When
l (i, j) is optimal, d (i ) is equal to the length of a shortest path from node i to the destination, and l (i, j ) + d ( j ) is equal to the length of a shortest path from node i to the destination subject to the condition that the path begins with arc (i, j ) (see Figure 2). Thus the optimal l (i, j ) can be intuitively understood as representing how much the inclusion of arc (i, j ) would increase the shortest path length from node i to the destination, and is generally referred to as the reduced cost of arc (i, j ) .
d(j) j l(i,i)
n i
d(i)
Fig. 2. Analysis of the reduced cost of an arc. A shortest path from node i to node n via arc (i,j) is longer than a shortest path from node i to node n without such a restriction by
l (i, j) + d ( j ) − d (i) = l (i, j) . Note that the dashed arrows represent shortest paths, and the solid arrow represents an arc.
62
T. Shirabe
The interpretation of the optimality conditions in terms of reduced costs helps us find one or more shortest paths from any chosen node to the destination because any sequence of arcs with zero reduced cost is a shortest path. For instance, two such sequences (1-3-6-8 and 1-5-3-6) connect nodes 1 and 8 in Figure 3.
Fig. 3. A network with reduced costs. It is implied that paths 1-3-6-8 and 1-5-3-6-8 are shortest paths because they consist only of arcs with zero reduced cost
3 Method of Producing Information on the Consequence of a Move Our approach to supporting route improvisation is to keep the traveler informed of the consequence of every possible move from the current location. Obviously, there is a limit on the amount of information a traveling person is capable to process. Also, there is a limit on the length of time for which a traveling person is willing to wait before information becomes available. Thus, it is crucial to design information products that are small in volume and easy to compute but represent the consequences of alternative moves effectively. 3.1 Consequence Values We generally refer to a single value relevant to the consequence of a move as the consequence value of that move. One such (and perhaps the most straightforward) value indicates how long it takes to reach a destination if a certain move is made. Letting c (i, j ) denote this value for the move of taking arc (i, j ) , it is defined as: c (i, j ) = l (i , j ) + d ( j )
(6)
This is easy to derive from the output of the all-to-one shortest path algorithm discussed in the previous section. For a numerical example, suppose that we are at node 3 in the network illustrated in Figure 1. The consequence value of moving to node 4 is 5, as the length of (3, 4) is 1 and the shortest path length from node 4 to the destination is 4. Similarly, the consequence values of moving to node 5 and to node 6 are 9 (= 3 + 6) and 4 (= 3 + 1), respectively. One can easily extend the notion of consequence value so that the length of a path can be measured in terms of a variety of other attributes such as time, (monetary) cost,
Information on the Consequence of a Move
63
and energy consumption. Then, letting l (i, j , a ) denote the length of arc (i, j ) in term of attribute a and d ( j , a ) the shortest path length from node j to the destination in term of attribute a, the consequence value, c (i, j , a ) , of taking arc (i, j ) in terms of attribute a is defined as: c(i, j , a ) = l (i, j , a ) + d ( j , a )
(7)
In practice, it often takes some extra cost to turn at an intersection [3, 11, 24]. To see how such costs can be included in computation of consequence values, let us here modify our notation as follows. p (i, j , a ) denotes the cost incurred by turning from arc i to arc j in terms of attribute a, l ( j, a ) denotes the length of arc j in terms of attribute a, d ( j , a ) denotes the shortest path length (with turn costs included) from the head of arc j to the destination in terms of attribute a, and c (i, j , a ) denotes the consequence value of taking a turn from arc i to arc j in terms of attribute a. Then c (i, j , a ) is defined as: c(i, j , a ) = p (i, j , a ) + l ( j , a ) + d ( j , a )
(8)
In the remainder of this paper, to avoid notational complexity, it is assumed that there is no turn penalty so that consequence values are given by Equation (7). However, this assumption does not alter the essence of consequence value. 3.2 Consequence Values Relative to Particular Move Consequence values have so far been measured in absolute terms. They may not be most effective when their relative advantages (or disadvantages) need to be directly compared. Such a comparison can be facilitated by designating one particular move as the basis and express the consequence values of all other moves relative to it. This leads to another form of consequence value, here denoted as c(i, j, k , a) . Its formula is given below. c(i, j , k , a ) = c (i, j , a ) − c(i, k , a )
(9)
Clearly the derived value represents the excess cost in terms of attribute a incurred by taking arc (i, j ) instead of taking arc (i, k ) . Node k may be selected so that arc (i, k ) is the next segment of the route currently intended or recommended to follow. If this route coincides with a shortest path in terms of the same attribute, a, then c(i, j, k , a) is identical to the reduced cost defined in Equation (7). It may be equally useful to designate some other route (which may be optimal in terms of a different attribute) as the route for comparison. For instance, a driver who is currently following a fastest route may want to know how much gas will be saved if he makes a detour. In this case, a should be set to fuel consumption while arc (i, k ) remain a segment of the fastest route.
64
T. Shirabe
3.3 Consequence Values Relative to Extramural Value One can look at consequence values from a different reference point determined externally by translating them so that this point becomes the new origin. This process can be generalized to a linear transformation of c (i, j , a ) expressed by the following formula with two parameters α and β. c (i , j , a , α , β ) = α ⋅ c (i , j , a ) + β
(10)
We regard c(i, j , a, α , β ) as yet another variation of consequence value. The utility of this transformation varies depending on what attribute is chosen, as well as how the parameters are set. If the consequence value is measured in terms of time, one may set α to 1 and β to the current time. The resulting value indicates the expected arrival time if arc (i, j ) is taken. Alternatively, one may set α to −1 and β to the due arrival time minus the current time to see how much spare time one can have without failing to reach the destination in time if arc (i, j ) is taken. Those who are concerned about the availability of gas may set α to −1 and β to the amount of fuel currently stored in the tank. The resulting value indicates how much gas is expected to be left on the arrival at the destination if arc (i, j ) is taken. The value 0 or smaller is a warning that if you make that move, you will need to stop and refill the tank on the way. 3.4 Generalization of Consequence Values We conclude this section with a possible generalization of consequence values. While the shortest path length (or variations of it) is useful in a practical sense and efficient with respect to computational complexity, it is possible to see it just as one of many possible parameters that summarize (a subset of) the population of all routes starting with a certain move (Figure 4). Some of them are classified into two kinds: one concerning (sequences of) arcs and the other concerning nodes. An example of the former is the number of alternative routes of a certain length or shorter. An example of the latter is the number of points of interest reachable within a certain time.
Fig. 4. Population of routes (represented by an area bounded by a curve) associated with each move (represented by an arrow) from the current location (represented by a circle)
Information on the Consequence of a Move
65
However simple they may sound, some parameters would require a significantly large amount of computation. For example, to find the number of drug stores within a certain travel time after each move, fastest times need to be calculated from its corresponding arc to all drug stores. Although a shortest path algorithm runs relatively fast, it may not fast enough to catch up with the user’s speed of travel. An alternative may be to pre-compute shortest paths from all nodes to all other nodes in advance and store them in a database. If the attribute of interest is stable (e.g. geometric length), this may work as long as the database has a large enough capacity to store all the shortest paths and organizes them in an efficient structure such as “shortest path quadtree” [18] or “path oracle” [19] that allows quick access to all shortest paths from any chosen node.
4 Design of Route Improvisation Support System The method of computing consequence values is intended to be integrated into a system that supports route improvisation. This section describes a design of such a system. In doing so, the following scenario is used for ease of exposition. •
The user is a pedestrian and may move in both directions on any road segment so that all arcs are undirected. • Travel time is the only attribute of interest. This simplifies the notation: l (i, j ) abbreviates l (i, j , travel time) and all other symbols should be interpreted similarly. The system admittedly resembles an existing navigation system. Therefore, details will be given only to distinctive components, i.e., those that calculate and communicate consequence values. 4.1 Overall Structure Figure 5 is a schematic diagram showing the overall arrangement of one possible implementation of the system.
User Input Device
2
Database
3
1 7
5 Consequence Value Calculator
Optimal Path Finder
4
Location Detector
6
8
Output Device
9
Storage Medium
Fig. 5. A design of a route improvisation support system. The boxes represent components of the system and the arrows represent flows of data. Each data flow is numbered to facilitate its explanation in the text.
66
T. Shirabe
A database stores a digital map that includes at least a (pedestrian) network in which each arc is assigned the time it takes to walk through it. The map may additionally include other data, such as locations of landmarks, pictures of intersections, and points of interest, useful for supporting orientation, place recognition, and route improvisation. A location detector detects the current location of the user by using existing technology such as a global positioning system, an indoor sensor network, an odometer and a gyroscope. Through a user input device, the user inputs an identifier of a destination, e.g., a postal address or a place name. The database transforms the identifier to a location (coinciding with a node or a point on an arc) on the map. According to the initial location (arrow 1) and the selected destination (arrow 2), the database retrieves a portion of the map relevant to the present trip. The map portion should be sufficiently small so that the subsequent tasks will be completed in a reasonable amount of time but sufficiently large so that it is guaranteed to find a fastest path from every node that the user may go through on the way to the destination. Given the selected destination and retrieved map portion (arrow 3), an optimal path finder builds a tree of fastest paths rooted at the destination, and saves it in a storage medium (arrow 4). Route improvisation support may begin as soon as the algorithm finds fastest paths from all nodes within a certain proximity of the current location while the rest of computation is being performed. In response to the change of the user’s location detected by the location detector (arrow 5), a consequence value calculator takes a relevant portion of the fastest path tree from the storage medium (arrow 6) and arc travel times from the database (arrow 7) and calculates a consequence value of each possible move from the current location. The result, together with any relevant data (e.g. locations of landmarks and background images) taken from the database (arrow 7), is transmitted to an output device (arrow 8). The user can always use the user input device to send the consequence value calculator a command (arrow 9) to change the form of consequence values. 4.2 Calculation of Consequence Value Like a navigation system, it is important for a route improvisation system to provide the user with sought information in a timely manner in accordance with the user’s current location. A consequence value should be computed for each of the moves that are possibly made next. It, however, involves ambiguity or subjectivity in judging which moves qualify to be next moves. One way for automating this judgment relies on two variables, one representing the travel time from the current location to the head of the arc being traversed and the other representing the travel time from the current location to the tail of this arc. These variables are denoted by l ( x, i ) and ( x, h ) in Figure 6, and how they are used is described below. In reference to Figure 6, suppose that the user is currently located at location x and approaching a four-way intersection (node i). If l ( x, i ) does not exceed a predetermined threshold, that is, the current position is sufficiently close to node i, then possible next moves are going straight through i (x to node i to node j2), turning left at
Information on the Consequence of a Move
67
i (x to node i to node j1), and turning right at i (x to node i to node j3). Otherwise, going to node i (not beyond it) is considered to be the only such move. Similarly, l ( x, h) determines which backward moves (i.e. moves in the direction to node h) should be considered as possible next moves. j2 d(j2)
l(i,j2) d(j1)
d(j3)
d(i)
j1
j3
i l(i,j3)
l(i,j1) l(x,i) x
l(x,h)
d(k1)
d(k3)
d(h)
k1
k3
h l(h,k1)
l(h,k3)
l(h,k2)
k2 d(k2)
Fig. 6. Portion of a network near the user’s current location (represented by a circle labeled with x). The value associated with each node (represented by another circle) indicates the shortest path length (in terms of travel time) from that node to the destination, and the value associated with each arc (represented by a line segment) indicates the travel time of that arc. Note that arc (h,i) is dynamically divided into two arcs (x,i) and (x,h) as the user moves.
It is easy to turn the aforementioned rules and Equations (6)-(10) into a procedure for generating consequence values in accordance with the user’s location. An example below identifies all possible next moves from a given location x and calculates their consequence values relative to that of the optimal move. It can be easily adapted for other forms of consequence values. Note that all fastest path lengths d (⋅) were calculated prior to the trip and that threshold is a predetermined constant.
68
T. Shirabe
if l ( x, i ) ≤ threshold and l ( x, h) ≤ threshold then min := minimum of { l ( x, i ) + l (i , j ) + d ( j ) for all nodes j ( ≠ h ) ad-
∪
jacent to i} { l ( x, h) + l ( h, k ) + d ( k ) for all nodes k ( ≠ i ) adjacent to h} for each node j ( ≠ h ) adjacent to i c (i, j ) := l ( x, i ) + l (i, j ) + d ( j ) − min endfor for each node k ( ≠ i ) adjacent to h c ( h, k ) := l ( x, h) + l ( h, k ) + d ( k ) − min endfor else if l ( x, i ) ≤ threshold and l ( x, h) > threshold then min := minimum of { l ( x, i ) + l (i , j ) + d ( j ) for all nodes j ( ≠ h ) adjacent to i}
∪{ l ( x , h ) + d ( h ) }
for each node j ( ≠ h ) adjacent to i c (i, j ) := l ( x, i ) + l (i, j ) + d ( j ) − min endfor c ( x, h) := l ( x, h) + d ( h) − min else if l ( x, i ) > threshold and l ( x, h) ≤ threshold then
∪
min := minimum of { l ( x, i ) + d (i ) } { l ( x, h ) + l ( h, k ) + d ( k ) for all nodes k ( ≠ i ) adjacent to h} c( x, i) := l ( x, i ) + d (i) − min for each node k ( ≠ i ) adjacent to h c ( h, k ) := l ( x, h) + l ( h, k ) + d ( k ) − min endfor else min = minimum of { l ( x, i ) + d (i ) , l ( x, h ) + d ( h) } c( x, i) := l ( x, i ) + d (i) − min c ( x, h) := l ( x, h) + d ( h) − min
endif
As seen above, the computation of a consequence value requires only a few elementary operations. Therefore, the result should be immediately available and ready to be communicated to the user. 4.3 Communication of Consequence Values Here we present an example of how consequence values may be communicated through a graphical interface. It should be understood that it serves the purpose of illustration not of restriction. This is particularly so since navigational information is
Information on the Consequence of a Move
69
often more effectively communicated vocally than graphically [22], and this may be true for route improvisation support, too. The output devise has a screen on which different forms of consequence values can be displayed (Figure 7) in response to a command sent by the user through a keyboard, a touch screen, or any other form of medium. It is assumed that the user is currently approaching to an intersection from the south and has options of going straight through the intersection, turning left at the intersection, turning right at the intersection, and turning around immediately.
(b)
(a) 20 MINS
30 MINS
6:20 PM
25 MINS
6:30 PM
28 MINS
6:25 PM
6:28 PM
(c)
(d) ±0 MIN
+10 MIN
+8 MINS
+5 MINS
+10 MIN
+5 MINS
+8 MINS
Fig. 7. Graphical communication of consequence values. It is assumed that the user’s current location (denoted by a dot) is sufficiently close to the intersection located at the center and sufficiently far from the intersection partially seen at the bottom.
In Figure 7(a), a consequence value is placed on the road segment onto which its corresponding move turns. For example, the label “25 MINS” is associated with the move of turning right at the intersection and indicates that it will take 25 minutes to reach the destination if the right turn is made there. An answer to such a what-if question is given to all other moves. The figure also suggests that the optimal move is the
70
T. Shirabe
one going straight since it is labeled with the smallest value. If arrival time is crucial in improvising a route, the user may choose to translate these consequence values by the current time (assumed to be 6:00 PM in Figure 7(b)). As mentioned earlier, the user may find it convenient if consequence values are calculated relative to that of the optimal move. Figure 7(c) displays this form of consequence values, from which the user can quickly learn how much extra time will be incurred by each move. The optimal move is the one with the “±0 MIN” label, which could be replaced by a pictorial symbol like an arrow (Figure 7(d)). This implies that the proposed method may be integrated into an existing navigation system.
5 Conclusion The paper introduced a new concept of travel assistance that keeps the user informed of the consequence of each possible move from the current location and lets him/her improvise a path while traveling. It employs a method of assigning each move a single value called a “consequence value,” which answer a what-if question regarding that move, such as how long (in terms of a selected attribute) it takes to reach a destination if that move is made. A consequence value of a move can be seen as one of many possible parameters that characterize a set of routes following that move. Some parameters are easily derived from a shortest path tree rooted at the destination, which is computed by an all-to-one shortest path algorithm executed prior to the trip. Others may require an excessive amount of pre-trip computation or an excessive frequency of en-route computation. The paper also outlined a design of a route improvisation support system equipped with the proposed method. Since the system share many basic components with the conventional navigation system, it is possible to use the proposed method as an extension of an existing navigation system. Whichever type of implementation chosen, however, it might experience difficulties in communicating a plurality of consequence values (one for each possible move) to the user effectively. The difficulties multiply if the user wants to associate with each move multiple consequence values, which may be computed using different cost types, different computing formulas, and/or even different destinations. This imposes a serious design question of where to place consequence values dynamically on a limited-size screen, which resembles the problem of “dynamic map labeling” [2]. Even if technical issues as such were addressed, a fundamental question regarding the usability of a route improvisation support system would remain: whether the user is able and willing to take the amount of cognitive load the system imposes. In the case of a conventional navigation system, the user focuses on the task of following a prescribed sequence of directions (although, as discussed earlier, its execution is not that easy). On the other hand, a route improvisation support system does not make a decision for the user, but lets (and indeed makes) the user process provided information and make his/her own decision while traveling. Therefore, the usability of the proposed method and system must be tested empirically, which will certainly call for interdisciplinary research cooperation.
Information on the Consequence of a Move
71
References 1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: theory, algorithms and applications. Prentice Hall, Englewood Cliffs (1993) 2. Been, K., Nöllenburg, M., Poon, S.-H., Wolff, A.: Optimizing active ranges for consistent dynamic map labeling. Computational Geometry 43(3), 312–328 (2010) 3. Cadwell, T.: On finding minimum routes in a network with turn penalties. Communications of the ACM 4(2), 107–108 (1961) 4. Ellard, C.: You Are Here: Why We Can Find Our Way to the Moon, But Get Lost in the Mall. Doubleday, New York (2009) 5. Dehne, F., Omran, M.T., Sack, J.-R.: Shortest paths in time-dependent FIFO networks using edge load forecasts. In: Proceedings of the Second International Workshop on Computational Transportation Science, IWCTS 2009 (2009) 6. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959) 7. Fan, Y., Kalaba, R., Moore, J.: Arriving on time. Journal of Optimization Theory and Applications 127(3), 497–513 (2005) 8. Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics SSC4 4(2), 100–107 (1968) 9. Kamburowski, J.: A note on the stochastic shortest route problem. Operations Research 33(3), 696–698 (1985) 10. Kaufman, D.E., Smith, R.L.: Fastest paths in time-dependent networks for ivhs application. IVHS Journal 1, 1–11 (1993) 11. Kirby, R.F., Potts, R.B.: The minimum route problem for networks with turn penalties and prohibitions. Transport Research 3, 397–408 (1969) 12. Klippel, A., Tappe, H., Habel, C.: Pictorial representations of routes: Chunking route segments during comprehension. In: Freksa, C., Brauer, W., Habel, C., Wender, K.F. (eds.) Spatial Cognition III. LNCS (LNAI), vol. 2685, pp. 11–33. Springer, Heidelberg (2003) 13. Lovelace, K.L., Hegarty, M., Montello, D.R.: Elements of good route directions in familiar and unfamiliar environments. In: Freksa, C., Mark, D.M. (eds.) COSIT 1999. LNCS, vol. 1661, pp. 65–82. Springer, Heidelberg (1999) 14. Montello, D.R.: Navigation. In: Shah, P., Miyake, A. (eds.) The Cambridge Handbook of Visuospatial Thinking, pp. 257–294. Cambridge University Press, Cambridge (2005) 15. Orda, A., Rom, R.: Minimum weight paths in time-dependent network. Networks 21(3), 295–320 (1991) 16. Raubal, M., Winter, S.: Enriching wayfinding instructions with local landmarks. In: Egenhofer, M.J., Mark, D.M. (eds.) GIScience 2002. LNCS, vol. 2478, pp. 243–259. Springer, Heidelberg (2002) 17. Richter, K.-F., Tomko, M., Winter, S.: A dialog-driven process of generating route directions. Computers, Environment and Urban Systems 32(3), 233–245 (2008) 18. Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable network distance browsing in spatial databases. In: Proceedings of ACM SIGMOD Conference, Vancouver, Canada, pp. 43–54 (2008) 19. Sankaranarayanan, J., Samet, H., Alborzi, H.: Path oracles for spatial networks. In: Proceedings of the 35th International Conference on Very Large Data Bases (VLDB), Lyon, France, vol. 2, pp. 1210–1221 (2009) 20. Schmid, F.: Knowledge-based wayfinding maps for small display cartography. Journal of Location Based Systems 2(1), 57–83 (2008)
72
T. Shirabe
21. Sigal, C.E., Pritsker, A.A.B., Solberg, J.J.: The stochastic shortest route problem. Operations Research 28(5), 1122–1129 (1980) 22. Streeter, L.A., Vitello, D., Wonsiewicz, S.A.: How to tell people where to go: comparing navigational aids. International Journal of Man-Machine Studies 22, 549–562 (1985) 23. Wiener, J.M., Büchner, S.J., Hölscher, C.: Taxonomy of human wayfinding tasks: a knowledge-based approach. Spatial Cognition & Computation 9(2), 152–165 (2008) 24. Winter, S.: Modeling Costs of Turns in Route Planning. Geoinformatica 6, 345–361 (2002) 25. Ziliaskopoulos, A., Mahmassani, H.S.: Time-dependent shortest path algorithm for realtime intelligent vehicle highway system applications. Transportation Research Record 1408, 94–100 (1993)
The Effect of Activity on Relevance and Granularity for Navigation Stephen C. Hirtle1, Sabine Timpf2, and Thora Tenbrink3 1
School of Information Sciences, University of Pittsburgh, Pittsburgh, PA 15260 USA
[email protected] 2 Institute of Geography, University of Augsburg, Augsburg 86135, Germany
[email protected] 3 Transregional Collaborative Research Center on Spatial Cognition, University of Bremen, Bremen 28359, Germany
[email protected]
Abstract. This paper addresses the role of activity on the construction of route directions. Primary to our conceptualization is that the activity at hand constrains the relevance of spatial information for task performance, as well as the level of granularity at which information is needed. In this paper, we highlight the role of activity for relevance and granularity first based on a review of each of the components involved, and furthermore by a semantic analysis of content patterns in human-generated instructions. The analysis identifies the verbalization styles that are associated with distinct types of activities on the basis of individual keywords that may serve as indicators. We offer a strong theoretical argument for the importance of activities and provide a first step towards an operationalization of this concept, as well as implications for the development of cognitively motivated navigation systems. Keywords: Activities, granularity, relevance, navigation, routing, word clouds.
1 Introduction Spatial information theory has made great advances over the past two decades in delineating the ontological and cognitive structures of how humans perceive space. One focus of this line of research has been on the construction of useful and efficient navigational systems that guide users using cognitively rich frameworks, such as landmarks, neighborhoods, features, and navigational history [1-4]. To be successful in building such systems, it is critical to understand the task at hand, the knowledge that users bring to bear, the expectations that users have about the space, and the physical cues that the environment provides to the user [5-6]. The approach taken is representative of a more general problem, which is to identify theoretical and practical issues that highlight how humans represent spatial information. Consider the problem of navigating from your home to a new theater in the center of town. This rather common and mundane task might be seen as requiring a number of stages from determining the location of the new theater, selecting the mode (or modes) of transportation, and timing the travel through space so that you are not late. M. Egenhofer et al. (Eds.): COSIT 2011, LNCS 6899, pp. 73–89, 2011. © Springer-Verlag Berlin Heidelberg 2011
74
S.C. Hirtle, S. Timpf, and T. Tenbrink
Additional constraints, such as mixing the trip with dinner or shopping, might also be included if time allows. Primary to our conceptualization of the problem is that the activity at hand constrains the relevance of spatial information for task performance as well as the level of granularity at which information is needed [7]. For example, while biking to work and biking for leisure would require access to the same underlying data of bicycle-friendly paths and roads, the recommended route might be quite different as a result of the planned activity. For someone hiking in a mountainous environment, elevation information would be relevant for navigation, while this may not be the case for someone driving a car in the same environment [8]. Additionally, the granularity of instructions should vary with the knowledge of the user or other needs [9]. In a familiar environment, one may only need a brief indication of the route, while in an unfamiliar environment much greater detail is needed [2]. In these and many other ways, the task setting and activity in which the navigator is engaged lead to determinations of the level and structure of spatial instructions [10]. These components are not exhaustive, but can provide a rich foundation for the understanding of navigational tasks. In this paper we will highlight the role of activity for relevance and granularity first based on a review of each of the components involved, and furthermore by a semantic analysis of content patterns in humangenerated instructions. This analysis will characterize the verbalization styles that are associated with distinct types of activities on the basis of individual keywords that may serve as indicators. Finally, implications for future navigation systems are discussed.
2 Background In recent years, the investigation of route directions has increasingly aimed at a systematic differentiation of conceptual aspects determining the choice of spatial components to be represented. Many accounts have jointly achieved the identification of a relatively constant set of cognitive elements that are used as building blocks in route directions, including start and end point, route segments, action and movement descriptions, reorientations, landmarks, regions and areas, and distances [11-16]. Further research (as reported below) has highlighted different levels of granularity and an impact of considerations of relevance on the ways in which these elements are chosen and represented in a description. We argue that these various influences can be comprehensively captured by understanding the activity at hand. To substantiate this claim, we first review previous findings on relevance and granularity. 2.1 Relevance According to Sperber and Wilson [17], human cognition is generally tuned to a maximization of relevance. Humans draw from the perceptual input they receive just those bits of information that matter to them in some respect, and that relate to previous knowledge as well as current requirements, purposes, and needs. Navalpakkam and Itti [18] present a computational model of how task-dependent relevance directs visual attention focus with respect to scene perception,
The Effect of Activity on Relevance and Granularity for Navigation
75
demonstrating the conceptual bias posed by relevance already at a stage at which visually validated objective fact might have been expected. Fauconnier and Turner [19] propose such a cognitive bias towards maximal relevance to be one of several pervasive basic simplification mechanisms, which together serve to keep the available perceptual and conceptual complexity within manageable limits. Van der Henst et al. [20] demonstrate how relevance influences the ways in which indeterminate relational problems are solved by humans, namely by focusing on those solution paths that are potentially useful within a certain functional context. In wayfinding contexts, relevance can be considered as the kind of spatial information that people need to know in order to effectively navigate. Here one might ask what spatial cues individuals pull out of the environment to aid navigation. Intuitively, those spatial elements that are frequently mentioned in route descriptions as summarized above should generally be those elements that are considered by route givers as relevant for navigation. This assumption is supported by independent evidence; for instance, Janzen and Turennout [21] used fMRI to show increased attention and recall for objects that appear at decision points in a virtual reality navigational task. Since navigation differs according to context, considerations of relevance have also been considered in distinct ways. Within GIScience, relevance has been discussed by Purves and Jones [22] in the context of geographic information retrieval, Raper [2] in the context of information needs, and Reichenbacher [23] with regard to mobile services. However, to our knowledge, considerations of relevance have not been spelled out systematically across wayfinding or route description contexts, or integrated into any general theory of navigation. We propose that this can only be achieved via a systematic distinction of activity types. In particular, relevance is always a relative concept: spatial information is relevant for a specific purpose, i.e., within a particular activity context. Relevance determines the type of information to be provided at all in route descriptions. The next issue then concerns the precise way how this information is to be provided. This has been discussed in terms of granularity, which we turn to next. 2.2 Granularity It is a widely acknowledged fact that contexts determine the levels of granularity with which humans perceive and conceive of the world. Often, this concerns level of detail at hand; for instance, the extent to which a glass can be truthfully referred to as empty depends decisively on the context in which this reference becomes relevant [24]. Similarly, though quite independent of degree of detail, one and the same real-world entity can be conceptualized (and referred to) in various ways depending on current function [25]. Due to these widely recognized effects, Fonseca et al. [26] propose a framework for offering spatial information at various levels of granularity for geographic information systems. Timpf et al. [27, 28] outline how wayfinding processes are conceptually hierarchical and therefore require granularity transformations to allow for the diverse procedures ranging from conceptual planning to the fine motor execution of navigation. The need to consider variable granularity in route directions has been documented in a recent paper by Tenbrink and Winter [29], where they argue that the level of
76
S.C. Hirtle, S. Timpf, and T. Tenbrink
granularity provided in a description should vary with knowledge of the space. Their approach builds on both a long history in the communications literature that argued for efficient conversation [30] and experimental work that indicated that ideal directions were not overly wordy but provided key details for the navigation task [11, 31, 32]. Tenbrink and Winter [29] present a model of granularity that includes multilevel granularity in terms of both 1D (linear) granularity and 2D (areal) granularity. The approach is general enough to account for previous approaches to 1D granularity, such as chunking of a route into known segments [2, 9, 33] or the constructional units of Wunderlich and Reinelt [34], which represent the partitioning of the route into an orientation phase at the start, a travel phase, and an orientation phase at the destination. It also accounts for 2D granularity, such as destination descriptions of the form ‘head to airport’ [35]. By comparing directions generated by humans with those generated by web-based services, Tenbrink and Winter [29] found that human route directions were much more variable, e.g., in terms of less information along simple paths as opposed to more detailed information at complex decision points. Obviously, therefore, the choice of granularity level is influenced by previous knowledge. Notably, such knowledge is not to be considered as static. For instance, building on earlier work by Norman [36] and Kuipers [37], Timpf [38] argued that mobile devices require the negotiation between knowledge in the head (what do you know about the space), knowledge in the world (signage and other information that will facilitate navigation), and knowledge in the pocket (mobile device with instructions, images, or locational information). Within this context activities, such as planning, tracking and assessing can take place. Similar effects of task influencing granularity have also been found to apply in other contexts, independent of knowledge. Hölscher et al. [39] compared descriptions of one's own future route with descriptions of another person's potential route (such as a stranger in town asking for the way). They found that the imagined route traveller was provided systematically with more details about the spatial environment within each category of spatial information investigated (actions at decision points, paths, and landmarks at and between decision points). Moreover, the routes chosen differed according to task setting, indicating that the route network itself was perceived at a coarser level of granularity (i.e., more graph oriented) than for one's own preferred route. That addressees can influence the level of granularity in various ways was also found by Tenbrink et al. [40], who investigated map-based route instructions given to humans as compared to an automatic dialogue system. The dialogue system was consistently addressed on an incremental, turn-by-turn level of granularity, while instructions for humans switched back and forth between incremental and destinationbased descriptions. Altogether, again, the general activity in which spatial navigation is embedded appears to determine decisively how spatial information is conveyed, both with respect to which elements are included (relevance) and with respect to the level of detail at which they are described (granularity). We will now look at the notion of activity more closely. 2.3 Activity Navigation seldom is an end to itself if we disregard special types of navigation such as exploration or hiking. We usually journey because we need to be at some other
The Effect of Activity on Relevance and Granularity for Navigation
77
place to do something there that we can’t do here, such as shopping, working, learning, or meeting with someone. This means that the navigation process usually is embedded in some kind of activity. Depending on the activity and its purpose, different goals for the navigation process might become important, such as taking the most efficient mode of transportation, minimizing the cost, minimizing the effort in navigation, following the most scenic route, maximizing safety, learning about the history or architecture, and so on. One might even just minimize the amount of effort in thinking about the trip, e.g., out of habit many Americans will often just get in their car and not even consider using a bicycle or walking. From an ontological point of view, activities and tasks produce partitions of reality [41], where reality is composed of (1) those things that are relevant (the smaller, but very detailed, part) and (2) those things that are not relevant for the task at hand (the larger part). The activity leads to the relevant information being extracted at varying degrees of granularity. Four different examples are given below. a) A person who is headed to hospital to take a friend to the emergency room would most likely have a singular focus in mind and thus require or even want no other details than fastest and most direct route, while the casual visitor who is visiting a friend in the hospital might appreciate being offered different parking options at different prices. b) In changing mode of transportation (bus, tram, subway), the rider needs additional information, which ideally is in the form of signage at the exchange points. It is often easier to change to a more global mode (e.g., bus to subway) than to a more local mode (e.g, subway to bus), in part due to the number of options at the transfer point. c) In taking a bus from home to downtown, the main question is when do I need to get off and, if necessary, how do I signal the driver to stop. In contrast, subways are well-designed to indicate stops, which are less numerous than bus stops, and will automatically stop at all scheduled stations. GPS enabled buses in many jurisdictions are now much improved at announcing future stops along the route. d) Even in straight-forward travelling situations, there are often what Hirtle et al [42] called endpoint problems. That is, the destination may be clear, but the appropriate office, parking lot, entrance way, etc., may not be well-marked. This is particularly true when the final location has a generic address, such as One Microsoft Way. A conceptual framework to describe and distinguish activities and their constituents is Activity Theory [43, 44]. The idea of activity theory is that the human mind can only be understood within the context of human interaction with the (physical) world. This interaction is socially and culturally determined. In Human Computer Interaction (HCI) activity theory is often used when designing human-artifact interaction [45]. Activity theory further describes all human activities as hierarchical. Activity can be understood at three levels of analysis: activity, action or task, and operation. Activity contributes the purpose or motive for a collection of actions. Tasks are directed towards goals that contribute to or are related to the purpose of the activity. These goals can also be in conflict with each other. Tasks are combined from operations, which are adapted to emerging conditions depending on the goals of the actions.
78
S.C. Hirtle, S. Timpf, and T. Tenbrink Table 1. Examples of activities and their purposes, tasks and goals
visit a friend at the hospital
Purpose
take a friend to emergency room at the hospital get medical help fast
socialize
Task 1
drive your car to the hospital or call the ambulance
drive your car to the hospital
as fast as possible, fastest route
optional: take shortest path
Activity
Goal
Task 2 Goal
Task 3 Goal
park next to emergency room
park where available
nearest parking space
optional: least expensive
go to emergency room
go to main entrance
as fast as possible
find directory or information booth
go to friend's room
Task 4 Goal
try not to get lost
In Table 1, the example a) from above has been expressed within the framework of activity theory. The relevant information is determined in relation to the purpose and the derived goals of activities and tasks. As can easily be seen already here, the relevance of specific information such as the location of the emergency room can be inferred from the activity and its purpose – in the example on the left this information is highly relevant whereas it is completely irrelevant in the example on the right in Table 1. Granularity as derived from the activity seems less obvious. However, the sequences of tasks describe the activity at a more detailed level of information, i.e. at a higher granularity (see also [28]). Granularity will depend on both the purpose and the local complexity, where less detail may be required in certain situations and more detail in others. The granularity required in describing a route for a specific person or type of person depends on the assumed knowledge of that person and on the complexity of the environment [46] in which the activity is situated. Table 2. Activity Model of Wayfinding from Timpf (2005)
Activity
Wayfinding: Get from place A to place B
Tasks
Planning
Tracking
Assessing
Operations
Information gathering, find routes, determine constraints, determine complexity, produce instructions
Orienting, track location, compare to plan, orient yourself
Compare needed to planned time, assess instructions, determine complexity of routes
The Effect of Activity on Relevance and Granularity for Navigation
79
The notion of activity is a relative one. In our example above, the activity was to get your friend to the hospital and one of the tasks was to drive your car to the hospital. Now looking in detail at this task, we can again assume that “to drive your car to the hospital” can be seen as an activity and the tasks this requires might be planning your route, tracking where you are and assessing if your are fast enough. The execution of the plan, including the possibility of updating in transit, occurs through the set of planning, tracking and assessing tasks that are indicated in Table 2 taken from Timpf [38]. One distinction that may be necessary to make is the one where navigating is seen as a task within an activity (such as in the examples in Table 1) and where it is seen to be the activity itself (Table 2). In the cases of exploration, sailing, hiking, or jogging, navigation can be said to be an activity itself, whereas in the everyday cases, navigation often is a task to accomplish as part of some other activity. Altogether, these thoughts suggest that the consideration of activities should be decisive for the formulation of route directions, both with respect to the kinds of information to be included based on their relevance for the task at hand, and with respect to the level of detail in which this information is presented. In the following, we will provide insights gained by examining a corpus of route directions collected from the internet.
3 Analysis of Activity-Based Directions 3.1 Examples of Directions In order to examine the effects of granularity, relevance and activity on directiongiving, we chose to mine the Spatially-strAtified Route Directions (SARD) Corpus that was collected at Penn State University [47]. The corpus consists of 11,254 webpages, which contain human-generated route directions in English from the United States, United Kingdom, and Australia. The webpages are for a large variety of sites, such as parks, hospitals, county inns, restaurants, soccer fields, and so on. Many of directions include landmarks, counts, and corrections. For example, one set of directions includes the following segments: At the third red light, turn right onto Highway 14/206 (East Main Street). Go under the railroad trestle and at the second red light past the trestle, turn left onto South Washington Street. Turn left on Doster Street (if you reach the Autauga Creek Bridge, you have gone too far). The library is immediately to your right.
While the directions above are rather generic, there were also examples of directions that varied in terms of relevance and granularity dependent on the activity or location in mind. Overview first. The following example indicates the role of granularity in choosing a route. The webpage describes two choices in very general terms for a drive into Mexico. A “road log” gives detailed directions by mileposts, including where services can and cannot be found along the 120 km route.
80
S.C. Hirtle, S. Timpf, and T. Tenbrink
Two routes exist - the "Low Road" and the "High Road". The low road is more scenic but is prone to being washed out during the rainy season. The high road is less scenic but more reliable. During rainy seasons the upper road between San Rafael and Bahuichivo may be exceedingly muddy and impassable; river crossings on the lower road may also be impassable, especially in late afternoons and evenings when thunderstorms are most likely. … Most traffic is now using the lower road but the choice changes frequently and is seasonal. … Our road log gives details on each route Directions for visitors. Visitors to a location are often looking for more than just the fastest route, but might also want interesting alternatives that, in turn, provide a context to the space. For example, one set of walking directions from the United Kingdom states: Alternatively, take the 426-446 bus to Street Peter's Hospital. Alight at the bus stop as the bus leaves the hospital! Cross the road just before the roundabout. Take the small path next to the Runneymede sign then join the main pathway and head towards the Samsung building. On a nice day this is a pleasant 10 minute walk. As the path curves round you will see the Electronic Arts sign on the left. Follow the path over the lake. Reception is on the first corner of this hugely impressive modern building. These instructions suggest that on a nice day, it would be a rather pleasant walk on a series of small footpaths that pass some impressive modern architecture. Such details are not necessary, but are included to give the visitor to the location a sense of the area and information that can later be used for orientation. Directions to sports fields. Directions to sports fields provide an interesting challenge in that, while they are often near other landmarks, they are typically without a direct numerical address. That is, they are often behind a school or past a landmark. In addition, the directions often need to direct you in some detail to the parking lots. For example, these directions from Georgia include a number of orientation remarks to help you locate the fields as you approach them from the highway: Our main soccer complex is located 25 miles south of Hartsfield International Airport and is just off of I-85 South in Newnan, GA. If taking exit 47 off of I-85, go east at the bottom of the exit ramp. Go past the Home Depot and then you will pass the entrance to the Yamaha (both are on the left hand side of Hwy 34). Once past the Yamaha plant, the fields are on the left. Take a left at the next red light, which will be Walt Sanders Memorial Drive and will be right at the John Cullen Dodge Dealership. The soccer fields and parking lots are just behind the John Cullen Dodge. 3.2 Conceptual Analysis As the directions were written for different purposes, it is also possible to examine the verbalization styles that are associated with distinct types of activities. The first set of instructions above was for going to a library, which is a rather generic task. There are
The Effect of Activity on Relevance and Granularity for Navigation
81
other kinds of tasks that one might need navigational instructions for. As a first pass at constructing a theory of activities, we identified five different types of activities that are representative of a much larger set of possible activities. Each row of Table 3 lists a different activity in a general sense. These are (1) getting somewhere urgently, (2) enjoying the natural scenery, (3) taking an educational trip or sightseeing, (4) attending a sporting event or finding a sporting location, such as a soccer field, and (5) following a trail or route for exercise. While these are distinct activities as such, they share some basic features while contrasting fundamentally in others. For example, some activities (such as getting somewhere urgently) involve time pressure, while others (such as enjoying natural scenery and sightseeing) rather suggest the opposite, if the traveler wishes to spend time in an enjoyable way. Similarly, activities differ systematically with respect to the role of the path: for some activities the navigation itself is in focus for the traveler, while for others navigation is a mere necessity in order to reach some destination. The columns of Table 3 provide an intuitive characterization of some of these basic features. A plus sign (+) indicates it is a likely factor to include as a positive attribute in the directions, a negative sign (-) indicates it is a likely factor to include as a negative attribute, and an “o” indicates that it is unimportant for the category. Table 3. Attributes of directions (columns) versus the purpose of navigation (rows)
Getting somewhere urgently Enjoying natural scenery Educational trip / Sightseeing Attending sporting event Following trail for hiking or exercise
Time pressure
Beauty of landscape
Urban architecture
+
O
O
-
+
O
-
+
-
O
O
+
-
O
+
O
+
+
O
O
O
O
+
O
O
+
O
+
O
+
Effort
Focus on destination
Focus on the path
Note: + indicates a positive attribute, - indicates a negative attribute, and o indicates a neutral or unimportant attribute. See text for details.
From this analysis, one can start to identify likely keywords for each column. Intuitively, instructions positively focused on time pressure would include terms such as fast, fastest, quick, speed, rush hour, or traffic, while those negatively focused on time pressure might include terms such as leisure or stroll. Neutral directions would favor no particular word for this category. Thus, directions focused on getting you
82
S.C. Hirtle, S. Timpf, and T. Tenbrink
somewhere as quickly as possible would include phrases like “the fastest route” or “during rush hour”. In contrast, the phrase “as you stroll through” might appear with directions along natural trail for enjoying the natural scenery, indicating the opposite of time pressure. Positive terms for the beauty of the landscape would include lexical indicators such as beautiful, scenic, scenery, impressive, stunning. Positive terms for urban architecture would include interesting, innovative, impressive, architecture, or historic, while descriptions of natural scenery activities that tend to avoid buildings would be characterized by an absence of these terms. Terms for effort would include difficult, steep, effort, or careful, which people trying to reach a destination quickly might want to avoid, while people looking for exercise might seek just these indicators. Positive terms for focus on destination would include see, look for, or arrive at, while descriptions focusing on the path would normally not contain these terms. In contrast, positive terms for focus on path would include follow, enjoyable, nice route, or pleasant, which would be relatively irrelevant for descriptions focused on the destination. One can also look at the destination and how it might fit into the activity matrix shown in Table 3. That is, how do the directions to a hospital (typically a place to get to quickly), differ from the directions to a mountain-top country inn (where a more scenic route might be preferred). The database was mined to examine how human generated directions might vary with the activity that is planned. This was accomplished by looking at (1) keywords that might suggest different activities (e.g., landscape, architecture, history) and (2) constraints that can be imposed on navigation (e.g., avoid, fastest, difficult, walking, rush hour). 3.3 Tabular Analysis To get a sense of how the instructions vary across dimensions we counted the number of route descriptions that included various keywords that would represent the activities, constraints and modes of travel. Table 4 shows the number of webpages in the corpus that contained specific words or phrases. It turns out that some phrases, such as “rush hour”, are remarkably infrequent with only 17 pages containing that phrase. At the opposite end of the spectrum, there are words like “traffic” that appear 2608 times, often in terms of “turn right at the traffic signal” or “proceed through three traffic lights.” Keywords with over 1000 hits were disqualified from further processing. 3.4 Word Clouds To get a sense of the characteristics of groups of directions, we chose to summarize the set of documents using word clouds [48-50]. A sample of representative sets of directions from categories in the tables above were collected, ignoring the extraneous material on the websites about hours, services, and other non-navigational details. That is to say that while the entire website provided the overall context for the directions, the word clouds were based on the text in the directions alone.
The Effect of Activity on Relevance and Granularity for Navigation
83
Table 4. Counts of selected keywords grouped in general categories of use
Time Pressure Traffic 2608 Quick 865 Speed 466 Fast 388 ArriveAt 342 Fastest 46 RushHour 17 (Ͳ)Leisure 249 (Ͳ)Stroll 74
Beauty of Landscape Beautiful 665 Scenic 359 Landscape 194 Scenery 88 Stunning 74
Urban Architecture History Historic Architecture Innovative Interesting Impressive
Effort
Focus on Destination See 2899 Look 1582 Fields 614 Soccer 347 Arriveat 342 LookFor 820
Focus on Path Follow 6212 pleasant 359 enjoyable 50 easydrive 15
Careful Steep Effort Difficult Exercise
175 168 162 131 105
1669 752 79 62 59 43
Note: Words in italics were too general to serve any discriminatory purpose.
We began by looking at word clouds for some of the attributes identified in the matrices above. Contrasting directions under time pressure with directions for the beauty of the landscape, Figure 1 shows the word cloud for directions that include the word fastest, while Figure 2 shows the word cloud for directions that include the word scenic. The fastest cloud tends to be direction oriented with words like left, right, east, west, turn, proceed, traffic, and so on, whereas the scenic cloud added words like pleasant, follow, approximately, and just, indicating a more leisurely journey rather than just hard directions. One can also look at differences by country. In all cases, the fastest directions consist primarily of place names, highway names, and simple directional commands. Not surprising, the USA tends to interstate-based, with words such as exits and ramps, while the Australian and UK directions tend to road-based with words such as fork, towards, and along. For a more direct test of the role of activities in the relevance of spatial information, Figure 3 shows the word cloud for soccer. Typically in the US, these were directions for youth soccer leagues, directing parents to fields for competitions that are often located behind schools, in parks, and in other hard to find locations.
84
S.C. Hirtle, S. Timpf, and T. Tenbrink
Fig. 1. Word cloud for the purpose of Time Pressure (Fastest)
Fig. 2. Word cloud for the purpose of enjoying the Beauty of Landscape (Scenic)
This is in contrast to major sporting stadiums that would be highly visible and indicated through road signage from multiple directions. The word cloud in Figure 3 conveys a different feel than the two previous clouds with words like located, approximately, entrance, follow, onto, park, parking, etc. It appears that the directions emphasized endpoint problems of how to find the fields and where to park. As a final example, Figure 4 shows the word cloud for the word hospital, which was not part of the tabular analysis. In contrast to both scenic directions and soccer directions, the directions to hospitals are much more succinct. In part, this is due to the locations of hospitals and clinics, which are typically in more urban, or possibly suburban, settings and are often clearly identified. Figure 4 implies fairly basic directions with an emphasis on left and right turns and street names.
The Effect of Activity on Relevance and Granularity for Navigation
85
Fig. 3. Word Cloud for soccer, indicating increased use of words such as parking, approximately, follow, entrance
Fig. 4. Word Cloud for hospital, indicating very basic directions focus around turns and street names
4 Summary and Conclusions In this paper, we have shown how the activities influence the construction of route directions. Activities lead to a chosen granularity of information and to both the inclusion of relevant details and exclusion of irrelevant details. These three components, activities, granularity and relevance, in part, account for the difficulty in automatically generating directions. Consider for example any current automated route guidance system. There are at most a few options in personalizing the route chosen, such as selecting the fastest route or more scenic route, avoiding tolls, or setting a preference for road type. Note that these options affect only the route selection. We know of no automatic systems that, when choosing the most scenic route, also highlights additional information about the area or gives additional
86
S.C. Hirtle, S. Timpf, and T. Tenbrink
warnings about the difficulty of the turns. Instead, the route description settings are independent of the route selection settings. The argument in this paper is that these two aspects are in fact tied to each other in symbiotic ways. We have outlined the importance of activity types for differences in relevance as well as granularity levels within route directions. As a first step towards an operationalization of this general idea via a keyword search, we have suggested a range of potential lexical indicators of dimensions (such as speed or beauty) that are relevant for some activities (such as getting somewhere quickly) rather than others. We adopted the use of word clouds to give an overall feel for a large set of directions under different parameters. This analysis shows how word clouds can indicate the kinds of terms that intermingle for different kinds of directions. At the same time, it is rather cumbersome and there is a need to explore advance text mining and visualization techniques to show how groups of directions vary in complexity. Finally, the theory in Section 2 suggests that granularity can vary in directions in multiple and complex ways. At one level, coarse granularity is useful for planning activities by providing a general overview of the space. The example directions gave overall options in one case (the low or high road) and a general location in another (25 miles south of Hartsfield International Airport). At the same time, scenic directions often have a finer granularity to give visitors to the area a sense of the surrounding area. Overall, additional work is needed. This paper adds to a growing body of literature [e.g., 2, 7, 10, 11, 29] that argues for more ergonomic directions. Even if automated systems will never meet the standards set by human generated directions, it is still useful to delineate the differences. By doing so, a complete theory of the role of navigation in communication acts can be realized. Acknowledgments. The third author acknowledges funding by the DFG (German Science Foundation) for the SFB/TR 8 Spatial Cognition, projects I5-[DiaSpace] and I6-[NavTalk]. The first author acknowledges sabbatical support from the University Center for International Studies at the University of Pittsburgh and the Geoinformatics Program at the University of Augsburg.
References 1. Burnett, G.E.: “Turn right at the traffic lights”: The requirement for landmarks in vehicle navigation systems. The Journal of Navigation 53, 499–510 (2000) 2. Klippel, A., Hansen, S., Richter, K.-F., Winter, S.: Urban Granularities - A Data Structure for Cognitively Ergonomic Route Directions. GeoInformatica 13, 223–247 (2009) 3. Sarjakoski, L., Nivala, A.M.: Adaptation to Context—A Way to Improve the Usability of Mobile Maps. In: Meng, L., Zipf, A., Reichenbacher, T. (eds.) Map-Based Mobile Services, Theories, Methods and Implementations, pp. 107–123. Springer, Berlin (2005) 4. Schwartz, T., Stahl, C., Baus, J., Wahlster, W.: Seamless Resource Adaptive Navigation. In: Crocker, M., Siekmann, J. (eds.) Resource-Adaptive Cognitive Processes. Cognitive Technologies Series, pp. 239–265. Springer, Berlin (2010) 5. Frankenstein, J., Büchner, S.J., Tenbrink, T., Hölscher, C.: Influence of geometry and objects on local route choices during wayfinding. In: Hölscher, C., Shipley, T.F., Olivetti Belardinelli, M., Bateman, J.A., Newcombe, N.S. (eds.) Spatial Cognition VII. LNCS, vol. 6222, pp. 41–53. Springer, Heidelberg (2010)
The Effect of Activity on Relevance and Granularity for Navigation
87
6. Lynch, K.: The Image of the City. The Technology Press and the Harvard University Press, Cambridge, MA (1960) 7. Tenbrink, T., Winter, S.: Presenting spatial information: Granularity, relevance, and integration. Journal of Spatial Information Science 49 (2010) 8. Raper, J.: Geographic relevance. Journal of Documentation 63, 836–852 (2007) 9. Srinivas, S., Hirtle, S.C.: Knowledge based schematization of route directions. In: Barkowsky, T., Knauff, M., Ligozat, G., Montello, D.R. (eds.) Spatial Cognition 2007. LNCS (LNAI), vol. 4387, pp. 346–364. Springer, Heidelberg (2007) 10. Timpf, S.: Geographic activity models. In: Duckham, M., Goodchild, M.F., Worboys, M.F. (eds.) Foundations of Geographic Information Science, pp. 241–254. Taylor & Francis, London (2003) 11. Denis, M., Pazzaglia, F., Cornoldi, C., Bertolo, L.: Spatial discourse and navigation: An analysis of route directions in the city of Venice. Applied Cognitive Psychology 13, 145–174 (1999) 12. Habel, C.: Prozedurale Aspekte der Wegplanung und Wegbeschreibung. In: Schnelle, H., Rickheit, G. (eds.) Sprache in Mensch und Computer, pp. 107–133. Westdt. Verlag, Opladen (1988) 13. Couclelis, H.: Verbal directions for way-finding: space, cognition, and language. In: Portugali, J. (ed.) The Construction of Cognitive Maps, pp. 133–153. Kluwer Academic Publishers, Dordrecht (1996) 14. Denis, M.: The description of routes: A cognitive approach to the production of spatial discourse. Cahiers de Psychologie Cognitive 16, 409–458 (1997) 15. Tversky, B., Lee, P.: Pictorial and Verbal Tools for Conveying Routes. In: Freksa, C., Mark, D.M. (eds.) COSIT 1999. LNCS, vol. 1661, p. 51. Springer, Heidelberg (1999) 16. Allen, G.L.: Principles and practices for communicating route knowledge. Applied Cognitive Psychology 14, 333–359 (2000) 17. Sperber, D., Wilson, D.: Relevance—Communication and cognition. Basil Blackwell, Oxford (1986) 18. Navalpakkam, V., Itti, L.: Modeling the influence of task on attention. Vision Research 45(2), 205–231 (2005) 19. Fauconnier, G., Turner, M.: The Way We Think: Conceptual Blending and the Mind’s Hidden Complexities. Basic Books, New York (2002) 20. Van der Henst, J.-B., Sperber, D., Politzer, G.: When is a conclusion worth deriving? A relevance-based analysis of indeterminate relational problems. Thinking and Reasoning 8, 1–20 (2002) 21. Janzen, G., van Turennout, M.: Selective neural representation of objects relevant for navigation. Nature Neuroscience 7, 673–677 (2004) 22. Purves, R., Jones, C.: Geographic Information Retrieval (GIR). Computers, Environment and Urban Systems 30(4), 375–377 (2006) 23. Reichenbacher, T.: Geographic relevance in mobile services. In: Proceedings of the 2nd International Workshop on Location and the Web (LOCWEB 2009). ACM, New York (2009) 24. Smith, B., Brogaard, B.: A unified theory of truth and reference. Loqique et Analyse 43, 169–170, 49–93 (2003) 25. Hobbs, J.R.: Sketch of an ontology underlying the way we talk about the world. International Journal of Human–Computer Studies 43(5/6), 819–830 (1995) 26. Fonseca, F., Egenhofer, M.J., Davis, C., Câmara, G.: Semantic granularity in ontologydriven geographic information systems. Annals of Mathematics and Artificial Intelligence 36(1-2), 121–151 (2002)
88
S.C. Hirtle, S. Timpf, and T. Tenbrink
27. Timpf, S., Volta, G.S., Pollock, D.W., Egenhofer, M.J.: A Conceptual Model of Wayfinding Using Multiple Levels of Abstractions. In: Frank, A.U., Formentini, U., Campari, I. (eds.) GIS 1992. LNCS, vol. 639, pp. 348–367. Springer, Heidelberg (1992) 28. Timpf, S., Kuhn, W.: Granularity Transformations in Wayfinding. In: Freksa, C., Brauer, W., Habel, C., Wender, K.F. (eds.) Spatial Cognition III. LNCS (LNAI), vol. 2685, pp. 77–88. Springer, Heidelberg (2003) 29. Tenbrink, T., Winter, S.: Variable Granularity in Route Directions. Spatial Cognition and Computation 9, 64–93 (2009) 30. Grice, H.P.: Logic and conversation. In: Cole, P., Morgan, J. (eds.) Syntax and Semantics, vol. 3, pp. 41–58. Academic Press, New York (1975) 31. Allen, G.L.: From knowledge to words to wayfinding: Issues in the production and comprehension of route directions. In: Hirtle, S., Frank, A. (eds.) COSIT 1997. LNCS, vol. 1329, pp. 363–372. Springer, Heidelberg (1997) 32. Schneider, L.F., Taylor, H.A.: How do you get there from here? Mental representations of route descriptions. Applied Cognitive Psychology 13, 415–441 (1999) 33. Richter, K.-F.: Context-Specific Route Directions — Generation of Cognitively Motivated Wayfinding Instructions. In: DisKi 314 / SFB/TR 8 Monographs, vol. 3. IOS Press, Amsterdam (2008) 34. Wunderlich, D., Reinelt, R.: How to get there from here. In: Jarvella, R.J., Klein, W. (eds.) Speech, Place, and Action, pp. 183–201. John Wiley & Sons, Chichester (1982) 35. Tomko, M., Winter, S.: Pragmatic Construction of Destination Descriptions for Urban Environments. Spatial Cognition and Computation 9, 1–29 (2009) 36. Norman, D.A.: The psychology of everyday things. Basic Books, New York (1988) 37. Kuipers, B.J.: The ‘Map in the Head’ metaphor. Environment and Behavior 14, 202–220 (1982) 38. Timpf, S.: Wayfinding with mobile devices: decision support for the mobile citizen. In: Rana, S., Sharma, J. (eds.) Frontiers of Geographic Information Technology, pp. 209–228. Springer, London (2005) 39. Hölscher, C., Tenbrink, T., Wiener, J.: Would you follow your own route description? Cognition (in press) 40. Tenbrink, T., Ross, R.J., Thomas, K.E., Dethlefs, N., Andonova, E.: Route instructions in map-based human-human and human-computer dialogue: a comparative analysis. Journal of Visual Languages and Computing 21, 292–309 (2010) 41. Smith, B.: Ontological Imperialism. In: Talk Held at GIScience in Savannah, Georgia (2000) 42. Hirtle, S.C., Richter, K.-F., Srinivas, S., Firth, R.: This is the tricky part: When directions become difficult. Journal of Spatial Information Science 1, 53–73 (2010) 43. Leontiev, A.N.: Activity, consciousness, and personality. Prentice-Hall, Englewood Cliffs (1978) 44. Nardi, B. (ed.): Context and consciousness - activity theory and human-computer interaction. MIT press, Cambridge (1996) 45. Kaptelinin, V., Nardi, B., Macaulay, C.: The activity checklist: a tool for representing the ’space’ of context. Interactions, 29–39 (July/August 1999) 46. Heye, C., Timpf, S.: Factors influencing the physical complexity of routes in public transportation networks. In: Axhausen, K. (ed.) 10th International Conference on Travel Behaviour Research, ETH Zurich, Luzern (2003) (CD-ROM) 47. Zhang, X., Mitra, P., Xu, S., Jaiswal, A.R., Klippel, A., MacEachren, A.: Extracting route directions from web pages. In: Twelfth International Workshop on the Web and Databases, WebDB 2009 (2009)
The Effect of Activity on Relevance and Granularity for Navigation
89
48. Bateman, S., Gutwin, C., Nacenta, M.: Seeing things in the clouds: the effect of visual features on tag cloud selections. In: HT 2008: Proceedings of the Nineteenth ACM Conference on Hypertext and Hypermedia, pp. 193–202. ACM, New York (2008) 49. Viégas, F., Wattenberg, M.: TIMELINES Tag clouds and the case for vernacular visualization. Interactions 15, 49–52 (2008) 50. Gottron, T.: Document word clouds: Visualising web documents as tag clouds to aid users in relevance decisions. In: Agosti, M., Borbinha, J., Kapidakis, S., Papatheodorou, C., Tsakonas, G. (eds.) ECDL 2009. LNCS, vol. 5714, pp. 94–105. Springer, Heidelberg (2009)
I Can Tell by the Way You Use Your Walk: Real-Time Classification of Wayfinding Performance Makoto Takemiya1 and Toru Ishikawa2 1
Graduate School of Interdisciplinary Information Studies, The University of Tokyo
[email protected] 2 Center for Spatial Information Science, The University of Tokyo
[email protected]
Abstract. Wayfinding activities often pose difficulty, especially for people with poor spatial abilities. If wayfinding aides can take into account individual differences during navigation, targeted assistance may be able to improve wayfinding performance. To enable this, the performance of wayfinders must first be classified. This work proposes a novel method that uses a probabilistic scoring function to classify wayfinding performance using only information available in real-time during route traversal. Training data for the classifier was algorithmically generated as routes representing different levels of wayfinding performance. This approach was tested through an empirical study in which people with different abilities walked from a start to a goal. The results show that performance of wayfinders can be reliably classified into two groups–good and poor–and that this classification can be done using only information available during route traversal. Our results suggest that environmental structure plays an important role in wayfinders’ route choice. Keywords: navigation, route choice, individual differences, spatial cognition, spatial abilities.
1
Introduction
“I’m lost,” is a phrase often heard when engaged in a wayfinding activity. Despite humans’ advanced cognitive faculties, wayfinding tasks often pose considerable difficulty, as anyone who has travelled to an unfamiliar land can attest to. Wayfinding is not randomly navigating an environment, but is a purposeful activity to traverse from a starting point to a goal destination. Montello [23] differentiates wayfinding from locomotion by arguing that wayfinding reflects cognitive processes going on during navigation, whereas locomotion involves only activities of the sensory and motor systems. Thus analysis of wayfinding activities can arguably provide insight into how humans perceive and reason about space. Additionally, it can also be theorized that spatial abilities are likely to have a measurable effect on wayfinding performance. M. Egenhofer et al. (Eds.): COSIT 2011, LNCS 6899, pp. 90–109, 2011. c Springer-Verlag Berlin Heidelberg 2011
Real-Time Classification of Wayfinding Performance
91
To assist in wayfinding, maps, and more recently electronic devices that utilize the Global Positioning System (GPS), provide externalized spatial information to assist people navigating spatial environments. However, despite the cost of and advances in technology, Ishikawa et al. [16] showed that when compared with traditional maps, GPS devices can increase the time and distance to traverse a route, while decreasing the wayfinder’s configurational knowledge of the route travelled. Obviously technology is not being properly utilized in many cases. One possible reason for this may be the failure of many contemporary devices to adapt to the individual needs of the people using them. Ishikawa and Montello [17] showed that significant individual differences exist in configurational understanding of routes, which suggests that significant differences may exist in individual spatial capabilities (also see [12]). Since people have significant differences in acquiring spatial knowledge and understanding spatial relations, it is likely that these differences will express themselves during wayfinding tasks in the form of various errors or sub-optimal route choices. This, in turn, implies that people will need different assistance to prevent and/or correct wayfinding errors. In order to provide the assistance that people need, individual wayfinding abilities need to be classified. Once this is done, targeted assistance can be applied. Test-based methods exist to classify spatial abilities of individuals, such as a self-report sense-of-direction questionnaire [13], but these methods cannot be practically done while a route is being traversed. Also, it is unlikely that feasible electronic wayfinding assistants can require users to take a spatial ability test before use. Ideally, a classification of what kind of assistance a wayfinder needs would be done automatically, based on a user’s wayfinding performance. Of especial importance to providing wayfinding assistance is finding wayfinders who are more likely to make poor route choices or get lost. In any non-trivial environment, many viable routes from a starting point to a destination goal can be taken. However, there will naturally be some routes that can be considered sub-optimal due to demands on time or other limited resources (e.g., fuel, energy). People who take these sub-optimal routes are thus more likely to be in greater need of wayfinding assistance, given their quantitatively lower performance (with respect to resources used). Distinguishing between wayfinders who need help and those who do not is a good starting point for providing targeted wayfinding assistance. This classification should be done as soon as possible after a wayfinder begins traversing a route, in order to provide appropriate assistance. Toward this end, a real-time classification algorithm should be used to determine a wayfinder’s ability based on individual performance. The objectives of the present work were twofold: to explore the connection between spatial abilities and wayfinding performance, and to see if wayfinding performance can be reliably classified. In this paper we discuss an empirical study of spatial abilities and wayfinding performance, and present a novel approach to differentiating between those who need help in a wayfinding task versus those who do not, and performing this classification in real-time.
92
2 2.1
M. Takemiya and T. Ishikawa
Empirical Study Study Area and Routes
Our study took place in Nara, Japan, near the Kintetsu Nara train station and Nara Prefectural University. In that area, we selected two routes for participants to traverse. The terrain was completely flat and isolated enough from the station such that finding participants who had never been to the study area did not prove to be too challenging. The two routes were on opposite sides of the university, thus geographically isolated from each other. The first route was longer and in a more complex (cf. [8]) area than the second route. The shortest path between the start and goal points were 1050 m and 560 m, for the first and second routes, respectively. For each route, the goal was not visible from the starting point, or vice versa, and participants could physically only walk on the streets, since there were buildings on all sides of the roads and no open spaces. There was a large variety of small streets, however, requiring the participants to choose from among many possible routes. The shortest path for the first route contained 18 decision points (see Section 3.1), where participants had to choose from among two or more possible directions to walk in. The shortest path for the second route contained 8 decision points (including the start and goal points for both routes). 2.2
Participants and Design
Thirty participants (fifteen female) participated in our study, in return for monetary compensation. All participants navigated using only provided paper maps, printed from Google Maps, without any other navigational aides and they were all unfamiliar with the area where the experiment took place. 2.3
Testing Spatial Abilities
To assess participants’ spatial abilities, we asked them to take the Santa Barbara Sense-of-Direction (SBSOD) scale and the mental rotation test. The SBSOD scale consists of 15 Likert-type statements with a 7-point scale [13], where participants expressed their agreement to each statement by circling a number from 1 (strongly agree) to 7 (strongly disagree). Seven of the statements show good navigational abilities or tendencies, such as “I am very good at giving directions,” while the remaining eight concern poor navigational abilities or tendencies, such as “I have trouble understanding directions.” The test boasts a high internal consistency and test-retest reliability, and has been used in many studies as a measure of spatial ability. Hegarty et al. [13] showed that people who scored highly on this test were good at updating their orientation and location in space when traversing an environment, making this a reasonable metric to try to correlate spatial ability and wayfinding performance.
Real-Time Classification of Wayfinding Performance
93
The mental rotation test consists of 21 questions that required the participants to mentally rotate line drawings and identify matching drawings with different orientations. Unlike the SBSOD scale, the mental rotation test had a time limit of 6 minutes, requiring participants to react as quickly and accurately as possible. This test is often used in studies of map use in different environments [20]. 2.4
Procedure
At the beginning of the experiment, instructions were given (e.g., do not use your cell phone or other navigational aides during the experiment) and participants answered the SBSOD scale and the mental rotation test. They were then taken individually from the train station to the starting point of the first route. While facing to the north (map was also north-oriented by the experimenter), participants were given a single A4-size map of the area before traversing each route. All participants traversed the two routes in the same order. On each map, only the starting point and the goal were marked, and the maps were not allowed to be written on. Participants were instructed to walk toward the goal and to inform the experimenter when they think that they successfully reached the goal. The experimenter walked approximately 3 m behind the participants and observed their behavior, without providing any assistance. For the first route, if participants got lost and did not reach the goal after 20 minutes had passed, they were taken to the goal by the experimenter. For the second route, participants were given up to 15 minutes to reach the goal. Upon completion of the first route, all participants were taken to the second starting position along a predetermined, fixed path. It took approximately one hour to complete the written and wayfinding tasks.
3 3.1
Wayfinding Classification Decision Points
When analyzing human wayfinding activities, it is useful to consider decision points that wayfinders must traverse when navigating an environment. A decision point is a location in an environment, such as an intersection, where a person navigating has to decide among competing paths to continue their traversal of the environment. Since the wayfinder has to make a decision as to which path to take at a decision point, this requires spatial reasoning. Compared with decision points, wayfinders presumably perform less spatial reasoning between decision points, and so a route taken through an environment can be represented abstractly as a set of decision points encountered on the traversal. 3.2
Metrics
Armed with the computational abstraction of routes in terms of decision points, we next decided on what metrics to use to analyze wayfinding performance. In this work, we considered the following metrics:
94
M. Takemiya and T. Ishikawa
Length. The distance in meters of a given route. Number of turns. A turn was any change in bearing greater than 30◦ . Total angle turned. The angular sum of all changes in bearing along the route from the starting point, up to the current decision point being measured. Average edge length. The length divided by the number of turns plus one. Complexity. We defined route complexity the same as in [4,26], where the complexity of a route was calculated as the sum of the complexity of all decision points along the route. At each decision point, the angle of the incident branch from the previous to the current decision point, the number of branches, and the angles between them were calculated, and complexity was assigned based on heuristics (e.g., angles separated by less than 45◦ were assigned a predetermined complexity value). 3.3
Other Metrics
Specifically for analyzing routes traversed by participants, we also considered two time-related metrics: Time. The time in seconds required for the participant to traverse a route. The maximum allowed value was the time limit for each route. Speed. The average meters travelled per second. Stops. If a participant stopped moving for more than 30 seconds, for example, to study their map, this was recorded as a stop. 3.4
Synthetic Route Generation
In order for classification of wayfinders to be feasible given real-world constraints, we could not use training data from humans, since it is not possible to collect training data for every possible start and goal location for the entire world (nay, even for a single city). Instead, we implemented a heuristic-based method to synthetically generate routes that are likely to be similar to routes that humans would take. As explained in more detail in Section 3.6, since we used a conditional probabilistic scoring function for classification, even though our generated routes were not always perfectly plausible routes that humans would take, we still obtained good results. Since the goal of synthetic route generation was to generate training data for our probabilistic classifier, we needed to generate a large variety of different routes. At first we tried permuting a large number of possible routes from the graph of decision points and their connecting edges, but too many infeasible routes that no human would ever dream of taking were created, thus making it difficult to generate routes that were actually useful for classification. To get around this, we decided to start with a heuristic search algorithm as a baseline to find the shortest-path route and then modified it slightly to generate variations on that shortest route. We used the A* heuristic search algorithm [11], modifying it slightly, to create routes by searching for routes from the starting point to the goal point for each
Real-Time Classification of Wayfinding Performance
95
route used in our empirical study. When searching for the goal, at each decision point A* chooses the edge from the current point that has the lowest heuristic cost. We used Cartesian distance from the current decision point to the goal as the heuristic function, to judge the value of each decision point, with the algorithm trying to minimize distance travelled. Since at each iteration of A*, the algorithm chooses the next path to explore based on the available edges and their heuristic cost values, and since we wanted to create a good diversity of routes around the shortest route, we modified the algorithm so that as each edge was considered, there was a 10% chance that the edge would become “tabu” and thus unable to be used. This had the effect of randomly forcing the algorithm to take sub-optimal routes and created a nice spread where a majority of the generated routes hovered around the shortest route, but occasionally very long routes would also exist. In order to get a good variety of routes, we generated 250 routes. Due to the introduced randomness, both “poor” routes that diverged sharply from the shortest path and “good” routes that were close to the shortest path from start to goal points were generated. To separate the good from the poor, we then clustered the generated routes into two clusters. We used the KMeans++ [1] clustering algorithm with a predefined cluster size of two in order to cluster our synthetically generated routes. From the metrics described in Section 3.2, we examined all combinations of up to two metrics and found that the total angle turned as the metric for clustering provided the best results. Thus for the KMeans++ clustering, distance between routes was calculated based on the difference between the total angles turned, and cluster centers were simply a single total angle turned value. 3.5
Poor Route Generation
Since there was still not enough variation to capture all the poor routes that wayfinders sometimes took, even with randomness included in the synthetic route generation, we purposely created routes to be poor. We did this by inverting the distance heuristic in the A* routing algorithm. This inverse was done by finding the decision point furthest from the goal in our graph of decision points and edges, and then using that maximal distance to subtract all the heuristic values (cartesian distances) from. This had the effect that shorter routes from the goal would show a higher heuristic cost than longer routes, thus inverting the heuristic score. There are other ways this inversion could have been accomplished, but this was chosen as a simple method to avoid negative heuristic values for A*. Inverting the heuristic cost function was the only change that we made to the A* router to purposefully generate poor routes. We used the same method as before of randomly marking edges of the current decision point under consideration as tabu, 10% of the time, in order to create variation in the routes generated. We generated 500 routes. Since some of the poor routes generated were indeed good routes, because of the included randomness, we then compared each poor route generated to the calculated shortest route between the start and goal points. If more than half the
96
M. Takemiya and T. Ishikawa
Good
Poor
Goal
Goal
Start
Start
Fig. 1. Synthetically generated training routes for the classifier, for the first wayfinding route of our empirical study, after clustering and adding the generated poor routes. As can be seen, the good routes typically take more direct paths to the goal.
decision points overlapped or if the length of the generated route was less than 10% greater than the shortest path, the generated poor route was added to the cluster containing good routes, otherwise the route was added to the cluster of poor routes. The final routes generated for our method for the first wayfinding route of our empirical study are shown in Figure 1. Our method here of route generation only considered the length of routes, but future work may want to consider taking into account additional features, such as route complexity [4,8,26] or routing through regions that have similar complexities [25]. Techniques from the field of agent-based modeling could also be applied to synthetically generate routes. 3.6
Probabilistic Classification
The probability that a route belonged to a certain class was computed by summing up all the scores for each decision point. Scores were computed with a conditional probability function and the algorithm determined the class of decision points that was most closely associated by assigning a score to each decision point in a route. A route’s class was then evaluated based on the sum of the scores for all decision points. This is shown in the following equations, adapted from [7,22]. C eval(ri ) > 0 class(ri ) = (1) C otherwise eval(ri ) = score(dj ) (2) j
score(dj ) =
P (dj |C) − P (dj |C ) P (dj |C) + P (dj |C )
(3)
Real-Time Classification of Wayfinding Performance
97
Related to wayfinding, dj is the jth decision point on a route ri to classify. If a route’s score is greater than 0, it is a poor route (class C), otherwise it is good (C , compliment of C). A route’s score is defined as the sum of the scores of all its decision points. Decision point scores are calculated from Equation 3. P (dj |C) is a probability function that calculates the probability of decision point dj given class C. This is calculated by taking the frequency of a decision point dj in routes of a given class, and dividing it by the total number of decision points in the given class, multiplied by their respective frequencies. Thus the score will always be in the range [-1, 1]. For example, if class C represents good wayfinders and class C represents everyone else, if the sum of the scores for all decision points in a route is greater than zero, the route is in the good group. This is very easy to conceptualize and is one of the advantages of using probabilistic classification. Also, as will be discussed with respect to real-time classification, the scoring function used allows a great amount of leeway in dealing with missing information, since it can make a classification given as few as one decision point, albeit accuracy will suffer when not enough data are available. Since probabilistic classification is dependent on the generated routes in order to decide whether a given route is good or poor, the algorithm, without modification, cannot assign values to decision points that are not included in any of the synthetically generated routes used to train the classifier. This would happen if a wayfinder took an unusual route that deviated greatly from any of the variety of routes that were synthetically generated. In this case, it is fairly safe to say that the wayfinder is in need of some help and should thus be classified as poor. To facilitate this, we slightly modified the score function to assign a slightly negative weight to decision points that do not appear in any of the training data. Thus if a wayfinder were to deviate drastically from the synthetically generated routes, our algorithm is capable of making a reasonable classification. 3.7
Real-Time Classification
In order for classification of wayfinders to be useful, it needs to take place in realtime, while a wayfinder is navigating. By “real-time classification,” what we mean is that given only data from the starting point up until the current point in space that a wayfinder has traversed, a classification of wayfinding performance can be made. We accomplished this using the same method of conditional probabilistic classification as discussed in Section 3.6. Even though some data are needed to obtain an accurate classification, this can still be done in real-time while a wayfinder is traversing a route. For many cases it is expected that a reasonably accurate prediction can be obtained after a participant has traversed only a small percentage of a route (see Section 4.6). We simulated real-time classification by taking traversal data from our empirical study and limiting the data available for classification to mimic a real-time situation.
98
3.8
M. Takemiya and T. Ishikawa
Participant Labeling Based on Wayfinding Performance
One of the problems of determining the performance of our classifier is not having ground truth labels that say whether or not a participant’s route traversal is good or poor. A human looking at the data can judge which routes appear to be better than others, but this is not necessarily a repeatable criteria for determining performance. To test the efficacy of our classification method, we labeled participants as having poor performance if they: 1. Failed to reach the goal. 2. Took a route that involved less than half of the decision points located along the shortest route.
Route 1
Good Wayfinders
Poor Wayfinders
Goal
Goal
Start
Route 2
Good Wayfinders
Start
Start
Poor Wayfinders
Goal
Start
Goal
Gray Buildings © 2008 Zenrin © 2011 Zenrin © 2010 Google
Fig. 2. Route traversals for all participants. Section 3.8 explains good and poor labels.
Meeting either of these conditions resulted in a participant’s traversal of a route in the experiment being labeled “poor,” otherwise a participant’s traversal was labeled as “good.” This label was called the “ground truth,” and is abbreviated GT in the following analysis and discussion.
Real-Time Classification of Wayfinding Performance
99
It should be noted that these criteria, although reasonable given the structure of the two routes in our experiment, are somewhat arbitrary and are by no means universal criteria for labeling wayfinding performance, though for this study, we determined that these criteria produced labels that seemed correct. This highlights the need to quantitatively evaluate a person’s route traversal, but due to the somewhat fuzzy nature of this evaluation, this is not likely to be a trivial task; thus we did not attempt to solve this problem definitively. Our classifications of participants for both routes are shown in Figure 2, so we will let the reader judge our attempt at labeling the performance of wayfinders.
4 4.1
Results Spatial Ability Test Results
For the SBSOD scale, answers for statements showing good abilities were reversed so that high scores corresponded to better spatial abilities. After this was accomplished, SBSOD scores ranged from 2.2 to 6.2, with a mean of 3.9. It should be noted that the lowest and highest possible scores for the SBSOD test are 1 and 7, respectively. The mental rotation test was scored by giving one point for each correctly identified item and subtracting one point for each incorrectly identified item, and the scores ranged from -3 to 42, with a mean of 28.6. Of the 30 participants in our study, only 14 finished answering all the questions on the mental rotation test within the 6-minute time limit. 4.2
Route Performance
Traversal data from all participants are shown in Figure 2. Participants’ times on the first route ranged from 10 minutes and 20 seconds to 20 minutes, with a mean of 14 minutes and 54 seconds. For the second route, traversal times ranged from 5 minutes and 52 seconds to 15 minutes, with a mean time of 7 minutes and 59 seconds. For both routes, 28 of 30 participants successfully reached the goal. Those who did not reach the goal successfully used the fully allotted time of 20 and 15 minutes, respectively, for the first and second routes. Traversal lengths ranged from 1050 to 1976 m, with a mean of 1229 m for the first route. For the second route, participants’ traversal lengths ranged from 560 to 1412 m, with a mean of 645 m. Looking only at the differences in traversal lengths and times, it is apparent that profound individual differences exist in wayfinding performance. For the first route, 21 participants had the ground truth label of good, 9 poor. For the second route, 16 were good, 14 poor. Half of all the participants (15) had the same ground truth label for both routes. The first route required participants to travel much farther (1050 versus 560 m, for the shortest routes). The average complexity values of the participants’ traversals were 3.81 and 3.13, respectively, for the first and second routes (a difference of over 20%), even though the first route was almost twice as long, for the shortest route. Good and poor wayfinders for the first route had an average traversal length of 1168 m and 1396 m, respectively. For the second route, good wayfinders travelled an average of 577 m, while poor wayfinders travelled 722 m.
100
4.3
M. Takemiya and T. Ishikawa
Metric Correlations
From the empirical data from our 30 participants, we computed the Pearson correlation between all of our metrics. The results are shown in Figure 3.
Fig. 3. Metric correlations. Non-white squares are significantly correlated p < .05.
Our results show the only significant correlations including the SBSOD scale were with average speed of traversal and, in the case of route 1, with time. The ground truth scores were significantly correlated with time, but not speed. The lack of significant correlations between the mental-rotation score and any other metric was somewhat surprising, as the wayfinding task involved map reading. Total angle turned for route 2 was significantly negatively correlated with its corresponding ground truth (p < .01), but this was not the case with route 1 and its ground truth. This significant correlation for the second route between
Real-Time Classification of Wayfinding Performance
101
the total angle turned and the ground truth, may show support for a strategy of minimizing deviation from the perceived goal direction [6,15]. The reason that this was not significantly correlated with the first route is likely due to structural differences between the two routes. Frankenstein et al. [9] discussed that wayfinders have a preference for longer lines of sight as well as higher numbers of visible branching paths. For the second route it is likely that wayfinders could get longer lines of sight while minimizing their angle turned. However, the first route’s environment likely precluded wayfinders from achieving both these criteria without taking a longer, more arduous traversal to the periphery, where participants could walk in straighter lines. Also, in support of this, the average edge length is significantly negatively correlated with the ground truth score for route 1, but positively correlated for route 2 (p < .01 for both). This shows that for route 1, better wayfinders took shorter average edges before turning, whereas for route 2, good wayfinders took longer edges. The average edge length metric does not necessarily take into account actual line of sight in the environment, but comparing the first and second route environments, the environment of the first route seems to have more short roads compared to the second environment. Route complexity was significantly correlated with ground truth performance for the second route (p < .01), but not the first, thus further suggesting the extent to which the environments for routes 1 and 2 were different. The positive correlation shows that better wayfinders took more complex traversals for the second route. 4.4
Measuring Classification Performance
In order to evaluate our wayfinding performance classifiers, we used precision, recall, and F-score, common metrics in information extraction. Precision quantifies “how precise,” or accurate, the results are, and is defined as:
precision =
# correctly classified routes # correctly classified + # incorrectly classified routes
(4)
Recall measures “how many” out of the total number of routes that are labeled with a category are correctly classified as that category (e.g., good and poor). Recall is defined as: recall =
# correctly classified routes # routes in the category
(5)
Since precision and recall are often inversely related to each other, the harmonic mean between the two is computed. This is called the F-score and is a good overall measure of the performance of the classifier: F-score =
2 ∗ precision ∗ recall precision + recall
(6)
102
4.5
M. Takemiya and T. Ishikawa
Probabilistic Route Classification
Before attempting to classify route traversals in real-time, we first used probabilistic classification to classify complete routes from our participants. For the good and poor classifications, we based the correctness of the classification on the SBSOD score and ground truth labels. Our threshold score for the SBSOD score was 4.0 (inclusive; the midpoint of the 7-point scale), up to and including which, participants were classified as having a poor ability, and thus more likely in need of assistance when navigating environments. Scores above 4.0 were considered to be good. The “GT good” and “GT poor” labels were determined as in Section 3.8. F-scores from the overall classification, averaged over 100 runs, with respect to good, poor, GT good, and GT poor, are shown in Figure 4. The results with respect to the SBSOD score were fairly poor. F-scores for the poor classification never rose above 0.55, while the good classification was 0.65 and 0.54 for the first and second routes, respectively, which is not much higher than chance. Performing the same classification with respect to the GT labels yielded Fscores of 0.99 for the first route and 0.97 for the second route, for both good and poor classifications. Thus if the GT labels are accepted as the measure of wayfinding performance, the results demonstrate the feasibility of using a conditional probabilistic scoring function to classify wayfinding performance. Precision
Recall
F-Score
1 0.9 0.8 0.7 0.6 0.5 0.4 0.3 0.2 0.1 0
Poor
Good
GT Poor
Route 1
GT Good
Poor
Good
GT Poor
GT Good
Route 2
Fig. 4. Classification of complete routes traversed by participants. Results are averaged from 100 runs of the program.
4.6
Real-Time Probabilistic Route Classification
Figure 5 shows the results of our real-time route classification. As with the overall route classification, the classification with respect to GT outperformed classification with respect to the SBSOD scale. Whereas overall classification used all the decision points from participants’ traversals, the real-time classification used only decision points from the starting point up to the current point where the classification was performed. We simulated real-time by taking the participants’
-:JVYL=HS\L
+LJPZPVU7VPU[Z
+LJPZPVU7VPU[Z
9V\[L9LHS;PTL*SHZZPÄJH[PVU^Y[.YV\UK;Y\[O
-:JVYL=HS\L -:JVYL=HS\L
5\TILYVM7HY[PJPWHU[Z 5\TILYVM7HY[PJPWHU[Z
+LJPZPVU7VPU[Z
9V\[L9LHS;PTL*SHZZPÄJH[PVU^Y[.YV\UK;Y\[O
+LJPZPVU7VPU[Z
9V\[L9LHS;PTL*SHZZPÄJH[PVU^Y[:):6+
Fig. 5. Real-time route classification. The x-axis numbers the nth decision point, where only decision points 1 to n are classified. The bars show the number of participants to classify at each iteration, which decreases as participants reach the goal and stop their traversals. Plotted F-scores are averaged from 100 runs.
-:JVYL=HS\L
5\TILYVM7HY[PJPWHU[Z 5\TILYVM7HY[PJPWHU[Z
9V\[L9LHS;PTL*SHZZPÄJH[PVU^Y[:):6+
Real-Time Classification of Wayfinding Performance 103
104
M. Takemiya and T. Ishikawa
routes and iterating through all the decision points used, starting at the first point and continuing until the maximum point (35 and 25, for the first and second routes, respectively) was reached. Since some participants took routes with fewer decision points than others, Figure 5 also shows the number of participants classified at each iteration, as the bar graph behind the F-score line graphs. After several decision points were available, classification performance increased and was comparable to the overall classification results (Figure 4). Again, classification with respect to the SBSOD scale was poor, but the GT classification became very good after three decision points for the first route and seven decision points for the second route. As participants began to finish (and thus were no longer classified), the classification performance became more erratic and was no longer consistently good, although the performance even