Simplest Instructions: Finding Easy-to-Describe Routes for Navigation

8 years 3 months ago
Simplest Instructions: Finding Easy-to-Describe Routes for Navigation
Abstract. Current applications for wayfinding and navigation assistance usually calculate the route to a destination based on the shortest or fastest path from the origin. However, numerous findings in cognitive science show that the ease of use and communication of route instructions depends on factors other than just the length of a route, such as the number and complexity of decision points. Building on previous work to improve the automatic generation of route instructions, this paper presents an algorithm for finding routes associated with the “simplest” instructions, taking into account fundamental principles of human direction giving, namely decision point complexity, references to landmarks, and spatial chunking. The algorithm presented can be computed in the same order of time complexity as Dijkstra’s shortest path algorithm, O(n2 ). Empirical evaluation demonstrates that the algorithm’s performance is comparable to previous work on “simplest paths,” with an ave...
Kai-Florian Richter, Matt Duckham
Added 09 Nov 2010
Updated 09 Nov 2010
Type Conference
Year 2008
Authors Kai-Florian Richter, Matt Duckham
Comments (0)