Exploring Semantic Clustering and Similarity Search for Heterogeneous Traffic Scenario Graph
Ferdinand M\"utsch, Maximilian Zipfl, Nikolai Polley, J. Marius Z\"ollner

TL;DR
This paper introduces a graph neural network-based self-supervised approach for clustering and similarity search of traffic scenarios, facilitating scalable and representative testing of automated vehicles without manual labels.
Contribution
It proposes a novel heterogeneous spatio-temporal graph model and a self-supervised embedding method for scenario clustering and retrieval in AV testing.
Findings
Effective clustering of scenarios into meaningful groups
Ability to retrieve representative scenarios via nearest-neighbor search
Captures semantics without manual labeling
Abstract
Scenario-based testing is an indispensable instrument for the comprehensive validation and verification of automated vehicles (AVs). However, finding a manageable and finite, yet representative subset of scenarios in a scalable, possibly unsupervised manner is notoriously challenging. Our work is meant to constitute a cornerstone to facilitate sample-efficient testing, while still capturing the diversity of relevant operational design domains (ODDs) and accounting for the "long tail" phenomenon in particular. To this end, we first propose an expressive and flexible heterogeneous, spatio-temporal graph model for representing traffic scenarios. Leveraging recent advances of graph neural networks (GNNs), we then propose a self-supervised method to learn a universal embedding space for scenario graphs that enables clustering and similarity search. In particular, we implement contrastive…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
