2014
DOI: 10.1109/taes.2014.120716
|View full text |Cite
|
Sign up to set email alerts
|

Prediction and retrodiction algorithms for path-constrained targets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 27 publications
0
2
0
Order By: Relevance
“…Reference [13] extends the idea of including road map knowledge to random finite set (RFS) methods, however, using a more involved road representation and handling than the method proposed in this paper. Reference [14] also uses a different road and coordinate representation that requires projections, however, the concept of branching hypotheses in ambiguous situations (e.g., at intersections), also found in [15], is similar to the handling found in our approach.…”
mentioning
confidence: 85%
“…Reference [13] extends the idea of including road map knowledge to random finite set (RFS) methods, however, using a more involved road representation and handling than the method proposed in this paper. Reference [14] also uses a different road and coordinate representation that requires projections, however, the concept of branching hypotheses in ambiguous situations (e.g., at intersections), also found in [15], is similar to the handling found in our approach.…”
mentioning
confidence: 85%
“…Cars and trucks are limited to roads [19], [20], trains are limited to their tracks [3], and even ships are partially limited to rivers or stick to shipping lanes in the open oceans [21]. Knowledge of these paths (i.e.…”
Section: B Map-aided Localizationmentioning
confidence: 99%