The present disclosure relates generally to the field of amusement parks. Specifically, embodiments of the present disclosure relate to techniques to manage amusement park experiences, including queuing for attractions.
Since the early twentieth century, amusement parks have substantially grown in popularity. In order to address this increasing demand, amusement parks have been expanding by adding attractions and space. The addition of attractions (e.g., rides, restaurants, shops, and shows) generally provides an amusement park with additional capacity to handle a larger number of guests. However, the additional attractions also typically provide potential guests with an incentive to visit the amusement park. Thus, while a particular amusement park may add additional capacity, the additional capacity does not always result in an increased ability for guests to participate in park entertainment (e.g., shopping, viewing shows, riding rides) or reduced wait times for attractions. This is because there is often a corresponding increase in attendance. Further, due to operating efficiencies, it is often desirable to limit the availability of attractions during low attendance times. Thus, queuing for attractions, which may limit participation in park activities, is a perennial issue for amusement parks.
While guests have demanded bigger, better, and more elaborate attractions, they also require and expect a positive overall experience. Providing a positive overall experience for amusement park guests entails addressing certain issues related to queuing for attractions. Indeed, it is now recognized that park guests can be deterred from returning to a particular amusement park due to negative experiences with queue waiting times. Further, guests may be prevented from accessing amusement park businesses (e.g., shops) due to time spent waiting in queues. Indeed, in the past, guests have waited hours in line to experience some of the more popular attractions at an amusement park. Additionally, it is now recognized that park capacity does not always result in efficient guest utilization of that capacity due to individual guest preferences for certain attractions over others. Accordingly, it is now recognized that it is desirable to improve amusement park queuing systems and methods.
Certain embodiments commensurate in scope with the originally claimed subject matter are summarized below. These embodiments are not intended to limit the scope of the disclosure, but rather these embodiments are intended only to provide a brief summary of certain disclosed embodiments. Indeed, the present disclosure may encompass a variety of forms that may be similar to or different from the embodiments set forth below.
In accordance with one embodiment, a virtual queue system is provided. The virtual queue system includes a virtual queue controller comprising processor and a memory. The memory stores instructions executable by the processor and is configured to receive a request. The request is associated with an individual guest and is for a position in a virtual queue of an attraction comprising a plurality of rides. The virtual queue permits access of the individual guest to one of the plurality of rides of the attraction and guests in the virtual queue are distributed between the plurality of rides of the attraction via the virtual queue. The memory is further configured to assign the individual guest to the position in the virtual queue in response to the request, receive ride schedule data for the attraction comprising information about a change in status of individual rides of the plurality of rides, and determine a wait time for the individual guest for the attraction based at least on the position of the individual guest in the virtual queue, the ride schedule data, and historical guest throughput at the attraction. The virtual queue system further includes communications circuitry configured to output a signal to a guest-associated device indicating the wait time for the attraction
In accordance with another embodiment, a virtual queue system is provided. The virtual queue system includes at least one monitoring device configured to monitor current queue conditions for an attraction and output a queue condition. The virtual queue system also includes a virtual queue controller comprising a controller and communications circuitry. The virtual queue controller is configured to receive the queue condition signal. The virtual queue controller is also configured to determine a current wait time for the attraction based on at least the queue condition signal and pre-set ride schedule data for the attraction, wherein the pre-set ride schedule data is indicative of a closure of a subset of a plurality of rides of the attraction. The virtual queue controller is further configured to output a queue modification signal in response to the determined current wait time being outside of a predetermined wait time range.
In accordance with another embodiment, a method is provided. The method includes the steps of providing ride schedule data for an attraction comprising a plurality of rides to a virtual queue controller, wherein the ride schedule data comprises scheduled times associated with closure of a subset of the plurality of rides, calculating variable guest throughput data for the attraction, wherein the variable guest throughput data is calculated based at least on current guest throughput data, the ride schedule data, and historical guest throughput data for the attraction, determining a current wait time for the next available position in a virtual queue for the attraction based on at least the next available position and the variable guest throughput data, wherein the current wait time overlaps the scheduled times such that the subset of the plurality of rides experiences the closure during the current wait time, and wherein the current wait time is calculated based on first variable guest throughput data indicative of a first guest throughput during the closure and second variable guest throughput data indicative of a second guest throughput during times outside of the closure; and outputting a current wait time signal to a display unit, a guest-associated device, or a combination thereof, indicating the current wait time to queue for the attraction.
These and other features, aspects, and advantages of the present disclosure will become better understood when the following detailed description is read with reference to the accompanying drawings in which like characters represent like parts throughout the drawings, wherein:
Theme park or amusement park attractions have become increasingly popular, and various amusement park attractions have been created to provide passengers with unique motion and visual experiences. Guests entering the various amusement park attractions may utilize a virtual queuing system that places the guests in a virtual queue rather than a physical queue, which allows the guests to enjoy other features of the amusement park while their position in the virtual queue advances. To help guests plan their day, the virtual queuing system may estimate wait times (e.g., a length of time before the guest may enter the attraction) and provide a reminder to the guest that the time to enter the attraction is approaching. However, in determining wait times for guests for each attraction, certain virtual queuing systems assume average wait times or average guest return rates, or may utilize predetermined or preconfigured wait times for a static number of rides (e.g., guest-accepting features of the attraction, such as individual ride vehicles, individual lanes of a multi-lane slide, individual tracks of a multi-track attraction, etc.) within a specific attraction. Using data based on a static number of rides to determine wait times may fail to dynamically react to queue conditions (e.g., ride closures and openings at an attraction). Indeed, such virtual queuing systems may provide inaccurate wait times for guests, which may lead to excessive or deficient wait times and cause inefficient operation of the amusement park attractions.
With this in mind, certain embodiments of the present disclosure relate to virtual queuing systems that determine wait times by monitoring and/or dynamically evaluating the virtual queue based at least on queue conditions and scheduling information for the amusement park attraction. Embodiments of the present disclosure facilitate dynamically modifying queue operations in response to received feedback associated with the wait times. Specifically, certain embodiments of the present disclosure relate to determining wait times by monitoring and evaluating dynamic variations in open/close times for various attractions (or various rides within a specific attraction) in addition to queue conditions when determining wait times for attractions. In particular, the virtual queue system may be configured to utilize scheduled times for each attraction, current or real-time guest throughput for an attraction, estimated guest throughput in the future, a historical throughput for each attraction, and/or historical queue wait time information to accurately determine wait times for a particular attraction to avoid communicating inaccurate wait times to guests. In this manner, the virtual queuing system may help to prevent ride underutilization, ride overcrowding, and/or inefficient use of ride resources over a period of time. Additionally, certain embodiments of the present disclosure relate to automatically or dynamically modifying queue operations or the actual virtual queue in response to deficient or excessive wait times to further prevent inefficient operations, ride underutilization, ride overcrowding, and/or wasting ride resources over a period of time. Further, the virtual queuing system may be configured to monitor and track how the guests transition or move throughout the queue to provide for a more granular control of the virtual queue. Accordingly, based on a more granular control of the virtual queue, the virtual queuing system may be configured to have automatic and dynamic control of attraction access, thereby preventing ride starvation, overcrowding, or wasting other ride resources.
While the depicted embodiments are shown in the context of water attractions, such as water slides, it should be understood that other multi-ride attractions 112 are contemplated. Further, the rides 118 of an individual attraction 112 may include any suitable number of rides 118 (slides, tracks, paths vehicles, etc.) accommodating any suitable number of guests that are nonetheless accessed via a single virtual queue for the attraction 112. In addition, the theme park 110 may also feature other attractions 112 that do not include multiple rides 118, e.g., single ride attractions 112.
In one embodiment, via the virtual queue system 114, guests are assigned a position in a virtual queue for the amusement park attraction 112 after submitting a request from a guest-associated device 120 (e.g., smart phone, guest wrist band) or a guest kiosk 121 and need not physically queue to enter the attraction 112 until a designated time. Thus, guests using a virtual queue may spend less time waiting in lines during their visit to the theme park 110. Additionally, data from the virtual queue provides guidance to the theme park for scheduling ride openings and closures to optimize guest throughput and amusement park attraction efficiency.
In some embodiments, the virtual queue system has a plurality of virtual queues, each corresponding to a separate amusement park attraction (e.g., 112a and 112b). To aid guests in determining which virtual queue to enter, the virtual queue system 114 is configured to output a wait time signal 122 indicating current wait times for each amusement park attraction 112. A display unit 126 may be configured to receive the wait time signal 122 and display the current wait times for guests within the theme park 110. The display unit 126 may be a central display unit configured to display the current wait times corresponding to a plurality of amusement park attractions. However, in some embodiments, the display unit 126 may be a localized display unit configured to display a current wait time for a single amusement park attraction. In another embodiment, a guest-associated device 120 (e.g., smart phone, guest wrist band, guest tracker, etc.) may receive the wait time signal 122 and display the current wait times for a guest (e.g., text message, smart phone app. notification, etc.).
In certain embodiments, the wait time signal 122 transmits the current wait time, a guest wait time (i.e., a wait time for an individual guest in the virtual queue), or some combination thereof. The current wait time indicates the time that an unqueued guest should anticipate waiting before entering the amusement park attraction 112 if joining the virtual queue at that time. In contrast, the guest wait time indicates the time that an individual guest, already having a position in the virtual queue, still has to wait until entering the amusement park attraction 112. Thus, the guest wait time corresponds to a specific position of an individual guest already queued in the virtual queue, whereas the current wait time corresponds to the next available position (i.e., an unassigned position) in the virtual queue.
In an embodiment, the virtual queue system 114 determines wait times based at least on scheduling information or ride schedule data for the attraction 112. Ride schedule data includes planned ride openings and closures for the attractions 112 at specified times during theme park hours as well as dynamic openings or closures in response to desired crowd flow. In the depicted embodiment, the attraction 112a includes three rides 118a, 118b, and 118c (e.g., slides, ride vehicles, seats, etc.) accessed by a single virtual queue. One or more of the three rides 118 may close during park hours, e.g., at specified times, determined by or included in a ride schedule, for the purpose of increasing attraction efficiency. For example, each of the three rides 118 may have an average historical guest throughput potential of one hundred and twenty guests per hour. Thus, in the depicted embodiment, a second ride 118b and a third ride 118c may close during times of the day when guest throughput is historically low. When guest throughput is low, opening only a first ride 118a may allow the attraction to maintain sufficient guest throughput to keep the wait times low while requiring fewer employees to operate the attraction 112a. In contrast, when guest throughput is historically high, the attraction may open the second ride 118b and the third ride 118c to increase guest throughput in order to minimize the wait times. Because opening and closing rides 118 of the attraction 112 dynamically changes real-time guest throughput and future guest throughput during the closure times, having the virtual queue system 114 determine wait times based at least on scheduling information may provide more accurate wait times for guests. Thus, scheduling information regarding dates, times, and other details as to ride closures and openings is sent to a virtual queue controller 130 of the virtual queue system 114. In certain embodiments, scheduling information is automatically transmitted to the virtual queue controller 130 from a theme park database. In other embodiments, a user may manually enter or modify scheduling information for the virtual queue controller using an operator interface 132.
In certain embodiments, the method 234 includes the step of further calculating the variable throughput data based on current or real-time guest throughput data. In some embodiments, the method 234 includes the step of providing queue condition data for the attraction 112 to a virtual queue controller 114, wherein the queue condition data includes at least current guest throughput data for the amusement park attraction.
In certain embodiments, the virtual queue controller 130 is configured to continuously or periodically determine the guest wait time and to continuously output the wait time signal to the guest-associated device 120 indicating an updated guest wait time. In other embodiments, the virtual queue controller 130 is configured to determine the guest wait time in response to an update request from the guest. The virtual queue controller 130 may limit the number of update requests that a guest may issue. In other embodiments, the virtual queue controller 130 may limit the rate at which guests may issue update requests. In some embodiments, the virtual queue controller 130 is configured to output the wait time signal when the virtual queue controller determines that the guest wait time has changed by more than a pre-determined amount of time. For example, the virtual queue controller 130 may output a new wait time signal when the guest wait time has changed by more than two minutes.
In certain embodiments, the virtual queue controller 330 may include a memory device 354a storing instructions executable by a processor 356a to perform the methods and control actions described herein. For example, the processor 356a may execute instructions for dynamically evaluating virtual queue conditions and determining wait times for guests based on guest throughput inputs 358 and ride schedule data inputs 360 received by the virtual queue controller 330. The ride schedule data inputs may be received through user input, from a memory storage, and/or through cloud services. The virtual queue controller 330 may receive scheduling (or re-scheduling) information in real-time, and may be configured to update wait times based on the updated schedule. In certain embodiments, the virtual queue controller 330 may receive and utilize additional inputs in combination with the ride schedule data inputs 360 and guest throughput inputs 358 when determining wait times.
Further, in certain embodiments, the processor 356a may utilize historical queue condition data inputs 362 (e.g., historical weather information, previous guest behavior within a particular ride/attraction, calendar information (e.g., time of day, day of week, holidays, etc.), demographic information, number of guests within a group(s), and so forth) in combination with the ride schedule data inputs 360 and/or guest throughput inputs 358 when determining wait times. For example, the processor 356a may account for historically slower crowds or colder seasons conditions when providing wait times. As a further example, in certain embodiments, the processor 356a may utilize various characteristics of the guests (e.g., type, gender, age, number, etc.) within the queue, in combination with the ride schedule data inputs 360 and guest throughput inputs 358, in order to determine wait times. While the guest throughput inputs 358, ride schedule data inputs 360, and historical queue condition data inputs 362 are depicted as being received via an operator interface 332, it should be understood that the various inputs to the virtual queue controller 330 may be received from other components of the system 314. In one embodiment, the guest throughput inputs 358 comprise real-time throughput information that is transmitted to the virtual queue controller 330 based on guest-associated device 320 interaction with a check-in or tap-in device or by passing through a gate at each attraction 112. For example, as each guest enters the attraction 112, the associated guest identification information from the guest-associated device 320 is read by a reader comprising communication circuitry and associated with the attraction. In an embodiment, each individual ride 118 of the attraction 112 is configured to provide guest identification from a reader positioned at a top or start of each ride 118. The guest identification information, associated attraction 112 information and/or ride 118 information, and timestamp may be provided to the virtual queue controller 330 as inputs to determine dynamic real-time guest throughput (e.g., guests/hour). Further, the attraction 112 may also include a reader at a ride exit to track total time through the ride 118 as a variable in determining real-time guest throughput. In another embodiment, the real-time guest throughput may be based on operator information. For example, a ride operator may track a number of guests and provide guest numbers periodically to the operator interface 332. Further, the virtual queue controller 330 may store the guest throughput information to update historical queue condition inputs 362 using acquired guest throughput data.
The processor 356a of the virtual queue controller 330 may include one or more processing devices, and the memory may include one or more tangible, non-transitory, machine-readable media. By way of example, such machine-readable media can include RAM, ROM, EPROM, EEPROM, or optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to carry or store desired program code in the form of machine-executable instructions or data structures and which can be accessed by the processor or by other processor-based devices (e.g., mobile devices). For example, the virtual queue controller 330 may be accessed by an operator interface 332 (e.g., a computer-based workstation or a mobile device, and/or may include an input/output interface 364 and a display).
In certain embodiments, the guest-associated device 320, having a processor 356b and a memory 354b, may be a personal guest device (e.g., smart phone, tablet, laptop, etc.) or a park queue device assigned to guests (e.g., smart wrist bands, portable communication devices, etc.). Park queue devices include a program for viewing wait times and sending queue requests. Guests using personal guest devices may be given access to the program (e.g., web based program, smart phone app., downloadable program, etc.). For example, an admission ticket to the theme park or a confirmation email may include details for finding the program, as well as a username, a passcode, or a combination thereof, for accessing the program. Personal information associated with a guest (height, weight, age, and other demographics) may be linked to the username and/or passcode, such that the guest identification information may be transmitted with the queue request signal. A guest using park queue devices may have their guest information uploaded to the park queue device when the device is assigned to the guest. The virtual queue controller 330 may utilize guest identification information determining wait times as provided herein.
In certain embodiments, the system may include a queue station (e.g., guest kiosk 121) that includes a processor and a memory, and is configured to provide an additional resource for guests to view times and send queue requests. Guests may access queuing functionality on the queue station using a form of guest identification (e.g., username, passcode, card, RF wristband, personal information, etc.). Queue stations may be disposed at various locations around the theme park 110. In some embodiments, at least one queue station is disposed proximate an entrance of each attraction 112, such that guests are provided a means to queue for the attraction 112 at a location proximate the attraction 112. In some embodiments, queue stations may only permit guests to queue for the attraction 112 most proximate the queue station. In other embodiments, general queue stations are located throughout the theme park 110, which may be used to queue for attractions 112 in the theme park 110.
In certain embodiments, the display unit 326 is configured to receive the wait time signal 322 from the virtual queue controller 330 and display current wait times for the attractions 112. In some embodiments, at least one display unit 326 is disposed proximate an entrance of each attraction 112. The display unit may be configured to display only the current wait time for the attraction 112 most proximate the display unit. In other embodiments, general display units are disposed in general locations (e.g., eating areas, walking paths, etc.) around the theme park 110. General display units may display current wait times for a plurality of attractions 112.
In certain embodiments, the monitoring device 466 may be configured to monitor or determine current queue conditions, including, but not limited to, the length of the queue, number of guests in the queue, flow rate of the guests entering and exiting the queue, particular individuals within the queue (e.g., identify guests in the queue), number of sub-queues within the queue, types of guests within the queue, and so forth. In certain embodiments, the monitoring device 466 may monitor particular locations (e.g., geographical location, queue zones, etc.) within the queue and output the number of guests in each particular location to the virtual queue controller. In certain embodiments, the monitoring device 466 may monitor guests not just at the beginning or end of the queue, but may also monitor whether guests leave the queue in the middle of the queue. In certain embodiments, the monitoring device 466 may determine various characteristics of the guests (e.g., type, gender, age, number, etc.) within the queue and output that data to the virtual queue controller 430 to track and record historical throughput data associated with the queue as it relates to the attraction 112.
In certain embodiments, the monitoring device 466 includes a counting mechanism 470 configured to monitor queue conditions. For example, the number of guests within the queue may be monitored with a counting mechanism 470, which may be a manual system and/or may include one or more sensors disposed proximate to the queue. In other embodiments, the monitoring device may include at least one sensor 472 (e.g., optical sensors, mechanical treadles, RF sensing systems, etc.) disposed physically proximate to the queue, and communicatively coupled to the virtual queue controller 430. The sensors 472 may provide continuous feedback to the virtual queue system 414 associated with current queue conditions. For example, in situations where guests each carry RF identification, RF sensors associated with the monitoring device may be configured to monitor when the particular guest(s) enters and exits the queue and output that data to the virtual controller. As a further example, the sensors 472 may be configured to recognize individual guests at the entrance and exit of the queue and continuously output that information to the virtual queue controller, such that various conditions of the queue (e.g., wait time, queue length, etc.) may be calculated based on length of time individual guests spend within the queue.
Based on the received feedback, the virtual queue system 414 may be configured to dynamically respond to current queue conditions. In certain embodiments, the virtual queue system 414 may include the functionality to automatically remove a guest from the virtual queue based on one or more factors (e.g., been in the queue for an extended period of time past current queue wait time, guest is seen at an unexpected location within the queue, guest enters another queue, guest is recognized outside of the queue, etc.). In certain embodiments, the virtual queue system 414 may virtually monitor and dynamically adjust a plurality of queues (or sub-queues), and may be configured to correlate the data for a variety of queues when calculating or determining current queue conditions.
In certain embodiments, the virtual queue system 414 may utilize the feedback received from the monitoring device 466 to calculate other queue conditions. The virtual queue system 414 may calculate various factors or variables, such as, but not limited to, length of the virtual queue, current or real-time guest throughput, maximum attraction throughput, historical information related to queue conditions and responses (e.g., historical guest throughput), length of time that the queue is in different states (overfill state, under-fill state, starvation state, overcrowding state, etc.), and so forth. For example, based on the number of guests within the queue and/or the flow rate of the guests entering or exiting the queue, the virtual queue system 414 may calculate current wait times, guest wait times, current attraction capacity, and so forth. In particular, the virtual queue system 414 may be configured to determine accurate real-time information related to the queue system and queue conditions, based at least in part on the continuous feedback received from the monitoring device 466.
In another embodiment, in response to determined wait times for guests in the virtual queues and/or physical attraction access areas, the virtual queue system 414 may be configured to output a queue modification signal 474. Specifically, the virtual queue system may be configured to dynamically respond to deviations of the calculated wait times for guests from a wait time range by outputting a queue modification signal 474.
In certain embodiments, the queue modification signal 474 is configured to temporarily disable the ability to add a guest to the virtual queue for an attraction 112 when the wait time for the attraction is longer than a maximum limit of the wait time range. For example, when the virtual queue is deemed too long by the virtual queue controller 430, the virtual queue controller is configured to output the queue modification signal 474 to the guest-associated device 420 (e.g. smart phone, guest kiosk, etc.). The queue modification signal 474 is configured to transmit instructions to a queue program, on the guest-associated device 420, to disable an option to send a queue request for the attraction 112. Additionally, the queue modification signal 474 may include instructions to display a message in relation to disabling a portion of the queue program. Once wait times of the virtual queue fall back down to a length of time within the wait time range, the virtual queue controller 430 may be configured to send a resume signal 476 to enable the option to send queue requests.
In certain embodiments, the queue modification signal 474 includes instructions to notify guests of a shorter than average queue time for an attraction 112 when the wait time for the attraction is shorter than the minimum limit of the wait time range. For example, the queue modification signal 474 may include instructions for the guest-associated device to display a message indicating that the attraction 112 has a short wait time. In some embodiments, the queue modification signal 474 may include instructions to activate a quick queue option in the program on the guest-associated device 120. For example, the quick queue option may activate a pop up message the screen that indicates that the virtual queue has a short wait time. Additionally, the pop up message may include a button configured to immediately enter the guest into the virtual queue for the attraction 112. In certain embodiments, the virtual queue controller 430 is configured to send the queue modification signal 474 to guest-associated devices 420 linked to guests that have experienced fewer attractions 112 during that day than other guests at the theme park 110 before sending the queue modification signal to the other guests, thereby giving a first opportunity to enter the virtual queue to individuals who have experienced fewer attractions 112. In certain embodiments, the program includes an option to dismiss messages activated in response to the guest-associated device receiving the queue modification signal 474. However, once wait times of the virtual queue rise up to a length of time within the wait time range, the virtual queue controller is configured to send the resume signal to automatically dismiss notifications from the queue modification signal.
In certain embodiments, the virtual queue controller is configured to send an attraction modification signal 478 to an amusement park operator device 480 in response to the wait times longer than the maximum limit or shorter than the minimum limit of the wait time range. The attraction modification signal is configured to send instructions to an amusement park operator to open and/or close rides of an amusement park ride 118 to adjust current guest throughput in response to the wait times. In addition to disabling the virtual queue or sending notifications, dynamically opening and closing rides 118 of an attraction 112 may further increase amusement park attraction efficiency.
In certain embodiments, the virtual queue controller 430 may calculate the wait time range 584 by adding a wait time buffer to the average wait time 590. For example, the virtual queue controller 430 may calculate average wait times for 9 a.m., 11 a.m., 1 p.m., and 3 p.m. to be five, twenty, forty, and thirty-five minutes respectively. The virtual queue controller 430 may provide a five minute wait time buffer to the average wait times to calculate the wait time range. Thus, the wait time ranges at 9 a.m., 11 a.m., 1 p.m., and 3 p.m. are 0-10 minutes, 15-25 minutes, 35-45 minutes, and 30-40 minutes respectively. In other embodiments, the virtual queue controller 430 may calculate the wait time range 584 using a dynamic wait time buffer. The dynamic wait time buffer may change a length of time of the wait time buffer at different time slots of a day. For example, a wait time buffer at 9 a.m. may be five minutes, while a wait time buffer at 1 p.m. may be fifteen minutes. In other embodiments, the dynamic wait time buffer includes a longer wait time buffer between the average wait time and the maximum limit than the wait time buffer between the average wait time and the minimum limit. In some embodiments, the dynamic wait time buffer may be determined using historical throughput data, operator input, etc.
In certain embodiments, the wait time range may be set based on inputs receive by the virtual queue controller 430. In some embodiments, the virtual queue controller 430 is configured to receive an input from the operator interface 332. An operator may transmit instructions for the virtual queue controller 430 to set specific wait time ranges using the operator interface 332. The operator may set static or dynamic wait time ranges. In some embodiments, an operator may set a wait time range independent of historical throughput data. For example, in the event that an attraction 112 is temporarily under staffed, an operator may adjust the wait time range 584 of the attraction 112 to decrease guest throughput of the attraction 112 until the attraction 112 is properly staffed. In another example the operator may adjust the wait time ranges 584 for a plurality of attractions 112 to encourage guests to queue for the particular attraction 112, in order to prevent overcrowding of other attractions 112 or locations.
In certain embodiments, the virtual queue controller 430 may determine wait times 582 for a position in the virtual queue based on variable guest throughput data and ride schedule data. Generally, the virtual queue controller 430 calculates a variable guest throughput based at least on current guest throughput data, historical throughput data, historical ride schedule data, etc. The variable guest throughput data represents an expected guest throughput for a single ride 118 of the attraction 112 for each time slot during park hours. The virtual queue controller 430 is configured to predict expected guest throughput data at least based on deviations of current guest throughput data with respect to historical throughput data and other queue conditions. To accurately analyze throughput variations and prevent scheduling variations from skewing the calculation, the current guest throughput data and the historical throughput data are first divided respectfully by the number of rides currently open and the number of rides historically open (i.e., to determine current guest throughput data and historical guest throughput data for a single ride). Further, the virtual queue controller 430 is configured to dynamically multiply the expected guest throughput data for a single ride according to the ride schedule data to determine an expected guest throughput for each time slot during the park hours. The virtual queue controller 430 is configured to utilize the expected guest throughput, current queue conditions (e.g., number of guests in queue, etc.) in relation to the guest position to determine wait times.
As an exemplary embodiment, in certain situations, an attraction 112 may include one or more rides 118 that open and close at different times throughout the day. For example, a first ride 118a of an attraction 112 may open concurrently with the opening of theme park 110, and a second ride of the attraction 112 may open an hour after the theme park 110 opens. Each ride of the attraction 112 may have a throughput of 120 guests per hour. Features of the present disclosure enable the virtual queuing system to utilize the scheduled open/close times of each ride during the day to determine wait times for the attraction 112. For example, the virtual queuing system accounts for the delayed opening time of the second ride 118b when determining a wait time for the attraction 112. In this manner, the virtual queuing system may provide an accurate wait time for the attraction 112, rather than an artificially low wait time that would be associated with the cases of all rides 118 being open. In other words, when one or more of the rides 118 are closed, the estimated total guest throughput of the attraction 112 will be reduced. Further, the virtual queuing system 114 accounts for the one hour delay in opening the second ride 118b during wait times assigned before the second ride 118b is scheduled to open.
For example, in an embodiment, a guest requests a position in the virtual queue such that the guest wait time for the attraction 112 encompasses or overlaps a first time period in which a subset of the rides 118 are closed and a second time period in which all of the rides 118 are open. That is, some or all of the closed rides 118 are opened while the guest is in the virtual queue. Accordingly, the attraction 112 has an estimated lower guest throughput during the first time period and an estimated higher guest throughput during the second time period. By using the lower guest throughput and the higher guest throughput, a more accurate guest waiting time may be determined. In this manner, the virtual queuing system may avoid periods of ride starvation (when artificially high wait times are reported), or ride overcrowding (when artificially low wait times are reported).
In one embodiment, for the attraction 112, historical guest throughput data may show that, on average at 1 p.m., the attraction 112 has a guest throughput of 240 guests per hour and a guest throughput at 2:00 p.m. of 220 guests per hour, both with two rides open. The current conditions, as determined by the monitoring device 466, indicate that the current guest throughput of the ride at 1 p.m. is 120 guests per hour with one ride 118a open. However, ride schedule data provided to the virtual queue controller 430 indicate that a second ride 118b is scheduled to open at 1:30 p.m. First, the virtual queue controller may determine that the historical guest throughput for one ride vehicle at 1:00 p.m. is 120 guests per hour, and that the ride throughput per vehicle is on par with historical guest throughput data. However, the historical guest throughput data shows a trend indicating that at 2:00 p.m., guest throughput for one ride vehicle historically decreases to 110 guests per hour. The virtual queue controller 430 may be configured to consider the decreasing guest throughput in calculating wait times. Additionally, although the current guest throughput is only 120 guests per hour, the virtual queue controller is configured to increase the expected guest throughput by a factor of two at 1:30 p.m. to account for the opening of the second ride vehicle. The expected ride throughput should increase to 240 guests per hour minus the anticipated decrease in guest throughput. Thus, the expected ride throughput at 1:30 p.m. may be 230 guests per hour. Using the estimated guest throughput data and current queue conditions in relation to the guest position, the virtual queue controller may dynamically determine wait times 582. Additionally, in certain embodiments, the virtual queue controller may continually calculate the variable guest throughput to account for changes in current guest throughput and other queue conditions, in order to provide guests with updated wait times.
In some embodiments, the virtual queue controller 430 further utilizes other queue conditions to determine wait times 582. Specifically, the virtual queue controller 430 may be configured to consider various factors, such as, but not limited to, previous guest behavior, guests' current activities within and outside of the queue, current location or historical locations of the guest within the park, weather, calendar information (e.g., time of day, day of week, holidays, etc.), demographic information, number of guests within a group(s), and so forth. Further, in certain embodiments, the virtual queue controller 430 may record real-time queue conditions as historical queue condition information for future use. For example, acquired real-time queue conditions may indicate that one ride 118a has historically slower guest throughput relative to the other rides 118b, 118c, even if all three rides 118 are otherwise alike or of a same type. Such slower throughput may be because an entrance in the loading area for the ride 118a is farther from the entrances of the other rides 118b, 118c, because a loading angle involves slower loading, or because show props adjacent the ride 118a cause guests to linger at the ride entrance. Accordingly, a more accurate estimated guest wait time may take into account which of the rides 118 is closed and use historical guest throughput information associated with each individual ride 118. For example, when the slower ride 118a is closed, the estimated guest wait time may use historical guest throughput for the faster rides 118b, 118c and not from the closed slower ride 118a in calculating an estimated guest wait time.
In certain embodiments, the virtual queue controller 430 may be configured to determine the wait times 582 for each attraction 112 based on a coordinated analysis of other queue conditions. For example, in certain embodiments, the virtual queue controller 430 may receive ride schedule data and guest throughput data for a plurality of attractions 112, and may be configured to coordinate the wait times 582 for the attractions 112 based on the received data. In certain embodiments, the virtual queue controller 430 may utilize other types of data to perform a coordination analysis. For example, the virtual queue controller may receive crowd flow data and/or wait times for other rides, and may utilize this data to provide accurate wait times 582 for each attraction 112.
While only certain features of the present disclosure have been illustrated and described herein, many modifications and changes will occur to those skilled in the art. It is, therefore, to be understood that the appended claims are intended to cover all such modifications and changes as fall within the true spirit of the disclosure.
The techniques presented and claimed herein are referenced and applied to material objects and concrete examples of a practical nature that demonstrably improve the present technical field and, as such, are not abstract, intangible or purely theoretical. Further, if any claims appended to the end of this specification contain one or more elements designated as “means for [perform]ing [a function] . . . ” or “step for [perform]ing [a function] . . . ”, it is intended that such elements are to be interpreted under 35 U.S.C. 112(f). However, for any claims containing elements designated in any other manner, it is intended that such elements are not to be interpreted under 35 U.S.C. 112(f).
The present application is a divisional application of U.S. application Ser. No. 15/807,411, filed on Nov. 8, 2017, which claims priority to U.S. Provisional Patent Application No. 62/419,837, entitled “Systems and Methods for Pre-Scheduling In Virtual Queuing Systems,” filed Nov. 9, 2016; and to U.S. Provisional Patent Application No. 62/419,833, entitled “Systems and Methods for Automatically Monitoring and Dynamically Adjusting A Queue,” filed on Nov. 9, 2016, which are incorporated by reference in their entireties herein for all purposes.
Number | Name | Date | Kind |
---|---|---|---|
5006983 | Wayne | Apr 1991 | A |
5192247 | Barr et al. | Mar 1993 | A |
5502806 | Mahoney et al. | Mar 1996 | A |
5566327 | Sehr | Oct 1996 | A |
5694514 | Evans et al. | Dec 1997 | A |
5946444 | Evans et al. | Aug 1999 | A |
5978770 | Waytena | Nov 1999 | A |
5987420 | Maeda et al. | Nov 1999 | A |
5987421 | Chuang | Nov 1999 | A |
6078928 | Schnase et al. | Jun 2000 | A |
6142368 | Mullins et al. | Nov 2000 | A |
6173209 | Laval et al. | Jan 2001 | B1 |
6259786 | Gisby | Jul 2001 | B1 |
6307952 | Dietz | Oct 2001 | B1 |
6424623 | Borgstahl et al. | Jul 2002 | B1 |
6526158 | Goldberg | Feb 2003 | B1 |
6529786 | Sim | Mar 2003 | B1 |
6535376 | Fujita et al. | Mar 2003 | B2 |
6629019 | Legge et al. | Sep 2003 | B2 |
6748364 | Waytena et al. | Jun 2004 | B1 |
6785539 | Hale et al. | Aug 2004 | B2 |
6813608 | Baranowski | Nov 2004 | B1 |
6819759 | Khuc et al. | Nov 2004 | B1 |
6845361 | Dowling | Jan 2005 | B1 |
6873260 | Lancos et al. | Mar 2005 | B2 |
6889098 | Laval et al. | May 2005 | B1 |
6889900 | Davies et al. | May 2005 | B2 |
6937998 | Swartz et al. | Aug 2005 | B1 |
7029400 | Briggs | Apr 2006 | B2 |
7047205 | Hale et al. | May 2006 | B2 |
7136822 | Kimura et al. | Nov 2006 | B2 |
7152038 | Murashita et al. | Dec 2006 | B2 |
7188767 | Penuela et al. | Mar 2007 | B2 |
7204425 | Mosher, Jr. et al. | Apr 2007 | B2 |
7212983 | Redmann et al. | May 2007 | B2 |
7222080 | Hale et al. | May 2007 | B2 |
7224967 | Hale et al. | May 2007 | B2 |
7286966 | Hotta et al. | Oct 2007 | B2 |
7327251 | Corbett, Jr. | Feb 2008 | B2 |
7366512 | Kefalas et al. | Apr 2008 | B1 |
7400932 | Ackley et al. | Jul 2008 | B2 |
7430411 | Sengupta et al. | Sep 2008 | B2 |
7496445 | Mohsini et al. | Feb 2009 | B2 |
7505474 | Walter | Mar 2009 | B2 |
7516148 | Waytena et al. | Apr 2009 | B2 |
7532941 | Hale et al. | May 2009 | B2 |
7541926 | Dugan et al. | Jun 2009 | B2 |
7603321 | Gurvey | Oct 2009 | B2 |
7642921 | Cutler et al. | Jan 2010 | B2 |
7674184 | Briggs et al. | Mar 2010 | B2 |
7685009 | Halavais et al. | Mar 2010 | B2 |
7685014 | Dean | Mar 2010 | B2 |
7706904 | Jones et al. | Apr 2010 | B2 |
7720718 | Hale et al. | May 2010 | B2 |
7729382 | Rosner et al. | Jun 2010 | B2 |
7739925 | Foster | Jun 2010 | B2 |
7752146 | Lert, Jr. | Jul 2010 | B2 |
7756745 | Leet et al. | Jul 2010 | B2 |
7775894 | Henry et al. | Aug 2010 | B2 |
7778937 | Ferrara et al. | Aug 2010 | B2 |
7787965 | Hale et al. | Aug 2010 | B2 |
7788215 | Trowbridge et al. | Aug 2010 | B2 |
7793109 | Ortiz | Sep 2010 | B2 |
7801629 | Hale et al. | Sep 2010 | B2 |
7801752 | Neulight | Sep 2010 | B2 |
7802724 | Nohr | Sep 2010 | B1 |
7817990 | Pamminger et al. | Oct 2010 | B2 |
7826966 | Little et al. | Nov 2010 | B2 |
7837567 | Holzberg et al. | Nov 2010 | B2 |
7881713 | Hale et al. | Feb 2011 | B2 |
7885763 | Havens | Feb 2011 | B2 |
7895066 | Waytena et al. | Feb 2011 | B2 |
7921297 | Ortiz et al. | Apr 2011 | B2 |
7942320 | Joe | May 2011 | B2 |
7966215 | Myers et al. | Jun 2011 | B1 |
7994910 | Brooks et al. | Aug 2011 | B2 |
8016667 | Benbrahim | Sep 2011 | B2 |
8082165 | Natsuyana et al. | Dec 2011 | B2 |
8126782 | Zhu et al. | Feb 2012 | B1 |
8200515 | Natsuyama et al. | Jun 2012 | B2 |
8226493 | Briggs et al. | Jul 2012 | B2 |
8231047 | Canora | Jul 2012 | B2 |
8253533 | Jones | Aug 2012 | B2 |
8253542 | Canora et al. | Aug 2012 | B2 |
8275767 | Shepherd et al. | Sep 2012 | B2 |
8284924 | Dube et al. | Oct 2012 | B2 |
8294549 | Samovar et al. | Oct 2012 | B2 |
8296983 | Padgett et al. | Oct 2012 | B2 |
8313381 | Ackley et al. | Nov 2012 | B2 |
8330587 | Kupstas | Dec 2012 | B2 |
8333321 | Gressel et al. | Dec 2012 | B2 |
8396001 | Jung et al. | Mar 2013 | B2 |
8396727 | Waytena et al. | Mar 2013 | B2 |
8401334 | Neville et al. | Mar 2013 | B2 |
8416087 | Canora et al. | Apr 2013 | B2 |
8424716 | Hegan et al. | Apr 2013 | B2 |
8425314 | Benbrahim | Apr 2013 | B2 |
8430749 | Nelson et al. | Apr 2013 | B2 |
8452708 | Birenbaum et al. | May 2013 | B1 |
8453926 | Hunt | Jun 2013 | B2 |
8462994 | Ortiz et al. | Jun 2013 | B2 |
8489451 | Ramchandani | Jul 2013 | B2 |
8489657 | Shepherd et al. | Jul 2013 | B2 |
8498900 | Spirin et al. | Jul 2013 | B1 |
8500031 | Naelon | Aug 2013 | B2 |
8510136 | Charania et al. | Aug 2013 | B2 |
8510163 | Hess et al. | Aug 2013 | B2 |
8565735 | Wohlwend et al. | Oct 2013 | B2 |
8577734 | Treyz et al. | Nov 2013 | B2 |
8581721 | Asher et al. | Nov 2013 | B2 |
8608548 | Mattice et al. | Dec 2013 | B2 |
8612278 | Ashley, Jr. et al. | Dec 2013 | B1 |
8616984 | Mattice et al. | Dec 2013 | B2 |
8618935 | Felt et al. | Dec 2013 | B2 |
8654965 | Dube et al. | Feb 2014 | B2 |
8700005 | Kiraly et al. | Apr 2014 | B1 |
8731997 | Corbett et al. | May 2014 | B2 |
8732101 | Wilson et al. | May 2014 | B1 |
8750576 | Huang et al. | Jun 2014 | B2 |
8750784 | Ortiz et al. | Jun 2014 | B2 |
8751472 | Mei et al. | Jun 2014 | B2 |
8762101 | Yuen et al. | Jun 2014 | B2 |
8773245 | Canora et al. | Jul 2014 | B2 |
8774839 | Busch | Jul 2014 | B2 |
8775244 | Boss et al. | Jul 2014 | B2 |
8793314 | Spivak et al. | Jul 2014 | B2 |
8798643 | Boyle et al. | Aug 2014 | B1 |
8803366 | Proud | Aug 2014 | B2 |
8810430 | Proud | Aug 2014 | B2 |
8821238 | Ackley et al. | Sep 2014 | B2 |
8827810 | Weston et al. | Sep 2014 | B2 |
8830030 | Arthurs et al. | Sep 2014 | B2 |
8831963 | Backer et al. | Sep 2014 | B2 |
8851372 | Zhou et al. | Oct 2014 | B2 |
8866673 | Mendelson | Oct 2014 | B2 |
8870641 | Dabrowski | Oct 2014 | B2 |
8879440 | Guo et al. | Nov 2014 | B2 |
8896485 | Mendelson | Nov 2014 | B2 |
8897808 | Farris | Nov 2014 | B2 |
8913011 | Barney et al. | Dec 2014 | B2 |
8924432 | Richards et al. | Dec 2014 | B2 |
8948541 | Neville et al. | Feb 2015 | B2 |
8949146 | Fisher | Feb 2015 | B2 |
8954091 | Boyle et al. | Feb 2015 | B1 |
8972048 | Canora et al. | Mar 2015 | B2 |
8979646 | Moser et al. | Mar 2015 | B2 |
8989779 | Centore, III | Mar 2015 | B1 |
9002736 | Wohlwend et al. | Apr 2015 | B2 |
9138650 | Barney et al. | Sep 2015 | B2 |
9149717 | Barney et al. | Oct 2015 | B2 |
9162148 | Barney et al. | Oct 2015 | B2 |
10127744 | Butler | Nov 2018 | B2 |
10185513 | Vandewater | Jan 2019 | B1 |
20020007292 | Paxton et al. | Jan 2002 | A1 |
20020046068 | Koh | Apr 2002 | A1 |
20020070865 | Lancos et al. | Jun 2002 | A1 |
20020082897 | Menelly et al. | Jun 2002 | A1 |
20020099576 | MacDonald et al. | Jul 2002 | A1 |
20020116233 | Kuge et al. | Aug 2002 | A1 |
20020116235 | Grimm et al. | Aug 2002 | A1 |
20020174003 | Redmann et al. | Nov 2002 | A1 |
20030030561 | Yafuso et al. | Feb 2003 | A1 |
20030041105 | Patrick | Feb 2003 | A1 |
20030093167 | Sim | May 2003 | A1 |
20030102956 | McManus et al. | Jun 2003 | A1 |
20030129978 | Akiyama et al. | Jul 2003 | A1 |
20030195760 | Kim et al. | Oct 2003 | A1 |
20040006497 | Nestor et al. | Jan 2004 | A1 |
20040059614 | Brown et al. | Mar 2004 | A1 |
20040100390 | Giraldin et al. | May 2004 | A1 |
20040117219 | Sugimoto et al. | Jun 2004 | A1 |
20040117528 | Beacher et al. | Jun 2004 | A1 |
20040130680 | Zhou et al. | Jul 2004 | A1 |
20040158482 | Hale et al. | Aug 2004 | A1 |
20040172316 | Hale et al. | Sep 2004 | A1 |
20040225540 | Waytena et al. | Nov 2004 | A1 |
20050045710 | Burke | Mar 2005 | A1 |
20050060173 | Hale et al. | Mar 2005 | A1 |
20050070258 | Stanco | Mar 2005 | A1 |
20050080675 | Lovegreen et al. | Apr 2005 | A1 |
20050168340 | Mosher, Jr. et al. | Aug 2005 | A1 |
20050198107 | Cuhls et al. | Sep 2005 | A1 |
20050200455 | Veni, III et al. | Sep 2005 | A1 |
20050240453 | Lyons | Oct 2005 | A1 |
20050278215 | Seele, Jr. | Dec 2005 | A1 |
20060002413 | Tsutazawa | Jan 2006 | A1 |
20060068787 | Deshpande et al. | Mar 2006 | A1 |
20060100985 | Mark et al. | May 2006 | A1 |
20060147005 | Taub | Jul 2006 | A1 |
20060273920 | Doan et al. | Dec 2006 | A1 |
20070042748 | Macarthur | Feb 2007 | A1 |
20070064904 | Wesley | Mar 2007 | A1 |
20070088701 | Rao | Apr 2007 | A1 |
20070127691 | Lert | Jun 2007 | A1 |
20070130313 | King | Jun 2007 | A1 |
20070156846 | Seward | Jul 2007 | A1 |
20070168390 | Mardirossian | Jul 2007 | A1 |
20070174042 | Thompson | Jul 2007 | A1 |
20070203763 | Ackley et al. | Aug 2007 | A1 |
20070225911 | Chanick | Sep 2007 | A1 |
20070233291 | Herde et al. | Oct 2007 | A1 |
20070244731 | Bayhydt et al. | Oct 2007 | A1 |
20070286220 | Stenning | Dec 2007 | A1 |
20080022089 | Leedom | Jan 2008 | A1 |
20080040172 | Watkins | Feb 2008 | A1 |
20080055051 | Snyder et al. | Mar 2008 | A1 |
20080071587 | Granucci et al. | Mar 2008 | A1 |
20080080445 | Bayne et al. | Apr 2008 | A1 |
20080086377 | Jain | Apr 2008 | A1 |
20080129487 | Crucs | Jun 2008 | A1 |
20080133283 | Backer et al. | Jun 2008 | A1 |
20080197984 | Peters et al. | Aug 2008 | A1 |
20080201227 | Bakewell et al. | Aug 2008 | A1 |
20080215385 | Veitch | Sep 2008 | A1 |
20080220871 | Asher et al. | Sep 2008 | A1 |
20080246592 | Waalkes et al. | Oct 2008 | A1 |
20080267107 | Rosenberg | Oct 2008 | A1 |
20080270230 | Hendrickson et al. | Oct 2008 | A1 |
20080270305 | Andreasson et al. | Oct 2008 | A1 |
20080275630 | Regienczuk | Nov 2008 | A1 |
20080301264 | Mathai et al. | Dec 2008 | A1 |
20080319935 | Chandak | Dec 2008 | A1 |
20080319992 | Mathai et al. | Dec 2008 | A1 |
20090063205 | Shibasaki | Mar 2009 | A1 |
20090076875 | Lert, Jr. et al. | Mar 2009 | A1 |
20090104874 | Ellis | Apr 2009 | A1 |
20090112638 | Kneller et al. | Apr 2009 | A1 |
20090116235 | Tsao et al. | May 2009 | A1 |
20090204449 | Waytena et al. | Aug 2009 | A1 |
20090216547 | Canora et al. | Aug 2009 | A1 |
20090222291 | Montavon et al. | Sep 2009 | A1 |
20090252318 | Smith et al. | Oct 2009 | A1 |
20090259556 | Carroll et al. | Oct 2009 | A1 |
20090267728 | Mayrand | Oct 2009 | A1 |
20090276341 | McMahan et al. | Nov 2009 | A1 |
20090281817 | Ferrara et al. | Nov 2009 | A1 |
20090281903 | Blatstein | Nov 2009 | A1 |
20090286559 | Janas et al. | Nov 2009 | A1 |
20090313062 | Natsuyama et al. | Dec 2009 | A1 |
20090319306 | Chanick | Dec 2009 | A1 |
20100017238 | Johnson | Jan 2010 | A1 |
20100017725 | McCarthy et al. | Jan 2010 | A1 |
20100062838 | Nguyen et al. | Mar 2010 | A1 |
20100063854 | Purvis et al. | Mar 2010 | A1 |
20100111377 | Monroe | May 2010 | A1 |
20100114968 | Dean | May 2010 | A1 |
20100161432 | Kumanov et al. | Jun 2010 | A1 |
20100250612 | Reuveni et al. | Sep 2010 | A1 |
20100262507 | Woycik et al. | Oct 2010 | A1 |
20100277276 | Bayne et al. | Nov 2010 | A1 |
20100308964 | Ackley et al. | Dec 2010 | A1 |
20100317377 | Zou et al. | Dec 2010 | A1 |
20100321149 | Foster | Dec 2010 | A1 |
20100328025 | Razdan | Dec 2010 | A1 |
20110022425 | Block et al. | Jan 2011 | A1 |
20110040655 | Hendrickson | Feb 2011 | A1 |
20110133892 | Nohr | Jun 2011 | A1 |
20110158398 | Kannan et al. | Jun 2011 | A1 |
20110178960 | Dever et al. | Jul 2011 | A1 |
20110227726 | Lee | Sep 2011 | A1 |
20110307547 | Backer | Dec 2011 | A1 |
20120013462 | Tuck et al. | Jan 2012 | A1 |
20120016745 | Hendrickson | Jan 2012 | A1 |
20120040751 | Peters | Feb 2012 | A1 |
20120116789 | Boss | May 2012 | A1 |
20120116863 | Boss et al. | May 2012 | A1 |
20120136793 | Barber-Mingo et al. | May 2012 | A1 |
20120147169 | Haver et al. | Jun 2012 | A1 |
20120184367 | Parrott et al. | Jul 2012 | A1 |
20120197746 | Harris | Aug 2012 | A1 |
20120197949 | Taylor et al. | Aug 2012 | A1 |
20120223834 | Hyatt | Sep 2012 | A1 |
20120271834 | Canora et al. | Oct 2012 | A1 |
20120287281 | Williams et al. | Nov 2012 | A1 |
20120315868 | Ben-Alexander | Dec 2012 | A1 |
20120323646 | Dube et al. | Dec 2012 | A1 |
20120330740 | Pennington et al. | Dec 2012 | A1 |
20130018661 | Padgett et al. | Jan 2013 | A1 |
20130018684 | Padgett et al. | Jan 2013 | A1 |
20130041696 | Richard | Feb 2013 | A1 |
20130045804 | Ruke | Feb 2013 | A1 |
20130065679 | Gelman et al. | Mar 2013 | A1 |
20130066660 | Kopitzke et al. | Mar 2013 | A1 |
20130073325 | Ross | Mar 2013 | A1 |
20130090957 | Popkey et al. | Apr 2013 | A1 |
20130091146 | Stanger | Apr 2013 | A1 |
20130102248 | Jay et al. | Apr 2013 | A1 |
20130103486 | Hess | Apr 2013 | A1 |
20130103519 | Kountotsis et al. | Apr 2013 | A1 |
20130124234 | Nilsson et al. | May 2013 | A1 |
20130146659 | Zhou et al. | Jun 2013 | A1 |
20130151296 | Waytena et al. | Jun 2013 | A1 |
20130165154 | Joshi | Jun 2013 | A1 |
20130184087 | Degirmenci | Jul 2013 | A1 |
20130204651 | Gulec et al. | Aug 2013 | A1 |
20130204656 | Mahfouda et al. | Aug 2013 | A1 |
20130218612 | Hunt | Aug 2013 | A1 |
20130254027 | Silverman et al. | Sep 2013 | A1 |
20130254137 | Hunt | Sep 2013 | A1 |
20130293720 | Tyson et al. | Nov 2013 | A1 |
20130332208 | Mehta | Dec 2013 | A1 |
20130332509 | Schwartz et al. | Dec 2013 | A1 |
20140006451 | Mullis et al. | Jan 2014 | A1 |
20140046802 | Hosein et al. | Feb 2014 | A1 |
20140074404 | Hassan | Mar 2014 | A1 |
20140074523 | Turner et al. | Mar 2014 | A1 |
20140089075 | Sanchis et al. | Mar 2014 | A1 |
20140108149 | Jabara et al. | Apr 2014 | A1 |
20140113707 | Asher et al. | Apr 2014 | A1 |
20140114807 | Baker et al. | Apr 2014 | A1 |
20140132400 | Heaven et al. | May 2014 | A1 |
20140136105 | Chakraborty et al. | May 2014 | A1 |
20140156290 | Kozicki et al. | Jun 2014 | A1 |
20140156319 | Deeb | Jun 2014 | A1 |
20140162693 | Wachter et al. | Jun 2014 | A1 |
20140163934 | Zhang et al. | Jun 2014 | A1 |
20140235276 | Lefkowitz | Aug 2014 | A1 |
20140236653 | Farrell | Aug 2014 | A1 |
20140249866 | Popkey et al. | Sep 2014 | A1 |
20140249994 | Proud | Sep 2014 | A1 |
20140256421 | Bishop et al. | Sep 2014 | A1 |
20140256446 | Barney et al. | Sep 2014 | A1 |
20140257889 | Ashley, Jr. et al. | Sep 2014 | A1 |
20140278688 | Sullivan et al. | Sep 2014 | A1 |
20140324488 | Boccelli | Oct 2014 | A1 |
20140343976 | Ahluwalia et al. | Nov 2014 | A1 |
20140343977 | Macina | Nov 2014 | A1 |
20140343995 | Backer et al. | Nov 2014 | A1 |
20140364148 | Block et al. | Dec 2014 | A1 |
20140378233 | Weston et al. | Dec 2014 | A1 |
20150009116 | Mangold et al. | Jan 2015 | A1 |
20150025919 | West | Jan 2015 | A1 |
20150026008 | Werbitt | Jan 2015 | A1 |
20150046202 | Hunt | Feb 2015 | A1 |
20150058129 | Nevid et al. | Feb 2015 | A1 |
20150058324 | Kauwe | Feb 2015 | A1 |
20150080081 | Kessman et al. | Mar 2015 | A1 |
20150081348 | Avera et al. | Mar 2015 | A1 |
20150083803 | Herron et al. | Mar 2015 | A1 |
20150088562 | Woods | Mar 2015 | A1 |
20150088671 | Xiong et al. | Mar 2015 | A1 |
20150088782 | Zhang | Mar 2015 | A1 |
20150090242 | Weston et al. | Apr 2015 | A1 |
20150379434 | Argue et al. | Dec 2015 | A1 |
20160055429 | Schwartz | Feb 2016 | A1 |
20160180412 | DuLeone et al. | Jun 2016 | A1 |
20160321548 | Ziskind et al. | Nov 2016 | A1 |
Number | Date | Country |
---|---|---|
101498586 | Aug 2009 | CN |
101833698 | Sep 2010 | CN |
201607767 | Oct 2010 | CN |
0958553 | Nov 1999 | EP |
1 690 222 | Aug 2006 | EP |
1 696 327 | Aug 2006 | EP |
2002032800 | Jan 2002 | JP |
2004178041 | Jun 2004 | JP |
2008502971 | Jan 2008 | JP |
2011186575 | Sep 2011 | JP |
2015122093 | Jul 2015 | JP |
20020017240 | Mar 2002 | KR |
100895464 | May 2009 | KR |
161048 | Apr 2016 | RU |
WO 9718534 | May 1997 | WO |
WO 2003034350 | Apr 2003 | WO |
WO 2004047353 | Jun 2004 | WO |
WO 2005038612 | Apr 2005 | WO |
WO 2005038688 | Apr 2005 | WO |
WO 2005124699 | Dec 2005 | WO |
WO2007004047 | Jan 2007 | WO |
WO 2008128583 | Oct 2008 | WO |
WO 2008144283 | Nov 2008 | WO |
WO 2010089771 | Aug 2010 | WO |
2015185917 | Dec 2015 | WO |
Entry |
---|
Touringplans.com, “Dragon Challenge”, (Web archive screen capture of Oct. 7, 2015, available at: httos://touringplans.com/islands-of-adventure/attractions/dragon-challenge) (Year: 2015). |
Lemaster, Austin. “Analysis and Implications of Guest Attitudes Towards Queuing in Theme Parks.” (2015). (Year: 2015). |
JP 2019-524147 Office Action dated Oct. 4, 2021. |
RU 2019117785/12 Office Action dated May 11, 2021. |
Ahmadi (Ahmadi R.H. 1997, Managing Capacity and Flow at Theme Parks, Operations Research, vol. 45 No. 1, pp. 1-13). |
AllABoutLean (https://web.archive.org/web/20150630191446/https://www.allaboutlean.com/littles-law/). |
Cribme (https://wegb.archive.org/web/20151106024343/http://www.cribme.com/cu/data/Applied%20Math/Markov%20Processes/HW/hw5.pdf). |
CN201780069272.9 Office Action dated Jul. 22, 2020. |
Lemaster, Austin, “Analysis and Implications of Guest Attitudes Towards Queuing in Theme Parks” (2015) HIM 1990-2015. 1720. (Year: 2015). |
International Search Report and Written Opinion in corresponding PCT Application No. PCT/US2015/045897 dated Nov. 11, 2015 (11 pages). |
International Search Report and Written Opinion in corresponding PCT Application No. PCT/US2013/044785 dated Apr. 30, 2014 (15 pages). |
PCT/US2017/060922 Invitation to Pay Additional Fees dated Feb. 1, 2018. |
Prenhall (https://web.archive.org/web/20060517181306/http://wps.prenhall.com/wps/media/objects/2234/2288589/ModD.pdf). |
Touringplans.com, “Dragon Challenge”, (Webarchive screen capture of Oct. 7, 2015, available at: hitps//touringplans.com/slands-ofadventure/atttactions/dragon-challenge) (Year: 2015). |
KR 2019-7016318 Office Action dated Jun. 27, 2022. |
Number | Date | Country | |
---|---|---|---|
20210166161 A1 | Jun 2021 | US |
Number | Date | Country | |
---|---|---|---|
62419837 | Nov 2016 | US | |
62419833 | Nov 2016 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 15807411 | Nov 2017 | US |
Child | 17174791 | US |