Infrastructure Engineering - Research Publications

Permanent URI for this collection

http://hdl.handle.net/11343/347

Filters

2003 1
1
Reset filters

Settings
Statistics
Citations
End date: 2009 × Type: Book Chapter × Author: Kulik, Lars × Subject: wayfinding ×

Search Results

Now showing 1 - 1 of 1
  • Item
    Thumbnail Image
    "Simplest" paths: automated route selection for navigation
    DUCKHAM, MATT ; KULIK, LARS (Springer, 2003)
    Numerous cognitive studies have indicated that the form andcomplexity of route instructions may be as important to human navigatorsas the overall length of route. Most automated navigation systemsrely on computing the solution to the shortest path problem, and not theproblem of finding the “simplest” path. This paper addresses the issueof finding the “simplest” paths through a network, in terms of the instructioncomplexity. We propose a “simplest” paths algorithm that hasquadratic computation time for a planar graph. An empirical study ofthe algorithm’s performance, based on an established cognitive model ofnavigation instruction complexity, revealed that the length of a simplestpath was on average only 16% longer than the length of the correspondingshortest path. In return for marginally longer routes, the simplest pathalgorithm seems to offer considerable advantages over shortest paths interms of their ease of description and execution. The conclusions indicateseveral areas for future research: in particular cognitive studies areneeded to verify these initial computational results. Potentially, the simplestpaths algorithm could be used to replace shortest paths algorithmsin any automated system for generating human navigation instructions,including in-car navigation systems, Internet driving direction servers,and other location-based services.