Creates an HMM path matcher that only matches to vertices that are accessible by cars, and that is suitable for sparse probes. However, if the observations are not close enough, they will be considered unreachable.

Besides a sequence of MatchResults, this path matcher returns a list of transitions. A transition is a sequence of Vertex objects that represents a path between OnRoad match results associated to two successive observations. A transition does not contain the two vertices referenced by the corresponding OnRoad match results.

Consider the following example:

 O1                   O2
 |                    |
 v                    v
--V1--> --V2--> --V3-->

The observation O1 is matched to vertex V1, and O2 to V3. Although V1 and V3 are not directly connected, the path matcher returns a transition from O1 to O2 that contains the intermediate vertices, V2 in this case.

Internally, this method creates a PathMatcherWithFilter that uses a DistanceFilter and a ProjectingInterpolator to improve match results when consecutive points are close to one another.

See also PathMatcherWithFilter for more information about filtering and interpolation.

Creates an HMM path matcher that only matches to vertices that are accessible by cars.

The path matcher uses TransitionProbabilityStrategies.directDistance to calculate the transition probabilities of the Hidden Markov Model. Therefore, this path matcher is not recommended for sparse input observations. For sparse input observations, consider using a path matcher created by PathMatchers.carPathMatcherWithTransitions instead.

Creates an HMM path matcher that uses default parameters and doesn't take any restriction into consideration. It is suitable for sparse probes. However, if the observations are not close enough, they will be considered unreachable.

Besides a sequence of MatchResults, this path matcher returns a list of transitions. A transition is a sequence of Vertex objects that represents a path between OnRoad match results associated to two successive observations. A transition does not contain the two vertices referenced by the corresponding OnRoad match results.

Consider the following example:

 O1                   O2
 |                    |
 v                    v
--V1--> --V2--> --V3-->

The observation O1 is matched to vertex V1, and O2 to V3. Although V1 and V3 are not directly connected, the path matcher returns a transition from O1 to O2 that contains the intermediate vertices, V2 in this case. * Internally, this method creates a PathMatcherWithFilter that uses a DistanceFilter and a ProjectingInterpolator to improve match results when consecutive points are close to one another.

See also PathMatcherWithFilter for more information about filtering and interpolation.

Creates an HMM path matcher that uses default parameters and doesn't take any restriction into consideration.

The path matcher uses TransitionProbabilityStrategies.directDistance to calculate the transition probabilities of the Hidden Markov Model. Therefore, this path matcher is not recommended for sparse input observations. For sparse input observations, consider using a path matcher created by PathMatchers.unrestrictedPathMatcherWithTransitions instead.