Distributed visitors coordination system in theme park problem

Authors:
Takashi Kataoka;Hidenori Kawamura;Koichi Kurumatani;Azuma Ohuchi
Affiliations:
Graduate School of Information Science and Technology, Hokkaido University, Sapporo, Japan;Graduate School of Information Science and Technology, Hokkaido University, Sapporo, Japan;Information Technology Research Institute, National Institute of Advanced Industrial Science and Technology, Tokyo, Japan;Graduate School of Information Science and Technology, Hokkaido University, Sapporo, Japan
Venue:
MMAS'04 Proceedings of the First international conference on Massively Multi-Agent Systems
Year:
2004

Citing 3
Cited 2

Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
Stability and Chaos in Input Pricing for a Service Facility with Adaptive Customer Response to Congestion

Management Science
Effective Information Provision for Relieving Traffic Congestion

ICCIMA '01 Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications

Designing Guest Flow and Operations Logistics for the Dolphin Tales

Interfaces
Using Cellular Automata to Reduce Congestion for Tourist Navigation Systems in Mobile Environments

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

A distributed visitors coordination system is proposed as an application of a massively multi-agent system. In the system, some agents register their next destination using an information device such as a cellular phone, and this information is used to reduce the effect of the time delay between decision-making and effect-emergence. This delay causes queue lengths to oscillate. However, it is troublesome for agents to continuously register their next destination. To compensate them, exclusive queues are made available to agents registering their next destination. Computer simulation of the theme park problem, showed that when all agents avoid the congestion by registering their next destination, the total waiting time is minimized and queue length oscillation is reduced.