A Method for Driving Route Predictions Based on Hidden Markov Model

Algorithm 1

New_Track (a training set ).

Input: A training set .

Output: The extending training set New.

(1)  Coordinate Point Set , = ;

(2)  Extending route Set New = ;

(3)  foreach (route in )

(4)   Starting point ;

(5)   End point ;

(6)   Insert and into the set ;

(7)    = Filter();

(8)   Cluster Set -means++ ();

    /∗  , which is clusters altogether. ∗/

(9)  for (int ; ; ++)

(10)   for (int ; ; ++)

(11)     for (int ; .length; ++)

      /∗  .length represents the number of coordinate points in the th cluster. ∗/

(12)     for (int ; .length; ++)

(13)       Insert Best_route(, ) into New;

         /∗  represents the th coordinate point in the th cluster. ∗/