TY - GEN
T1 - A multiple cyclic-route generation method for strolling based on point-of-interests
AU - Nishimura, Tensei
AU - Ishikawa, Kazuaki
AU - Takayama, Toshinori
AU - Yanagisawa, Masao
AU - Togawa, Nozomu
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018/12/13
Y1 - 2018/12/13
N2 - With the spread of map applications, route generation has become a familiar function. Most of route generation methods search a rapidly movable route to a destination, but more enjoyable route generation is recently focused on. Particularly, cyclic-route generation for strolling requires to suggest to a user more than one route passing through several POIs (Point-of-Interests), to satisfy the user's preferences as much as possible. In this paper, we propose a multiple cyclic-route generation method for strolling based on POIs. Firstly, our proposed method finds out a set of reference points based on the route length constraint. Secondly, we search a non-cyclic route from one reference point to the next one and finally generate a cyclic route by connecting these non-cyclic routes. Compared with previous methods, our proposed method generates a cyclic route closer to the route length constraint, reduces the number of the same points passing through by more than 80%, and increases the number of passing through POIs to approximately 1.24 times.
AB - With the spread of map applications, route generation has become a familiar function. Most of route generation methods search a rapidly movable route to a destination, but more enjoyable route generation is recently focused on. Particularly, cyclic-route generation for strolling requires to suggest to a user more than one route passing through several POIs (Point-of-Interests), to satisfy the user's preferences as much as possible. In this paper, we propose a multiple cyclic-route generation method for strolling based on POIs. Firstly, our proposed method finds out a set of reference points based on the route length constraint. Secondly, we search a non-cyclic route from one reference point to the next one and finally generate a cyclic route by connecting these non-cyclic routes. Compared with previous methods, our proposed method generates a cyclic route closer to the route length constraint, reduces the number of the same points passing through by more than 80%, and increases the number of passing through POIs to approximately 1.24 times.
KW - Point-of-Interests
KW - cyclic-route generation
KW - multiple routes
KW - the route length constraint
UR - http://www.scopus.com/inward/record.url?scp=85060312946&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85060312946&partnerID=8YFLogxK
U2 - 10.1109/ICCE-Berlin.2018.8576185
DO - 10.1109/ICCE-Berlin.2018.8576185
M3 - Conference contribution
AN - SCOPUS:85060312946
T3 - IEEE International Conference on Consumer Electronics - Berlin, ICCE-Berlin
BT - 2018 IEEE 8th International Conference on Consumer Electronics - Berlin, ICCE-Berlin 2018
PB - IEEE Computer Society
T2 - 8th IEEE International Conference on Consumer Electronics - Berlin, ICCE-Berlin 2018
Y2 - 2 September 2018 through 5 September 2018
ER -