Packages

object TransitionProbabilityStrategies extends TransitionProbabilityStrategiesMixin

Contains factory methods for TransitionProbabilityStrategys.

These methods may extract some layers from a provided Optimized Map for Location Library Catalog:

  • "routinggraph" layer, to create a routing graph using com.here.platform.location.integration.optimizedmap.graph.Graphs$#from(Catalog, CacheManager)
  • "geometry" layer, to get the fraction associated to a point on a given Vertex
  • "length" layer, to get the length of a given Vertex

See also OptimizedMapLayers.

Linear Supertypes
TransitionProbabilityStrategiesMixin, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. TransitionProbabilityStrategies
  2. TransitionProbabilityStrategiesMixin
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. val DefaultDijkstraMaxDistanceInMeters: Double

    Maximum distance explored by the shortest path algorithm

    Maximum distance explored by the shortest path algorithm

    Definition Classes
    TransitionProbabilityStrategiesMixin
  5. val DefaultExponentialProbabilityDistributionBeta: Double

    Sensible beta value for exponential distributions used by DistanceTransitionProbabilityStrategy

    Sensible beta value for exponential distributions used by DistanceTransitionProbabilityStrategy

    See also Exponential_distribution

    Definition Classes
    TransitionProbabilityStrategiesMixin
  6. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  7. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  8. def directDistance[O, V, E](graph: DirectedGraph[V, E], length: PropertyMap[V, Double], roadAccess: RangeBasedPropertyMap[V, Boolean], distanceCalculator: StraightLineDistanceCalculator)(implicit arg0: GeoCoordinateOperations[O]): TransitionProbabilityStrategy[O, V, Seq[V]]

    Creates a strategy using the distance between candidates to calculate transition probabilities given a specific graph and vertex lengths from a length PropertyMap.

    Creates a strategy using the distance between candidates to calculate transition probabilities given a specific graph and vertex lengths from a length PropertyMap. The data from roadAccess determines which parts of a vertex are considered traversable and which are not.

    This strategy uses DirectDistanceCalculator to calculate the distance between points along the road network. DirectDistanceCalculator can only calculate distances between points on the same vertex or on two directly connected vertices. For that reason, this strategy should only be used when the expected distances between consecutive observations in a trip are small.

    See also DistanceTransitionProbabilityStrategy.

    length

    The lengths of the vertices of graph

    roadAccess

    Ranges with value true are accessible, while ranges with value false will be interpreted as forbidden

    Definition Classes
    TransitionProbabilityStrategiesMixin
  9. def distanceWithTransitions[O, V, E, LS](graph: DirectedGraph[V, E], geometry: PropertyMap[V, LS], length: PropertyMap[V, Double], roadAccess: RangeBasedPropertyMap[V, Boolean], distanceCalculator: StraightLineDistanceCalculator)(implicit arg0: GeoCoordinateOperations[O], arg1: LineStringOperations[LS]): TransitionProbabilityStrategy[O, V, Seq[V]]

    Creates a strategy calculating routes and transition probabilities between candidates given a specific graph and vertex lengths from a length PropertyMap.

    Creates a strategy calculating routes and transition probabilities between candidates given a specific graph and vertex lengths from a length PropertyMap. Note that even though the observations can be separated by multiple vertices, if they are not close enough, they will be considered unreachable.

    The computed paths will be returned by the HMMPathMatcher as com.here.platform.location.core.mapmatching.MatchedPath.Transitions.

    See also DistanceTransitionProbabilityStrategy.

    geometry

    Used to translate a path made of Vs to a line string (sequence of geocoordinates).

    length

    The lengths of the vertices of graph

    roadAccess

    Ranges with value true are accessible, while ranges with value false will be interpreted as forbidden

    Definition Classes
    TransitionProbabilityStrategiesMixin
  10. def distanceWithoutTransitions[O, V, E, LS](graph: DirectedGraph[V, E], geometry: PropertyMap[V, LS], length: PropertyMap[V, Double], roadAccess: RangeBasedPropertyMap[V, Boolean], distanceCalculator: StraightLineDistanceCalculator)(implicit arg0: GeoCoordinateOperations[O], arg1: LineStringOperations[LS]): TransitionProbabilityStrategy[O, V, NoTransition]

    Creates a strategy using the distance between candidates to calculate transition probabilities given a specific graph and vertex lengths from a length PropertyMap.

    Creates a strategy using the distance between candidates to calculate transition probabilities given a specific graph and vertex lengths from a length PropertyMap. The data from roadAccess determines which parts of a vertex are considered traversable and which are not. Note that even though the observations can be separated by multiple vertices, if they are not close enough, they will be considered unreachable.

    See also DistanceTransitionProbabilityStrategy.

    geometry

    Used to translate a path made of Vs to a line string (sequence of geocoordinates).

    length

    The lengths of the vertices of graph

    roadAccess

    Ranges with value true are accessible, while ranges with value false will be interpreted as forbidden

    Definition Classes
    TransitionProbabilityStrategiesMixin
  11. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  12. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  13. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  14. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  15. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  16. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  17. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  18. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  19. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  20. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  21. def toString(): String
    Definition Classes
    AnyRef → Any
  22. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  23. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  24. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()

Deprecated Value Members

  1. def connectivity[O, V, E](graph: DirectedGraph[V, E], length: PropertyMap[V, Double])(implicit arg0: GeoCoordinateOperations[O]): TransitionProbabilityStrategy[O, V, NoTransition]

    Creates a strategy using only the graph connectivity between candidates to calculate transition probabilities.

    Creates a strategy using only the graph connectivity between candidates to calculate transition probabilities.

    See also SimpleConnectivityTransitionProbabilityStrategy for more details about how the transition probabilities will be calculated.

    length

    The lengths of the vertices of graph

    Definition Classes
    TransitionProbabilityStrategiesMixin
    Annotations
    @Deprecated @deprecated
    Deprecated

    (Since version SDK 2.48) Please use directDistance

  2. def distanceWithTransitions[O, V, E](graph: DirectedGraph[V, E], length: PropertyMap[V, Double], roadAccess: RangeBasedPropertyMap[V, Boolean], distanceCalculator: StraightLineDistanceCalculator)(implicit arg0: GeoCoordinateOperations[O]): TransitionProbabilityStrategy[O, V, Seq[V]]

    Creates a strategy calculating routes and transition probabilities between candidates given a specific graph and vertex lengths from a length PropertyMap.

    Creates a strategy calculating routes and transition probabilities between candidates given a specific graph and vertex lengths from a length PropertyMap. Note that even though the observations can be separated by multiple vertices, if they are not close enough, they will be considered unreachable.

    The computed paths will be returned by the HMMPathMatcher as com.here.platform.location.core.mapmatching.MatchedPath.Transitions.

    See also DistanceTransitionProbabilityStrategy.

    length

    The lengths of the vertices of graph

    roadAccess

    Ranges with value true are accessible, while ranges with value false will be interpreted as forbidden

    Definition Classes
    TransitionProbabilityStrategiesMixin
    Annotations
    @Deprecated @deprecated
    Deprecated

    (Since version SDK 2.41) Use another overload of distanceWithTransitions instead

  3. def distanceWithoutTransitions[O, V, E](graph: DirectedGraph[V, E], length: PropertyMap[V, Double], roadAccess: RangeBasedPropertyMap[V, Boolean], distanceCalculator: StraightLineDistanceCalculator)(implicit arg0: GeoCoordinateOperations[O]): TransitionProbabilityStrategy[O, V, NoTransition]

    Creates a strategy using the distance between candidates to calculate transition probabilities given a specific graph and vertex lengths from a length PropertyMap.

    Creates a strategy using the distance between candidates to calculate transition probabilities given a specific graph and vertex lengths from a length PropertyMap. The data from roadAccess determines which parts of a vertex are considered traversable and which are not. Note that even though the observations can be separated by multiple vertices, if they are not close enough, they will be considered unreachable.

    See also DistanceTransitionProbabilityStrategy.

    GreatCircleDistanceCalculator for an implementation of distanceCalculator

    length

    The lengths of the vertices of graph

    roadAccess

    Ranges with value true are accessible, while ranges with value false will be interpreted as forbidden

    Definition Classes
    TransitionProbabilityStrategiesMixin
    Annotations
    @Deprecated @deprecated
    Deprecated

    (Since version SDK 2.41) Use another overload of distanceWithoutTransitions instead

Inherited from TransitionProbabilityStrategiesMixin

Inherited from AnyRef

Inherited from Any

Ungrouped