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.
- Alphabetic
- By Inheritance
- TransitionProbabilityStrategies
- TransitionProbabilityStrategiesMixin
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- val DefaultDijkstraMaxDistanceInMeters: Double
Maximum distance explored by the shortest path algorithm
Maximum distance explored by the shortest path algorithm
- Definition Classes
- TransitionProbabilityStrategiesMixin
- 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
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @IntrinsicCandidate() @native()
- 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
graphand vertex lengths from alengthPropertyMap.Creates a strategy using the distance between candidates to calculate transition probabilities given a specific
graphand vertex lengths from alengthPropertyMap. The data fromroadAccessdetermines 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
trueare accessible, while ranges with valuefalsewill be interpreted as forbidden
- Definition Classes
- TransitionProbabilityStrategiesMixin
- 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
graphand vertex lengths from alengthPropertyMap.Creates a strategy calculating routes and transition probabilities between candidates given a specific
graphand vertex lengths from alengthPropertyMap. 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
trueare accessible, while ranges with valuefalsewill be interpreted as forbidden
- Definition Classes
- TransitionProbabilityStrategiesMixin
- 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
graphand vertex lengths from alengthPropertyMap.Creates a strategy using the distance between candidates to calculate transition probabilities given a specific
graphand vertex lengths from alengthPropertyMap. The data fromroadAccessdetermines 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
trueare accessible, while ranges with valuefalsewill be interpreted as forbidden
- Definition Classes
- TransitionProbabilityStrategiesMixin
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @IntrinsicCandidate() @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @IntrinsicCandidate() @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @IntrinsicCandidate() @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @IntrinsicCandidate() @native()
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
Deprecated Value Members
- 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
- 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
graphand vertex lengths from alengthPropertyMap.Creates a strategy calculating routes and transition probabilities between candidates given a specific
graphand vertex lengths from alengthPropertyMap. 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
trueare accessible, while ranges with valuefalsewill be interpreted as forbidden
- Definition Classes
- TransitionProbabilityStrategiesMixin
- Annotations
- @Deprecated @deprecated
- Deprecated
(Since version SDK 2.41) Use another overload of distanceWithTransitions instead
- 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
graphand vertex lengths from alengthPropertyMap.Creates a strategy using the distance between candidates to calculate transition probabilities given a specific
graphand vertex lengths from alengthPropertyMap. The data fromroadAccessdetermines 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
trueare accessible, while ranges with valuefalsewill be interpreted as forbidden
- Definition Classes
- TransitionProbabilityStrategiesMixin
- Annotations
- @Deprecated @deprecated
- Deprecated
(Since version SDK 2.41) Use another overload of distanceWithoutTransitions instead
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
(Since version 9)