Patent Publication Number: US-11645546-B2

Title: System and method for predicting fine-grained adversarial multi-agent motion

Description:
CROSS-REFERENCE TO RELATED APPLICATIONS 
     This application claims priority from U.S. Provisional Application Ser. No. 62/619,891, filed, Jan. 21, 2018, which is hereby incorporated by reference in its entirety. 
    
    
     FIELD OF THE DISCLOSURE 
     The present disclosure generally relates to system and method for generating a predictive model and, more specifically, a system and method for predicting multi-agent location using the predictive model. 
     BACKGROUND 
     Humans continuously anticipate the future states of their surroundings. Someone extending a hand to another is likely initiating a handshake. A couple entering a restaurant is likely looking for a table for two. A basketball player on defense is likely trying to stay between their opponent and the basket. These predictions are critical for shaping our daily interactions, as they enable humans to navigate crowds, score in sports matches, and generally follow social mores. As such, computer vision systems that are successfully deployed to interact with humans must be capable of forecasting human behavior. 
     SUMMARY 
     Embodiments disclosed herein generally relate to a system and method for predicting multi-agent location. In one embodiment, a method is disclosed herein. A computing system retrieves tracking data from a data store. The tracking data includes a plurality of sequences of agent movement during the course of a plurality of sporting events. The computing system generates a predictive model using a conditional variational autoencoder. The conditional variational autoencoder learns one or more paths a subset of agents of the plurality of agents are likely to take based at least on historical location data of each agent in each sequence of the plurality of sequences and identity information of each agent. The computing system receives tracking data from a tracking system positioned remotely in a venue hosting a candidate sporting event. The computing system identifies one or more candidate agents for which to predict locations. The computing system infers, via the predictive model, one or more locations of the one or more candidate agents. The computing system generates a graphical representation of the one or more locations of the one or more candidate agents. 
     In another embodiment, a system is disclosed herein. The system includes a processor and a memory. The memory has programming instructions stored thereon, which, when executed by the processor, performs one or more operations. The one or more operations include retrieving tracking data from a data store. The tracking data includes a plurality of sequences of agent movement during the course of a plurality of sporting events. A conditional variational autoencoder generates a predictive model using a conditional variational autoencoder. The conditional variational autoencoder learns one or more paths a subset of agents of the plurality of agents are likely to take based at least on historical location data of each agent in each sequence of the plurality of sequences and identity information of each agent. The one or more operations further include receiving tracking data from a tracking system positioned remotely in a venue hosting a candidate sporting event. The one or more operations further include identifying one or more candidate agents for which to predict locations. The one or more operations further include inferring, via the predictive model, one or more locations of the one or more candidate agents. The one or more operations further include generating a graphical representation of the one or more locations of the one or more candidate agents. 
     In another embodiment, a non-transitory computer readable medium is disclosed herein. The non-transitory computer readable medium includes one or more sequences of instructions that, when executed by the one or more processors cause a computing system to retrieve tracking data from a data store. The tracking data includes a plurality of sequences of agent movement during the course of a plurality of sporting events. The computing system generates a predictive model using a conditional variational autoencoder. The conditional variational autoencoder learns one or more paths a subset of agents of the plurality of agents are likely to take based at least on historical location data of each agent in each sequence of the plurality of sequences and identity information of each agent. The computing system receives tracking data from a tracking system positioned remotely in a venue hosting a candidate sporting event. The computing system identifies one or more candidate agents for which to predict locations. The computing system infers, via the predictive model, one or more locations of the one or more candidate agents. The computing system generates a graphical representation of the one or more locations of the one or more candidate agents. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
       So that the manner in which the above recited features of the present disclosure can be understood in detail, a more particular description of the disclosure, briefly summarized above, may be had by reference to embodiments, some of which are illustrated in the appended drawings. It is to be noted, however, that the appended drawings illustrated only typical embodiments of this disclosure and are therefore not to be considered limiting of its scope, for the disclosure may admit to other equally effective embodiments. 
         FIG.  1 A  is a block diagram illustrating a computing environment, according to example embodiments. 
         FIG.  1 B  is a block diagram illustrating a component of the computing environment of  FIG.  1 A , according to example embodiments. 
         FIG.  2    is a block diagram illustrating a general method for predicting the trajectory of one or more agents, according to example embodiments. 
         FIG.  3    is a block diagram of a conditional variational auto-encoder, according to example embodiments. 
         FIG.  4    is a flow diagram illustrating a method of training a conditional variational auto-encoder for predicting the trajectories of one or more agents, according to example embodiments. 
         FIG.  5    is a block diagram illustrating an exemplary graphical user interface (GUI), according to example embodiments. 
         FIG.  6    is a flow diagram illustrating a method of predicting trajectories of one or more agents, according to example embodiments. 
         FIG.  7    is a flow diagram illustrating a method of predicting agent location, according to example embodiments. 
         FIG.  8 A  is a block diagram illustrating a computing device, according to example embodiments. 
         FIG.  8 B  is a block diagram illustrating a computing device, according to example embodiments. 
     
    
    
     To facilitate understanding, identical reference numerals have been used, where possible, to designate identical elements that are common to the figures. It is contemplated that elements disclosed in one embodiment may be beneficially utilized on other embodiments without specific recitation. 
     DETAILED DESCRIPTION 
     One or more embodiments disclosed herein generally relate to a system and method for predicting trajectories of one or more agents. For example, the one or more techniques disclosed herein simultaneously and accurately forecast the behavior of a plurality interacting agents, thereby permitting computer vision applications to be widely deployed (e.g., autonomous vehicles, security, surveillance, sports). In particular, one or more systems disclosed herein implements a conditional variational autoencoder, which may be configured to learn a model that “personalizes” prediction to individual agent behavior within a group representation. Although one or more examples provided herein generally relate the use of the system and methods in relation to the sport of basketball, those skilled in the art readily understand that such systems and methods may extend outside of the sport of basketball. 
     Team sports, generally, provide an exemplary setting for evaluating personalized behavior models. Firstly, there is a vast amount of labeled data in sports, including potentially thousands of data points for each player. Furthermore, the behaviors in team sports are well-defined and complex, with multiple agents simultaneously interacting collaboratively and adversarially. Therefore, sports tracking data is a good compromise between completely unstructured tracking data (e.g., pedestrian motion where the number of agents is unconstrained) and highly structured data (e.g., body pose or facial tracking where the number of agents is both fixed and physically connected). 
     One of the challenges of personalizing prediction of multi-agent motion is developing a representation that is simultaneously robust to the number of possible permutations arising in a situation and sufficiently fine-grained, so the output prediction is at the desired level of granularity. One typically employ one of two approaches: i) a bottom-up approach in which each trajectory has the same model applied to it individually, or ii) a top-down approach in which a group representation of all trajectories has one model applied to it all at once. The data and target application mainly drive the choice of approach. For example, in settings with a variable number of agents, e.g., autonomous vehicles or surveillance, a bottom-up approach may be favored; in settings with a fixed number of agents, e.g., sports, faces, and body pose, a top-down approach may be favored. 
     The present application solves this problem, in part, through the use of a conditional variational autoencoder and the specific conditions selected for such processes. 
       FIG.  1 A  is a block diagram illustrating a computing environment  100 , according to example embodiments. Computing environment  100  may include tracking system  102 , organization computing system  104 , and one or more client devices  108  communicating via network  105 . 
     Network  105  may be of any suitable type, including individual connections via the Internet, such as cellular or Wi-Fi networks. In some embodiments, network  105  may connect terminals, services, and mobile devices using direct connections, such as radio frequency identification (RFID), near-field communication (NFC), Bluetooth™, low-energy Bluetooth™ (BLE), Wi-Fi™, ZigBee™, ambient backscatter communication (ABC) protocols, USB, WAN, or LAN. Because the information transmitted may be personal or confidential, security concerns may dictate one or more of these types of connection be encrypted or otherwise secured. In some embodiments, however, the information being transmitted may be less personal, and therefore, the network connections may be selected for convenience over security. 
     Network  105  may include any type of computer networking arrangement used to exchange data or information. For example, network  105  may be the Internet, a private data network, virtual private network using a public network and/or other suitable connection(s) that enables components in computing environment  100  to send and receive information between the components of environment  100 . 
     Tracking system  102  may be positioned in a venue  106 . For example, venue  106  may be configured to host a sporting event that includes one or more agents  112 . Tracking system  102  may be configured to record the motions of all agents (i.e., players) on the playing surface, as well as one or more other objects of relevance (e.g., ball, referees, etc.). In some embodiments, tracking system  102  may be an optically-based system using, for example, a plurality of fixed cameras. For example, a system of six stationary, calibrated cameras, which project the three-dimensional locations of players and the ball onto a two-dimensional overhead view of the court may be used. In some embodiments, tracking system  102  may be a radio-based system using, for example, radio frequency identification (RFID) tags worn by players or embedded in objects to be tracked. Generally, tracking system  102  may be configured to sample and record, at a high frame rate (e.g., 25 Hz). Tracking system  102  may be configured to store at least player identity and positional information (e.g., (x, y) position) for all agents and objects on the playing surface for each frame in a game file  110 . 
     Game file  110  may be augmented with other event information corresponding to the captured one or more frames, such as, but not limited to, game event information (pass, made shot, turnover, etc.) and context information (current score, time remaining, etc.). 
     Tracking system  102  may be configured to communicate with organization computing system  104  via network  105 . Organization computing system  104  may be configured to manage and analyze the data captured by tracking system  102 . Organization computing system  104  may include at least a web client application server  114 , a pre-processing engine  116 , a data store  118 , and trajectory agent  120 . Each of pre-processing engine  116  and trajectory engine  116  may be comprised of one or more software modules. The one or more software modules may be collections of code or instructions stored on a media (e.g., memory of organization computing system  104 ) that represent a series of machine instructions (e.g., program code) that implements one or more algorithmic steps. Such machine instructions may be the actual computer code the processor of organization computing system  104  interprets to implement the instructions or, alternatively, may be a higher level of coding of the instructions that is interpreted to obtain the actual computer code. The one or more software modules may also include one or more hardware components. One or more aspects of an example algorithm may be performed by the hardware components (e.g., circuitry) itself, rather as a result of the instructions. 
     Data store  118  may be configured to store one or more game files  122 . Each game file  122  may be captured and generated by a tracking system  102 . In some embodiments, each of the one or more game files  122  may include all the raw data captured from a particular game or event. In some embodiments, the data contained in each game file  122  may include one or more sequences in the game or event represented by game file  122 . Each sequence may include the same team on offense for the full duration. Each sequence may end either due to a shot (e.g., score), turnover, or foul. Accordingly, in some embodiments, the data contained in each game file  122  may not include sequences representative of transition plays (e.g., when teams switch from defense to offense mid sequences). In other words, in these embodiments, the sequences are constrained to contain persistent offense and persistent defense. Still further, in some embodiments, each sequence may be zero-centered to center-court and aligned, so that the offense always shoots toward the court&#39;s right-side basket. 
     Trajectory agent  120  may be configured to predict the trajectory of one or more agents given one or more historical trajectory points. For example, given an agent&#39;s coordinates up to a time t q , trajectory agent  120  may use at least the agent&#39;s coordinates up to time t q  to predict the agent&#39;s coordinates up to time t f , where t f  is after t q , where q represents some end-time between (e.g., (1 . . . n)) and f represents some future time, after q (e.g., (n+1)). 
     Pre-processing agent  116  may be configured to process data retrieved from data store  118  prior to input to trajectory agent  120 . For example, pre-processing agent  116  may be configured to align the data of a given game file  122 , such that the trajectories of all agents are in a natural and consistent ordering. For example, if data is pulled from game file  122  randomly, two similar plays with similar trajectories may have different representations. To reduce (or minimize) the number of permutations, pre-processing agent may align data retrieved from data store such that the information is consistent from one play (or sequence) to the next. 
     Client device  108  may be in communication with organization computing system  104  via network  105 . Client device  108  may be operated by a user. For example, client device  108  may be a mobile device, a tablet, a desktop computer, or any computing system having the capabilities described herein. Users may include, but are not limited to, individuals such as, for example, subscribers, clients, prospective clients, or customers of an entity associated with organization computing system  104 , such as individuals who have obtained, will obtain, or may obtain a product, service, or consultation from an entity associated with organization computing system  104 . 
     Client device  108  may include at least application  124 . Application  124  may be representative of a web browser that allows access to a website or a stand-alone application. Client device  108  may access application  124  to access one or more functionalities of organization computing system  104 . Client device  108  may communicate over network  105  to request a webpage, for example, from web client application server  124  of organization computing system  104 . For example, client device  108  may be configured to execute application  124  to access content managed by web client application server  124 . The content that is displayed to client device  108  may be transmitted from web client application server  124  to client device  108 , and subsequently processed by application  124  for display through a graphical user interface (GUI) of client device  108 . 
       FIG.  1 B  illustrates trajectory agent  120  in greater detail, according to example embodiments. Trajectory agent  120  may include conditional variational autoencoder  152  and interface module  154 . Conditional variational autoencoder  152  may be configured to learn a model that personalizes predictions to individual agent behavior within a group interaction. For example, by using conditional variational autoencoder  152 , trajectory agent  120  may create a generative model that simultaneously learns the latent representation of multi-agent trajectories and may be able to predict the agents&#39; context-specific motion. 
     The multi-agent trajectory prediction performed by trajectory agent  120  may be framed as follows: in a two-dimensional environment, a set A of interacting agents may be observed over the time history [t 0 , t q ] to have trajectories X A   [t     0     ,t     q     ] , where:
 
 X   A   [t     0     ,t     q     ]   ={X   i   [t     0     ,t     q     ]   }|∀i∈A,  
 
t 0 =some initial time and t q =some end time.
 
     The trajectory history of the i th  agent may be defined as:
 
 X   i   [t     0     ,t     q     ]   ={x   i   t     0     ,x   i   t     0     +1   , . . . ,x   i   t     q   }
 
where x i   t  may represent the two-dimensional coordinates of a trajectory at time t.
 
     Using conditional variational autoencoder  152 , trajectory agent  120  may predict the subsequent future motion, to time t f , of a subset of agents P⊆A. In other words, trajectory agent  120  may leverage conditional variational autoencoder  152  to learn the posterior distribution P(Y P   (t     q     ,t     f     ] |X A   [t     0     ,t     f     ] ,O) of the future trajectory of the agents in subset P, specifically Y P   (t     q     ,t     f     ] ={Y j   (t     q     ,t     f     ] }|∀j∈PP, where Y j  represents the agents in subset P for which trajectories are to be determined and t f =some future time after t q . 
     In addition to the observed trajectory history, trajectory agent  120  may also condition the learned future trajectory distribution on other available observations O. For example, O may consist of: 1) the identities ρ of the agents in P; and 2) the future context C, represented by the future trajectories X k   (t     q     ,t     f     ] ={X l   (t     q     ,t     f     ] }|∀l∈K of agents in the set K⊂A, such that K∪P=A and K∩P={ }, where l represents an agent on each team. In other words, the union of the sets of A (i.e., the agents for which trajectory agent  120  will be projecting trajectories) and K (i.e., the agents for which trajectory agent  120  will not be projecting trajectories) is the entire set A of agents in a given sequence. In some embodiments, K={ }. In other words, trajectory agent  120  may not rely on, or take into consideration, the future motions of any agents. 
     One of the improvements over conventional processes is how to include various types of information into O, and the influence of each information type on the prediction accuracy of Y P   (t     q     ,t     f     ] . 
     Conditional variational autoencoder  152  may include a context encoder  156 , a trajectory encoder  158 , an agent encoder  160 , a variational module  162 , and a decoder  164 . Each of context encoder  156 , trajectory encoder  158 , and agent encoder  160  may include N fully connected layers. For example, each layer may have roughly half the number of units as its input layer. 
     The conditionals and inputs to conditional variational autoencoder may be encoded using a respective encoder. 
     Context autoencoder  156  may be configured to encode input data directed to trajectory context. For example, context autoencoder  156  may be configured to encode input data directed to future trajectories of a subset of agents. 
     Trajectory encoder  158  may be configured to encode at least data directed to historical agent positional information. For example, trajectory encoder  158  may be configured to encode at least data directed to agent trajectories up to a known time t q . Trajectory encoder  158  may further be configured to encode data directed to trajectory context and data directed to team identity. 
     Identity encoder  160  may be configured to encode identity information of each agent for which trajectory agent  120  will predict the trajectories. Such identity information may include, but is not limited to, player name, player ID, team name, team ID, position (e.g., guard, forward, shooting guard, etc.), and the like. 
     Variational module  162  may be configured to predict the mean and standard deviation of a latent variable distribution based on, at least, the set of information encoded by trajectory encoder  158 . Decoder  164  may be configured to predict the future trajectories of each agent based on, at least, a sample of the latent variable distribution, the encoded context (from context autoencoder  156 ), and the encoded identity information. 
     Interface module  154  may be configured to generate one or more graphical user interfaces (GUIs) that include a representation of a projected trajectory for one or more players. For example, interface module  154  may generate a GUI that includes real-time (or near real-time) tracking data of agents during a game. Trajectory agent  120  may be used to fill in gaps of data that is missing from a particular sequences due, for example, from a particular agent being temporarily outside of a line of sight of tracking system  102 . Accordingly, trajectory agent  120  may leverage historical positioning information of the particular agent, as well as positional data of the other agents, to project a location of the particular agent. As such, interface module  154  can include an estimated location of such agent in the GUI. 
       FIG.  2    is a block diagram  200  illustrating one or more phases of predicting multi-agent motion, according to example embodiments. Block diagram  200  may include a training phase  202  and an implementation phase  204 . 
     In training phase  202 , organization computing system  104  attempts to generate a fully-trained model for use in application phase  204 . Training phase  202  may include data store  118 , pre-processing engine  116 , and trajectory engine  120 . An administrator may identify a data set for use with training conditional variational autoencoder to learn a model. For example, the data set identified by the administrator in data store  118  may include about 95,000 twelve-second sequences of two dimensional trajectories. For each sequences, the administrator may define the subset P of all agents A for which their trajectories are to be projected. Each sequence may be labeled with agent identity, team, and canonical position (e.g., point guard, shooting guard, guard, small forward, power forward, forward, center). For the subset K of all agents A for which trajectory agent  120  will not predict trajectories, each agent may be labeled by their canonical position, thus limiting the set of player identities. The data set may then be split into training, validation, and test sets. For example, the training set may include about 60,000 twelve-second sequences; the validation set may include about 15,000 twelve-second sequences; and the test set may include about 19,000 twelve-second sequences. 
     In some embodiments, the latent variable distribution may be modeled as a normal distribution. For example, the latent variable distribution may be modeled as:
 
 Q ( z={circumflex over (z)}|X   A   [t     0     ,t     q     ]   ,X   K   (t     q     ,t     f     ] ,ρ)= Q ( z={circumflex over (z)}H   x   ,H   C   ,H   ρ )˜ (μ z ,Σ z )
 
where {circumflex over (z)} is a sample of a latent variable, H x  is a set of encoded trajectories, H c  is a set of encoded context, and H ρ  is the set of encoded identities. In other words, the above equation may represent the likelihood that the latent variable z={circumflex over (z)}, may be conditioned on the identity, ρ, the previous motion, X A   [t     0     ,t     q     ] , the future motion of the subset K of agents, X K   (t     q     ,t     f     ] . This likelihood may be equivalent to being conditioned on the encoded future motion, H x , the encoded previous motion, H c , and the encoded identity, H ρ . This may be concurrent to, or approximated by, the normal Gaussian distribution on the latent variable, z.
 
     Accordingly, during training, variational module  162  may minimize the Kullback-Leibler (KL) divergence (D KL ) and trajectory decode  164  may minimize the Euclidean distance ∥Y−Ŷ∥ 2   2 . In one example, for simplicity, let Y=(X P   [t     q     −1,t     q     ] , Y P   (t     q     ,t     f     ] ). Then the total loss may be:
 
 L=∥Y−Ŷ∥   2   2   +βD   KL ( P∥Q ),
 
where P(z|X A   [t     0     ,t     q     ] , X K   (t     q     ,t     f     ] , ρ)= (0,1) may be a prior distribution and β may be a weighting factor to control the relative scale of the loss terms. In other words, the loss function that may be optimized for is the distance between the real position, Y, and the predicted position Ŷ. This distance may be measured using the L 2  norm. This distance may be added to the KL divergence between the predicted distribution, P, and the ground truth distribution, Q, weighted by a weighting factor, β.
 
     During testing, the input to trajectory encoder  158  may be the trajectory history of all agents X A   (t     0     ,t     q     ] , the future trajectories of the agents not predicted X K   (t     q     ,t     f     ] , and the encoded agent identities ρ. As stated above, the set K of agents not predicted may be equal to the empty set. Accordingly, training and testing of the prediction model may be performed without relying on, or taking into consideration, the future trajectories of any agents. 
     Variational module  162  may take the encoded trajectory, H x , which may also be conditioned on the context X K   (t     q     ,t     f     ]  and the agent identities ρ, and may return a sample of the random latent variable {circumflex over (z)}. Trajectory decoder  164  may then infer the tracks (or paths) of each agent to be predicted (i.e., X P   (t     q     ,t     f     ] ) given a sampled {circumflex over (z)}, the encoded context H c , the encoded identities H ρ , and the final one second of trajectory history for agents to be predicted, X P   [t     q     −1,t     q     ] . 
     Pre-processing agent  116  may pre-process the identified data set prior to inputting the data set to training engine  120 . Generally, the inputs to conditional variational autoencoder may be a concatenation of disparate two-dimensional agent trajectories. For example, the input X A   [t     0     ,t     q     ]  may form an |A|×(t q ·5)×2 array, where |A| is the number of agents, t q ·5 is the total number of temporal samples over t q  second sampled at 5 Hz. One of the challenges in encoding multi-agent trajectories is the presence of permutation disorder. In particular, if the trajectories of all agents in A are concatenated to form X A   [t     0     ,t     q     ] , a natural and consistent ordering of the agents may be needed. If the trajectories of all agents in A are concatenated in a random order, then two similar plays with similar trajectories may have considerably different representations. To reduce (or minimize) the permutation order, pre-processing agent  116  may order the agents such that they are consistent from one play to another. 
     Pre-processing agent  116  may align agent tracks (or paths) using a tree-based role alignment. For example, pre-processing agent  116  may align agent tracks (or paths) using a tree-based role alignment, such as that discussed in Sha et al. “Fine-Grained Retrieval of Sports Plays using Tree-Based Alignment of Trajectories” (2017). Such alignment may minimize reconstruction error, and thus provide an improved (e.g., optimal) representation of multi-agent trajectories. 
     The tree-based alignment used by pre-processing agent may implement two alternating steps: 1) an expectation-maximization (EM) based alignment of agent positions to a template; and 2) K-means clustering of the aligned agent positions, where cluster centers may form the templates for the next EM step. Pre-processing agent  116  alternating between EM and clustering may lead to a splitting of leaf nodes in a tree until either there are fewer than M frames in a cluster or the depth of the tree exceeds D. Using a specific example, pre-processing agent  116  may set D=6 and trained separate tress for offense (e.g., M=400) and defense (e.g., M=4000). To learn a per-frame alignment tree, pre-processing agent may use 120,000 randomly sampled frames from ten basketball games. 
     Once pre-processing engine  116  pre-processes the data sets (e.g., training set, validating set, test set) from data store  110 , pre-processing engine  116  may pass the pre-processed (e.g., aligned) data to trajectory agent  120 . Trajectory agent  120  may use each respective data set to train, validate, and test a model generated by conditional variational autoencoder. The end result may be a fully trained model for use with subsequent inputs. 
     In implementation phase  204 , organization computing system  104  may use the trained model to generate multi-agent trajectory predictions for incoming tracking information. Implementation phase  204  may include tracking system  102 , pre-processing engine  116 , and a trained model  206 . Tracking system  102  may be configured to provide tracking data to organization computing system  104 . In some embodiments, tracking system  102  may provide tracking data to organization computing system  104  in real-time (or near real-time). Pre-processing engine  116  may pre-process the data, such that the agent tracks (or paths) are aligned. For example, pre-processing engine  116  may align the data using a tree-based alignment, such as that discussed above. 
     Pre-processing engine  116  may pass the aligned data to predictive model  206 . Predictive model  206  may predict the paths of various agents. For example, based on the aligned tracking data, predictive model  206  may project a trajectory for one or more agents. Such methodology may be beneficial in situations, for example, when incomplete tracking data is provided to organization computing system  104  on account, for example, of one or more agents outside the point-of-view of tracking system  102 . With predictive model  206 , organization computing system  104  may be able to accurately predict the position of such one or more agents, thus creating a more complete overview of the event for the end user. 
       FIG.  3    is a block diagram  300  illustrating conditional variational autoencoder  152 , according to example embodiments. Variational autoencoder includes context encoder  156 , trajectory encoder  158 , agent encoder  160 , variational module  162 , and decoder  164 . 
     As illustrated, each encoder may receive, as input, one or more sets of data. Agent encoder  160  may receive, as input, the set ρ. The set ρ may include information directed to an agent identity and/or a team identity. The output from agent encoder  160  may be a set of encoded values H ρ . 
     In some embodiments, context encoder  156  may receive, as input, the trajectory context X K   (t     q     ,t     f     ] . The set X K   (t     q     ,t     f     ]  may include future trajectories of those agents for which trajectory agent  120  is not projecting trajectories. In other words, X k   (t     q     ,t     f     ] ={X l   (t     q     ,t     f     ] }|∀l∈K of agents in the set K⊂A, such that K∪P=A and K∩P={ }. In some embodiments, K={ }. The output from context encoder  156  may be a set of encoded trajectory context values, H C . 
     Trajectory encoder  158  may receive, as input the tracking history of all players, X A   ]t     0     ,t     q     ] , the trajectory context, X K   (t     q     ,t     f     ] , and the encoded agent identity and/or team identity, H C . Trajectory encoder  158  may encode the tracking history of all players, X A   [t     0     ,t     q     ] , the trajectory context, X K   (t     q     ,t     f     ] , and the encoded agent identity and/or team identity, H C , to generate the encoded set H X . 
     The encoded set, H X , may then be provided, as input, to variational module  162 . In other words, the input to variational module  162  may be the joint encoding of the trajectory history X A   [t     0     ,t     q     ]  with the context and identity. Variational module  162  may predict the mean, μ z , and standard deviation, Σ z , of a latent variable distribution,  (μ z , Σ z ), based on, at least, the set of information encoded by trajectory encoder  158 . Variational module  162  may generate, as output, a random sample, {circumflex over (z)}, from  (μ z ,Σ z ). The random sample, {circumflex over (z)}, may be concatenated with the encoded values H ρ  and the encoded context H C . As such, the trajectory history, context, and identity may serve as conditionals for conditional variational autoencoder  152 . 
     The concatenated set of information (i.e., {circumflex over (z)}, H ρ , H C ) may be provided as input to decoder  164 . In some embodiments, the concatenated set of information may further include X P   [t     q     −1,t     q     ] . In other words, the concatenated set of information may include the last one second of observed trajectory history of the agents in the set P. Such information may encourage the predictions to be consistent with the observed history. Decoder  164  may output the set X P   [t     q     −1,t     q     ]  concatenated with Y P   (t     q     ,t     f     ] . In other words, decoder  164  may provide as output the projected trajectory of one or more agents (i.e., Y P   (t     q     ,t     f     ] ) with the last one second of observed trajectory history of the one or more agents (i.e., X P   [t     q     −1,t     q     ] ). 
       FIG.  4    is a flow diagram illustration a method  400  of generating a prediction model for predicting multi-agent trajectories, according to example embodiments. Method  400  may begin at step  402 . 
     At step  402 , trajectory agent  120  may retrieve tracking data from data store  118 . For example, the data set identified by the administrator in data store  118  may include a plurality of pre-defined sequences of two-dimensional trajectories. For each sequence, the administrator may define the subset P of all agents A for which their trajectories are to be projected. Each sequence may be labeled with agent identity, team, and canonical position (e.g., point guard, shooting guard, guard, small forward, power forward, forward, center). For the subset K of all agents A for which trajectory agent  120  will not predict trajectories, each agent may be labeled by their canonical position, thus limiting the set of player identities. The data set may then be split into training, validation, and test sets. 
     At step  404 , the identified data sets may be transmitted to pre-processing agent  116 . Pre-processing agent  116  may pre-process the identified tracking data. In some embodiments, pre-processing agent  116  may align the identified trajectory data, such that the trajectories of all agents are in a natural and consistent ordering. For example, given the trajectory data, two similar plays with similar trajectories may have different representations. To reduce (or minimize) the number of permutations, pre-processing agent may align data retrieved from data store such that the information is consistent from one play (or sequence) to the next. 
     At step  406 , trajectory agent  120  may generate a first set of data that includes agent position coordinates. The first set of data may include the multi-agent trajectory of a set A of interacting agents, the coordinates of which may be observed over a time history [t 0 , t q ]. For example, the trajectories may be represented as X A   [t     0     ,t     q     ] . 
     In some embodiments, method  400  may include step  408 . At step  408 , trajectory agent  120  may generate a second set that is representative of agent context. The trajectory context may be represented as X K   (t     q     ,t     f     ] . The set X K   (t     q     ,t     f     ]  may include future trajectories of those agents for which trajectory agent  120  is not projecting trajectories. In other words, X k   (t     q     ,t     f     ] ={X l   (t     q     ,t     f     ] }|∀l∈K of agents in the set K⊂A, such that K∪P=A and K∩P={ }. In some embodiments, K={ }. 
     At step  410 , trajectory agent  120  may generate a third set of values that include the identities of agents in the first set. The identity values may be represented as ρ. The set ρ may include information directed to an agent identity and/or a team identity. 
     At step  412 , agent encoder  160  may encode the third set of values, ρ. For example, agent encoder may receive, as input, the third set of values, ρ, and encode the values accordingly. The output from agent encoder  160  may be a set of encoded values H ρ . 
     At step  414 , trajectory encoder  158  may encode at least the first set of values. In some embodiments, trajectory encoder  158  may encode the first set of values, the second set of values, and the third set of values to generate an output, H x . For example, Trajectory encoder  158  may receive, as input the tracking history of all players, X A   [t     0     ,t     q     ] , the trajectory context, X K   (t     q     ,t     f     ] , and the encoded agent identity and/or team identity, H C . Trajectory encoder  158  may encode the tracking history of all players, X A   (t     0     ,t     q     ] , the trajectory context, X K   (t     q     ,t     f     ] , and the encoded agent identity and/or team identity, H C , to generate the encoded set H X . 
     In some embodiments, method  400  may include step  416 . At step  416 , context encoder  156  may encode the second set of values. For example, context encoder  156  may receive, as input, the trajectory context X K   (t     q     ,t     f     ] , and encode the trajectory context accordingly. The set X K   (t     q     ,t     f     ]  may include future trajectories of those agents for which trajectory agent  120  is not projecting trajectories. In other words, X K   (t     q     ,t     f     ] ={X K   (t     q     ,t     f     ] }|∀l∈K of agents in the set K⊂A, such that K∪P=A and K∩P={ }. In some embodiments, K={ }. The output from context encoder  156  may be a set of encoded trajectory context values, H C . 
     At step  418 , trajectory agent  120  may generate a sample of a random latent variable. For example, trajectory agent  120  may input the encoded set, H X , to variational module  162 . Variational module  162  may predict the mean, μ z , and standard deviation, Σ z , of a latent variable distribution,  (μ z ,Σ z ), based on, at least, the set of information encoded by trajectory encoder  158 . Variational module  162  may generate, as output, a sample of a random latent variable, {circumflex over (z)}, from  (μ z , Σ z ). 
     At step  420 , trajectory agent  120  may infer the trajectory of each agent based on at least the sample of the random latent variable (i.e., {circumflex over (z)}). For example, trajectory agent  120  may concatenate the random sample, {circumflex over (z)}, with the encoded values H ρ  and the encoded context H C . The concatenated set of information (i.e., {circumflex over (z)}, H ρ , H C ) may be provided as input to decoder  164 . In some embodiments, the concatenated set of information may further include X P   [t     q     −1,t     q     ] . Decoder  164  may output the set X P   [t     q     −1,t     q     ]  concatenated with Y P   (t     q     ,t     f     ] . In other words, decoder  164  may provide as output the projected trajectory of one or more agents (i.e., Y P   (t     q     ,t     f     ] ) with the last one second of observed trajectory history of the one or more agents (i.e., X P   [t     q     −1,t     q     ] ). 
     At step  422 , trajectory agent  120  may compare the inferred trajectory of each agent to the actual trajectory of each agent. For example, trajectory agent  120  may utilize an L 2  loss function to minimize the error between the inferred trajectories (i.e., output from decoder  164 ) and the actual trajectories (e.g., from data store  118 ). 
     The end-result from training conditional variational autoencoder  152  may be a trained model that is able to receive live trajectory data, and generate a projected trajectory for one or more agents. In some embodiments, the trained model is able to predict between 1s and 8s of agent trajectories. In some embodiments, the trained model is able to predict greater than 8s of agent trajectories. 
       FIG.  5    is a block diagram  500  illustrating an example graphical user interface (GUI)  502 , according to example embodiments. As shown, GUI  502  may include a representation of agent trajectories on a field of play  504 . In this example, the field of play is a basketball court. Illustrated in GUI  502  may be a first agent, A 1 , and a second agent, A 2 . The known trajectory of A 1  may be represented by solid line  506   1 ; the known trajectory of A 2  may be represented by solid line  5062 . For this example, trajectory agent  120  may project the trajectory of A 1 , while using the trajectory of A 2  as context. As shown, the future trajectory of A 2  may be represented by dashed line  508 . Information directed to the future trajectory of A 2  and the historical trajectory of A 1  may be provided to trajectory agent  120  as input to generate a projected trajectory for A 1 . The projected trajectory for A 1  may be represented by dashed-line  510 . 
       FIG.  6    is a flow diagram illustrating a method  600  of generating a projected trajectory for one or more agents using prediction model  206 , according to example embodiments. 
     Method  600  may begin at step  602 . At step  602 , organization computing system  104  may receive tracking data from tracking system  102 . In some embodiments, organization computing system  104  may receive tracking data from tracking system  102  in real-time (or near real-time). In some embodiments, organization computing system  104  may receive tracking data from tracking system  102  after a slight delay (e.g., 5 second delay, 10 second delay, etc.). The tracking data may include coordinates of agent position up to a time, t q . 
     At step  604 , pre-processing agent  116  may pre-process the received tracking data. In some embodiments, pre-processing agent  116  may align the trajectory data, such that the trajectories of all agents are in a natural and consistent ordering. 
     At step  606 , trajectory agent  120  may identify a subset of agents for which to project trajectories. For example, given a set of agents A, trajectory agent  120  may select (or an administrator may select) a subset of agents P for which to project trajectories. 
     At step  608 , trajectory agent  120  may generate a first set that includes position coordinates for each agent in the set A. The position coordinates may be sets of (x, y) coordinates from a time t 0  to a time t q . 
     In some embodiments, method  600  may include step  610 . At step  610 , trajectory agent  120  may generate a second set that a second set that is representative of agent context. For example, trajectory agent  120  may generate a second set of data that includes the trajectories of those agents, K, for which trajectory agent  120  is not projecting trajectories. Accordingly, as recited above, the second set may be an empty set, i.e., the trajectory prediction does not depend on or require the future projections of any other agents. 
     At step  612 , trajectory agent  120  may generate a third set of values that include the identities of agents in the first set. The identity values may be represented as ρ. The set ρ may include information directed to an agent identity and/or a team identity. 
     At step  614 , trajectory agent  120  may encode each set of values. For example, agent encoder  160  may encode the third set of values corresponding to the identity values. Trajectory encoder  158  may encode at least the first set of values. In some embodiments, trajectory encoder  158  may encode the first set of values, the second set of values, and the third set of values to generate an encoded output. For example, Trajectory encoder  158  may receive, as input the tracking history of all players, the trajectory context, and the encoded agent identity and/or team identity. Context encoder  156  may encode the second set of values. For example, context encoder  156  may receive, as input, the trajectory context, and encode the trajectory context accordingly. 
     At step  616 , variational module  162  may sample the set of information provided as input. For example, variational module  162  may sample the encoded data generated by trajectory agent  158  (i.e., the encoded first set of values, the encoded second set of values, and the re-encoded third set of values). 
     At step  618 , decoder  164  may infer the trajectories of the one or more agents based on the sample generated by variational module  162 . For example, decoder  164  may infer the trajectories of the one or more agents based on a vector that includes a concatenated set of data comprising: (1) the sample of the set of information generated by variational module  162 ; (2) the encoded identity values; and (3) the encoded context values. In some embodiments, the concatenated set of data may further include the last one second of observed trajectory history of the one or more agents. 
     At step  620 , trajectory agent  120  may generate a graphical representation of the projected trajectory of each agent. For example, interface module  154  may generate a graphical user interface that includes the graphical representation of the projected trajectory of each agent. 
       FIG.  7    is a flow diagram illustrating a method  700  of generating a projected trajectory for one or more agents using prediction model  206 , according to example embodiments. 
     Method  700  may begin at step  702 . At step  702 , organization computing system  104  may receive tracking data from tracking system  102 . In some embodiments, organization computing system  104  may receive tracking data from tracking system  102  in real-time (or near real-time). In some embodiments, organization computing system  104  may receive tracking data from tracking system  102  after a slight delay (e.g., 5 second delay, 10 second delay, etc.). The tracking data may include coordinates of agent position up to a time, t q . Although method  700  discuses use of live (or near-live) information, those skilled in the art may recognize that the following processes may be performed using historical (or non-live) information. 
     At step  704 , organization computing system  104  may identify at least one agent outside the line of vision of a tracking system  102 . For example, at least one agent may be outside the line of vision of the one or more cameras of tracking system  102  due to, for example, injury, lack of hustle, etc. 
     At step  706 , pre-processing agent  116  may pre-process the received tracking data. In some embodiments, pre-processing agent  116  may align the trajectory data, such that the trajectories of all agents are in a natural and consistent ordering. 
     At step  708 , trajectory agent  120  may identify the projected location of the at least one agent that was outside the line of vision of a tracking system  102 . Step  708  may include one or more substeps  712 - 722 . 
     At step  712 , trajectory agent  120  may generate a first set that includes position coordinates for each agent in the set A. The position coordinates may be sets of (x, y) coordinates from a time t 0  to a time t q . 
     In some embodiments, method  700  may include step  714 . At step  714 , trajectory agent  120  may generate a second set that a second set that is representative of agent context. For example, trajectory agent  120  may generate a second set of data that includes the trajectories of those agents, K, for which trajectory agent  120  is not projecting trajectories. In some embodiments, K={ }. 
     At step  716 , trajectory agent  120  may generate a third set of values that include the identities of agents in the first set. The identity values may be represented as ρ. The set ρ may include information directed to an agent identity and/or a team identity. 
     At step  718 , trajectory agent  120  may encode each set of values. For example, agent encoder  160  may encode the third set of values corresponding to the identity values. Trajectory encoder  158  may encode at least the first set of values. In some embodiments, trajectory encoder  158  may encode the first set of values, the second set of values, and the third set of values to generate an encoded output. For example, Trajectory encoder  158  may receive, as input the tracking history of all players, the trajectory context, and the encoded agent identity and/or team identity. Context encoder  156  may encode the second set of values. For example, context encoder  156  may receive, as input, the trajectory context, and encode the trajectory context accordingly. 
     At step  720 , variational module  162  may sample the set of information provided as input. For example, variational module  162  may sample the encoded data generated by trajectory agent  158  (i.e., the encoded first set of values, the encoded second set of values, and the re-encoded third set of values). 
     At step  722 , decoder  164  may infer the trajectories of the at least one agent based on the sample generated by variational module  162 . For example, decoder  164  may infer the trajectories of the one or more agents based on a vector that includes a concatenated set of data comprising: (1) the sample of the set of information generated by variational module  162 ; (2) the encoded identity values; and (3) the encoded context values. In some embodiments, the concatenated set of data may further include the last one second of observed trajectory history of the one or more agents. 
     At step  710 , trajectory agent  120  may generate a graphical representation of the projected trajectory of the at least one agent. For example, interface module  154  may generate a graphical user interface that includes the graphical representation of the projected trajectory of the at least one agent. Accordingly, any end users tracking the game via client device  108 , may be able to view the position of all agents on the field of player, even when a portion of the agents may be outside the line of sight of tracking system  102 . 
       FIG.  8 A  illustrates a system bus computing system architecture  800 , according to example embodiments. System  800  may be representative of at least a portion of organization computing system  104 . One or more components of system  800  may be in electrical communication with each other using a bus  805 . System  800  may include a processing unit (CPU or processor)  810  and a system bus  805  that couples various system components including the system memory  815 , such as read only memory (ROM)  820  and random access memory (RAM)  825 , to processor  810 . System  800  may include a cache of high-speed memory connected directly with, in close proximity to, or integrated as part of processor  810 . System  800  may copy data from memory  815  and/or storage device  830  to cache  812  for quick access by processor  810 . In this way, cache  812  may provide a performance boost that avoids processor  810  delays while waiting for data. These and other modules may control or be configured to control processor  810  to perform various actions. Other system memory  815  may be available for use as well. Memory  815  may include multiple different types of memory with different performance characteristics. Processor  810  may include any general purpose processor and a hardware module or software module, such as service  1   832 , service  2   834 , and service  3   836  stored in storage device  830 , configured to control processor  810  as well as a special-purpose processor where software instructions are incorporated into the actual processor design. Processor  810  may essentially be a completely self-contained computing system, containing multiple cores or processors, a bus, memory controller, cache, etc. A multi-core processor may be symmetric or asymmetric. 
     To enable user interaction with the computing device  800 , an input device  845  may represent any number of input mechanisms, such as a microphone for speech, a touch-sensitive screen for gesture or graphical input, keyboard, mouse, motion input, speech and so forth. An output device  835  may also be one or more of a number of output mechanisms known to those of skill in the art. In some instances, multimodal systems may enable a user to provide multiple types of input to communicate with computing device  800 . Communications interface  840  may generally govern and manage the user input and system output. There is no restriction on operating on any particular hardware arrangement and therefore the basic features here may easily be substituted for improved hardware or firmware arrangements as they are developed. 
     Storage device  830  may be a non-volatile memory and may be a hard disk or other types of computer readable media which may store data that are accessible by a computer, such as magnetic cassettes, flash memory cards, solid state memory devices, digital versatile disks, cartridges, random access memories (RAMs)  825 , read only memory (ROM)  820 , and hybrids thereof. 
     Storage device  830  may include services  832 ,  834 , and  836  for controlling the processor  810 . Other hardware or software modules are contemplated. Storage device  830  may be connected to system bus  805 . In one aspect, a hardware module that performs a particular function may include the software component stored in a computer-readable medium in connection with the necessary hardware components, such as processor  810 , bus  805 , display  835 , and so forth, to carry out the function. 
       FIG.  8 B  illustrates a computer system  850  having a chipset architecture that may represent at least a portion of organization computing system  104 . Computer system  850  may be an example of computer hardware, software, and firmware that may be used to implement the disclosed technology. System  850  may include a processor  855 , representative of any number of physically and/or logically distinct resources capable of executing software, firmware, and hardware configured to perform identified computations. Processor  855  may communicate with a chipset  860  that may control input to and output from processor  855 . In this example, chipset  860  outputs information to output  865 , such as a display, and may read and write information to storage device  870 , which may include magnetic media, and solid state media, for example. Chipset  860  may also read data from and write data to RAM  875 . A bridge  880  for interfacing with a variety of user interface components  885  may be provided for interfacing with chipset  860 . Such user interface components  885  may include a keyboard, a microphone, touch detection and processing circuitry, a pointing device, such as a mouse, and so on. In general, inputs to system  850  may come from any of a variety of sources, machine generated and/or human generated. 
     Chipset  860  may also interface with one or more communication interfaces  890  that may have different physical interfaces. Such communication interfaces may include interfaces for wired and wireless local area networks, for broadband wireless networks, as well as personal area networks. Some applications of the methods for generating, displaying, and using the GUI disclosed herein may include receiving ordered datasets over the physical interface or be generated by the machine itself by processor  855  analyzing data stored in storage  870  or  875 . Further, the machine may receive inputs from a user through user interface components  885  and execute appropriate functions, such as browsing functions by interpreting these inputs using processor  855 . 
     It may be appreciated that example systems  800  and  850  may have more than one processor  810  or be part of a group or cluster of computing devices networked together to provide greater processing capability. 
     While the foregoing is directed to embodiments described herein, other and further embodiments may be devised without departing from the basic scope thereof. For example, aspects of the present disclosure may be implemented in hardware or software or a combination of hardware and software. One embodiment described herein may be implemented as a program product for use with a computer system. The program(s) of the program product define functions of the embodiments (including the methods described herein) and can be contained on a variety of computer-readable storage media. Illustrative computer-readable storage media include, but are not limited to: (i) non-writable storage media (e.g., read-only memory (ROM) devices within a computer, such as CD-ROM disks readably by a CD-ROM drive, flash memory, ROM chips, or any type of solid-state non-volatile memory) on which information is permanently stored; and (ii) writable storage media (e.g., floppy disks within a diskette drive or hard-disk drive or any type of solid state random-access memory) on which alterable information is stored. Such computer-readable storage media, when carrying computer-readable instructions that direct the functions of the disclosed embodiments, are embodiments of the present disclosure. 
     It will be appreciated to those skilled in the art that the preceding examples are exemplary and not limiting. It is intended that all permutations, enhancements, equivalents, and improvements thereto are apparent to those skilled in the art upon a reading of the specification and a study of the drawings are included within the true spirit and scope of the present disclosure. It is therefore intended that the following appended claims include all such modifications, permutations, and equivalents as fall within the true spirit and scope of these teachings.