Management of the flow of persons in relation to centers of crowd concentration via television control

• US 20040181424A1
• Filed: 10/15/2003
• Published: 09/16/2004
• Est. Priority Date: 08/10/1999
• Status: Active Grant

• Current Assignee: Disney Enterprises Incorporated (The Walt Disney Company)
• Original Assignee: Disney Enterprises Incorporated (The Walt Disney Company)
• Inventors: Stafford, Dale A., Hale, Gregory B., Schwalb, Andrew, Craven, Tom, Schweizer, Kenneth W.
• Granted Patent: US 7,720,718 B2
• Time in Patent Office: Days
• US Class Current: 705/1
• CPC Class Codes: G06Q 10/02 Reservations, e.g. for tickets, services or events
• CPC Class Codes: G06Q 10/025 Coordination of plural reservations, e.g. plural trip segments, transportation combined with accommodation
• CPC Class Codes: G06Q 10/04 Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem" market predictions or forecasting for commercial activities G06Q30/0202
• CPC Class Codes: G06Q 20/105 involving programming of a portable memory device, e.g. IC cards, "electronic purses"
• CPC Class Codes: G06Q 30/02 Marketing; Price estimation or determination; Fundraising
• CPC Class Codes: G06Q 30/0639 Item locations
• CPC Class Codes: G06Q 90/20 Destination assistance within a business structure or complex
• CPC Class Codes: G07C 11/00 Arrangements, systems or apparatus for checking, e.g. the occurrence of a condition, not provided for elsewhere
• CPC Class Codes: G07C 2011/02 related to amusement parks
• CPC Class Codes: G07C 2011/04 related to queuing systems

Abstract

A method and system for the loading of patrons at multiple attractions at an entertainment includes the first-in first-out line and a priority based line. A cellular telephone is used to obtain and claim priority status. In other forms different priorities are established based on where, when and the number of priority spaces required. Different hierarchies are established for computer controlling the different lines for multiple attractions in the entertainment environment. The system and method also provide for moving people from an area of concentration to other locations.

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.

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.

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.

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.