The present disclosure relates generally to the field of amusement parks. More specifically, embodiments of the present disclosure relate to methods and equipment utilized 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 been forced to wait 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 equal 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 at least one virtual queuing station associated with an individual attraction within a theme park. The virtual queue system also includes a transceiver of the at least one virtual queuing station, wherein the transceiver is configured to receive a wireless signal from a guest-associated device, wherein the wireless signal comprises identification information for a guest associated with a guest device. The virtual queue system also includes a virtual queue control system in communication with the at least one virtual queuing station and the active wearable, wherein the virtual queue control system is configured to receive a communication comprising the identification information from the at least one virtual queuing station and wherein receiving the communication causes the virtual queue control system to add the wearer to a virtual queue for the individual attraction and to send a confirmation message to one or both of the at least one virtual queuing station or to the guest device that the guest has been added to the virtual queue.
In accordance with another embodiment, a virtual queue system is provided. The virtual queue system includes a plurality of virtual queuing stations associated with respective attractions within a theme park; and a virtual queue control system configured to maintain respective virtual queues for the respective attractions and in communication with the plurality of virtual queuing stations, wherein the virtual queue control system is configured to receive communications from the plurality of virtual queuing stations and add guests to the respective virtual queues based on the communications.
In accordance with another embodiment, a method is provided. The method includes the steps of providing a wireless signal using communication circuitry of an active wearable to a virtual queuing station associated with an individual attraction within a theme park, wherein the wireless signal comprises identification information for a guest associated with a guest device; receiving a confirmation message via the communications circuitry confirming being added to a virtual queue of the individual attraction; and receiving a status message via the communications circuitry related to a position in the virtual queue.
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:
Presently disclosed embodiments facilitate virtual queuing within a theme park. A virtual queue control system as provided herein manages queuing for various attractions with the theme park to minimize or eliminate guest time spent waiting in a physical queue. In certain embodiments, a given attraction has a single virtual queue that is dynamically managed by the control system to add or remove guests, update positions in the queue, and send messages to the guests related to their queue positions. The system receives various inputs from the attractions and/or guests that are used to dynamically manage the various queues. In certain embodiments, queuing is mediated via guest devices such as active wearables (e.g., bracelets, wearable tags, necklaces or badges, etc.) that are carried by or associated with the guests and that interact with various kiosks or check-in points to permit guest to enter attraction queues. In this manner, park guests may enjoy the park without carrying paper tickets, identification, or other credentials. For example, guests at a water park may not wish to manage paper tickets that can get wet. Further, because guests wearing bathing suits have limited ability to carry identification items or handheld devices, active wearables that are compatible with water activities (e.g., waterproof) may be a more convenient way to manage queue information than a mobile device.
As generally represented by block 12 of method 10, when guests 120 arrive at a ticketing location 124 (e.g., hotel front desk, kiosk, guest service counter, park gate), the guests 120 may be provided with entry credentials (e.g., tickets or active wearables 110) among other items, such as a park map, virtual queuing instructions, and amenities instructions. Informational media (e.g., audio, video) and instructional signage may be present at all such ticketing locations 124. In some instances, guests 120 may have obtained entry credentials prior to arrival and may skip acquiring such credentials at the ticketing location 124.
As generally represented in block 14 of method 10, guests may enter and be provided entry into the park or a park area via an entryway 126. Specifically, as illustrated in
Also, as generally represented by block 14 of method 10, if guests 120 do not have their AW 110 with them or if their AW 110 is not properly activated, they may insert ticket media 132 into a scanner 134, which facilitates transfer of information to the gate monitoring facility 128, which may include any of a number of gate monitoring systems, and informs a park employee that the guest 120 is authorized to enter the park or park area. If authorization is granted in this manner, an AW 110 may be distributed to them and a photograph of the guest's face automatically taken. For example, a photograph may be automatically taken by a camera 136 positioned proximate the entryway 126. The same camera 136 may be used for monitoring purposes as well. In other embodiments, the picture of guests 120 acquiring their AW 110 may occur in a different location. Further, in some embodiments, the guests 120 may acquire their AW 110 after progressing through the entryway 126 (as in the illustrated embodiment of
As generally represented by block 16 of method 10, wait times may be ascertained by guests by viewing displays provided at numerous locations throughout the park or park area. At the entrance of certain or all attractions, displays 108 provide the wait time for the specific attraction. For example, the water slide 142 includes a display 144 that specifically provides a wait time for that attraction. The information for each display may be provided based on information obtained by tracking AWs 110 or otherwise monitoring park areas (e.g., ride exits and entrances) with monitoring sensors 104. Further, at the exit of certain or all attractions, a display may be provided to indicate the wait times for all attractions (e.g., all attractions in the park or park area). For example, the exit area of the water slide 142 includes a display 146 that may provide wait times for all of the surrounding attractions (e.g., rides 148). The display 146 may even provide wait times for non-ride attractions, such as a wait time for a restaurant 150. The display 146 may be limited to display of wait times for attractions within a particular park area 152 (e.g., a park “village”). Also, within each park area 152, one or more wait time boards 154 (e.g., centrally located displays 108) may indicate wait times for all park attractions or attractions within the park area 152. Further still, before guests 120 place their portable devices (e.g., mobile phones) into lockers 160, mobile applications may be used via the mobile devices to ascertain wait times.
Block 18 generally represents entering or establishing a position within a virtual queue. In one embodiment, the guest 120 enters the queue by walking to the attraction entry and walking through an entry portal. For example, the guest 120 may walk to the water slide 142 and walk through its entry portal 166. Once the guest 120 walks through the portal 166, the guest's AW 110 will notify him/her (via a tone, vibration, illuminator) of being added to the virtual queue. This may be achieved by detecting the AW 110 with the monitoring sensor 104 at the entry portal 166 and via aspects of the AW 110, which will be discussed further below. In another embodiment, the guest 120 may enter the virtual queue by walking to a queue entry post 168, which may indicate the name of the attraction and current wait time, and engaging the post 168 with the AW 110. This may include tapping the AW 110 against or positioning it near the post 168. The posts 168 may be located at the exit or entry of each attraction and at a central location within each park area 152 or village. In one embodiment, an individual post 168 may be associated with only one attraction such that engaging with the post 168 automatically enters the guest 120 in the virtual queue of the associated attraction, e.g., the virtual queue is entered without any guest selection between different attractions at the post 168, and tapping or engaging the post is the selection step for selecting the associated attraction.
Once the guest engages the queue entry post 168, the guest's AW 110 will notify the guest (e.g., via a tone, vibration, illuminator) of being added to the virtual queue. For example, the AW 110 may receive a signal to cause the displayed information on the AW 110 to change. Further, the post 168 may additionally or alternatively provide a notification of successful addition to the queue. The notification may be generated and/or communicated by a central virtual queue control system to the AW 110. In another embodiment, the notification is generated and/or communicated by the queue entry post 168. In yet another embodiment, the guest 120 may enter the virtual queue by walking to a queue kiosk 172 (e.g., a single device that displays the names and wait times for all virtual queuing attractions in the park or park area). Queue kiosks 172 may be located at the entry or exit of each attraction and in a central location within each park area 152. The guest 120 selects the queue he/she wishes to enter and engages (e.g., taps) the kiosk with his/her AW 110. Once the guest 120 engages the queue kiosk 172, the guest's AW 110 will notify the guest 120 (e.g., via a tone, vibration, illuminator) of being added to the virtual queue. For example, the AW 110 may receive a signal to cause the displayed information on the AW 110 to change. Further, the kiosk 172 may additionally or alternatively provide a notification of successful addition to the queue.
In another embodiment, the guest 120 must physically go the area of a particular attraction and engage with the designated queue entry post 168 for that attraction to enter the queue. That is, virtual queue entry is mediated only via the designated queue entry post (or posts) 168 that are physically co-located with the attraction. In this manner, the guest is encouraged to see an individual ride 148 and determine if the ride is of interest before entering the ride virtual queue. The central queue controller receives the communication form the post 168 or kiosk 172 and adds the guest to the appropriate virtual queue. The addition may be based on a time stamp or a counter. For example, for attractions that have multiple tap-in posts 168, the guests may be added based on the individual time stamp of the tap-in event and on a first-in basis.
In each of the embodiments discussed above, the guest's AW 110 may display the estimated return time. For example, a display on the AW 110 may provide a time (e.g., 5:02 PM) by which the guest should return to enter a loading group 122. This time may dynamically change depending on the operational factors (e.g., current ride capacity, other guests leaving the queue, guests with express (e.g., credentials to automatically jump to the front of a physical and/or virtual queue) or very important person (VIP) credentials entering the queue, inclement weather, and/or downtimes). In some embodiments, once the guest 120 has entered a virtual queue (or some limited number of virtual queues), the guest 120 can no longer enter any other virtual queue unless he/she leaves the current virtual queue, either by entering the ride or by entering a different virtual queue. For example, in one embodiment, engaging the post 168 of a ride or attraction overrides any previously existing places in a virtual queue. In this manner, the guest 120 may traverse the park and, upon noting a ride that is of greater interest or that has a shorter wait time, may simply swipe the AW 110 to enter into a new virtual queue and be automatically removed from a previous virtual queue with one action, which permits the guest 120 to minimize engagement with queue devices and enjoy the park experience.
Further, if more than one virtual queue can be entered, the difference between wait times for the available virtual queues may be set to be a sufficient time for both to be entered taking into consideration variables such as travel time between. The system may also artificially space multiple virtual queues to optimize the patrons' day and transit time. In one embodiment, if there is no penalty for failure to arrive at a queued attraction, aside from not being able to enter additional queues, the system may permit close-together times but may also account for a certain predicted percentage of no-shows. In another embodiment, the virtual queuing system may only be in effect if the wait time for the current attraction is greater than 10 minutes. In another embodiment, the guest 120 may be permitted to enter two virtual queues at the same time, but may only enter a single virtual queue at a time that is associated with a ride designated as a low capacity ride. For example, certain park rides may have relatively low capacity and, therefore, may develop longer virtual queues than higher capacity rides, which are capable of moving a greater number of guests through the ride in a given period of time. To control the virtual queue length of lower capacity rides, the virtual queue system as provided herein may, in certain embodiments, prevent the guest 120 from entering two low capacity ride virtual queues simultaneously. For example, when the guest 120 is already entered in a low capacity queue, engaging with the designated post 168 of a second low capacity ride may trigger a warning message displayed on a display of the post 168, e.g., “GUESTS IN LINE FOR DINOSAUR ADVENTURE MAY NOT ENTER THE LINE FOR VOLCANO RUSH. WOULD YOU LIKE TO EXIT THE LINE FOR DINOSAUR ADVENTURE TO JOIN THE LINE FOR VOLCANO RUSH?” The post 168 may then receive a guest selection of YES or NO. If the guest 120 selects no, the engagement with the post 168 of the second low capacity ride is ended. If the guest 120 selects YES, the guest 120 is added to the virtual queue of the second low capacity ride and automatically removed from the virtual queue of the first low capacity ride.
As generally represented by block 20 of method 10, present embodiments facilitate monitoring or waiting in the virtual queue. Guests 120 may wait in the virtual queue by experiencing instantaneous capacity attractions (e.g., a wave pool, swimming pool, splash pad, lazy river, a ride with no wait time), visiting food, beverage, or merchandising locations, or simply relaxing (e.g., resting in a lounge chair). If an attraction wait time of a virtual queue changes, this information may be provided via the communication system 106 to the AW 110, which will notify the wearing guest 120 and display the updated wait time. If a guest 120 wishes to leave a current virtual queue for another virtual queue, he/she can do so by just joining a new virtual queue as set forth in the description of the various embodiments above. If a guest leaves the park (or, in some cases, a park area) while waiting in a virtual queue, he/she is automatically removed from any virtual queues he/she is currently in. Present embodiments may establish no geographical limits within the park while waiting in a virtual queue and guests 120 may be free to go to any location and perform any task within the park.
As generally represented by block 22 of method 10, present embodiments encourage initiating and participating in attraction experiences. In some embodiments, the virtual queuing system 100 will notify the guest 120 prior to the guest's ride time. To determine the amount of prior notification time, the system 100 will utilize multiple factors to optimize capacity: current wait time at the attraction, current distance of the guest 120 away from the attraction, the guest's current activity, and the guest's history for arrival speeds from previous virtual queues. Once the guest is notified, the guest 120 travels to the attraction entrance and walks to the load platform, which accommodates the limited standby group 122. These factors or variables are monitored by the computer system 102 (e.g., a network of computers 302), which includes at least one processor 304 and at least one memory 306, via communication with the monitoring sensors 104. To ensure that the attraction throughput is not starved, a small standby group 122 (less than 10 minutes) may be formed prior to the load platform at each attraction. Once a guest reaches the load platform and enters the ride, he/she is removed from the current virtual queue. After experiencing the attraction, guests 120 can join another virtual queue as described above (e.g., a post, kiosk, or the like located in the exit path of the attraction).
As generally represented by block 24 of method 10, present embodiments also facilitate communication and management of additional data related to park management. For example, the AW 110 may also perform functions other than facilitating queue access. Specifically, the AW 110 may operate as an identification device used for cashless purchases and for validation to access controlled areas. In some embodiments, guest photographs are automatically taken while on each attraction, as triggered by the AW 110. Such photographs can be purchased by the guest 120 via an Internet portal (e.g., website, app, kiosk). Further, information may be automatically logged by the virtual queuing system 100 for data analysis. This information may include: experienced attractions (including count and order of visit), wait time for each attraction, time it takes for the guest to return to the attraction once notified, entry time into the park, exit time out of the park, amount of money spent via cashless system.
In addition, one or both of the virtual queue control system 502 and an individual virtual queuing station 530 may include a memory device (e.g., memory device 508 or 510) for storing instructions executable by a processor (e.g., processor 512 or 514) to perform the methods and control actions described herein. For example, the processor 512 may execute instructions for dynamic virtual queue management based on inputs from the virtual queuing stations 530 as well as data on guest entry into a ride and guest exit from a park. Additional inputs to dynamic queue management may include guest location within the park. For example, a reminder to return to the attraction may be based at least in part on the guest's location relative to the attraction, as determined via wireless signal or global positioning system (GPS) information from the guest active wearable or by a guest's last tap-in location with the virtual queuing station or other tap-in device. The system 500 may store guest locations during a park visit to create an accessible log of guest locations within the park for use in predicting guest current and future locations. If the guest is estimated to be located within a first distance or within a first zone relative to the attraction, the return reminder or message is sent within to return within a first time (e.g., “20 MINUTES UNTIL VOLCANO RUSH”), which accounts for a shorter travel time to the attraction. If the guest is instead in a farther second zone or a farther estimated second distance, the return reminder or message accounts for the longer travel time by providing an earlier return time (e.g., “5 MINUTES UNTIL VOLCANO RUSH”), to account for longer walking times to the attraction. In this manner, guests at similar positions in the virtual queue but at different locations within the park are estimated to return to the attraction within the same approximate time window.
The processor 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 control system 502 or an individual virtual queuing station 530 may include may be accessed by an operator interface 520, e.g., a computer-based workstation or a mobile device, and/or may include an input/output interface 510 and a display (e.g., display 532).
The virtual queuing station 530 receives signals (e.g., wireless signals, such a RF signals) from a guest AW 540. The AW 540 may, in one embodiment, tap in to the virtual queuing station (e.g., via a hand wave or via positioning the AW 540 within the reading zone of the virtual queuing station 530) where it send the signal via NFC and receives signal back and updates via NFC. Additionally, components of the system (e.g., the virtual queuing station 540 and/or the AW 540) may be actively listening for a wireless broadcast and may update the display upon receipt of the appropriate broadcast. Another option is a system where the virtual queuing station 530 are dumb/passive and the AW 540 reads the totem location and transmits the request through a wireless network bypassing the need to have the virtual queuing station 530 or ride entry/exit stations read the AW 540. These signals may, in turn, be communicated to the virtual queue control system 502 to add the guest associated with the AW 540 to the virtual queue. While the virtual queuing station 530 facilitates guest entry into a virtual queue, the virtual queue system 500 may also include ride entry stations 550. An individual ride entry station 550 may be implemented as an automatic gate or reader such that the AW 540 as it passes through the ride entry station 550 is automatically read and the guest associated with the AW 540 is indicated as entering the ride and, therefore, is automatically removed from the virtual queue. An individual ride entry station 550 may include communications circuitry 550, a processor 554, and a memory device 556 as provided herein. It should be understood that certain features of the virtual queue control system 502 may additionally or alternatively be implemented locally at the virtual queuing station 530 or the ride entry station 550.
The virtual queue system 500 may, in certain embodiments, manage a total guest experience to ensure that an individual guest may experience a minimum number of rides or experiences per day. For example, based on the virtual queue load for various attractions, the virtual queue system 500 may permit entry into a predetermined number of queues at the beginning of the day. Alternatively, the virtual queue system 500 may dynamically present ride options to each guest at a central kiosk (e.g., queue kiosk 172, see
While only certain features of the present embodiments 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 present disclosure. Further, it should be understood that certain elements of the disclosed embodiments may be combined or exchanged with one another.
The present application is a continuation of U.S. application Ser. No. 14/829,227, filed on Aug. 18, 2015, which claims the benefit of U.S. Provisional Application No. 62/039,609, entitled “Virtual Queuing System and Method” and filed Aug. 20, 2014, the disclosures of which are incorporated herein by reference for all purposes.
Number | Name | Date | Kind |
---|---|---|---|
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 et al. | 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 |
6628899 | Kito | Sep 2003 | B1 |
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 |
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 |
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 | Dabrowskiqqq | 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 |
20020007292 | Paxton | 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 |
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 |
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 |
20050093986 | Shinohara | May 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 |
20050256724 | Rasin | Nov 2005 | A1 |
20050278215 | Seele, Jr. | Dec 2005 | A1 |
20060002413 | Tsutazawa et al. | 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 |
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 |
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 |
20090259556 | Carroll et al. | Oct 2009 | A1 |
20090267728 | Mayrand | Oct 2009 | A1 |
20090276341 | McMahan 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 et al. | 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 |
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 |
20110178960 | Dever et al. | Jul 2011 | A1 |
20110227726 | Lee | Sep 2011 | A1 |
20110307547 | Backer et al. | Dec 2011 | A1 |
20120013462 | Tuck et al. | Jan 2012 | A1 |
20120016745 | Hendrickson | Jan 2012 | A1 |
20120040751 | Peters | Feb 2012 | A1 |
20120116789 | Boss et al. | May 2012 | A1 |
20120116863 | Boss et al. | May 2012 | A1 |
20120136793 | Barber-Mingo et al. | May 2012 | A1 |
20120147169 | Harper 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 |
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 |
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 |
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 |
20140074521 | Morioka | 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 |
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 |
20170098337 | Galley et al. | Apr 2017 | 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 |
H08194853 | Jul 1996 | JP |
2002032800 | Jan 2002 | JP |
2004178041 | Jun 2004 | JP |
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 |
2014041738 | Mar 2014 | WO |
Entry |
---|
Chu, Liou, Lin Hui, and Fu-Yi Hung. “Simulation of theme park queuing system by using arena.” 2013 Ninth International Conference on Intelligent Information Hiding and Multimedia Signal Processing. IEEE, 2013. (Year: 2013). |
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). |
JP 2017-510342 Office Action dated Jun. 20, 2019. |
JP Japanese Office Action Application No. 2022-101699 dated Aug. 31, 2023. |
Number | Date | Country | |
---|---|---|---|
20210350292 A1 | Nov 2021 | US |
Number | Date | Country | |
---|---|---|---|
62039609 | Aug 2014 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 14829227 | Aug 2015 | US |
Child | 17385391 | US |