EVENT MANAGEMENT
20210012293 ยท 2021-01-14
Assignee
Inventors
Cpc classification
G06Q20/127
PHYSICS
G06Q30/0236
PHYSICS
G06Q10/025
PHYSICS
G06K19/0723
PHYSICS
G06Q10/047
PHYSICS
G06F3/04847
PHYSICS
G06K7/10366
PHYSICS
International classification
G06K7/10
PHYSICS
Abstract
Obtain rider locations for horse riders of a horse show event, the rider locations including at least a first location associated with a first horse rider, the horse show event including a plurality of venues, each of the plurality of venues being associated with at least a different first venue location. Obtain horse locations for horses associated with the horse riders, the horse locations including at least a second location associated with a first horse associated with the first horse rider. Determine a first route for the first horse rider from the first location of the first horse rider to a first venue location. Determine a second route for the first horse from the second location of the first horse to the first venue location. Provide an interface through which the first route and the second route are accessible.
Claims
1. A system comprising: one or more processors; and memory storing instructions that, when executed by the one or more processors, cause the system to perform: obtaining a first location associated with a participant at a venue; registering the participant for a first event that is or will be scheduled to occur at a first venue location of a plurality of venue locations associated with the venue; providing a scratch toggle that, when activated, indicates the participant is to be unregistered from the first event; obtaining a second location, wherein the second location represents a location of a thing associated with the participant; determining, in response to and based on a first start time associated with the first event, a first route for the participant from the first location to the first venue location; disabling the scratch toggle when the second location matches the first venue location, wherein disabling the scratch toggle prevents the participant from being unregistered from the first event; providing an interface through which the first route and the scratch toggle are accessible.
2. (canceled)
3. The system of claim 1, wherein the instructions further cause the system to perform: detecting, prior to the first start time associated with the first event, a change from the first venue location to a second venue location of the plurality of venue locations; and dynamically updating, in response to the change, the first route based on the change.
4. The system of claim 1, wherein the participant is a first horse rider of a plurality of horse riders in a horse show at the venue and the thing associated with the participant is a first horse.
5. The system of claim 4, wherein the memory stores instructions that, when executed by the one or more processors, causes the system to perform: obtaining horse locations for a plurality of horses associated with the horse riders, the horse locations including at least the second location, wherein the second location is associated with a first horse of the first horse rider; determining, in response to and based on the first start time, a second route for the first horse from the second location to the first venue location, wherein the first route and the second route are determined such that the first horse rider and the first horse are scheduled to arrive at the first venue location of the particular venue at a same time.
6. The system of claim 4, wherein the instructions cause the system to perform: obtaining horse locations for a plurality of horses associated with the horse riders, the horse locations including at least the second location, wherein the second location is associated with a first horse of the first horse rider; determining, in response to and based on the first start time, a second route for the first horse from the second location to the first venue location, wherein the first route and the second route are determined such that the first horse rider and the first horse are scheduled to arrive at the first venue location of the particular venue at different times.
7. The system of claim 1, wherein the first location represents a current location of the participant, and the second location represents a current location of the thing associated with the participant.
8. The system of claim 1, wherein the instructions cause the system to perform: linking any of the participant and the thing associated with the participant to at least one judge responsible for scoring either or both the participant, and the thing associated with the participant.
9. The system of claim 8, wherein the instructions further cause the system to perform: receiving a physical score card to be completed; generating and uploading an electronic score card based on the physical score card to be completed; receiving, via a graphical user interface, one or more user inputs drawn on the electronic score card; converting the one or more user inputs into usable data for scoring either or both the participant and the thing associated with the participant; determining, based on the converted inputs, a participant score, thereby proving near-real time participant scoring.
10. The system of claim 9, wherein the instructions further cause the system to perform: providing the participant score to at least the participant via the interface.
11. A method implemented by a computing system including one or more processors and storage media storing machine-readable instructions, wherein the method is performed using the one or more processors, the method comprising: obtaining a first location associated with a participant at a venue; registering the participant for a first event that is or will be scheduled to occur at a first venue location of a plurality of venue locations associated with the venue; providing a scratch toggle that, when activated, indicates the participant is to be unregistered from the first event; obtaining a second location, wherein the second location represents a location of a thing associated with the participant; determining, in response to and based on a first start time associated with the first event, a first route for the participant from the first location to the first venue location; disabling the scratch toggle when the second location matches the first venue location, wherein disabling the scratch toggle prevents the participant from being unregistered from the first event; providing an interface through which the first route and the scratch toggle are accessible.
12. (canceled)
13. The method of claim 11, further comprising: detecting, prior to the first start time associated with the first event, a change from the first venue location to a second venue location of of the plurality of venue locations; and dynamically updating, in response to the change, the first route based on the change.
14. The method of claim 11, wherein the participant is a first horse rider of a plurality of horse riders in a horse show at the venue and the thing associated with the participant is a first horse.
15. The method of claim 14, comprising: obtaining horse locations for a plurality of horses associated with the horse riders, the horse locations including at least the second location, wherein the second location is associated with a first horse of the first horse rider; determining, in response to and based on the first start time, a second route for the first horse from the second location to the first venue location, wherein the first route and the second route are determined such that the first horse rider and the first horse are scheduled to arrive at the first venue location of the particular venue at a same time.
16. The method of claim 14, comprising: obtaining horse locations for a plurality of horses associated with the horse riders, the horse locations including at least the second location, wherein the second location is associated with a first horse of the first horse rider; determining, in response to and based on the first start time, a second route for the first horse from the second location to the first venue location, wherein the first route and the second route are determined such that the first horse rider and the first horse are scheduled to arrive at the first venue location of the particular venue at different times.
17. The method of claim 11, wherein the first location represents a current location of the participant, and the second location represents a current location of the thing associated with the participant.
18. The method of claim 11, wherein the instructions cause the system to perform: linking any of the participant and the thing associated with the participant to at least one judge responsible for scoring either or both the participant, and the thing associated with the participant.
19. The system of claim 18, further comprising: receiving a physical score card to be completed; generating and uploading an electronic score card based on the physical score card to be completed; receiving, via a graphical user interface, one or more user inputs drawn on the electronic score card; converting the one or more user inputs into usable data for scoring either or both the participant and the thing associated with the participant; determining, based on the converted inputs, a participant score, thereby providing near-real time participant scoring.
20. The method of claim 19, further comprising: providing the participant score to at least the participant via the interface.
21. The method of claim 11, comprising: providing an add toggle that, when activated, indicates the participant is to be registered for a second event that is or will be scheduled to occur at a second venue location of the plurality of venue locations associated with the venue; obtaining a third location associated with the participant; determining, in response to and based on a second start time associated with the second event, a second route for the participant from the third location to the second venue location; providing an interface through which the add toggle and the second route are accessible.
22. The system of claim 1, wherein the instructions cause the system to perform: providing an add toggle that, when activated, indicates the participant is to be registered for a second event that is or will be scheduled to occur at a second venue location of the plurality of venue locations associated with the venue; obtaining a third location associated with the participant; determining, in response to and based on a second start time associated with the second event, a second route for the participant from the third location to the second venue location; providing an interface through which the add toggle and the second route are accessible.
Description
DETAILED DESCRIPTION
[0019]
[0020] The CRM 102 in intended to represent a computer system or network of computer systems. A computer system, as used herein, may include or be implemented as a specific purpose computer system for carrying out the functionalities described in this paper. In general, a computer system will include a processor, memory, non-volatile storage, and an interface. A typical computer system will usually include at least a processor, memory, and a device (e.g., a bus) coupling the memory to the processor. The processor can be, for example, a general-purpose central processing unit (CPU), such as a microprocessor, or a special-purpose processor, such as a microcontroller.
[0021] Memory of a computer system includes, by way of example but not limitation, random access memory (RAM), such as dynamic RAM (DRAM) and static RAM (SRAM). The memory can be local, remote, or distributed. Non-volatile storage is often a magnetic floppy or hard disk, a magnetic-optical disk, an optical disk, a read-only memory (ROM), such as a CD-ROM, EPROM, or EEPROM, a magnetic or optical card, or another form of storage for large amounts of data. During execution of software, some of this data is often written, by a direct memory access process, into memory by way of a bus coupled to non-volatile storage. Non-volatile storage can be local, remote, or distributed, but is optional because systems can be created with all applicable data available in memory.
[0022] Software in a computer system is typically stored in non-volatile storage. Indeed, for large programs, it may not even be possible to store the entire program in memory. For software to run, if necessary, it is moved to a computer-readable location appropriate for processing, and for illustrative purposes in this paper, that location is referred to as memory. Even when software is moved to memory for execution, a processor will typically make use of hardware registers to store values associated with the software, and a local cache that, ideally, serves to speed up execution. As used herein, a software program is assumed to be stored at an applicable known or convenient location (from non-volatile storage to hardware registers) when the software program is referred to as implemented in a computer-readable storage medium. A processor is considered configured to execute a program when at least one value associated with the program is stored in a register readable by the processor.
[0023] In one example of operation, a computer system can be controlled by operating system software, which is a software program that includes a file management system, such as a disk operating system. One example of operating system software with associated file management system software is the family of operating systems known as Windows from Microsoft Corporation of Redmond, Wash., and their associated file management systems. Another example of operating system software with its associated file management system software is the Linux operating system and its associated file management system. The file management system is typically stored in the non-volatile storage and causes the processor to execute the various acts required by the operating system to input and output data and to store data in the memory, including storing files on the non-volatile storage.
[0024] The bus of a computer system can couple a processor to an interface. Interfaces facilitate the coupling of devices and computer systems. Interfaces can be for input and/or output (I/O) devices, modems, or networks. I/O devices can include, by way of example but not limitation, a keyboard, a mouse or other pointing device, disk drives, printers, a scanner, and other I/O devices, including a display device. Display devices can include, by way of example but not limitation, a cathode ray tube (CRT), liquid crystal display (LCD), or some other applicable known or convenient display device. Modems can include, by way of example but not limitation, an analog modem, an IDSN modem, a cable modem, and other modems. Network interfaces can include, by way of example but not limitation, a token ring interface, a satellite transmission interface (e.g. direct PC), or other network interface for coupling a first computer system to a second computer system. An interface can be considered part of a device or computer system.
[0025] Computer systems can be compatible with or implemented as part of or through a cloud-based computing system. As used in this paper, a cloud-based computing system is a system that provides virtualized computing resources, software and/or information to client devices. The computing resources, software and/or information can be virtualized by maintaining centralized services and resources that the edge devices can access over a communication interface, such as a network. Cloud may be a marketing term and for the purposes of this paper can include any of the networks described herein. The cloud-based computing system can involve a subscription for services or use a utility pricing model. Users can access the protocols of the cloud-based computing system through a web browser or other container application located on their client device.
[0026] A computer system can be implemented as an engine, as part of an engine, or through multiple engines. As used in this paper, an engine includes at least two components: 1) a dedicated or shared processor or a portion thereof; 2) hardware, firmware, and/or software modules executed by the processor. A portion of one or more processors can include some portion of hardware less than all of the hardware comprising any given one or more processors, such as a subset of registers, the portion of the processor dedicated to one or more threads of a multi-threaded processor, a time slice during which the processor is wholly or partially dedicated to carrying out part of the engine's functionality, or the like. As such, a first engine and a second engine can have one or more dedicated processors, or a first engine and a second engine can share one or more processors with one another or other engines. Depending upon implementation-specific or other considerations, an engine can be centralized, or its functionality distributed. An engine can include hardware, firmware, or software embodied in a computer-readable medium for execution by the processor. The processor transforms data into new data using implemented data structures and methods, such as is described with reference to the figures in this paper.
[0027] The engines described in this paper, or the engines through which the systems and devices described in this paper can be implemented, can be cloud-based engines. As used in this paper, a cloud-based engine is an engine that can run applications and/or functionalities using a cloud-based computing system. All or portions of the applications and/or functionalities can be distributed across multiple computing devices and need not be restricted to only one computing device. In some embodiments, the cloud-based engines can execute functionalities and/or modules that end users access through a web browser or container application without having the functionalities and/or modules installed locally on the end-users' computing devices.
[0028] As used in this paper, datastores are intended to include repositories having any applicable organization of data, including tables, comma-separated values (CSV) files, traditional databases (e.g., SQL), or other applicable known or convenient organizational formats. Datastores can be implemented, for example, as software embodied in a physical computer-readable medium on a general- or specific-purpose machine, in firmware, in hardware, in a combination thereof, or in an applicable known or convenient device or system. Datastore-associated components, such as database interfaces, can be considered part of a datastore, part of some other system component, or a combination thereof, though the physical location and other characteristics of datastore-associated components is not critical for an understanding of the techniques described in this paper.
[0029] Datastores can include data structures. As used in this paper, a data structure is associated with a way of storing and organizing data in a computer so that it can be used efficiently within a given context. Data structures are generally based on the ability of a computer to fetch and store data at any place in its memory, specified by an address, a bit string that can be itself stored in memory and manipulated by the program. Thus, some data structures are based on computing the addresses of data items with arithmetic operations; while other data structures are based on storing addresses of data items within the structure itself. Many data structures use both principles, sometimes combined in non-trivial ways. The implementation of a data structure usually entails writing a set of procedures that create and manipulate instances of that structure. The datastores, described in this paper, can be cloud-based datastores. A cloud based datastore is a datastore that is compatible with cloud-based computing systems and engines.
[0030] Assuming a CRM includes a network, the network can be an applicable communications network, such as the Internet or an infrastructure network. The term Internet as used in this paper refers to a network of networks that use certain protocols, such as the TCP/IP protocol, and possibly other protocols, such as the hypertext transfer protocol (HTTP) for hypertext markup language (HTML) documents that make up the World Wide Web (the web). More generally, a network can include, for example, a wide area network (WAN), metropolitan area network (MAN), campus area network (CAN), or local area network (LAN), but the network could at least theoretically be of an applicable size or characterized in some other fashion (e.g., personal area network (PAN) or home area network (HAN), to name a couple of alternatives). Networks can include enterprise private networks and virtual private networks (collectively, private networks). As the name suggests, private networks are under the control of a single entity. Private networks can include a head office and optional regional offices (collectively, offices). Many offices enable remote users to connect to the private network offices via some other network, such as the Internet.
[0031] The virtual venue datastore 104 is intended to represent a datastore of static and dynamic objects within a venue, which can include places, people, animals, and things that can be tracked in some manner (e.g., via manual methods, such as checklists, or via sensors located around a venue, including cameras that can use facial recognition to determine a location of a person, or radios that can detect RFID or other electromagnetic signals of devices, such as RFID tags affixed to an object or a wireless signal from a smartphone) or for which a location and time are otherwise provided. Static objects can include buildings, ski resorts, outdoor arenas, bodies of water, competition rings, tracks (including waypoints along a track), show grounds, tables, booths, entrances, exits, and other places or fixtures. Static objects may or may not have a dynamic time component. For example, a location may be scheduled for multiple different events such that the space-time parameter values of an associated static location data structure in the virtual venue datastore 104 varies over time. In the context of a horse show, an arena can be scheduled for events every 30 minutes. In the context of a restaurant, a table can be reserved when the reservation is made, or a party is seated.
[0032] The virtual venue datastore 104 can include a historical virtual venue, which may be useful for revisiting a past event or rewinding for a moment. The virtual venue datastore 104 can include a current virtual venue, which is intended to represent, as accurately as possible, the venue in real time. The virtual venue datastore 104 can include a future virtual venue, which may be useful for scheduling and planning purposes. In at least some implementations, it is probably desirable for a human or artificial agent to be able to update the virtual venue datastore 104 quickly as data used to predict a future virtual venue change (e.g., if an arena needs to be shut down temporarily thereby delaying future events, if a party takes longer than expected at a table, if an event is canceled, or the like). Information about the venue (facility name, address, phone number, email address, maps/directions, etc.) can be considered part of the virtual venue datastore. In a horse show context, information about, for example, grooms, braiders, haulers; feed, hay, and bedding suppliers; tack suppliers; can also be considered part of the virtual venue datastore.
[0033] The venue mapping engine 106 is intended to represent an engine that creates, reads, updates, or deletes (CRUDs) the virtual venue datastore 104 to include data associated with a venue map. Such data can include building addresses, building blueprints, maps, paths (including, e.g., restricted areas, inaccessible areas, intended paths, difficult terrain (e.g., streams, ponds, mud, lakes, groves, bushes, or the like), and open areas that permit traversal but are not intended paths). Map locations do not vary over time but an event overlay can cause a map location to be treated differently (e.g., a stage could have an 8:00 show and a 10:00 show that would be distinct events in the same map location). As used in this paper, the events could be characterized as having identical locations and different times (or different space-times).
[0034] The fixture placement engine 108 is intended to represent an engine that CRUDs the virtual venue datastore 104 to include data associated with fences, tables, booths, and other things that are fixtures or are intended to act as fixtures for a span of time. (Note: Map locations could also be treated as static locations but are distinguished in this example of illustrative reasons.) An event administrator, or human or artificial agent thereof, can determine where to place fixtures and other objects intended to act as fixtures, which can include legacy objects, such as fences that are already in place. The degree to which a venue may need to be modified can have a bearing on how carefully real-world fixtures and objects intended to act as fixtures are tracked by the static location placement engine 108. For example, a semi-permanent fence could be assumed to remain in place for an event but protocol may require a temporary fence have its location verified with a snapshot after it is put in place.
[0035] The dynamic location overlay engine 110 is intended to represent an engine that CRUDs the virtual venue datastore 104 to include data associated with events with an associated timespan. For example, an arena can be used for different shows at different times during the day and a table can be used for different parties of diners throughout the day. In some instances, fixtures or objects intended to be treated as fixtures can be treated like dynamic locations to the extent they are monitored to ensure they remain in place. For example, a table may be affixed with a wireless device to make it part of the IoT (the table and the wireless device can collectively be considered a thing in the IoT), its location being monitored to ensure it is in place at a start time and remains in place until an end time. However, for illustrative purposes, it is assumed objects intended to act as fixtures are treated as static during a relevant timespan even if their location is tracked. More generally, the time component of an area is what defines the area as an event (dynamic location).
[0036] The resource integration engine 112 is intended to represent an engine that enters a resource into a venue. From the context of participants (e.g., horse riders), the resource could be the participants themselves and, potentially, assistants, guests, animals, equipment, and the like. In a specific implementation, the smartphone of a participant (human resource) acts as a location device and portal into the virtual venue datastore 104. Instead or in addition, a participant can be provided a physical device, such as a badge or placard, that is detectable by the resource tracking engine 114.
[0037] Once integrated into the virtual venue, participants can see (e.g., on their smartphones) time and distance from events, making it unnecessary to crowd a competition ring to determine when it is their turn to go. Advantageously, participants can reduce wasted time while enabling social distancing. For example, participants can be alerted that it is their turn to compete, so they know when to go to the ring. In a horse show context, competitors usually need to congregate around the competition ring or start gate because no one really knows what is going on, in addition to standing in line to sign up for a show, standing in line to make changes to their show schedules, and standing in line to sign out at the end of a show. Indeed, in the context of horse shows, riders can stay in the barn with their horses in lieu of having to wait, often 30-45 minutes, for a turn at the competition ring under the hot sun, sweating through their jackets, trying to remember the course while working to keep a 1200 pound animal to stand still.
[0038] The resource tracking engine 114 is intended to represent an engine that tracks a current location of a resource and CRUDs the virtual venue datastore 104 with the data. In the context of this paper, an asset can include a person. In the context of a horse show, the resource can include a rider (competitor), trainer, judge, photographer, groundskeeper, horse, and/or pieces of equipment (such as a badge, piece of equestrian gear, or some other device configured for radio communication, such as RFID, tracked explicitly, such as via a checklist, or the like). What is considered a resource can depend upon the entity tracking the resource. For example, a competitor may not care about the location of a groundskeeper, so even for a venue that defines the groundskeeper as a human resource, competitors may not have access to the data.
[0039] In a specific implementation, the resource tracking engine 114 includes a device used to track the position of a resource. Examples of sensors include cameras, RFIDs, 802.11-compliant radios, GPS devices, or the like. An entity that uses a sensor under their own control to obtain location data may or may not choose to publish the location data to a centralized datastore. For example, a competitor may choose to track their own location so it can be compared to the start time and place for an event in which they will compete but not share their location with anyone else (or share with a limited number of parties). All such data can be considered part of a comprehensive virtual venue datastore. In the context of this paper, however, unpublished location data (or data otherwise unavailable to an event administration application) is not considered part of the virtual venue datastore 104 unless explicitly stated or context dictates. It may be noted, however, that a competitor that chooses not to share location information can still be detected through other channels, if applicable, and the virtual venue datastore 104 will include such data; data can also be anonymized. For example, a competitor may have a short-range RFID tag that enables location detection at or near the entrance of an arena.
[0040] The granularity of a location update is configuration-, implementation-, or preference-specific. For example, a competitor may want to know an estimated time of arrival (ETA) at an event from a current location at any time, making it desirable to update competitor location frequently. In this example, the competitor could rely upon available location and time parameters for an event in which the competitor will compete and apply unshared location data and current time to the known location and time of the event. In a specific implementation, the unshared location data is compared with the known location and time data to provide an estimated ETA. The estimate can be improved with knowledge of competitor speed (e.g., walking, riding, driving, etc.) and the venue itself (e.g., crowds, need for assisted transit, paths, routes, etc.).
[0041] The environmental conditions estimation engine 116 is intended to represent an engine that tracks conditions, such as weather, crowds, accidents, or the like, and CRUDs the virtual venue datastore 104 to more accurately virtually represent real-time (or predicted) conditions at a venue. In some instances, it may be desirable to gain access to a third party datastore, such as a weather prediction service, to improve prediction accuracy of parameters of a future virtual venue.
[0042] The agent interface engine 118 is intended to represent an engine that enables a human or artificial agent to access the virtual venue datastore 104. What data is accessed will depend upon the type of agent. For example, a competitor may use an application on a smartphone to find, join, determine location of, and take other actions with respect to events. The application can include a billing component, a feedback component, and a local datastore integration component (e.g., to compare a current location and time to that of an event and provide an ETA). Marketers, teachers, purchases (e.g., horse buyers), event coordinators, restauranteurs, hospital administrators, guests, and other individuals will have other interests and can be provided data accordingly. Some examples are described below.
[0043]
[0044] The virtual venue datastore 202 includes maps, locations, and events to which a human can navigate. In a specific implementation, a venue participant can also sign up, sign in, buy tickets, and take other actions that facilitate getting to and/or participating in an event.
[0045] The venue map display engine 204 is intended to represent an engine that displays a venue map from the virtual venue datastore 202 with a dynamic location overlay. In a specific implementation, at least one map is static, with a dynamic overlay that is associated with multiple events at a single static location. For example, a morning event and an evening event may take place at a single location and both would be represented on the static map. One reason to include a static map is humans have been trained to view maps as static things. Instead or in addition, a venue participant can select between a static venue map, a dynamic venue map.
[0046] Depending upon implementation-, configuration-, or preference-specific factors, dynamic venue maps can include, historic venue maps, a current venue map, and future venue maps. If an event is ongoing, one of the dynamic venue maps will be a current venue map and the others can be historic venue maps (if an event is over) or future venue maps (if an event has not yet begun). The granularity of time-increments used to distinguish between multiple dynamic maps can vary depending upon how rapidly a dynamic overlay changes. For example, if there are only morning and evening shows at a venue (and ignoring a current venue map for the moment), there may only be two historic venue maps (if the events are over), two future venue maps (if the events have not started), or one of each (if one event is over and one has not yet started). For events that change in concert (e.g., all event times start on the hour), granularity can be set to that amount, though it may be desirable to include a it has been delayed flag if the granularity is course. For events that change independently of one another, the granularity may be further reduced. For example, a cinema may have multiple movies of different durations playing on multiple screens. In such a scenario, the dynamic overlay may vary every 5 minutes (or every 1 minute if the granularity is down to the minute). Also, increments need not necessarily be the same; for example, a dynamic event slider could span x minutes for a first increment, from the start time of a first event to the start time of a second event (not necessarily at the same location), and then y minutes for a second increment, from the start time of the second event to the start time of a third event, where xy.
[0047] Some venues are huge, such as the Desert International Horse Park, which is 1.25 million square feet in area, and which is a popular venue for horse shows. For even moderately sized venues, a map with a dynamic location overlay can be exceptionally useful.
[0048] It may be desirable to provide amenities at a relatively large venue. Such amenities can include restrooms, restaurants, gift shops, and other amenities, whether in static or mobile form. In the context of a venue navigation system, amenities are assumed to have a physical form such that navigation of the venue for delivery purposes is relevant. Advantageously, you can also have mobile or deliverable amenities come to you, which can improve your ability to remain in an environment you prefer, practice social distancing, or save time. To the extent it is desirable to distinguish between mobile amenities that can be summoned (e.g., a pizza delivery) and mobile amenities that cannot (e.g., an ice cream vendor), the former can be referred to as delivered amenities.
[0049]
[0050] Referring once again to the example of
[0051] Breed, lineage, show records and the like can be obtained from HippoMundo and, in a specific implementation, HippoMundo integration is enabled. In a specific implementation, a driver's license number can be entered, which can be used to indicate whether a participant is a minor (triggering such actions as hiding last name from others, activating a last name entry field only after a driver's license has been entered, or the like). The system can use information to determine classes within a division a rider is signed up for, associate points with a rider for each event in which they participate (points are aggregated for each class and totaled by division), and provide the ability to add and scratch from an event. Associations (e.g., USEF, PCHA, NORCAL, OHJA) are tracked because they can sponsor multiple divisions and riders must be members of an association to capture points for sponsored division and class; association membership impacts eligibility to participate in classes, so riders are given a unique number from each association in which they have membership. In a specific implementation, individuals can readily see how many points are needed to qualify for medals through an API to a relevant association.
[0052] Point and award updates are later associated with registrants. Points and awards are associated with riders for each class for each association. Points are totaled by class for awards in a division. Associations have unique point value systems. Each rider is linked to multiple associations and each association has a member number.
[0053] An aspect of participant registration is integrating the participant as described above with reference to the resource integration engine 112 (
[0054] The event attendance management engine 208 is intended to represent an engine that facilitates time management (and social distancing) for a venue participant. In a specific implementation, event participants are queued. An aspect of event attendance taking is integrating the participant as described above with reference to the resource integration engine 112 (
[0055]
[0056]
[0057] The example of
[0058]
[0059]
[0060]
[0061]
[0062] For illustrative purposes, the horse attributes window 1008 displays attributes of a horse for a competitor that has been selected. Trainers are commonly looking for horses to buy for their clients and it is very difficult to find good horses because they are forced to approach other trainers to ask if they have any horses for sale. Advantageously, this innovation provides the ability to provide a list of horses that are for sale and removes difficulties associated with buying and selling horses at horse shows by providing data that would be relevant to a potential buyer at the relevant location (enabling trainers to see which horses are for sale, go see the horses compete, and have all relevant information), made readily accessible if the horse is for sale (potentially including less information if the horse is not for sale). This is important because it is very difficult for trainers to know which horses are for sale at horse shows.
[0063]
[0064] The my sponsors option of the options window 1104 is intended to represent an opt in to be a social influencer, tools for completing federal paperwork for tax and other purposes, data associated with sponsors. Advantageously, parties can be brought together in accordance with paleo-marketing principles (micro-sponsorship). For example, competitors can gain recognition through, e.g., winning and opt into micro-sponsorships so potential sponsors can bid on them. As social influencers, the competitors can opt into offering their services in saying good things about a sponsor on their social networks, which sponsors can monitor for messaging and activity effectiveness. In a specific implementation, potential sponsors bid for desired social influencers; competitors can place bids for those same influencers and the influencers can see the bidding for a micro-sponsorship contract (usually to say good things about a brand, stay out of trouble, etc.) and select one or more in accordance with their goals (e.g., most money, highest ethical rating, fewer restrictions, personal preference, or the like). Because the sponsorship is a micro-sponsorship, sponsors can generally lose relatively little money if a social influencer under-performs or can double down in the social influencer performs well; revenue can be in up-front payments, a commission, contingent on performance that is tracked through unique IDs to each sponsored influencer, or the like.
[0065] The my team option of the options window 1104 is intended to represent an interface to data associated with individuals on the competitor's team, which can include owners, trainers, parents, or the like. Such team members can gain access to a network associated with the competitor and have other advantages, as well (e.g., alerts if a trainer has been passed up by another trainer, updated points for students and horses for the year, judge biographies and the rings they judge, or the like). In some competitions, such as horse showing, judges have no set method for determining winners, so it may be desirable to track judges and compare to people's choice winners or using an objective metric; the importance of particular parameters for particular judges can then be made available.
[0066] The checkout option of the options window 1104 is intended to represent an interface to amenities as described previously in this paper (or options associated with the app).
[0067] Other possibilities include a social network for horses like LinkedIn or Facebook, a people's choice award for competitors, or the like. For example, competitors can be upvoted for things like good sportsmanship, friendliness, how cute a horse is, the attitude of the horse (e.g., nice, eager, willing), or the like. Positive social interaction increases serotonin, making all involved feel better (plus it is good for you), which can be encouraged with a system that rewards upvoting others. Also, judges are imperfect; it may be nice to have a people's award to override the judges and keep them honest. In a specific implementation, upvoting another provides a people's choice currency. In many contexts (e.g., restaurants), this can translate to coupons or discounts; in a competitive context, this can translate to an award or some form of recognition.
[0068]
[0069] The competition kiosk 1204 is intended to represent engines and devices to be located within a competition office to assist with signup and other activities. In a specific implementation, the competition kiosk 1204 allows trainers to login using unique IDs, select a rider they want to scratch, confirm the rider is in the class to be scratched, confirm competition time has not passed (because you typically can't scratch a class that has already started), scratch the rider (triggering an engine of the competition kiosk 1204 to initiate a refund or credit), to name several activities. In a specific implementation, the competition kiosk 1204 includes a printer to enable the printing of paper receipts for office recordkeeping.
[0070] The show management engine 1206 is intended to represent engines for event management (see, e.g.,
[0071] The show venue datastore 1208 is intended to represent data provided from the show management engine 1206 and other venue-related information.
[0072]
[0073]
[0074]
[0075]
[0076] In step 1602, a system (e.g., the system for event management depicted in
[0077] In step 1604, the system obtains horse locations for a plurality of horses associated with the horse riders of the horse show event. The horse locations can include at least a second location associated with a first horse of the plurality of horses associated with the first rider. For example, the second location can be a current location of the first horse, which may be different than the location of the associated horse rider. The current location can be an absolute location (e.g., a GPS location) and/or a relative location (e.g., relative to a position within the horse show event, venue, and/or the like.)
[0078] In some implementations, the first horse rider and the first horse are linked, and the first route and the second route can be determined based on the link. For example, the link can include a wireless network link (e.g., based on RFID, wireless LAN, and/or the like). Routes may be based on the link. Characteristics of the horse rider and/or horses and their relationship to each other may be used to determine routes. For example, if either a horse rider or a linked horse is instructed to go to a particular location, the other can be automatically instructed to go to the same location and/or different location(s) (e.g., a stable nearest to the destination of the horse rider). In another example, the routes may be based on how fast they can each travel, current information about how crowded areas may be, and/or the like.
[0079] In some implementations, the first route and the second are determined such that the first horse rider and the first horse are scheduled to arrive at the first venue location of the particular venue (and/or one or more other intermediate locations) at a same time. In some implementations, the first route and the second are determined such that the first horse rider and the first horse are scheduled to arrive at the first venue location of the particular venue (and/or one or more other intermediate locations) at different times.
[0080] In some implementations, horse riders and/or horses can be linked to judges (e.g., in the same manner as the linking of horses and horse riders). This may facilitate real-time scoring and allowing accurate tracking of which judge scored which horses and/or horse riders. This information may be collected and stored as historical information, which may be later audited (e.g., to determine if judges are scoring properly or improperly).
[0081] In step 1606, the system determines, in response to and based on a first start time associated with the horse show event, a first route (or, path) for a first horse rider of the plurality of horse riders from the first location of the first horse rider to the first venue location of a particular venue of the plurality of venues of the horse show event. For example, the start time (e.g., 10 AM) may be the start time of a particular event (e.g., race) for which the horse rider is registered.
[0082] In step 1608, the system determines, in response to and based on the first start time associated with the horse show event, a second route (or, path) for the first horse of the plurality horses associated with the first horse rider from the second location of the first horse to the first venue location of the particular venue of the plurality of venues of the horse show event.
[0083] In step 1610, the system provides an interface (e.g., graphical user interface) through which the first route and the second route are accessible (e.g., viewable, editable, and/or otherwise interactable). For example, the interface can include a first graphical layer overlaid over a second graphical layer. The first layer can be a dynamic layer and the second graphical layer can be a static map.
[0084] In step 1612, the system detects, prior to the first start time associated with the horse show event, a change from the first venue location of the particular venue to the a second venue location of a different venue of the plurality of venues of the horse show event. For example, the venue may have changed to another venue 0.25 miles away and/or to a different start time (e.g., 11 AM).
[0085] In step 1614, the system dynamically updates, in response to the change, the first route and the second routes based on the change. For example, the system can, in real-time, update the routes and/or create new routes to the new location. This can be performed any number of times to handle any number of venue changes, venue location changes, time changes, and/or the like.
[0086] In step 1616, the system provides, based on the dynamic updates, an updated interface through which the dynamically updated first and second routes can be accessed.
[0087]
[0088] In step 1702, a system (e.g., the system for event management depicted in