Unifying constraint satisfaction and recommendation for amusement park navigation

Hayato Ohwada, Hiroki Igarashi, Tsukasa Tanaka, Hiroyuki Nishiyama

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publication26th Chinese Control and Decision Conference, CCDC 2014
PublisherIEEE Computer Society
Pages341-345
Number of pages5
ISBN (Print)9781479937066
DOIs
Publication statusPublished - 2014
Event26th Chinese Control and Decision Conference, CCDC 2014 - Changsha, China
Duration: 31 May 20142 Jun 2014

Publication series

Name26th Chinese Control and Decision Conference, CCDC 2014

Conference

Conference26th Chinese Control and Decision Conference, CCDC 2014
Country/TerritoryChina
CityChangsha
Period31/05/142/06/14

Keywords

  • Constraint satisfaction
  • Navigation
  • Recommendation
  • Route planning

Fingerprint

Dive into the research topics of 'Unifying constraint satisfaction and recommendation for amusement park navigation'. Together they form a unique fingerprint.

Cite this