DocumentCode :
175457
Title :
Unifying constraint satisfaction and recommendation for amusement park navigation
Author :
Ohwada, Hayato ; Igarashi, H. ; Tanaka, T. ; Nishiyama, Hiroki
Author_Institution :
Fac. of Sci. & Technol., Tokyo Univ. of Sci., Noda, Japan
fYear :
2014
fDate :
May 31 2014-June 2 2014
Firstpage :
341
Lastpage :
345
Abstract :
Unlike conventional traveling salesman problems (TSPs) for transportation, amusement park navigation using a smart phone needs both efficiency and preference for personal adaptation. In addition, a dynamic treatment for waiting time estimation and reservation ticket use should be incorporated into a minimum path finding algorithm. This study attempts to unify an optimization method and recommender system facility for real-time support in Tokyo Disneyland navigation. We have developed a smart phone web application in which users select attractions, and then the application suggests reasonable and enjoyable routes. The experiment was conducted to demonstrate the novel functionality and performance of the proposed application.
Keywords :
Internet; computerised navigation; constraint satisfaction problems; smart phones; traffic engineering computing; travelling salesman problems; Tokyo Disneyland navigation; amusement park navigation; constraint satisfaction; minimum path finding algorithm; optimization method; personal adaptation; recommender system facility; reservation ticket usage; smart phone Web application; traveling salesman problems; waiting time estimation; Cities and towns; Global Positioning System; Heuristic algorithms; Planning; Servers; Smart phones; Constraint satisfaction; Navigation; Recommendation; Route planning;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Control and Decision Conference (2014 CCDC), The 26th Chinese
Conference_Location :
Changsha
Print_ISBN :
978-1-4799-3707-3
Type :
conf
DOI :
10.1109/CCDC.2014.6852169
Filename :
6852169
Link To Document :
بازگشت