2018
DOI: 10.1049/iet-its.2018.5132
|View full text |Cite
|
Sign up to set email alerts
|

Hidden Markov model and driver path preference for floating car trajectory map matching

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
11
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 16 publications
(11 citation statements)
references
References 12 publications
0
11
0
Order By: Relevance
“…Some studies have focused on lowdimensional manifold models to account for a minor subset of trajectories that are possible at intersections (4). Hidden Markov models have also been proposed (5). Recurrent neural network (RNN) has also been widely used, particularly the long short-term memory (LSTM) model, to understand the complex dynamics of vehicle motions (6).…”
Section: Literature Reviewmentioning
confidence: 99%
“…Some studies have focused on lowdimensional manifold models to account for a minor subset of trajectories that are possible at intersections (4). Hidden Markov models have also been proposed (5). Recurrent neural network (RNN) has also been widely used, particularly the long short-term memory (LSTM) model, to understand the complex dynamics of vehicle motions (6).…”
Section: Literature Reviewmentioning
confidence: 99%
“…Additionally, the eye and gaze data are also used for early detection of a driver's intentions, which is an interesting feature of ADAS. Most schemes developed for prediction of a driver's maneuvering behavior are principally based on the hidden Markov model (HMM) and its variants [209][210][211][212]. These schemes are applied to the data obtained from the driver's gaze sequence [9] and head position [213].…”
Section: Data Processing Algorithmsmentioning
confidence: 99%
“…Offline HMM map matching algorithms are applied using historical data, batching the whole input trajectory to find the optimal matching path in the road network [23][24][25][26][27][28]. Whole trajectories enable offline algorithms to take account of the relationship between the front and the back points to achieve higher accuracy.…”
Section: Introductionmentioning
confidence: 99%
“…Other studies, e.g., Quick Matching [26], Multistage Matching [27], and SnapNet [29] consider more factors including the speed constraint, road level, and vehicle heading. With regard to transition probability calculation, to consider temporal relationship of different points, some factors such as speed constraint and free-flow travel time are considered in several studies [23,25,28,30,31]. To consider spatial relationship, some factors are included such as the difference between great-circle distance and route distance [24,28,29,31], difference between vehicle's heading change and road segments' heading change [27], and same road priority [29].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation