2020
DOI: 10.48550/arxiv.2004.03053
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Scenario-Transferable Semantic Graph Reasoning for Interaction-Aware Probabilistic Prediction

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
25
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
3
2
1

Relationship

2
4

Authors

Journals

citations
Cited by 9 publications
(25 citation statements)
references
References 45 publications
0
25
0
Order By: Relevance
“…Such a representation is compact, efficient and generic, which captures sufficient information for intention determination and can be generically used across different driving scenarios. For more information related to DIA and SG, please refer to [18]. Illustrated in the left part of Figure 2, the process of extracting semantic graph representation G t−T f ,t from raw observations O t−T f ,t can also be formally described:…”
Section: Proposed Methodsmentioning
confidence: 99%
See 4 more Smart Citations
“…Such a representation is compact, efficient and generic, which captures sufficient information for intention determination and can be generically used across different driving scenarios. For more information related to DIA and SG, please refer to [18]. Illustrated in the left part of Figure 2, the process of extracting semantic graph representation G t−T f ,t from raw observations O t−T f ,t can also be formally described:…”
Section: Proposed Methodsmentioning
confidence: 99%
“…In this section, we first adopt the semantic graph (SG), which is originally introduced in [18]. In the SG, the dynamic insertion area (DIA) is defined as a generic and compact representation of the scenario.…”
Section: A High-level Intention-identification Policymentioning
confidence: 99%
See 3 more Smart Citations