A fewest-turn-and-shortest path algorithm based on breadth-first search

Abstract

Many cognitive studies have indicated that the path simplicity may be as important as its distance travelled. However, the optimality of paths for current navigation system is often judged purely on the distance travelled or time cost, and not the path simplicity. To balance these factors, this paper presented an algorithm to compute a path that not only possesses fewest turns but also is as short as possible by utilizing the breadth-first-search strategy. The proposed algorithm started searching from a starting point, and expanded layer by layer through searching zero-level reachable points until the endpoint is found, and then deleted unnecessary points in the reverse direction. The forward searching and backward cleaning strategies were presented to build a hierarchical graph of zero-level reachable points, and form a fewestturn-path graph (G*). After that, a classic Dijkstra shortest path algorithm was executed on the G* to obtain a fewestturn-and-shortest path. Comparing with the shortest path in Baidu map, the algorithm in this work has less than half of the turns but the nearly same length. The proposed fewest-turn-and-shortest path algorithm is proved to be more suitable for human beings according to human cognition research.

Congklak, a traditional game solution approach with breadth first search

“…The searching procedure with BFS algorithm is a searching perform by visiting each node systematically at each level until the goal state is found [9,10,12,13] a) Granary-1: 6, 2 congklak seeds are already in granaries 2, and the granaries 3 and 1 of the granary 3 are in this section b) Granary-2: 8, 1 seed granary 3 is in this section c) Granary-3: 7 Game congklak will be an order X x Y so that users can determine their own desired order. In the order X x Y, 2 boxes will be used by the starting point and point of destination, the rest to produce a path to look the path that will ultimately determine the shortest path to the destination point.…”

“…The BFS algorithm [10,11] describes the problemsolving process which must take every best decision at each step by visiting each node of the tree that is likely to be the optimal solution for completion of congklak games.…”

The impact of urban road network morphology on pedestrian wayfinding behaviour

“…Fewest Turns strategy: [13] observed that the fewest turns strategy is the most popular wayfinding strategy and ranked it just after shortest distance and least time criteria. [46] developed modified wayfinding algorithms based on this heuristic. Pedestrians tend to choose routes involving the fewest number of turns that result in so called simpler routes, since turns involve decision making and increased cognitive effort.…”

Integrating Human Behavior and Safety Measure into Evacuation Route Planning in a Volcanic Crisis

“…Such a perception is often constructed by heuristics and distorted by human's limited knowledge of geographical landmarks. For instance, several studies have found that people perceived a path to be cognitively shorter if it had fewer turns, even if the physical distance traversed was longer [8,9,10]. In many navigation systems, cognitive distance has also been included to minimize instructions' complexity [11].…”