Abstract: An approach is provided for using pedestrian probe data for ridesharing. The approach involves, for example, receiving pedestrian probe data from a search zone associated with a designated location. The pedestrian probe data is collected, for instance, from one or more location sensors of at least one device associated with at least one pedestrian. The approach also involves processing the pedestrian probe data to determine one or more pedestrian paths terminating at the designated location. The approach further involves identifying at least one common origin, at least one common destination, or a combination thereof of the one or more pedestrian paths and providing the least one common origin, the at least one common destination, or a combination thereof as an output.

Abstract: A plurality of instances of event data are received. Each instance of event data corresponds to a traffic event on a first segment and comprises an indication of at least one parameter characterizing travel of a vehicle along the first segment during the traffic event. Based on the plurality of instances of event data, a recurring event is identified. At least one representative parameter characterizing travel along the first segment during the recurring event is determined based on the two or more instances of event data corresponding to the recurring event. At least one element of a data structure is modified with the at least one representative parameter. The at least one element of the data structure corresponds to the first segment. A geographic database comprises the data structure and a navigation application is configured to use at least a portion of the data structure to perform a navigation function.

Abstract: An approach is provided for automatically detecting a merge lane traffic jam. The approach involves, for example, determining a plurality of road links in proximity to a merge point comprising a highway and a ramp. The method also involves processing probe data collected from the plurality of road links to classify the plurality of road links, one or more sublinks of the plurality of road links, or a combination thereof into at least one of a highway upstream class, a merging area class, a highway downstream class, a ramp downstream class, and a ramp upstream class. The method further involves determining vehicle speed data for the highway upstream class, the merging area class, the highway downstream class, the ramp downstream class, the ramp upstream class, or a combination thereof. The method further involves automatically determining an occurrence of the merge lane traffic jam based on the vehicle speed data.

Abstract: An apparatus and method for determining a traffic level in the future. A road network including graph edges for a plurality of intersections and graph nodes for a plurality of road links is identified. A road link of interest is selected from the plurality of road links. A set of related link subset are calculated for the selected road link. Historical data is queried for the related link subset. A predicted traffic level is calculated for the selected road link in response to the historical data for the related link subset.

Abstract: A method, apparatus and computer program product are provided to define a strand upstream of a direction based traffic (DBT) link. In a method, a strand is defined upstream of a DBT link. The method includes extending the strand so as to include one or more links upstream of the DBT link. The strand is extended by determining whether a link is to be added to the strand based upon evaluation of a termination criteria. The termination criteria is at least partially based upon a relationship of a function class of the link to the function class of one or more other links. In an instance in which the termination criteria is satisfied, the method ceases further extension of the strand.

Abstract: An approach is provided for determining tunnel speed for a vehicle travelling through a tunnel. A tunnel processing platform aggregates probe data associated with at least one vehicle into at least one tunnel path based, at least in part, on a network geometry topology for at least one tunnel. The tunnel processing platform also designates at least one probe point collected upstream of the at least one tunnel as at least one starting point of the at least one tunnel path and at least one temporary probe point as at least one endpoint of the at least one tunnel path, wherein the at least one temporary probe point is downstream of the at least one tunnel. It then determines at least one temporary tunnel speed for the at least one tunnel path based, at least in part, on the timestamp for the at least one probe point and the current time associated with the at least one temporary probe point.

Abstract: An approach is provided for creating an origin-destination matrix from probe trajectory data. The approach includes determining, via an outdoor positioning system, that at least one probe device has entered a point-of-interest (POI). The approach also includes initiating an indoor positioning system to determine indoor location data associated for the at least one probe device while the at least one device is within the POI. The approach further includes processing the indoor location data to generate an origin-destination (OD) matrix. The OD matrix represents an indoor movement of the at least one probe device among a plurality of sub-POIs located within the POI indicated by the indoor location data. The approach further includes providing the OD matrix as an output.

Abstract: An approach is provided for an unknown moving object detection system. The approach, for instance, involves capturing a plurality of unknown object events indicating an unknown object detected by one or more computer vision systems. The approach also involves clustering the plurality of unknown object events into a plurality of clusters based on one or more clustering parameters. The approach further involves selecting at least one cluster of the plurality of clusters based on a selection criterion. The approach further involves determining at least one operating scenario for the one or more computer vision systems based on a combination of the one or more clustering parameters associated with the selected at least one cluster.

Abstract: One or more potential drone and/or flying car (DFC) corridors are identified based on the topology of a road network. Trajectories traveled by vehicles are determined from a plurality of instances of probe data received from a plurality of vehicle apparatuses onboard the vehicles. A volume of traffic for a path through the road network and corresponding to a potential DFC corridor is determined based on the trajectories. A delay metric for the path through the road network and corresponding to the potential DFC corridor is determined based on the trajectories. A traffic metric is then determined for the path based on a combination of the volume of traffic, the delay metric and a measure of the topology of the road network. The one or more potential DFC corridors are ranked by their corresponding traffic metrics.

Abstract: A plurality of instances of probe data are received. Each instance of probe data corresponds to travel of a vehicle apparatus along a first segment, comprises an indication of at least one parameter characterizing the travel of the vehicle apparatus along the first segment. The at least one parameter is extracted from the instances of probe data to generate a distribution of parameters. One or more clusters of instances of probe data are identified based on the distribution of parameters. Responsive to identifying two or more clusters, a representative at least one parameter is determined for each cluster, and an element of a data structure is modified based thereon for each cluster. Responsive to identifying only one cluster of instances of probe data, the data structure is not modified based on the cluster. A navigation application is configured to use the data structure to perform a navigation function.

Abstract: A system, a method, and a computer program product for generating maneuver data for a vehicle are disclosed herein. The system comprises at least one non-transitory memory configured to store computer program code instructions and at least one processor configured to execute the computer program code instructions to obtain direction share data from at least one mobile device, wherein the direction share data comprises immediate route data and immediate direction data associated with the corresponding at least one mobile device, determine localized direction share data for the at least one mobile device from the direction share data, wherein the localized direction share data indicates location, exact lane and direction of the corresponding at least one mobile device, and generate the maneuver data for the vehicle, based on the localized direction share data and map data, using at least one machine learning model.

Abstract: A method, apparatus and computer program product are provided to identify a lane level traffic surprise. In the context of a method, historical lane level traffic information is received including a representation of a speed of travel along a respective lane of a link. The method also receives recent lane level traffic information including a representation of a speed of travel along the respective lane of the link. The recent lane level traffic information is indicative of more recent traffic conditions, than the traffic conditions represented by at least some of the historical lane level traffic information. The method further includes determining a representation of a difference between representations of the speed of travel provided by the historical lane level traffic information and the recent lane level traffic information, and identifying the lane level traffic surprise based upon representation of the difference.

Abstract: A method is provided, performed by at least one apparatus, the method including: obtaining probe data including a plurality of probe samples of a multi-dimensional probe sample space, the probe data being representative of a potentially multi-modal traffic scenario; performing a cluster analysis for at least a part of the probe samples of the probe data, the cluster analysis including: associating at least a part of the probe samples with respective clusters, each cluster being representative of a mode of the potentially multi-modal traffic scenario.

Abstract: A method, apparatus and computer program product are provided to define a strand upstream of a direction based traffic (DBT) link. In a method, a strand is defined upstream of a DBT link. The method includes extending the strand so as to include one or more links upstream of the DBT link. The strand is extended by determining whether a link is to be added to the strand based upon evaluation of a termination criteria. The termination criteria is at least partially based upon a relationship of a function class of the link to the function class of one or more other links. In an instance in which the termination criteria is satisfied, the method ceases further extension of the strand.

Abstract: System and methods are provided for calculating a lane maneuver delay for different lane maneuvers and different road segments at different times of the day to generate a predicted lane maneuver delay for use in routing and navigation services. A lane-level map-matcher identifies the lane a vehicle is driving on using positional sensors. Sensor data is obtained from vehicle sensors using the left-turn and right-turn signal lights sensor. A lane maneuver delay value is calculated from the time period a left-turn or right-turn signaling light was kept on before a vehicle completed a lane maneuver. The lane maneuver delay values are aggregated to generate a predicted lane maneuver delay that may be used in lane level routing instructions.

Abstract: A method, apparatus and computer program product are provided to define a strand upstream of a direction based traffic (DBT) link. In a method, a strand is defined upstream of a DBT link. The method includes extending the strand so as to include one or more links upstream of the DBT link. The strand is extended by determining whether a link is to be added to the strand based upon evaluation of a termination criteria. The termination criteria is at least partially based upon a relationship of a function class of the link to the function class of one or more other links. In an instance in which the termination criteria is satisfied, the method ceases further extension of the strand.

Abstract: An apparatus for matching probe measurements to a path in a geographic location includes a receiver, a window manager, a location generator, a path calculator, and an output. The receiver is configured to receive a stream of probe measurements. The window manager is configured to fill a window with the measurements, to select an additional measurement from the stream, and to select an oldest measurement in the window. The location generator is configured to generate candidate locations for the measurements in the window and the additional measurement. The path calculator is configured to match the oldest measurement to a candidate location. The output is configured to output a path-matched probe measurement based on the oldest measurement and the candidate location matched to the oldest measurement.

Abstract: A method is provided to generate a route between an origin and a destination using historical travel times between segments of a road network map. Methods may include accessing a memory configured to store road network data segmented into tiles represented by quadkeys; determining a travel time between any two quadkeys of the stored road network data; receiving an origin and a destination within a road network corresponding to the road network data; calculating a route between the origin and the destination using the travel time between quadkeys that can be traversed from the origin to the destination; generating route guidance for the route between the origin and the destination; and providing the route guidance to a user indicating the route between the origin and the destination. The travel time between any two quadkeys may be determined based on historical travel times between the respective two quadkeys.

Abstract: A method, apparatus and computer program product are provided to determine a measure of probe quality, such as a level of accuracy with which the location of a probe point is defined. In the context of a method and for a plurality of probe points, a distance is determined between a respective probe point and a line representative of a link. For the plurality of probe points, the method also includes determining a difference between a bearing of the respective probe point and a bearing of the link. The method further includes determining the measure of probe quality based upon a product of a representation of the distance between the plurality of probe points and the line representative of the link and a representation of the difference between the bearing of the plurality of probe points and the bearing of the link.

Abstract: A method, apparatus and computer program product are provided for establishing direction based traffic events and lane-level traffic associated therewith. Methods may include receiving a plurality of probe data points, where each probe data point includes location information associated with the respective probe apparatus; determining a path through an intersection from among a plurality of paths through the intersection for each probe apparatus based, at least in part, on a sequence of probe data points from each respective probe apparatus; determining, for each path through the intersection, an average speed of probe apparatuses traveling along the respective path and an average travel time along a road link approaching the intersection of the probe apparatuses traveling along the respective path; and determining a direction based traffic event in response to the differential amount of time between the highest average travel time and the lowest average travel time.