Here Global B.v.

Other

Ksai Electronics

Bo Xu

Matei Stroila

Jane MacFarlane

Bishnu P Phuyal

Raghavendran Balu

Nirav Ajmeri

Muhammed Mas-Ud Hussain

Andrew Lewis

Davide Pietrobon

Tao Song

Onur Derin

Tessa Berry

Tiffany Barkley

Xidong Pi

Ouri Wolfson

Bang Xin Zhang

Bishnu Phuyal

An apparatus and methods provide trajectory data for a geographic area. Multiple probe data sets are received or identified from one or more mobile devices. The probe data sets include time values in a first sequence associated with location values in the first sequence. At least one of the probe data sets is modified to reverse the location values such that the modified probe data set includes time values in a first sequence associated with location values in a second sequence. A location clustering algorithm is performed on the plurality of probe data sets and the modified probe data set based on the location values.

Trajectory time reversal

Apparatus and methods are described for identification of a geographic location for sign placement. Probe data is received for a geographic area, and the probe data is collected by one or more sensors. Trips including destinations within the geographic area are matched with road segments from a geographic database. At least one potential sign placement road segment is compared to road segments of the trip. One or more destinations are selected from the trips based on the comparison of the at least one sign placement road segment to the trip road segments.

Geographic position calculation for sign placement based on destination profiling of probe data

A method, apparatus and computer program product selectively qualify trajectories for utilization in regards to the determination of the travel time for a maneuver. In the context of a method, it is determined whether a trajectory intersects both first and second gate lines disposed at opposite ends of a maneuver that includes first and second sections. If the trajectory intersects both the first and second gate lines, the method determines whether a candidate probe point is within a respective distance threshold of at least one of the first section or the second section. The method also includes selectively identifying the trajectory as either a qualified trajectory or a disqualified trajectory in regards to a determination of a travel time for the maneuver based upon whether the candidate probe point is determined to be within the respective distance threshold of at least one of the first section or the second section.

Method and apparatus for selectively qualifying trajectories in regards to a determination of travel time for a maneuver

Systems, methods, and apparatuses are described for determining turn lane data from probe data. Probe data for an intersection including locations and headings is identified. The probe data for the intersection is divided into a first trace and a second trace based on locations. The difference in the headings, heading change data, is calculated. From the heading change data, at least two local extrema points are identified. A characteristic of the turning lane is determined based on the at least two local extrema points.

Turn lane configuration

An apparatus for providing anonymity in geographic data for probes using a variable mix zone in a geographic region includes a geographic database, a mix zone generator, and a pseudonym generator. The geographic database is configured to store one or more map features in the geographic region. The mix zone generator is configured to define a mix zone boundary having a size based on the one or more map features and monitor probe data for at least one probe. The probe data including a location within a predetermined distance of the mix zone boundary. The pseudonym generator is configured to select a pseudonym for the at least one probe in response to the location of the probe data and apply the pseudonym for the at least one probe in the geographic data when the at least one probe exits the mix zone.

Dynamic mix zones

An approach is provided for generating trajectory bundles for map data analysis. The approach involves receiving probe data associated with the bounded geographic area. The probe data are collected from sensors of a plurality of devices traveling in the bounded geographic area, and includes probe points indicating a position, a heading, a speed, a time, or a combination thereof. The approach also involves constructing a plurality of trajectories from the probe points to represent respective movement paths of said each of the plurality of devices. The approach further involves computing similarities among a plurality of curves represented by the plurality of trajectories. The approach further involves clustering the plurality of trajectories into trajectory bundles based on the similarities with each bundle representing a possible maneuver within the bounded geographic area. The approach further involves generating a map of the bounded geographic area based on the trajectory bundles.

Method and apparatus for providing trajectory bundles for map data analysis

An approach is provided for providing adaptive location sampling in mobile devices. The approach involves determining one or more maneuvers from among a plurality of one or more links representing a localized area of a transportation network. Each of the one or more maneuvers is a combination of two or more adjacent links of the one or more links. The approach also involves determining a road length and a speed attribute for each link in said each maneuver. The approach further involves calculating a travel time for said each maneuver based on the road length and the speed attribute of said each link. The approach further involves calculating a sampling interval for the mobile device traveling in the localized area based on the travel time. The mobile device is configured to collect probe data using one or more sensors at the sampling interval while traveling in the localized area.

Method and apparatus for providing adaptive location sampling in mobile devices

An approach is provided for generating a minimum overlapping alternative path. The approach involves receiving a constraint parameter for traversing a path between a first location and a second location. The approach also involves determining a critical portion of the path that is to be traveled to satisfy the constraint parameter, and designating a remaining portion of the path that is not the critical portion as a non-critical portion. The approach further involves calculating one or more candidate minimum overlapping alternative paths for the non-critical portion of the path. The approach further involves generating the minimum overlapping alternative path between the first location and the second location by combining the critical portion of the path with a selected one of the one or more candidate minimum overlapping alternative paths that satisfies the constraint parameter.

Method and apparatus for providing a minimum overlapping alternative path

An approach is provided for filtering device location points in a sampled trajectory while maintaining path reconstructability. The approach involves determining a first location point in the sampled trajectory that is an unfiltered location point. The sampled trajectory includes device location points sampled by a device traversing a road network. The approach also involves determining a fastest alternative path from the first location point to a second location point. The approach further involves calculating a sampling time difference between a time at which the first location point was sampled and another time at which the second location point was sampled. The approach further involves designating the second location point as a next unfiltered location point when the sampling time difference is within a threshold value of a free-flow travel time calculated for the fastest alternative path. Otherwise, the second location point is designated as a filtered location point.

Method and apparatus for filtering device location points in a sampled trajectory while maintaining path reconstructability

In accordance with the exemplary embodiments of the invention there is at least a method and apparatus to determine a shortest code length of at least one category of a publish-subscribe system such that a length requirement of prefix code system for the at least one category is not exceeded; and assign a prefix code of the shortest code length to each of the at least one category of the publish-subscribe system.

Optimal coding method for efficient matching of hierarchical categories in publish-subscribe systems

An approach is provided for classifying a traffic jam from probe data. The approach involves receiving the probe data that is map-matched to a roadway on which the traffic jam is detected. The probe data is collected from one or more vehicles traveling the roadway. The approach also involves determining a jam area of the roadway based on the probe data. The jam area corresponds to one or more segments of the roadway affected by the traffic jam. The approach further involves determining a set of features indicated by the probe data from a portion of the probe data collected from the jam area. The approach further involves classifying, using a machine learning classifier, the traffic jam as either a recurring traffic jam or a non-recurring traffic jam based on the set of features.

Method and apparatus for classifying a traffic jam from probe data

An approach is provided for processing and/or facilitating a processing of probe trace data to determine one or more mode indicators, wherein the one or more mode indicators include, at least in part, one or more attributes of the probe trace data. The approach involves causing, at least in part, a modeling of one or more statistical patterns of at least one pedestrian mode of transport, at least one non-pedestrian mode of transport, or a combination thereof based, at least in part, on determining one or more probabilities that one or more mode indicators are associated with the at least one pedestrian mode of transport, the at least one non-pedestrian mode of transport, or a combination thereof. The approach also involves causing, at least in part, a classification of other probe trace data as being associated with the at least one pedestrian mode of transport or the at least one non-pedestrian mode of transport based, at least in part, on the one or more mode indicators that are associated with the other probe trace data and the one or more statistical patterns.

Method and apparatus for detecting pedestrian mode from probe data

A method, apparatus, computer program product, and device with various means are disclosed for determining the time it takes to a traverse a transportation structure by enclosing a representation of a transportation structure with a bounding polygon, specifying a plurality of gates which represent legitimate entry or exit points of the transportation structure as one or more edges of the bounding polygon, and computing the travel time for a probe traveling through the bounding polygon via the gates. Computing the probe's travel time comprises generating a location trace of movement of the probe, determining an entry and exit time, and calculating the difference between the exit time and the entry time. Determining the entry and exist time can be done by interpolation. An average of a set of computations can be used to get an average of the time it takes traverse the transportation structure.

Growing community of inventors

Lisle, IL, United States of America

Bo Xu