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

• US 20040172316A1
• Filed: 10/15/2003
• Published: 09/02/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,047,205 B2
• Time in Patent Office: Days
• US Class Current: 705/5
• 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 30/02 Marketing; Price estimation or determination; Fundraising
• CPC Class Codes: G06Q 50/40 Business processes related to the transportation industry shipping G06Q10/083
• CPC Class Codes: G07B 15/04 comprising devices to free a barrier, turnstile, or the like turnstiles with registering means G07C9/10; coin-freed aspects G07F17/00
• 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 f a space to the attraction comprising:

a. developing a hierarchy for patrons using the priority basis;

b. permitting different patrons in the hierarchy access to a first attraction;

c. permitting a request for an allocation of a space on the first attraction including the steps of;

i. receiving an input from a remote location, input being communicated to a central computer for regulating the load of the first attraction;

ii. allocating available return times in relation to a level of a patron in the hierarchy;

iii. permitting receiving of a response remotely about available return times for the first attraction; and

iv. permitting the patrons to effect a choice of a selected available return time; and

d. employing an operation to provide patrons in the hierarchy access to the first attraction.

2. A method as claimed in claim 1 wherein the hierarchy 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.

3. A method as claimed in claim 1 wherein the hierarchy 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.

4. 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.

5. 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.

6. 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.

7. A method as claimed in claim 1 wherein multiple priority requests are permitting to selected patrons, the multiple requests being for different patrons in a selected group being at least one of the levels of the hierarchy of patrons.

8. 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 being at least one of the levels of the hierarchy of patrons.

9. 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 being at least one of the levels of the hierarchy of patrons.

13. 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.

14. 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.

15. 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.

16. 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.

17. A method as claimed in claim 1 wherein a nonuse of a priority assignment is factored into a computation of loading.

10. 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 f a space to the attraction comprising:

a. a hierarchy structure for patrons using the priority basis;

b. the structure providing access for different patrons in the hierarchy to a first attraction;

c. a receiver for a request for an allocation of a space on the first attraction including;

i. an input for receiving a signal from a remote location, input being communicated to a central computer for regulating the load of the first attraction;

ii. a table for allocating available return times in relation to a level of a patron in the hierarchy;

iii. a receiver for receiving of a response remotely about available return times for the first attraction; and

iv. a selection device for permitting the patrons to effect a choice of a selected available return time; and

d. means to provide patrons in the hierarchy access to the first attraction.

11. A system as claimed in claim 10 including a receiver for multiple priority requests to selected patrons, the multiple requests being for different attractions in the environment.

12. A system as claimed in claim 10 including a receiver for multiple priority requests to selected patrons, the multiple requests being for different patrons in a selected group being at least one of the levels of the hierarchy of patrons.