The present invention relates to a resource access management system, in particular, but not exclusively, for managing access to a ride at an amusement park. A method of determining a very accurate expected queue wait time for accessing a resource is also provided, as is a resource access management system for a resource having multiple access options, and a method of managing access to a resource having a standard queue access, an expedited queue access, and a queue-less access, and/or other access options. The system also measures the actual waiting time for an attraction at intervals throughout the period that the attraction is open.

When queuing for any resource, but in particular when queuing for access to a ride at an amusement park, it is common that the expected wait time for a user joining the queue is displayed. This allows a user to determine whether they wish to join the queue for a particular resource, or, as is the case in many situations, pay for expedited access to the resource, usually via a fast-track queuing system, time-slot booking or other methods. However, theme parks in particular have found precise determination and presentation of accurate wait times for rides expected before the wait or actually after the wait to be very challenging to implement.

There is an intrinsic difficulty in estimating the demand for the resource in order to provide an accurate determination of the estimated wait time. Users are often left with no accurate indication of the expected wait time for a queue line for individual rides or attractions, due to the present inaccuracy of the determination of the expected wait times. Failure to accurately identify an anticipated wait time to users of the resource can lead to the users becoming irate, particularly where the estimated wait time significantly underestimates the actual wait time. For some time, users have been given, through displays, highly inaccurate wait times. This has reduced user confidence in expected wait times shown throughout the park on overhead display boards.

However, some parks have fast-track queuing options and unfortunately these have reduced usage by park visitors because of accuracy and variability of indicated wait time values. There is also the requirement for the user to commit to using this method of entry for a whole day, which requires a significant payment to be made at the start of use.

This issue is exacerbated by expedited access options. The provision of a fast-track queue with a similarly variable demand can have deleterious effects on the rate of progression of the standard access queue. Often, operators will need to close their fast-track queue facilities to avoid undermining the accuracy of their standard access queue wait time information which is displayed to their users. Furthermore, fast-track queues are often managed manually with a separate long queue-line at the point of purchase. This negates many of the benefits associated with the fast-track process.

Pricing is also a difficulty for fast-track queues; during periods of low demand for the resource, the access via the fast-track queue is less attractive, and therefore there is minimal uptake for the fast-track queue. Often, operators will attempt to sell fast-track day-passes to users to mitigate these effects, rather than resource-specific tickets, for instance, for specific rides in an amusement park. However, this typically leads to the users feeling overcharged, particularly when demand for the resources is low, leading to a reduced satisfaction with the operator.

Furthermore, beneficial operation of controlling access to a resource or facility that has overloaded request for entry has to meet a number of major standards for operators, users and any regulatory authority. There is also the expected requirement that the system gives the appearance of being fair to the users, which is currently not met by many parks.

For the example provided, that is, for queueing for a ride at an amusement park, the expected wait time for the standard queue access can be estimated by the physical length of the queue area itself, with the exit of the queue area being gated and controlled. The majority of users in the amusement park would access this queue area.

The fast-track entrance has a queue line which is controlled via entry and exit mechanisms, allowing the users to access the ride much more quickly than those in the standard queue access. A specific charge would likely be levied. Alternatively, booked time slots could be provided, negating the need for the users in the fast-track queue to physically queue at all. However, visitors often arrive early and thus should add the early arrival waiting time to any fast-track queue time.

At present, it is difficult for users to be able to make an informed decision as to whether an expedited access route is advantageous, since the accuracy of the waiting times shown is so inaccurate. Also, in a theme park, the user will make decisions on methods of entry a number of times during the day, and inaccurate estimates of wait time will make users more and more irritated. Also causing extra irritation, on a less busy day, the day-long expensive fast-track pass is viewed as blatant profiteering by the park.

The present invention seeks to provide a vastly improved resource access management system and methodology for all visitors to the park which benefits both users and operators of the resource. The present invention allows the operator to watch the various queue lines and provide data of their use to permit careful management thereof, whilst providing the user with the feeling of having been fairly treated in their ability to access the resource.

According to a first aspect of the invention, there is provided a resource or facility access management system comprising: an entrance to the resource or facility having a plurality of access routes thereto; a primary said access route having a queue area including a queue entrance and a queue exit; at least one secondary said access route for providing access to the resource which is expedited with respect to that of the primary access route; at least one expedited queue access authorization issuing device configured to issue an expedited queue access authorization token for accessing the or each secondary access route; an expedited queue access authorization verifying device associated with the or each secondary access route which is configured to receive authorization information based on a presented expedited queue access authorization token and issued by the expedited queue access authorization device to determine a validity of the received authorization information; a first user counter positioned at or adjacent to the queue entrance and arranged to monitor the entrance of the queue area to provide user entrance data relating to the queue area; a second user counter positioned at or adjacent to the queue exit and arranged to continuously image the exit of the queue area to provide user exit data relating to the queue area; specific-user recognition means comprising a first user-recognition imaging device positioned at the queue entrance, and a second user-recognition imaging device positioned at the queue exit; a processor in communication with the first and second cameras, the specific-user recognition means, the expedited queue access authorization verifying device, and the queue less authorization verifying device; wherein the processor is adapted to determine an estimated queue wait time based on the user entrance data and the user exit data; the processor being configured to determine a specific-user accurate queue wait time from the specific-user recognition means, the processor enhancing the estimated queue wait time using the specific-user accurate queue wait time; wherein a number and/or proportion of expedited queue authorization tokens issued by the expedited queue access authorization issuing device respectively is determined based on the enhanced estimated queue wait times.

In a system in which a plurality of access options is provided, the determination of an accurate estimate of the queue wait time, irrespective of future trends, becomes challenging. In the present invention, there is a single processor which is able to combine data streams relating to each of the access options, and then determine an accurate wait time for at least the queue area. In particular, the use of a specific-user accurate queue wait time to act as a feedback for moderating any errors from any of the data streams ensures that the displayed queue wait time never deviates too greatly from the real wait time experienced by a user joining the queue at any given time. This ensures that the users feel as though they are being treated fairly when being charged for expedited access, in that the wait times displayed are an accurate indication of the wait times that they would otherwise experience when they are deciding whether to purchase expedited access.

The main purpose of the present invention is the ability to convey to a potential user how long they will have to wait in a queue line, and potentially whether to purchase expedited access, for a resource such as a theme park ride with a high degree of precision, and/or decide whether to choose, on an attraction-by-attraction basis, which queuing method to use. This can be achieved by the electronic purchasing of an‘out-of-line’ access ticket. The cost of this ticket may be proportional to the time saved in not having to wait in the regular queue line.

Furthermore, the first and second user counters may be first and second cameras arranged to also continuously monitor the entrance and exit of the queue area respectively.

Preferably, each of the first and second cameras may be associated with user-counting software and timing means, the user entrance data comprising a time-dependent change in the number of users entering the queue entrance, and the user exit data comprising a time-dependent change in the number of users exiting the queue exit. Said user-counting software may include head-counting software. User counting is the simplest method of obtaining an estimate of the number of users accessing a resource via the queue area and the rate of change of the total number of users in the queue area. The method is computationally simple, though errors can be introduced by double-counting or missing users, particularly children, who manage to bypass the cameras or similar user counter. However, it is an efficient way of providing continuous updates to the expected estimated queue wait time for the resource.

The present invention therefore uses technology in a new way. Television cameras can count the number of users that have entered and also the number that have left a queue line so as to predict the likely wait. However, this number is usually incorrect for a variety of different reasons. The provision of two different cameras with different features, that is, counting and personal recognition, allows for the actual wait time to be recorded in such a way that allows the system to compute a correction factor so that expected wait times are much more accurate. Since the two different types of camera are effectively coupled together so that the predicted wait time is very accurate, charging at a specific price per minute saved waiting in queue lines is precise and therefore viable. Without this improved accuracy, the park’s staff working in customer service would be inundated dealing with overcharging of customers who have bought access for a reduced wait that is totally inaccurate.

Optionally, specific-user recognition means may be provided for identifying a specific user in the queue, the processor being adapted to measure a specific-user accurate queue wait time, the processor modifying the estimated queue wait time using the specific-user accurate queue wait time. Said specific-user recognition means may comprise facial-recognition software. Optionally, the specific-user recognition means may comprise any of: infra-red detectors; cameras; cellular telephone network detectors; radio detectors; short- range communications detectors; or a physical identification mechanism.

Modification of the estimated queue wait time so as to provide a more accurate queue wait time which can be displayed to users, thereby allowing them to make a more precise decision regarding accessing the resource, can be quite important in maintaining user satisfaction during their resource experience. An accurate periodic modifier can be readily determined by monitoring the time taken for a specific user to pass through the queue area, advantageously offsetting any errors which may have been introduced by the user counting method.

Additionally, or alternatively, the specific-user recognition means may comprise user recognition software associated with each of the first and second cameras.

To reduce the cost of set-up of the system, it may be possible to utilise the existing cameras for the user count to identify specific users in order to create the more accurate estimate of queue wait time.

The first and second cameras may be overhead cameras positioned above the queue area, and the first and second user-recognition imaging devices may be positioned so as to image in a horizontal or substantially horizontal direction with respect to the queue area. These different view angles may currently prohibit one camera from performing both activities, but this may be overcome by other camera types in the future. It may be necessary that different imaging devices are used for the user count and identification of a specific user. An overhead camera is better suited for counting heads as they pass underneath, whilst facial recognition may be a straightforward way of identifying a specific user. In this case, the imaging devices will need to be positioned so as to be able to view the users faces as they pass through the queue area.

The system may preferably further comprise an external queue-data input in communication with the processor, the external queue-data input providing characteristic queue-wait-time modification data, the processor being adapted to determine a projected queue wait time or modifier based on the queue-wait-time modification data; and a display having first and second display portions, the estimated queue wait time being displayable at the first display portion, and the projected queue wait time or modifier being displayable at the second display portion.

Existing queue wait time display systems which may be currently installed in the park show the estimated queue wait for users already just about to finish queueing when they are present in the queue and can now be upgraded to show the precise expected wait time, using the present invention, for a person who is just about to join the queue. This information will be inaccurate for users joining the queue subsequently, as demand for the resource changes over time. The present invention utilises predictive capabilities to anticipate the change in demand based on a variety of factors which may affect the demand, such as the time of the day, or changes in weather conditions, vacation timing, and so on. Any display can then be configured to indicate both the present wait time and any expected change to the wait time, thereby better informing the users wishing to access the resource, actual time wasted for a current rider getting on the resource, and anticipated wasted time for a user about to join the line.

Preferably, the display may comprise a fixed position display board at or adjacent to the resource. Optionally, the display may comprise a display screen of a portable user device.

The form of the display may be chosen to best interact with users, and any appropriate combination of functional display types could be considered. Technology is integrated so that real-time waiting information is available at the user’s smartphone, and the purchase of out-of-line tickets and entry authorisation can be made via the smartphone.

The characteristic queue-wait-time modification data may comprise at least one of: historical resource usage data; environmental data; resource-venue-specific data; and projected resource usage data; calendar data; schools or college data; and advance ticket-sale data.

Furthermore, the characteristic queue-wait-time modification data may comprise resource frequency and/or availability data.

Different types of characteristic queue-wait-time modification data may be indicative of different factors which may affect the overall queue wait time of the queue area, including, but not limited to time of day and weather, and predictions of weather during the day, or available historical data from previous days. The more of these factors which can be considered and/or weighted, the more accurate the information which can be presented to the users.

Preferably, a plurality of said secondary access routes may be provided, the respective numbers of expedited queue authorization tokens issued by the expedited queue access authorization issuing device being adjustable based on the projected queue wait time. Additionally, or alternatively, a plurality of said secondary access routes may be provided, the respective numbers of expedited queue authorization tokens issued by the expedited queue access authorization issuing device being adjustable based on the projected queue wait time.

In order to control or manipulate demand for the various access options, it is possible for the operator to, manually or automatically, modify the issuance of authorization tokens in accordance with the demand as determined by the projected queue wait time.

One of the said secondary access route may be a fast-track access route. Others may include a queue-less access route, or a virtual queue access route, or a pre-bookable access route.

Optionally, a pricing of the or each secondary access route where preferred waiting is in cyberspace is then proportional to the accurate estimated queue wait time. Furthermore, a pricing of the or each secondary access route may be variable based on a difference between the enhanced estimated queue wait time and an expected wait time for the or each secondary access route.

The provision of a pricing structure which can be created so as to be proportionate to a realistic wait time saved by entering into a specific secondary access route provides users with a much greater degree of security regarding the benefit of purchasing expedited entry. This gives a greater degree of fairness for the customers than previous systems have ever been able to achieve.

According to a second aspect of the invention, there is provided a method of managing access to a resource having a standard queue access, an expedited queue access, and a queue-less access, the method comprising the steps of: a] counting the users accessing and/or leaving the resource via the standard queue access using first and second user counters positioned at or adjacent to a queue entrance and queue exit thereof respectively; b] determining an estimated queue wait time based on a time-dependent change in the number of users accessing and/or leaving the resource determined during step a]; c] modifying the estimated queue wait time based on a specific-user accurate queue wait time which is determined from a specific-user recognition means comprising a first user-recognition imaging device positioned at the queue entrance, and a second user-recognition imaging device positioned at the queue exit; and d] issuing a number and/or relative proportion of expedited queue authorization tokens and queue-less authorization tokens for respectively permitting authorized access to the expedited queue access and queue-less access based on the modified estimated queue wait time. According to a third aspect of the invention, there is provided a resource or facility access management system comprising: a queue area for providing access to a resource for which there is a time-variable demand, the queue area having a queue entrance and a queue exit; an expedited queue area for providing access to the resource which is expedited with respect to that of the queue area; a first user counter positioned at or adjacent to the queue entrance and arranged to monitor the entrance of the queue area to provide user entrance data relating to the queue area; a second user counter positioned at or adjacent to the queue exit and arranged to monitor the exit of the queue area to provide user exit data relating to the queue area; specific-user recognition means comprising a first user-recognition imaging device positioned at the queue entrance, and a second user-recognition imaging device positioned at the queue exit; a processor in communication with the first and second user counters, the specific-user recognition means, the expedited queue access authorization verifying device, and the queue-less authorization verifying device; wherein the processor is adapted to determine an estimated queue wait time based on the user entrance data and the user exit data; the processor being adapted to determine a specific -user accurate queue wait time from the specific-user recognition means, the processor enhancing the estimated queue wait time using the specific- user accurate queue wait time.

The invention will now be more particularly described, by way of example only, with reference to the accompanying drawings, in which:

Figure 1 shows a plan representation of one embodiment of a resource access management system in accordance with the first and third aspects of the invention;

Figure 2 shows a graph of an indicative expected wait time over the course of a day for a resource such as a ride at an amusement park;

Figure 3 shows a diagrammatic representation of a method of displaying an accurate queue wait time for accessing a resource; and

Figure 4 shows a diagrammatic representation of a method of managing access to a resource having a standard queue access, an expedited queue access, and a queue-less access, in accordance with the second aspect of the invention.

Referring to Figure 1, there is shown a resource access management system, indicated globally at 10, which is used for controlling access to a resource 12, such as a ride at an amusement park, for example, a rollercoaster.

The management of the access to the resource 12 is controlled by accurate determination of the demand for the resource 12, which in turn, allows the operator or proprietor to determine and/or modify information which is presented to prospective users 14 of the resource 12. In the indicative embodiment of the resource access management system 10, there are three access routes for prospective users. The first access route is a queue area 16 in which the users l4a may queue without charge, and users l4a in the queue area 16 are permitted to access the resource 12 on a first-come-first-served basis in the queue area 16.

The queue area 16 may be defined by a queue fencing 18 which has a queue entrance 20 at one end, via which users l4a may access the queue area 16. The queue entrance 20 may be provided with an entrance barrier 22, such as a gate or turnstile, to ensure that users l4a enter the queue area 16 in an orderly manner. The entrance barrier 22 may also potentially act as a user counting means, to determine a number of users l4a entering via the queue entrance 20. This allows the time-dependent change in the number of users l4a in the queue area 16 to be ascertained.

The queue area 16 may be fenced or have bounding walls, and a channel or walk-way is fenced which is preferably only wide enough for one or two individuals. The queue area 16 preferably has sufficient length and area that, even when at its busiest time, people do not crowd around the entrance 20 to the resource 12.

The length of the queue area 16 may be altered by addition of sections, or gating off parts thereof, if it is expected that a section may not be used based on an expected influx of users 14. The usable length of the queue area 16 must be proportionate to the expected number of users 14.

At the opposite end of the queue area 16 is a queue exit 24, via which the users l4a in the queue area are able to access the resource 12. Access via the queue exit 24 may be controlled by an exit barrier 26, which may preferably be an automated barrier such as a motorised gate or turnstile, but it will be appreciated that access could be readily regulated by a resource attendant. Preferably, the queue exit 24 is adjacent to an entrance to the resource 12.

It is expected that a majority of users l4a of the resource 12 would access the resource 12 via this primary access route, and there is typically no excess charge levied for users l4a wishing to access the resource 12 via this mechanism.

The second access route may preferably be an expedited, or fast-track, queue access 28 via which users l4b may access the resource 12 in an expedited way, typically via purchasing an authorization token 30 which enables access to the expedited queue access 28. The expedited queue access 28 may also be defined by queue fencing 18, as per the queue area 16, and may have an expedited queue entrance 32 which has an entrance barrier 34. Access to the expedited queue access 28 may be enabled by providing an expedited queue access authorization verifying device 36 at or adjacent to the expedited queue entrance 32 with which the authorization token 30 is communicable to permit entry to the expedited queue access 28. An expedited queue exit 38 may also be provided to permit access to the resource from the expedited queue access 28. The expedited queue access 28 may be provided so as to be associated with an expedited queue access authorization issuing device 40 configured to issue an expedited queue access authorization token 30 for accessing the expedited queue access 28.

Users 14 accessing the resource 12 via the expedited queue access 28 will typically experience shorter queue times for accessing the resource 12, since the purchase of authorization tokens 30 will limit the number of users 14 in the expedited queue access 28.

The third access option is a queue-less, or zero-wait, access 42, which permits a user l4c to access the next available and/or a specific instance of the resource 12 without needing to queue, preferably via a queue-less resource entry barrier 44. For example, a user 14 could purchase an authorization token 46 which allows them to immediately bypass the users 14 in the queue area 16 and expedited queue access 28, or a user 14 could purchase an authorization token 46 which is indicative of a specific time to access the resource 12, effectively booking their place on the resource 12.

In such an arrangement, a queue-less authorization issuing device 48 is provided which is configured to issue a queue-less authorization token 46 for accessing the queue-less access 42, and a queue-less authorization verifying device 50 is provided which is associated with the queue-less access 42.

It will be appreciated that the expedited queue and queue-less authorization issuing devices 40, 48 need not necessarily be physical devices which issue physical authorization tokens 30, 46. It may be that virtual authorization tokens 30, 46 are generated which can be read from a user device, such as a smartphone or via a computer application, for example.

The provision of three separate resource access routes, that is, the queue area 14, the expedited queue access 28, and the queue-less access 42, provides the operator of the resource access management system 10 with a significant degree of freedom with respect to the management of demand and/or costings for different aspects of the resource 12. A typical demand for the resource is illustrated in Figure 2. This demand is represented by a very accurate prediction of expected wait time for the regular queue line for an actual ride, and was validated by stopwatch measurements of the actual queue wait time throughout the day. Correction factors were introduced from time to time when estimated wait times were more than a given inaccuracy. It is believed that this graph was an original discovery. Demand is low when the amusement park first opens, but expected wait time increases over time. However, there are significant fluctuations, particularly in and around mealtimes, before a serious downturn in expected wait time as the amusement park is closed. These fluctuations, however, cause the serious issues in inaccurate estimation of the wait time. In the example shown, demand at 11.30am is approximately half that at 12.30pm, whilst the demand at 15.30pm is double that at 16.00pm. This illustrates the need for accurate determination of the wait time.

It will also be appreciated that other access routes could be considered, for example, a virtual queuing option, which allows users 14 to wait for their turn to access the resource 12 without necessarily physically being required to queue. This may or may not be chargeable. Alternatively, a booking system could be used, allowing users 14 to book their access to the resource for a specific time, allowing them to immediately or rapidly access the resource 12 provided that they arrive on time to the resource entrance.

Management of the issuance of the authorization tokens 30, 46 for either or both of the expedited queue access 28 and the queue-less access 42 can be controlled via a controller 52, which includes at least a queue- wait-time determining processor 54 and a communications means 56 which is in communication with the authorization token issuing devices 30, 46 preferably via the internet or radio communication. The processor 54 may be configured to determine at least one of: a number of authorization tokens 30, 46 to be issued for each of the expedited queue access 28 and the queue-less access 42 in view of demand; a price for each authorization token 30, 46; and any relationship between the expedited queue access 28 and/or queue-less access 42 and any specific instances of access to the resource 12 which may be related thereto, for example, specific seats 58 on a ride, such as front seats 58a.

Whilst a single controller 52 is referred to above, it will be appreciated that the control could be afforded by the provision of several independent controllers having separate processors.

The processor 54 is able to make decisions based on the demand for the access to the resource 12. If the length of the queue in the queue area 16 is large, then the cost for each authorization token 30, 46 can be increased, though if the charge is proportional to the wait in the queue area 16, this will automatically happen to some extent. Conversely, if the queue is short, the costs of the authorization tokens 30, 46 can be reduced. The processor 54 can also determine how many authorization tokens 30, 46 may be issued in total for a given time period.

Since the demand for the resource 12 determines the control afforded by the processor 54, it is critical that the demand for the resource 12 is determined accurately. Demand can be assessed based on many factors, but can be roughly calculated by the footfall through the resource 12.

The processor 54 may have access to a plurality of different variables which are characteristic to the resource 12, for example, the number of resource slots, such as seats 58, or the frequency of occurrence of specific instances of the resource 12. Such characteristic variables will provide the processor with an indication of expected capacity of the resource 12 per instance thereof. This may be represented as resource frequency and/or availability data, and may also encompass a maintenance status of the resource, for example.

Such information can be calculated in many ways. In the example provided, where the resource 12 is a ride, a sensor could be provided which logs the frequency of trains 60 passing through the access to the ride. Such a sensor could, for example, be provided as a proximeter 80 which is triggered by the passage of the train 60. Such an arrangement would allow the resource frequency to be updated regularly, rather than relying on a pre-programmed value which may be out-of-date as soon as any issues arise with the resource 12. Other factors to consider may be related to the users 14 of the resource. The total number of users 14 in each of the queue area 16, expedited queue access 28, and queue-less access 42, plus the number of users holding tokens for use at specific times provides the total demand. Calculation of this total demand can be challenging, but the processor 54 knowing the number of users either waiting or a total number allowed through each route, can then calculate a precise total demand.

Continuously counting the users 14 entering and exiting each of the queue area 16 and expedited queue access 28, as well as the number of users 14 passing through the queue-less access 42 can provide the time- dependent change in the number of users in the queue area 16. In the present invention, this is provided by the use of overhead cameras 62 which can count the number of users 14 passing thereunder. The overhead cameras 62 may be provided at the queue entrance and exit 20, 24 of the queue area 16, the expedited queue entrance and exit 32, 38 of the expedited queue access 28, and at the queue-less resource entry barrier 44 of the queue-less access 42. In effect, the overhead cameras provide user entrance and exit data which can be subsequently interpreted to determine the number of users 14 in the queue area 16. This data can be extracted, for example, by using user counting software, such as head-counting software, in combination with a timing means, such as an onboard clock of the processor 54. The data could be provided in the form of rates of entry or exit of users throughout the queue entrance and exit 20, 24 respectively, together with the actual number of people waiting in the queue lines having been issued with their tokens.

It is noted that overhead cameras 62 could be positioned at intervals, preferably regular intervals, through the queue area 16 and expedited queue access 28, which may in turn improve the accuracy of the head count.

At present, overhead cameras 62 are required in order to accurate determine the number of users 14 passing thereunder; misaligned cameras cannot accurately determine the correct number at present. However, it will be appreciated that any camera capable of user counting accurately could feasibly be utilised.

Other possible methods of user counting could be considered, however, with the same information fed back to the processor 54. For instance, a turnstile could be used to count the number of individuals passing through the entrance and exit barriers 22, 26, or the users could be manually counted, with the relevant data input for transfer to the processor 54. As such, overhead cameras 62 could be replaced with an alternative user counting means. Other options may include a physical counting mechanism, such as the turnstile, but could even include manual user counting by an individual.

It will be apparent that the determination of the number of users 14 exiting the queue area 16 need not necessarily be positioned at an end of the queue area 16 as defined by the queue fencing 18. For instance, users 14 could be counted at the point of accessing the resource 12, at the point of exiting the resource 12, that is, at a resource exit for instance, or could be counted during access of the resource 12. For example, sensors could be provided in individual seats 58 of a ride at an amusement park, thereby definitively counting the number of users 14 who physically access the resource 12. Overhead cameras 62 provide a means for readily determining the number of users 14 in total in the queues, since the total number having entered the queue area 16 and expedited queue access 28, minus the number having left the queue area 16 and expedited queue access 28, will provide the total number of users 14 wanting to access the resource 12 to which the number of token 30 holders l4b can be added. The time- dependent change in the number of users 14 accessing the queue-less access 42 may provide additional information regarding the possible throughput through the resource 12.

User counting can be inaccurate. If a user 14 does not pass directly under the overhead camera 62, or passes under the overhead camera 62 repeatedly, then the count may be distorted, but the processor 54 is able to correct this by utilising data gathered by user-recognition cameras which are able to measure exact wait times, as will be discussed hereafter.

The expected wait for users 14 in each of the queues in the queue area 16 and expedited queue access 28 can be calculated by the processor 54, based on the user count and the expected rate of passage of users 14 through the resource 12, and more accurately, when data from proximeter 80, which counts or notices the presence of each train and sends this data to the processor 54, is used. If the user count is inaccurate, then the expected wait for each of the queue area 16 and expedited queue access 28 can be distorted. This affects the operator’s ability to accurately set pricing and control demand for the authorization tokens 30, 46.

A more accurate determination of the wait time for users 14 in at least the queue area 16 can be created by using the determined time taken for a specific user 14 to pass through the queue area 16 to modify inaccurate user counting or if resource 12 is not completely or fully loaded. This can be determined by identifying the specific user 14, for example, via facial recognition or identification of easily-identifiable features of the user 14, such as readily-identifiable hair, clothing or accessories. First and second user-recognition devices 64 can be provided at or adjacent to the queue entrance 20 and queue exit 24 of the queue area 16, preferably being provided in the form of user imaging devices which are positioned so as to image in a horizontal or substantially horizontal direction with respect to the queue area 16. In a most basic arrangement, however, a single individual could be monitored manually, for example, by a member of staff, thereby allowing the accurate wait time to be determined precisely. Other options may include any of: infra-red detectors; cellular telephone network detectors; radio detectors; short-range communications detectors; or a physical identification mechanism. If cellular radio communication is used, this part of the queue should be inside a specially-constructed Faraday cage, to keep other radio signals away.

By using first and second user-recognition devices 64, the processor 54 is able to calculate the exact time taken by the specific user in the queue area 16, which can then be used as a correcting factor, transforming the expected wait as determined by the user counting calculation into an accurate wait time. This needs to be done every ten or twenty minutes in order to keep the actual queue parameters accurate, though it may be feasible to lengthen the period between determining a correction factor. In doing so, the operator is able to provide the accurate wait time as calculated for users 14 who are about to enter the queue area 16, which is likely to be more accurate than that determined solely by user counting. The processor 54 is able to determine an optimum flow progression through the various access routes, and accordingly weight the access of the various access routes to the resource 12, for example, by allocating specific percentages of seats on the ride to users 14 from specific access routes.

This approach is limited by virtue of the fact that the information regarding the demand is not up-to-date, that is, that it is based on the total number of users 14 presently in the queue area 16. Changes to the demand of historical data could be very useful, for example, in predicting the effect of a sudden heavy rain shower. There is no capability for determining expected changes to the demand.

The present invention can achieve this by providing an external queue-data input which is in communication with the processor, typically via the communications means 56, the external queue-data input providing characteristic queue-wait-time modification data which can be used to modify the accurate wait time to make future predictions. The processor 54 is adapted to determine a projected queue wait time or modifier based on the queue-wait-time modification data.

Characteristic queue-wait-time modification data may take many forms, but is indicative of an expected demand for the resource 12. For example, the characteristic queue-wait-time modification data may be indicative of time-dependent historical demand data, that is, anticipated fluctuations in the demand for the resource 12 over the course of a day. Historical resource usage data, environmental data, such as expected variations in weather over the course of a day, resource-venue-specific data such as special offers or deals, and projected resource usage data may all be contributing factors in the determination of characteristic queue-wait-time modification data. Other factors may include calendar data, schools or college data, and/or advance ticket-sale data.

By way of example, at an amusement park, sensors could be set up to anticipate demand for entry into the amusement park, as a likely indicator of demand for the rides. Sensors could be provided in a car park, for instance, to determine how many users 14 are likely to arrive, and data input could be received from public transport information sources, such as local train timetables, or from information relating to coachloads of users 14, which may significantly increase demand.

It is also noted that characteristic queue-wait-time modification data could also comprise information regarding expected demand for the expedited queue access 28 and/or the queue-less access 42. An increase in demand, for example, as determined by the number of authorization tokens 30, 46 issued, either as a whole or for a particular time period, will have an adverse effect on the rate of progression of the queue in the queue area 16. The processor 54 is therefore capable of determining both the accurate real-time wait time for the queue area 16, in addition to prospective changes to the wait times in the future. This information can be supplied to users 14 such that they can make informed decisions regarding their accessing of the resource 12.

To provide this information to users 14, the processor 54 can be configured to communicate with a display 66 having first and second display portions 68, 70. The estimated queue wait time is displayable at the first display portion 68, and the projected queue wait time or modifier is displayable at the second display portion 70.

The display 66 may be provided most commonly in the form of a fixed position, preferably electronic, display board at or adjacent to the queue entrance 20, but could additionally or alternatively be provided as a display for a portable user device, such as a smartphone, and may be displayable via a computer application.

It will be appreciated that a corresponding display 72 could be provided having at least one expedited queue access display portion 74 for displaying at least one of an estimated expedited queue wait time, projected expedited queue wait time or modifier, or expedited queue pricing or pricing modifier being displayed at the expedited queue display portion.

Similarly, a display 76 could be provided having a queue-less access display portion 78, an estimated queue less pricing being displayed at the queue-less access display portion 78.

The methodology underpinning the present invention can therefore be summarised as shown in Figure 3, as a method of determining an accurate queue wait time for accessing a resource 12, the method being indicated globally at S 100.

The users 14 accessing the resource 12 via the queue area 16 can be counted, at step S101, using first and second cameras 62 positioned at or adjacent to a queue entrance 20 and queue exit 24 respectively, so that the numbers waiting in queue area 16 is known at any point in time. An estimated queue wait time based on a time-dependent change in the number of users 14 accessing the resource 12 can then be determined, at step S 102. Using external characteristic queue-wait-time modification data, a projected queue wait time or modifier to the estimated queue wait time is determined, at step S 103, and both the estimated and projected wait times are displayed, at step S 104, to a user 14 wanting to access the resource 12.

The determination of the demand for the resource 12 via at least the queue area 16, and preferably also via the expedited queue access 28 allows for the operator to implement useful methods of controlling the demand for the resource 12 via the various access options.

Whilst the different access options could be all used to access identical instances of the resource 12, it will be appreciated that the different access options could act as different streams for different instances of the resource 12. In the embodiment of the resource access management system 10 illustrated in Figure 1, there may be an increased number of users 14 wishing to access the front seats 58a of the train 60, and as such, one or other of the queue-less access 42 or the expedited queue access 28 could be used purely for accessing the front seats 58a of the train 60 by the payment of a premium. Similar considerations may be applicable for riding in the rearmost seats, or in rear-facing seats, for instance.

To moderate access to the resource 12, it may also be possible for specific proportions of instances of the resource 12, such as seats 58 on the train 60, to be proportionally allocated to each of the access options. Demand for access via the expedited queue access 28 and/or the queue-less access 42 can be increased by decreasing the proportion of seats 58 available to users 14 in the queue area 16. This will have the effect of slowing the rate of users 14 in the queue area 16 passing through the resource 12, and this effect can be determined readily within the present invention, allowing the estimated queue wait time to be modified and displayed accordingly.

The throttling of demand for the expedited queue access 28 and/or the queue-less access 42 could also lead to the two access options being effectively combined, bringing the resource access management system 10 closer to a booking system.

In such an arrangement, the accurate estimated wait time for the queue area 16 can be used as an indicator of the expected wait time for a user 14 accessing the resource 12 at a particular time. Users 14 wishing to bypass the queue area 16 may effectively make a payment to reduce the time spent to wait for access to the resource 12.

The processor 54 is therefore able to provide a mechanism for adjusting the pricing associated with each access route, also waiting longer times for access will reduce demand, based on the accurate demand as determined by the present invention. Incentivising the purchase of specific access routes can in turn improve the smoothness with which the resource 12 operates, and can lead to improved customer satisfaction.

Such an arrangement may take the form of a cryptocurrency, configured using blockchain technology, with, for example, a unit of currency being capable of purchasing a ten-minute reduction in the wait time for the user 14, effectively booking a timeslot for a predetermined time in the future which is a reduced proportion of the estimated wait time. A user 14 wishing to access the resource immediately, in lieu of there being a queue-less access 42, may pay the full amount corresponding with the estimated wait time.

The cryptocurrency could be loaded as part of an authorization token 30, 46 issued for the resource, and therefore may have a physical representation. However, it will likely be more convenient that the cryptocurrency representation is virtual, for example, being loaded on a portable user device, such as a smartphone. The purchasing of reductions in wait time by users 14 evidently affects the wait time experienced by users 14 in the queue area 16. As such, it may be necessary for the processor 54 to automatically control the bookings for this facility so that only the predesignated maximum proportion of resource instances available to the users 14 attempting to bypass the queue area 16 to avoid significant and inequitable increases in the wait time experienced by those in the queue area 16.

There probably will be different pricing calculations associated with each of the secondary access routes for the resource 12. The wait time associated with the queue area 16 is critical, since this is generally the most well-populated queue. Expected wait times for this primary access route can be forecast very accurately through the method above and be shown on displays 66 throughout the amusement park, as well as near the queue entrance 20.

To establish the reasonably accurate wait time for this primary access route, the time take from entry to access of the resource 12 is determined using the overhead cameras 62 and the image recognition devices 64, and this results in the aforementioned highly accurate determination of the wait time for a user 14 joining the queue area 16 at that time.

For a user wishing to access the resource 12 via a virtual queue, the charge for booking a seat that will be available for riding after an out-of-line wait equal to the wait in the queue area 16 will have a numerical size proportionate to said expected wait time in the queue area 16, since this is the time saved by the user 14. This price will be indicated to the user prior to purchasing the entry into the virtual queue. Such a pricing structure can only be achieved if an accurate determination of the time saved compared with waiting in the queue area 16 is known, as is the case for the present invention.

For the fast-track access route, a potential pricing structure might be proportional to a percentage of the enhanced estimated wait time for the queue area 16, for example, proportional to half of the enhanced estimated wait time. However, it could also be proportionate to an expected reduction in the wait time for the fast-track access route, and therefore dynamic pricing in response to a time saving could be achieved. This control by the processor 54 is achievable since the system is sensitive to the dynamic fluctuations in demand for the resource 12 over time.

For instantaneous, or zero-wait, access routes, pricing could be made in a similar fashion to the fast-track access route, being proportional to the difference between the wait and the enhanced estimated wait time, which here is equal to the enhanced estimated wait time. Since this is an option which allows for effective queue-jumping to the resource 12, the proportionality could be achieved by applying a multiplier to the enhanced estimated wait time, such as double or triple the price of and equivalent gain via the fast-track route. Allocation of zero-wait access could have a significant knock-on effect on the wait time for the primary access option, and therefore will need to be effectively monitored, creating a feedback loop to the pricing of the instantaneous access route, but always supervised by processor 54 with a given proportion of seats or access numbers, where overall attendance is the maximum possible value. However actual feedback in the system when in daily use will indicate the maximum proportion of each access slot so that the system verification cannot be overruled, or indeed oversold.

Where pre-booking is a viable access route, a dynamic pricing structure could be utilised based on demand, and/or predicted demand for access to the resource 12. For example, pricing could be increased proportionally to the expected changes to the demand.

By way of example, a pricing structure could be considered as follows: for a fast-track route, a proportional charge could be levied to the wait in a physical queue which has been averted, with the user 14 effectively then waiting for a duration in cyberspace. For someone wishing to access the resource 12 more quickly, this charge could be increased by a proportional amount. For instance, if they wish for the waiting time to be halved with respect to the standard fast-track route, the charge could be doubled. For instant access, a more punitive charge could be applied, for example, a tripled charge with respect to the fast-track option.

One possible alternative might be to proportionally allocate access to the various access options according to their rarity and the speed with which the user 14 can access the resource 12.

For a four-access-route option, there may be a nominal allocation of priority access to the resource in the order of: ⁸ /i5, V 15, ² /is, and V s, respectively to standard queue access via the queue area 16, fast-track access, expedited fast-track access as described above, and instant access, respectively. The fractions indicated above are merely exemplary embodiments of one possible division between the allocations of the access routes and the skilled person will be able to determine a best proportion based on the context in which the present invention is used. This may be dependent upon a level of interest in the resource 12 by prospective users 14.

With the accurate knowledge of the queue wait time in the queue area 16, it becomes possible for the processor 54 to adjust the pricing of the various chargeable access routes based on the demand for at least the queue area 16, since this can be proportional to the wait time saved by comparison with the queue area 16. Where demand is low, the corresponding charges for the faster access routes can be automatically reduced; where demand is high, automatic increase of the charges can be applied. Since the charges applied will be proportionate to the queuing time calculated, which are accurate for a user 14 joining the queue area 16 at a given time, no users 14 feel cheated by the resource access management system and have an improved impression of their experience.

Clearly, there are significant difficulties associated with the accurate provision of queue wait times, especially when there is more than one access option for a resource 12. Figure 4 summarizes how the present invention is able to manage the determination of the estimated wait times for multi-queue resources 12. A method of managing access to a resource 12 is indicated globally at S200, the resource 12 having at least one access option and more preferably a standard queue access 16, an expedited queue access 28, and a queue-less access 42.

The users 14 accessing the resource 12 via the standard queue access 16 are counted, at step S201, using first and second cameras 62 positioned at or adjacent to a queue entrance 20 and queue exit 24 thereof respectively, and an estimated queue wait time is determined, at step S202, based on a rate and/or total number of users 14 accessing the resource via this access option, and/or the total number of users in the queues.

The estimated queue wait time can then be modified, at step S203, based on a specific-user accurate queue wait time which is determined from a specific-user recognition means comprising a first user-recognition imaging device 64 positioned at the queue entrance 20, and a second user-recognition imaging device 64 positioned at the queue exit 24.

A number and/or relative proportion of expedited queue authorization tokens 30 and queue-less authorization tokens 46 can then be issued, at step S204, for respectively permitting authorized access to the expedited queue access 28 and queue-less access 42 based on the modified estimated queue wait time.

The improved accuracy of the estimated queue wait time allows for the accurate control of the issuance, and/or pricing, of the expedited queue authorization tokens 30 and queue-less authorization tokens 46, without disrupting the overall passage of users 14 accessing the resource 12. This significantly improves the user 14 experience when accessing the resource 12, since their wait times will have been accurately displayed to them from the outset. Since most complaints from queueing users 14 relate to the discrepancy between the advertised wait time and that experienced, this arrangement will result in a reduction in the number of complainants.

It will be appreciated that whilst three access options are indicated in the above-described embodiment, it will be possible to utilise many of the techniques disclosed as part of the present invention with only a single queue, typically the queue area, or with two queues, typically the queue area and one or other of the expedited queue access or the queue-less access.

It is also noted that there are many contexts in which the present systems and methodologies could be applied outside of the queueing systems for rides at amusement parks.

One example of a system in which the present invention could be used is in the queueing at a taxi rank. The accurate determination of waiting times is notoriously difficult, and therefore the presentation to users of expected changes to demand, for example, based on local knowledge of expected demand increase associated with a large number of individuals leaving an event, such as a music or sports event, or the determination of the expected return times for taxis to the rank based on their expected journeys, is one scenario in which the display capabilities of the present invention could be utilised.

Ski resorts are also a logical corollary scenario, wherein often skiers are queuing for long periods to utilise ski lifts. Indication of likely changes to demand, such as with respect to the expected changes around normal mealtimes, or due to expected changes to the weather. Both the improved display capabilities and the demand-based modification of access to the resource could be utilised in this context. There will normally be single rider access to the lifts, that will also need to be integrated.

Similarly, the expected delays experienced at airport boarding areas could be utilised, in particular, to attempt to control the demand for processing through gates which can lead to excessive queues if large numbers of users attempt to access a boarding area simultaneously.

Another possible option is in the monitoring of traffic on toll roads or for carpool lanes or express lanes on motorways or highways. Determination of the demand for paid roads could be useful in setting a variable pricing level which could be displayed to the road users, as well as any expected changes in the demand, for instance, due to rush hour timings. Monitoring devices could be provided along a stretch of road leading to a toll road, for example, in order to determine the number of road users intending to utilise the toll road. Predictive demand could be assessed by monitoring the change in traffic, for example, by monitoring accession of vehicles at slip roads onto the motorways.

Other scenarios of relevance might be in sporting facilities, entertainment facilities, or water parks; indeed, any event where more than one access option may be viable.

It is therefore apparent that the present invention provides a resource access management system with significant improvements for both users and operators. The improved accuracy with which the estimated queue wait times can be calculated is of great benefit for users, allowing them to better plan their anticipated accessing of the resource, which the ability of the operator to control demand for the resource when multiple access options are present can also mitigate the effects of variable demand for a resource.

The words‘comprises/comprising’ and the words‘having/including’ when used herein with reference to the present invention are used to specify the presence of stated features, integers, steps or components, but do not preclude the presence or addition of one or more other features, integers, steps, components or groups thereof. It is appreciated that certain features of the invention, which are, for clarity, described in the context of separate embodiments, may also be provided in combination in a single embodiment. Conversely, various features of the invention which are, for brevity, described in the context of a single embodiment, may also be provided separately or in any suitable sub-combination. The embodiments described above are provided by way of examples only, and various other modifications will be apparent to persons skilled in the field without departing from the scope of the invention as defined herein.