TY  - JOUR
PY  - 2022//
TI  - Robust unsupervised learning of temporal dynamic vehicle-to-vehicle interactions
JO  - Transportation research part C: emerging technologies
A1  - Guha, Aritra
A1  - Lei, Rayleigh
A1  - Zhu, Jiacheng
A1  - Nguyen, XuanLong
A1  - Zhao, Ding
SP  - e103768
EP  - e103768
VL  - 142
IS  - 
N2  - Robust unsupervised learning of temporal dynamic interactions is an important problem in robotic learning in general and automated unsupervised learning in particular. Temporal dynamic interactions can be described by (multiple) geometric trajectories in a suitable space over which unsupervised learning techniques may be applied to extract useful features from raw and high-dimensional data measurements. Taking a geometric approach to robust unsupervised learning for temporal dynamic interactions, it is necessary to develop suitable metrics and a systematic methodology for comparison and for assessing the stability of an unsupervised learning method concerning its tuning parameters. Such metrics must account for (geometric) constraints in the physical world as well as uncertainties associated with the learned patterns. In this paper, we introduce a model-free metric based on the Procrustes distance for robust learning of dynamic vehicle interactions, and an optimal transport-based distance metric for comparing between distributions of interaction patterns. These distance metrics can serve as an objective for assessing the stability of an interaction learning algorithm. They are also used for comparing the outcomes produced by different algorithms. Moreover, they may also be adopted as an objective function to obtain clusters and representative interaction primitives. These concepts and techniques will be introduced, along with mathematical properties, while their usefulness will be demonstrated in unsupervised learning of vehicle-to-vehicle interactions extracted from the Safety Pilot database, one of the world's largest databases for connected vehicles. <br><br>RESULTS reveal that the proposed methods outperform existing techniques under several well-founded notions of clustering efficiencies.<p />  <p>Language: en</p>
LA  - en
SN  - 0968-090X
UR  - http://dx.doi.org/10.1016/j.trc.2022.103768
ID  - ref1
ER  -