Welcome to the InfoSci Platform
Route-Planning Algorithms for Amusement-Park Navigation

Route-Planning Algorithms for Amusement-Park Navigation

Hayato Ohwada, Masato Okada, Katsutoshi Kanamori
Copyright: © 2014 |Volume: 6 |Issue: 2 |Pages: 15
ISSN: 1942-9045|EISSN: 1942-9037|EISBN13: 9781466656819|DOI: 10.4018/ijssci.2014040105
Cite Article Cite Article

MLA

Ohwada, Hayato, et al. "Route-Planning Algorithms for Amusement-Park Navigation." IJSSCI vol.6, no.2 2014: pp.78-92. http://doi.org/10.4018/ijssci.2014040105

APA

Ohwada, H., Okada, M., & Kanamori, K. (2014). Route-Planning Algorithms for Amusement-Park Navigation. International Journal of Software Science and Computational Intelligence (IJSSCI), 6(2), 78-92. http://doi.org/10.4018/ijssci.2014040105

Chicago

Ohwada, Hayato, Masato Okada, and Katsutoshi Kanamori. "Route-Planning Algorithms for Amusement-Park Navigation," International Journal of Software Science and Computational Intelligence (IJSSCI) 6, no.2: 78-92. http://doi.org/10.4018/ijssci.2014040105

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

This paper describes route-planning algorithms for navigation in amusement parks (e.g. Disneyland). Unlike conventional shortest-path-finding used for traveling salesman problems, the authors provide several algorithms that consider waiting time estimates in real time, exploit the reservation facilities of an attraction such as Fastpass in Disneyland, and balance a series of enjoyment types such as excitement or relaxation. These features make the new shortest-path algorithms more flexible and dynamic for supporting the cognitive aspects of enjoyment. The authors developed a navigation tool as a Web application in which users select their attractions of interest and the application suggests reasonable and enjoyable routes. An experiment was conducted to demonstrate the performance of this application, focusing on well-known attractions in Tokyo Disneyland.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.