Distributed Visitors Coordination System in Theme Park Problem
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
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.
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.