.png){kind=icon}
.png){kind=icon}
Return
Roaming Navigation: Diverse Constrained Paths Using Heuristic Search
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2023.3295830.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Navigation has become an indispensable technology, especially when exploring unfamiliar environments. However, the existing shortest route-based navigation systems only focus on route effectiveness, which may deprive users of the opportunity to explore new areas. Hence, there is a need for a new navigation service that enriches our walking activities and maximizes their benefits in our daily lives by stimulating our natural tendency to explore. In this paper, we revisit navigation services from two orthogonal technological perspectives: 1) navigation using non-shortest routes; and 2) navigation across multiple days. Based on these two perspectives, we explain the relationship among related studies and develop a new heuristic search-based method to create diverse multiday routes. This could help construct a new navigation service to increase the graph roaming entropy values on those generated routes.
Keywords:
Heuristic search
pedestrian navigation
roaming entropy