Claims
- 1. A method of managing the loading by patrons of multiple attractions in an entertainment environment wherein different patrons are permitted access to the attraction on at least two bases, firstly, a first-in first-out basis, and secondly, on a priority basis established by a prior allocation of a space to the attraction comprising:
a. permitting application through an entry of an allocation of a space on the first attraction including the steps of:
i. receiving an input from a remote location, the input being effected through a control device associated with a television unit, selectively a digital television having a control device for operating the television, the input being communicated to a central computer for regulating the load of the first attraction; ii. permitting receiving of a response remotely about the available return times for the first attraction; and iii. permitting the patron to effect a choice of a selected available return time; and b. employing an operation, at the attraction to provide access to the first attraction.
- 2. A method as claimed in claim 1 wherein the television is locatable remotely from the environment, the remote location being selectively in at least one of a room of a patron, the room being associated with the entertainment environment, or in a common area of a facility housing the room.
- 3. A method as claimed in claim 1 wherein the television is locatable remotely from the environment, the remote location being selectively in at least both of a room of a patron, the room being associated with the entertainment environment, or in a common area of a facility housing the room.
- 4. A method as claimed in claim 1 wherein a hierarchy of available times is determined on the basis of those remotely located from the environment when making a priority request and those located at the environment making the priority request.
- 5. A method as claimed in claim 1 wherein a hierarchy of available times is determined on the basis of those remotely located from the environment when making a priority request, those resident in a facility associated with the environment when making the request, and those located at the environment making the priority request.
- 6. A method as claimed in claim 1 wherein multiple priority requests are permitting to selected patrons, the multiple requests being for different attractions in the environment.
- 7. A method as claimed in claim 2 wherein multiple priority requests are permitting to selected patrons, the multiple requests being for different attractions in the environment.
- 8. A method as claimed in claim 3 wherein multiple priority requests are permitting to selected patrons, the multiple requests being for different attractions in the environment.
- 9. A method as claimed in claim wherein multiple priority requests are permitting to selected patrons, the multiple requests being for different patrons in a selected group of at least one of the levels of the hierarchy of patrons.
- 10. A method as claimed in claim 2 wherein multiple priority requests are permitting to selected patrons, the multiple requests being for different patrons in a selected group of at least one of the levels of the hierarchy of patrons.
- 11. A method as claimed in claim 3 wherein multiple priority requests are permitting to selected patrons, the multiple requests being for different patrons in a selected group of at least one of the levels of the hierarchy of patrons.
- 12. A method as claimed in claim 1 wherein the priority is redeemed through a selected essentially automatic procedure, such procedure being the reading of one of a RF identification, reading of a magnetic code or barcode allocated to the patron.
- 13. A method as claimed in claim 1 wherein the priority is redeemed at a time of entry into the environment or the attraction in the environment.
- 14. A method as claimed in claim 1 including a computing process to determine the mix ratio of numbers of accesses granted to the priority access and non-priority access, and feeding back redemptions of the priority accesses such that near real time updates of availability for further granting of accesses may be computed.
- 15. A method as claimed in claim 1 including the ability to permit at least one of the exchange or return of previously assigned priority access, and whereby such exchange permits for updating the computation of a load of the attraction.
- 16. A method as claimed in claim 1 wherein a nonuse of a priority assignment is factored into a computation of loading.
- 17. A system of managing the loading by patrons of multiple attractions in an entertainment environment wherein different patrons are permitted access to the attraction on at least two bases, firstly, a first-in first-out basis, and secondly, on a priority basis established by a prior allocation of a space to the attraction comprising:
a. means for entry of an allocation of a space-on the first attraction including:
i. receiving an input from a remote location, the input being effected through a control device associated with a television unit, selectively a digital television having a control device for operating the television, the input being communicated to a central computer for regulating the load of the first attraction; ii. permitting receiving of a response remotely about the available return times for the first attraction; and iii. permitting the patron to effect a choice of a selected available return time; and b. employing an operation at the attraction to provide access to the first attraction.
- 18. A system as claimed in claim 17 including a computer for calculating a hierarchy of available times on the basis of those requested remotely from the environment when making a priority request and those located at the environment when making the priority request.
RELATED APPLICATIONS
[0001] This Application is a continuation in part of U.S. patent application Ser. No. 09/617,721, filed Jul. 17, 2000 entitled METHOD AND APPARATUS FOR MANAGING ATTRACTION ADMISSIONS, which in turn is a continuation in part of application Ser. No. 09/372,405, filed Aug. 10, 1999, and issued as U.S. Pat. No. 6,173,209. This application is also related to application Ser. No. ______ (Docket No. 58085-010201), application Ser. No. ______ (Docket No. 58085-010202), application Ser. No. ______ (Docket No. 58085-010204), all of which have been filed concurrently herewith. The contents of those applications are incorporated by reference herein.
Continuation in Parts (2)
|
Number |
Date |
Country |
Parent |
09617721 |
Jul 2000 |
US |
Child |
10687226 |
Oct 2003 |
US |
Parent |
09372405 |
Aug 1999 |
US |
Child |
09617721 |
Jul 2000 |
US |