Landmark and Branch-based Pedestrian Route Complexity and Selection Algorithm

Pedestrian route is an important part in human wayfinding and navigation tasks. The routes with many decision points and branches will spend pedestrian much time on spatial decisions. This paper proposes a landmark and branch-based pedestrian route complexity and selection algorithm, in which landmarks are included to reduce the complexity of route and help people to confirmroute choice decisions. Results show that this algorithm can balance the three objectives: travel distance, route complexity and the number of landmarks. Compared to the shortest route, the selected route of this algorithm has lower complexity and higher landmark density.