Flexible route planning for amusement parks navigation

Abstract

This paper describes flexible route planning for amusement parks (e.g. Disneyland) navigation. Unlike conventional shortest path finding, we provide several types of algorithms that consider waiting time estimation in real time, exploit the reservation facility of an attraction such as Fast Pass in Disneyland, and balance a series of enjoyment types such as excitement or relaxation. These features extend Dikstra's shortest path algorithm to be more flexible and dynamical. We have developed a navigation tool as a Web application in which users select their interesting attractions and then the application suggests reasonable and enjoyable routes. The experiment was conducted to show the performance of this application focusing on well-known attractions in Tokyo Disneyland.