"Simplest" Paths: Automated Route Selection for Navigation

Numerous cognitive studies have indicated that the form and complexity of route instructions may be as important to human navigators as the overall length of route. Most automated navigation systems rely on computing the solution to the shortest path problem, and not the problem of finding the “simplest” path. This paper addresses the issue of finding the “simplest” paths through a network, in terms of the instruction complexity. We propose a “simplest” paths algorithm that has quadratic computation time for a planar graph. An empirical study of the algorithm’s performance, based on an established cognitive model of navigation instruction complexity, revealed that the length of a simplest path was on average only 16% longer than the length of the corresponding shortest path. In return for marginally longer routes, the simplest path algorithm seems to offer considerable advantages over shortest paths in terms of their ease of description and execution. The conclusions i...

• Type: Conference
• Year: 2003
• Where: COSIT
• Authors: Matt Duckham, Lars Kulik
• Keywords: COSIT 2003, Paths Algorithms, Shortest Paths, Simplest Paths