1 Introduction
The goal of predicting pedestrian trajectories is to infer sociallyacceptable paths based on previous steps while considering the social norms of other moving agents. Many earlier works [helbing1995social, 5459260, 5206641, yamaguchi2011you] on human trajectory prediction are based on deterministic approaches which yield the most likely single path. One of the earliest works in [helbing1995social]
models a social force using attractive and repulsive forces between pedestrians. Since then, motion timeseries and agent interactions have been applied to trajectory forecasting. With the development of recurrent neural networks (RNNs), pioneering works such as, SocialLSTM
[alahi2016social] and SocialAttention [vemula2018social], have adopted a social pooling and attention mechanisms between spatial neighbors. These approaches have become baseline models in areas such as spatial relation aggregation [gupta2018social, huang2019stgat, Shi2021sgcn, salzmann2020trajectron++, mohamed2020social, sun2020rsbg] and temporal future prediction [mangalam2020pecnet, sun2020reciprocal, zhao2020tnt, Lee_2017_CVPR, Marchetti_2020_CVPR, zhang2019sr].Recently, generative models, which infer the distribution of potential future trajectories, are likely to inspire a major paradigm shift away from the single best prediction methods [gupta2018social, liang2019peeking, li2019conditional, shi2020multimodal, sadeghian2019sophie, kosaraju2019social, sun2020reciprocal, dendorfer2021mggan, zhao2019matf, tao2020dynamic, sun2020rsbg, shafiee2021Introvert, Lee_2017_CVPR, Ivanovic_2019_ICCV, salzmann2020trajectron++, huang2019stgat, mohamed2020social, liang2020garden, Shi2021sgcn, yu2020spatio, li2020Evolvegraph, mangalam2020pecnet, liu2021causal, liu2020snce]. The generative models represent all possible paths, such that pedestrians may go straight, turn left/right at an intersection or take a roundabout way to avoid obstacles. To efficiently establish this multimodality, a stochastic process is introduced to the trajectory prediction [gupta2018social], which models the inferred uncertainty of pedestrians’ movements in every time frame. Stochastic trajectory prediction models start by generating a random hypothesis. Due to the nondeterministic nature of random sampling, the quality of the hypotheses depends on the number of samples. Ideally, an infinite number of hypotheses would be able to characterize all possible movements of pedestrians, but this is infeasible. In practice, a fixed number of multiple trajectories are randomly sampled using the Monte Carlo (MC) method, and all existing stochastic models follow this random sampling strategy. However, the number of samples is typically too small to represent sociallyacceptable pedestrian trajectories because they are biased toward the random sampling, as illustrated in Fig. 1.
In this paper, we revisit the stateoftheart works which employ the stochastic process for multimodal prediction (Fig. 2(a)
(c)). We prove that all of the expected values in the generated trajectory distributions with Generative Adversarial Networks (GANs)
[gupta2018social, huang2019stgat, liu2021causal], Conditional Variational AutoEncoders (CVAEs) [salzmann2020trajectron++, mangalam2020pecnet, liu2020snce], and Gaussian methods [mohamed2020social, Shi2021sgcn] are biased. Afterward, we introduce a QuasiMonte Carlo (QMC) sampling method that effectively alleviates this problem using a lowdiscrepancy sequence, instead of random sampling. Lastly, we push the random sampling forward with a learnable method: NonProbability Sampling Network (NPSN), a very small network that generates purposive sample sequences using observations and agent interactions in Fig. 2(d). Without structurally modifying the existing models in any way, we achieve significant improvements in the performance of pedestrian trajectory prediction. This is accomplished by replacing one line of code on random sampling with our NPSN. Interestingly, one of the existing models using our NPSN as an auxiliary module achieves the best performance in all evaluation metrics.
Unlike previous methods, the proposed approach focuses on the sampling method to generate a set of random latent vectors. To the best of our knowledge, our work is the first attempt to adopt QMC sampling and to propose a learnable method for purposive sampling in trajectory forecasting in Fig. 1.
2 Related Works
2.1 Stochastic trajectory prediction
Convolutional neural network (CNN)based approaches using Gaussian distribution have improved the efficiency of pedestrian trajectory prediction. SocialLSTM [alahi2016social], a pioneering model in this field, predicts a bivariate Gaussian distribution consisting of five parameters for the observed trajectories of pedestrians. However, it has a limitation when inferring single paths, since it only selects the best one sample from the distribution in inference time. Followup works [vemula2018social, mohamed2020social, Shi2021sgcn, shi2020multimodal] predict multiple paths by sampling multiple next coordinates based on predicted distributions.
As another methodology, a generative model is introduced to predict realistic future paths. SocialGAN [gupta2018social] firstly uses a generative framework that recursively infers future trajectory. The benefit of GAN is that it generates various outputs according to latent vectors. As a result, interpersonal, socially acceptable and multimodal human behaviors are accounted for in the pedestrian trajectory prediction. Such a research stream encourages to define a variety loss which calculates for the best prediction among multiple samples for diverse sample generation. [kosaraju2019social, sadeghian2019sophie, sun2020reciprocal, liu2021causal, dendorfer2021mggan, huang2019stgat].
Similarly, there have been attempts to predict diverse future generations using CVAE frameworks. DESIRE [Lee_2017_CVPR] uses a latent variable to account for the ambiguity of future paths and learns a sampling model to produce multiple hypotheses of future trajectories from given observations. This approach provides a diverse set of plausible predictions without the variety loss, and shares inspiration to objectives in many CVAEbased models [salzmann2020trajectron++, mangalam2020pecnet, yu2020spatio, liu2020snce, Ivanovic_2019_ICCV].
All of these methods include a random sampling process and are sensitive to bias, due to the fixed number of samples, as above mentioned. In addition, current stateoftheart models with CVAE frameworks outperform Gaussian distributionbased methods [mohamed2020social, Shi2021sgcn]. In this study, we analyze these phenomena with respect to the bias of stochastic trajectory prediction, and show that the Gaussian distributionbased approaches achieve noticeable performance improvements by minimizing the bias, even better than the CVAEbased methods. Lastly, we mention a recent deterministic approach [zhao2020tnt] that predicts multiple trajectories, which is beyond the scope of this paper.
2.2 Learning latent variables
Some works account for the transformation of latent spaces by using prior trajectory information. PECNet [mangalam2020pecnet] for example uses a truncation trick in latent space to adjust the tradeoff between the fidelity and the variety of samples. In their learning approach, both IDL [li2019idl] and Trajectron++ [salzmann2020trajectron++]
predict the mean and standard deviation of a latent distribution in an inference step. Rather than directly predicting the distribution parameters, AgentFormer
[yuan2021agent]uses a linear transform of Gaussian noise to produce the latent vector. These methodologies still run the risk of bias because of the random sampling of the latent vectors. In the present work, we aim to reduce the bias using a discrepancy loss of a set of sampled latent vectors.
2.3 Graphbased approaches
Pioneering works have introduced the concepts of socialpooling [alahi2016social, gupta2018social, sun2020reciprocal] and socialattention mechanisms [vemula2018social, zhang2019sr, li2020Evolvegraph]
to capture the social interactions among pedestrians in scenes. Recently, Graph Neural Network (GNN)based approaches
[huang2019stgat, kosaraju2019social, mohamed2020social, liang2020garden, Shi2021sgcn, li2020Evolvegraph, Bae_Jeon_2021] have been introduced to model agentagent interactions with graphbased policies. In the GNNbased works, pedestrians are regarded as nodes of the graph, and their social relations are represented as edge weights. SocialSTGCNN [mohamed2020social] presents a Graph Convolutional Network (GCN) [kipf2016semi]based trajectory prediction which aggregates the spatial information of distances among pedestrians. Graph Attention Networks (GATs) [velivckovic2018graph] implicitly assign more weighting to edges with high social affinity on the pedestrian graph [huang2019stgat, kosaraju2019social, sun2020rsbg, Shi2021sgcn, yu2020spatio]. Multiverse [liang2020garden] and SimAug [liang2020simaug] utilize GATs on 2D grids to infer feasible trajectories. Unlike these previous works, where GATs are used in the encoding process, we apply a GAT framework to a sampling process on the latent space to make a decoder predict future paths more accurately.2.4 Monte Carlo Sampling Method
(Quasi) Monte Carlo is a computational technique for numerical experiment using random numbers. Exploiting the random numbers allows one to approximate integrals, but this is highly error prone. The error directly depends on the random sampling methods from probability distributions. QMC sampling is developed with quasirandom sequences, known as lowdiscrepancy sequences [low_discrepancy]
and is generated in a deterministic manner. It is widely utilized for many computer vision tasks, such as depth completion
[DC_MC_2], 3D reconstruction [MC_3Drecon, MC_3DPointCloudRegist], motion tracking [MC_motionTracking] and neural architecture search [MC_NAS_1, MC_NAS_2]. We firstly apply QMC sampling to ensure uniform coverage of the sampling spaces for pedestrian trajectory prediction. Note that the sequence is uniformly distributed if the discrepancy tends to be zero, as the number of samples goes to infinity.
3 Generated Trajectories Are Biased
In this section, we start with the problem definition for pedestrian trajectory prediction in Sec. 3.1. We then theoretically demonstrate that generated trajectories from stochastic trajectory prediction models are biased toward random sampling in Sec. 3.2. We also introduce a way to alleviate the bias with a lowdiscrepancy sequence for stochastic prediction in Sec. 3.3.
3.1 Problem Definition
We formulate the pedestrian trajectory prediction task as a multiagent future trajectory generation problem conditioned on their past trajectories. To be specific, during the observation time frames , there are pedestrians in a scene. The observed trajectory sequence is represented as for , where is the spatial coordinate of each pedestrian at time frame . With the given observed sequence, the goal of the trajectory prediction is to learn potential distributions to generate plausible future sequences for all pedestrians.
3.2 Stochastic Trajectory Prediction is Biased.
The generated trajectory comes from a distribution of possible trajectories which are constructed by pedestrians’ movements based on social forces (Fig. 3). is an expectation value computed with a plausible trajectory distribution, and is calculated with of which are independent and identically distributed (IID) random samples, i.e. the term is random if one uses different samples to generate trajectories. The expectation
is a Monte Carlo estimate of integral,
i.e. relevant expectation.Suppose that the expectation we want to compute from the trajectory distribution is which is the expected value of
for random variable
with a density on dimensional unit cube . Then, the Monte Carlo estimator for the generated trajectory distribution with samples can be formulated as below:(1) 
(2) 
where denotes a probability.
By the Strong Law of large numbers
[LawofLargeNumber], the MC estimate converges to as the number of samples increases without bound. Now, we assume thathas a finite variance
and define the error as below:(3) 
(4) 
where is an expectation and is . Note that the is nonnegative and depends on the function being integrated. The algorithmic goal is to specify the procedure that results in lower variance estimates of the integral.
Now consider a function of the generator , which is sufficiently smooth, in a Monte Carlo integral . We apply the Taylor series expansion of as follows:
(5) 
Therefore, the expectation value of can be formulated as below:
(6) 
where and the is a bias. Since the term is estimated with an MC integration, the estimate must have a bias of . Note that the bias in the generated trajectories vanishes for , however, it is infeasible to utilize all infinite possible paths in practice. Since depends on the generator, the generated trajectories are differently biased depending on the number of generated samples as well as the generators, which is validated in Sec. 5.2.
3.3 QuasiMonte Carlo for Trajectory Prediction
The QMC method utilizes a low discrepancy sequence including the Halton sequence [halton] and the Sobol sequence [sobol]. Inspired by [QMC_faster_mc], we select a Sobol sequence which not only shows consistently better performances than the Halton sequence, but also is up to 5 times faster than the MC method, even with lower error rates.
From the view of numerical analysis, an inequality in [QMC] proves that lowdiscrepancy sequences guarantees more advanced sampling in Eq. 2 with fewer integration errors as below:
(7) 
where is a total variation of function which is bounded variation, and is the discrepancy of a sequence for the number of samples . The inequality shows that a deterministic lowdiscrepancy sequence can be much better than the random one, for a function with finite variation. In the mathematics community, it has been proven that the Sobol sequences have a rate of convergence close to ; for a random sequence it is in [QMC_faster_mc, QMC]. For faster convergence, needs to be small and large (e.g., ). As a result, the low discrepancy sequences have lower errors for the same number of points () as shown in Tab. 1.
As an example, since are IID samples from a uniformly distributed unit box for MC estimates, the samples tend to be irregularly spaced. For QMC, as comes from a deterministic quasirandom sequence whose point samples are independent, they can be uniformly spaced. This guarantees a suitable distribution for pedestrian trajectory prediction by successively constructing finer uniform partitions. Fig. 4
displays a plot of a moderate number of pseudorandom points in 2dimensional space. We observe regions of empty space where there are no points generated from the uniform distribution, which produce results skewed towards the specific destinations. However, the Sobol sequence yields evenly distributed points to enforce prediction results close to sociallyacceptable paths.
Unfortunately, lowdiscrepancy sequences such as the Sobol sequence are deterministically generated and make the trajectory prediction intractable when representing an uncertainty of pedestrians’ movements with various social interactions. Adding randomness into the Sobol sequence by scrambling the sequence’s base digits [scramble_sobol] is a solution to this problem. The resultant sequence retains the advantage of QMC method, even with the same expected value. Accordingly, we utilize the scrambled Sobol sequence to generate pedestrian trajectories to account for the feasibility, the diversity, and the randomness of human behaviors.
4 NonProbability Sampling Network
In this section, we propose NPSN, which extends the sampling technique for pedestrian trajectory prediction based on observed trajectory. Unlike the previous methods, which sample paths in a stochastic manner, we construct a model that effectively chooses target samples using a nonprobabilistic sampling technique illustrated in Fig. 2(d).
4.1 NonProbability Sampling on Multimodal Trajectory Prediction
In contrast to stochastic sampling, purposive sampling, one of the most common nonprobability sampling techniques [black2019business], relies on the subjective judgment of an expert to select the most productive samples rather than random selection. This approach is advantageous when studying complicated phenomena in indepth qualitative research [samplingforqualitative].
Since most people walk to their destinations using the shortest path, a large portion of labeled attributes in public datasets [5459260, crowdsbyexample] are straight paths. Generative attribute models learn the probabilistic distributions of social affinity features for the attribute of straight paths. However, due to the multimodal nature of human paths, the models must generate as many diverse and feasible paths as possible, using only a fixed number of samples. As a possible solution, we can purposively include a variety of samples on turning left/right and detouring around obstacles. In purposive sampling, a maximum variation is beneficial for multimodal trajectory prediction, when examining the diverse ranges of pedestrians’ movements. We make this process a learnable method, aiming to generate heterogeneous trajectory samples with prior knowledge of past trajectories.
4.2 NPSN Architecture
We propose NPSN which substitutes the random sampling process of existing models with a learnable method. NPSN works as purposive sampling, which relies on the past trajectories of pedestrians when selecting samples in the distribution. As a result, when predicting a feasible future trajectory, a past trajectory can be used for the sampling process while also embedding informative features as a guidance. Unlike existing works [mangalam2020pecnet, li2019idl, salzmann2020trajectron++, yuan2021agent] that impose a restriction in the sampling space by limiting a distribution, we design all of the processes in a learnable manner.
Pedestrian graph representation. NPSN first captures the social relations using a GAT to generate sociallyacceptable samples. For input trajectory , a pedestrian graph is defined as a set of pedestrian nodes and their relation edges . With the node features , learned feature maps for the social relation are shared across different pedestrian nodes in a scene. We utilize an attention mechanism for modeling the social interaction, whose effectiveness is demonstrated in previous works [huang2019stgat, Shi2021sgcn]. The GAT allows NPSN to aggregate the features for neighbors by assigning different importance to their edge . Here, the importance value is calculated using the attention score between two node features .
Purposive sampling. With the interactionaware node features, we predict samples for each pedestrian. In particular, we use three MLP layers after the GAT layer for NPSN. By learning more prior information about samples of interest, prediction models using NPSN generate better samples. Each trajectory prediction model additionally receives an dimensional random latent vector along with the observed trajectory. Therefore, the NPSN must predict a set of output . The output passes through a prediction model to generate final trajectories for each pedestrian. For temporal consistency, we use the same set of purposive samples for all prediction time frames of each pedestrian node. This process is repeated for all pedestrian nodes, and the output shape of the NPSN is .
Loss function.
To optimize trajectory prediction models with our NPSN, we use two loss functions to generate welldistributed purposive samples. First, a winnertakesall process
[rupprecht2017learning], which generates a path closest to its ground truth, is trained to regress the accurate positions of pedestrians. Similar to [gupta2018social], we measure a distance between the prediction paths and the groundtruth, and use only one path with the smallest error for training:(8) 





However, we observe that all sample points are sometimes closely located near its groundtruth as learning progresses. This is a common problem in purposive sampling, because certain samples can be overbiased due to data imbalance, i.e. a large portion of the trajectory moving along one direction of the walkway. For this reason, we introduce a novel discrepancy loss to keep the sample points with lowdiscrepancy, as below:
(9) 
The objective of discrepancy loss is to maximize distances among the closest neighbors of samples. If the distance is closer, the loss imposes a higher penalty to ensure their uniform coverage of the sampling space.
The final loss function is a linear combination of both the distance and the discrepancy loss . We set to balance the scale of both terms.
4.3 Implementation Details
Transformation of one distribution to another.
While most human trajectory prediction models use a normal distribution, the Sobol sequence and our NPSN are designed to produce a uniform distribution. We bridge the gap by transforming between the uniform distribution and the normal distribution. There are some representative methods including Ziggurat method
[JSSv005i08], Inverse Cumulative Distribution Function (ICDF), and BoxMuller Transform
[Box1958ANO]. In this work, we utilize the BoxMuller transform which is differentiable and enables an efficient execution on a GPU with the lowest QMC error, as demonstrated in [gpugems3, OKTEN20111268]. The formula of the Boxmuller transform is as follows:(10) 
where is an independent sample set from a uniform distribution and is an independent random variable from a standard normal distribution.
Training Procedure. Our NPSN is embedded into the stateoftheart pedestrian trajectory prediction models [mohamed2020social, Shi2021sgcn, gupta2018social, huang2019stgat, salzmann2020trajectron++, mangalam2020pecnet, liu2020snce, liu2021causal] by simply replacing their random sampling part. The parameters of the models are initialized using the weights provided by the authors, except for two models [huang2019stgat, mangalam2020pecnet] which use weights reproduced from the authors’ source codes. Our NPSN has only 5,128 learnable parameters on and . We train the prediction models with NPSN using an AdamW optimizer [loshchilov2018decoupled] with a batch size of 128 and a learning rate of
for 128 epochs. We step down the learning rate with a gain of 0.5 at every 32 epochs. Training time takes about three hours on a machine with an NVIDIA 2080TI GPU.
5 Experiments
In this section, we conduct comprehensive experiments on public benchmark datasets to verify how the sampling strategy contributes to pedestrian trajectory prediction. We first briefly describe our experimental setup (Sec. 5.1), and then provide comparison results with various baselines and stateoftheart models (Sec. 5.2). Moreover, we run an extensive ablation study to demonstrate the effect of each component of our method (Sec. 5.3).
5.1 Experimental Setup
Dataset. We evaluate the effectiveness of the QMC method and our NPSN on various benchmark datasets [5459260, crowdsbyexample, robicquet2016learning, yi2015understanding] over stateoftheart methods. ETH [5459260] and UCY dataset [crowdsbyexample] include ETH and HOTEL, and UNIV, ZARA1 and ZARA2 scenes, respectively. Both datasets consist of various movements of pedestrians with complicated social interactions. The Stanford Drone Dataset (SDD) [robicquet2016learning] contains secluded scenes with various object types (e.g. pedestrian, biker, skater, and cart), and the Grand Central Station (GCS) [yi2015understanding] dataset consists of highly congested scenes where pedestrians walk. We observe a trajectory for 3.2 seconds (), and then predict future paths for the next 4.8 seconds (). We follow a leaveoneout crossvalidation evaluation strategy, which is the standard evaluation protocol used in many works [gupta2018social, huang2019stgat, mohamed2020social, Shi2021sgcn, salzmann2020trajectron++, mangalam2020pecnet].
Evaluation metric. We measure the performance of the trajectory prediction models using three metrics: 1) Average Displacement Error (ADE)  average Euclidean distance between a prediction and groundtruth trajectory; 2) Final Displacement Error (FDE)  Euclidean distance between a prediction and groundtruth final destination; 3) Temporal Correlation Coefficient (TCC) [tao2020dynamic]  Pearson correlation coefficient of motion patterns between a prediction and groundtruth trajectory. These metrics assess the best one of trajectory outputs, and we report average values for all agents in each scene. In addition, to reduce the variance in the prediction results of stochastic models, we repeat the evaluation 100 times and then average them for each metric.
Baseline. We evaluate QMC and NPSN sampling methods with representative stochastic pedestrian trajectory prediction models: 1) Gaussian distributionbased model  SocialSTGCNN [mohamed2020social], SGCN [Shi2021sgcn]; 2) GANbased model  SocialGAN [gupta2018social], STGAT [huang2019stgat], CausalSTGAT [liu2021causal]; 3) CVAEbased model  Trajectron++ [salzmann2020trajectron++], PECNet [mangalam2020pecnet], and NCETrajectron++ [liu2020snce]. To validate the effectiveness of QMC and NPSN, we replace their random sampling parts in the authors’ provided codes with our QMC and NPSN sampling method.
5.2 Results from QMC and NPSN method
Comparison of MC and QMC. We compare MC with the QMC method by incorporating them into the sampling part of the baseline models. As shown in Figs. 5 and 1, the QMC method significantly outperforms the MC method on all the evaluation metrics. In Fig. 5, we report the error distributions of the baseline models in the test phase. The QMC method achieves consistently lower errors and variations by alleviating the bias problem mentioned in Sec. 3.2.
We also observe that the Gaussianbased models show a large performance gain over the GAN and CVAEbased models. There are two reasons for the performance gains induced by the QMC method: 1) The dimension of the sampling space () in the Gaussianbased models is relatively smaller than other models (i.e. , or ). According to [drawbackQMC], for large dimensions and a small number of samples , the sampling results from a lowdiscrepancy generator may not be good enough over randomly generated samples. The Gaussianbased model thus yields promising results compared to one which has larger sampling dimensions. 2) The performance improvements depend on the number of layers in networks (shallower is better): The CVAE and GANbased models are composed of multiple layers. By contrast, the Gaussianbased models have only one layer which acts as a linear transformation between the predicted trajectory coordinates and final coordinates. To be specific, in the transformation, sampled independent 2D points are multiplied with the Cholesky decomposed covariance matrix and shifted by the mean matrix. Here, the shallow layer of the Gaussianbased models directly reflects the goodness of the QMC sampling method, rather than deeper layers which can barely be influenced by the random latent vector in the inference step.
Evaluation of NPSN. We apply NPSN to all three types of stochastic trajectory prediction models. As shown in Tab. 1, there are different performance gains according to the types. Particularly, the Gaussian distribution approaches (SocialSTGCNN [mohamed2020social], SGCN [Shi2021sgcn]) show the highest performance improvement (up to 60%), which can be analyzed by the advantages of the QMC method when . So far, the performance of the Gaussian distribution approaches has been underestimated due to the disadvantage of being easily affected by the sampling bias. Our NPSN maximizes the capability of the Gaussian distribution approaches through a purposive sampling technique.
In the CVAE based approaches, PECNet [mangalam2020pecnet] shows a larger performance improvement (up to 41%) than that of Trajectron++ [salzmann2020trajectron++]. Since PECNet directly predicts a set of destinations through the latent vector, NPSN is compatible with its inference step. On the other hand, NPSN seems to produce less benefit with the inference step of Trajectron++ because it predicts the next step recurrently and its sample dimension is relatively large ().
The generative models with variety loss, SocialGAN and STGAT, show relatively small performance improvements, compared to the others. For some datasets, the FDE values of STGAT are lower than those of MC and QMC when using our NPSN. This seems to suggest that NPSN fails to learn samples close to groundtruth trajectories due to the common entanglement problem of latent space [infogan, stylegan].
ETH  HOTEL  UNIV  ZARA1  ZARA2  AVG  
SocialGAN [gupta2018social]  0.87 / 1.62  0.67 / 1.37  0.76 / 1.52  0.35 / 0.68  0.42 / 0.84  0.61 / 1.21 
STGAT [huang2019stgat]  0.65 / 1.12  0.35 / 0.66  0.52 / 1.10  0.34 / 0.69  0.29 / 0.60  0.43 / 0.83 
SocialSTGCNN [mohamed2020social]  0.64 / 1.11  0.49 / 0.85  0.44 / 0.79  0.34 / 0.53  0.30 / 0.48  0.44 / 0.75 
PECNet [mangalam2020pecnet]  0.61 / 1.07  0.22 / 0.39  0.34 / 0.56  0.25 / 0.45  0.19 / 0.33  0.32 / 0.56 
Trajectron++ [salzmann2020trajectron++]  0.43 / 0.86  0.12 / 0.19  0.22 / 0.43  0.17 / 0.32  0.12 / 0.25  0.21 / 0.41 
SGCN [Shi2021sgcn]  0.57 / 1.00  0.31 / 0.53  0.37 / 0.67  0.29 / 0.51  0.22 / 0.42  0.35 / 0.63 
CausalSTGAT [liu2021causal]  0.60 / 0.98  0.30 / 0.54  0.52 / 1.10  0.32 / 0.64  0.28 / 0.58  0.40 / 0.77 
NCETrajectron++ [Liu_2021_ICCV_snce]  0.39 / 0.79  0.11 / 0.18  0.20 / 0.44  0.15 / 0.33  0.11 / 0.26  0.19 / 0.40 
NPSNSGAN  0.72 / 1.26  0.38 / 0.72  0.71 / 1.43  0.34 / 0.68  0.34 / 0.70  0.50 / 0.96 
NPSNSTGAT  0.61 / 1.02  0.31 / 0.57  0.53 / 1.13  0.34 / 0.68  0.30 / 0.62  0.42 / 0.80 
NPSNSTGCNN  0.44 / 0.65  0.21 / 0.34  0.28 / 0.44  0.25 / 0.43  0.22 / 0.38  0.28 / 0.45 
NPSNPECNet  0.55 / 0.88  0.19 / 0.29  0.29 / 0.44  0.21 / 0.33  0.16 / 0.25  0.28 / 0.44 
NPSNTrajectron++  0.40 / 0.76  0.12 / 0.18  0.21 / 0.41  0.17 / 0.31  0.12 / 0.24  0.20 / 0.38 
NPSNSGCN  0.36 / 0.59  0.16 / 0.25  0.23 / 0.39  0.18 / 0.32  0.14 / 0.25  0.21 / 0.36 
NPSNCausalSTGAT  0.56 / 0.90  0.25 / 0.40  0.51 / 1.09  0.32 / 0.65  0.27 / 0.56  0.38 / 0.72 
NPSNNCETrajectron++  0.36 / 0.68  0.11 / 0.18  0.18 / 0.39  0.14 / 0.29  0.11 / 0.23  0.18 / 0.35 
Qualitative results. Fig. 6 shows several cases where there are differences between the predictions of NPSN and other methods. Since NPSN takes an observation trajectory along with the lowdiscrepancy characteristics of the QMC method, the predicted paths from NPSN are closer to sociallyacceptable paths compared to other methods.
As we described in the Fig. 4, the QMC method generates a more realistic trajectory distribution than the MC method. However, due to the limitations of the dataset, the generated trajectories of the baseline network are biased toward a straight path. On the other hand, NPSN sampling method alleviates the problem by selecting the point near the groundtruth in the latent space. As a result, the human trajectory model with NPSN not only generates welldistributed samples with finite sampling pathways, but also represents the feasible range of human’s movements.
Comparison with the stateoftheart models. We push the stateoftheart models with our NPSN, a purposive sampling technique. As shown in Tab. 1, our NPSN shows a significant performance improvement on all the baseline networks. NPSN provides better overall accuracy by taking fully advantage of the lowdiscrepancy characteristics of the QMC method.
In addition, we report a benchmark result on ETH/UCY dataset in Tab. 2. It is noticeable that all the baseline models exhibit better performances with our NPSN. In particular, when NPSN is incorporated into the combinational approach of Trajectron++ [salzmann2020trajectron++] and NCE [liu2020snce], it achieves the best performances on the benchmark. Our NPSN is trained to only control the latent vector samples for the baseline models, and synergizes well with the inference step that comes after both the initial prediction of Trajectron++ and the collision avoidance of NCE.
5.3 Ablation Studies
Evaluation of different number of samples. To check the effectiveness of the density of sampled paths in human trajectory prediction, we randomly generate trajectories by changing the number of samples . As shown in Fig. 7, the performance gap between the MC and the QMC method is marginal when the number of samples goes to infinity. As mentioned above, it follows the Strong Law of large numbers in the MC integration. The Gaussianbased model, SGCN [Shi2021sgcn], achieves superior performance and improves more than 30% performance gain over the classic policy (). Since the sample dimension is small, the effectiveness and convergence of our NPSN are enlarged. Note that a performance drop over sparse conditions due to the discrepancy property: For small and a comparably large sample space dimension (i.e., ), the discrepancy of the QMC method may not be less than that of a random sequence. We overcome these limitations with a learnable sampling method by sampling a feasible latent vector with lowdiscrepancy characteristics.
Deterministic trajectory prediction. Since the stochastic model is trained to predict multimodal future paths, it outputs diverse paths at each execution, which is undesirable for deterministic human trajectory prediction, which infers only one feasible pathway (). By replacing the conventional probability process with a learnable sampling, NPSN allows the stochastic models to infer the most feasible trajectory in a deterministic manner. As shown in Fig. 7 (gray colored regions), NPSN outperforms QMC and the conventional methods on all the metrics at .
ETH  HOTEL  UNIV  ZARA1  ZARA2  AVG  
Baseline  0.57 / 1.00  0.31 / 0.53  0.37 / 0.67  0.29 / 0.51  0.22 / 0.42  0.35 / 0.63 
w/o  0.39 / 0.61  0.23 / 0.45  0.26 / 0.47  0.20 / 0.36  0.16 / 0.31  0.25 / 0.44 
w/o  0.38 / 0.61  0.16 / 0.25  0.23 / 0.39  0.18 / 0.32  0.14 / 0.25  0.22 / 0.37 
w/o GAT  0.36 / 0.57  0.17 / 0.28  0.23 / 0.39  0.18 / 0.32  0.14 / 0.26  0.22 / 0.37 
+NPSN  0.36 / 0.59  0.16 / 0.25  0.23 / 0.39  0.18 / 0.32  0.14 / 0.25  0.21 / 0.36 
Effectiveness of each component. Lastly, we examine the effectiveness of each component in our NPSN, whose result is reported in Tab. 3. Here, SGCN [Shi2021sgcn] is selected as the baseline model because it shows the most significant performance improvements with NPSN. First, our two loss functions work well. Particularly, the discrepancy loss guarantees sample diversity by generating lowdiscrepancy samples, and the distance loss enforces generating samples close to the groundtruth trajectory. The GAT captures the agentaware interaction for sociallyacceptable trajectory prediction, except for the secluded ETH scene.
6 Conclusion
In this work, we numerically analyze the limitations of the conventional sampling process in stochastic pedestrian trajectory prediction, by using the concept of discrepancy as a measure of the sampling quality. To overcome this limitation, we then introduce a novel, lightweight and learnable sampling strategy, inspired by the QuasiMonte Carlo method. Unlike conventional random sampling, our learnable method considers both observations and the social norms of pedestrians in scenes. In addition, our method can be inserted into stochastic pedestrian trajectory predictions as a plugandplay module. With the proposed learnable method, all of the stateofart models achieve performance improvements. In particular, the Gaussianbased models show the best results on the benchmark.
Acknowledgement This work is in part supported by the Institute of Information communications Technology Planning
Evaluation (IITP) grant funded by the Korea government (MSIT) (No.2019001842, Artificial Intelligence Graduate School Program (GIST), No.2021002068, Artificial Intelligence Innovation Hub), Vehicles AI Convergence Research
Development Program through the National IT Industry Promotion Agency of Korea (NIPA) funded by the Ministry of Science and ICT(No.S1602201001), the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIT) (No.2020R1C1C1012635), and the GISTMIT Collaboration grant funded by the GIST in 2022.