Info
Artikel von Dr. Daniel Rolf
Aktivitäten
7812 Follower:innen
Berufserfahrung und Ausbildung
Patente
-
Apparatus And Methods For Generating Update Data For A Map Database
Ausgestellt am US 20210097092
An apparatus, a method, and a computer program product for obtaining map update data of a region are provided. The method comprises receiving a node identifier and a first node digest of an update candidate node; obtaining, based on the node identifier, a second node digest of the update candidate node; comparing the first node digest and the second node digest of the update candidate node; and generating, based on the comparison, the update data for the map database, the update data containing…
An apparatus, a method, and a computer program product for obtaining map update data of a region are provided. The method comprises receiving a node identifier and a first node digest of an update candidate node; obtaining, based on the node identifier, a second node digest of the update candidate node; comparing the first node digest and the second node digest of the update candidate node; and generating, based on the comparison, the update data for the map database, the update data containing one of an indication of unchanged content; node digests of the child nodes of the update candidate node; or updated content corresponding to the update candidate node.
Andere Erfinder:innenPatent anzeigen -
Methods, Apparatus, and Computer Program Products for Fuzzy Term Searching
Ausgestellt am US 20210097073
Methods described herein relate to making fuzzy search queries. The method includes receiving one or more characters of a search query. The method also includes generating one or more search indicator values. Each search indicator value of the one or more search indicator values includes a digest of the one or more characters of a search query inputted into a minhash function with a distinct salt value input. The method further includes causing the transmission of at least one of the one or…
Methods described herein relate to making fuzzy search queries. The method includes receiving one or more characters of a search query. The method also includes generating one or more search indicator values. Each search indicator value of the one or more search indicator values includes a digest of the one or more characters of a search query inputted into a minhash function with a distinct salt value input. The method further includes causing the transmission of at least one of the one or more search indicator values to one or more index servers corresponding to the salt value input used to generate the at least one of the one or more search indicator values. The method also includes receiving one or more database values from the one or more index servers. Corresponding apparatuses and computer program products are also provided.
Andere Erfinder:innenPatent anzeigen -
Methods, Apparatus, and Computer Program Products for Fuzzy Term Searching
Ausgestellt am US 20210097074
Methods described herein relate to offline term searching. The method includes receiving one or more characters of a search query. The method also includes generating one or more search indicator values based on the one or more characters of a search query. Each search indicator value of the one or more search indicator values includes a digest of the one or more characters of a search query inputted into a minhash function with a distinct salt value input. The method further includes comparing…
Methods described herein relate to offline term searching. The method includes receiving one or more characters of a search query. The method also includes generating one or more search indicator values based on the one or more characters of a search query. Each search indicator value of the one or more search indicator values includes a digest of the one or more characters of a search query inputted into a minhash function with a distinct salt value input. The method further includes comparing the one or more search indicator values with one or more sets of database indicator values. Each database indicator value in the one or more sets of database indicator values corresponds to a database value. Corresponding apparatuses and computer program products are also provided.
Andere Erfinder:innenPatent anzeigen -
Method, Apparatus, and Computer Program Product for Map Data Agnostic Route Fingerprints
Ausgestellt am US 10861333
Provided herein is a method of generating and communicating map data agnostic routes between systems. Methods may include: providing an indication of a route request between an origin and a destination; identifying a starting road segment of the origin; identifying a target road segment of the destination; receiving one or more intermediate points for a route between the starting road segment and the target road segment; identifying one or more intermediate segments corresponding to the one or…
Provided herein is a method of generating and communicating map data agnostic routes between systems. Methods may include: providing an indication of a route request between an origin and a destination; identifying a starting road segment of the origin; identifying a target road segment of the destination; receiving one or more intermediate points for a route between the starting road segment and the target road segment; identifying one or more intermediate segments corresponding to the one or more intermediate points; establishing a route between the starting road segment and the target road segment, the route including a plurality of road segments and including the one or more intermediate segments, where the route includes a plurality of route fragments; generating a fingerprint for each route fragment; receiving a server-provided fingerprint for each route fragment; and comparing the generated fingerprints for each route fragment with the server-provided fingerprints for each route fragment.
Andere Erfinder:innenPatent anzeigen -
Method, Apparatus, and Computer Program Product for Map Data Agnostic Route Fingerprints
Ausgestellt am US 10809074
Patent anzeigenProvided herein is a method of generating and communicating map data agnostic routes between systems. Methods may include: receiving an indication of a route request between an origin and a destination; identifying a starting road segment corresponding to the origin; identifying a target road segment corresponding to the destination; establishing a route between the starting road segment and the target road segment, the route including a plurality of road segments; dividing the route up between…
Provided herein is a method of generating and communicating map data agnostic routes between systems. Methods may include: receiving an indication of a route request between an origin and a destination; identifying a starting road segment corresponding to the origin; identifying a target road segment corresponding to the destination; establishing a route between the starting road segment and the target road segment, the route including a plurality of road segments; dividing the route up between the starting road segment and the target road segment into a plurality of route fragments, each route fragment including one or more road segments; generating a fingerprint for each route fragment; and providing the fingerprints in response to the route request.
-
Route Determination and Navigation Based on Multi-version Map Regions
Angemeldet am US 20200318979
A method is disclosed comprising: obtaining route request information characterizing a route to be provided to a terminal; determining, at least partially based on the route request information, an intermediate route comprising a plurality of link identifiers respectively identifying links in respective current versions of one or more map regions; determining a final route by replacing, in the intermediate route, one or more link identifiers by respective indications, wherein each indication of…
A method is disclosed comprising: obtaining route request information characterizing a route to be provided to a terminal; determining, at least partially based on the route request information, an intermediate route comprising a plurality of link identifiers respectively identifying links in respective current versions of one or more map regions; determining a final route by replacing, in the intermediate route, one or more link identifiers by respective indications, wherein each indication of the indications respectively indicates whether or not a link or considered-to-be-suited link corresponding to a link, which is identified by the link identifier replaced by the indication and which is contained in a current version of a map region, is considered to be contained in a non-current-version of the map region available to the terminal, wherein the considered-to-be-suited-link is a link that is considered to be suited to be used for a route guiding process at the terminal; and outputting the final route.
Andere Erfinder:innenPatent anzeigen -
Route Determination and Navigation Based on Multi-version Map Regions
Ausgestellt am US 20200318978
A method is disclosed comprising: obtaining, at a terminal, a final route that comprises one or more indications, wherein each indication of the indications respectively indicates, whether or not a link or considered-to-be-suited link corresponding to a link that is contained in a current version of a map region and is identified by a respective link identifier comprised in an intermediate route determined at least based on respective current versions of one or more map regions and used as a…
A method is disclosed comprising: obtaining, at a terminal, a final route that comprises one or more indications, wherein each indication of the indications respectively indicates, whether or not a link or considered-to-be-suited link corresponding to a link that is contained in a current version of a map region and is identified by a respective link identifier comprised in an intermediate route determined at least based on respective current versions of one or more map regions and used as a basis for determining the final route, is considered to be contained in a non-current version of the map region available to the terminal; and conducting a route guiding process at the terminal at least based on the final route and at least respective non-current versions of one or more map regions available to the terminal that respectively contain, according to the one or more indications, a link or considered-to-be-suited link corresponding to a link that is contained in a respective current version of the respective m
Andere Erfinder:innenPatent anzeigen -
Method, Apparatus, and Computer Program Product for Map Data Agnostic Route Fingerprints
Ausgestellt am US 10794717
Provided herein is a method of generating and communicating map data agnostic routes between systems, and particularly, to identifying routes between an origin and one or more points-of-interest. Methods may include: receiving an indication of a route request between an origin and one or more points-of-interest; identifying a starting road segment corresponding to the origin; identifying a point-of-interest road segment corresponding to each of the one or more points-of-interest; generating at…
Provided herein is a method of generating and communicating map data agnostic routes between systems, and particularly, to identifying routes between an origin and one or more points-of-interest. Methods may include: receiving an indication of a route request between an origin and one or more points-of-interest; identifying a starting road segment corresponding to the origin; identifying a point-of-interest road segment corresponding to each of the one or more points-of-interest; generating at least one route between the starting road segment and a corresponding one of the one or more point-of-interest road segments; generating a fingerprint for the at least one route; and providing the fingerprints in response to the route request.
Andere Erfinder:innenPatent anzeigen -
Method, Apparatus, and Computer Program Product for Parking Availability Estimation Based on Probe Data Collection
Ausgestellt am US 10553114
A method, apparatus, and computer program product are provided for predicting parking availability for one or more road segments based on the map-matched probe data points. A method may include: receiving probe data points from a vehicle, where each probe data point includes a location; determining, from the probe data points, a parking location of the vehicle on a road segment, where the relative location along the road segment on which the vehicle parked can be determined; and estimating…
A method, apparatus, and computer program product are provided for predicting parking availability for one or more road segments based on the map-matched probe data points. A method may include: receiving probe data points from a vehicle, where each probe data point includes a location; determining, from the probe data points, a parking location of the vehicle on a road segment, where the relative location along the road segment on which the vehicle parked can be determined; and estimating availability of other parking spaces along the road segment based on the relative location.
Andere Erfinder:innenPatent anzeigen -
Method and Apparatus for Constructing a Traffic Model
Ausgestellt am US 10395520
Patent anzeigenA method, apparatus and computer program product are provided to more accurately construct a traffic model. In regards to a method, links of a second traffic model are categorized as being either observed or unobserved. A link is observed if a most likely route through a first traffic model transits over the link and includes at least a predetermined number of probe data points. Separately for an unobserved graph comprised of unobserved links and an observed graph comprised of observed links…
A method, apparatus and computer program product are provided to more accurately construct a traffic model. In regards to a method, links of a second traffic model are categorized as being either observed or unobserved. A link is observed if a most likely route through a first traffic model transits over the link and includes at least a predetermined number of probe data points. Separately for an unobserved graph comprised of unobserved links and an observed graph comprised of observed links, the method determines a fastest path between common nodes that appear in each of the unobserved and observed graphs. In an instance in which the fastest path in the unobserved graph is at least as fast as the fastest path in the observed graph, a travel time penalty is added to a travel time of the unobserved link in a second traffic model, subsequent to the first traffic model.
-
Stitching Mixed-version Map Tiles in Hybrid Navigation for Partial Map Updates
Ausgestellt am US 10378909
Methods, apparatus, computer program products, and systems related to partial map updates are provided. An example embodiment provides a method comprising receiving a map update for at least a first tile comprising map update data. The map update comprises updated map data for the first tile and previous map data for the first tile corresponding to one or more changed or new links intersected by a tile boundary between the first tile and a second tile. A map region of interest is determined…
Methods, apparatus, computer program products, and systems related to partial map updates are provided. An example embodiment provides a method comprising receiving a map update for at least a first tile comprising map update data. The map update comprises updated map data for the first tile and previous map data for the first tile corresponding to one or more changed or new links intersected by a tile boundary between the first tile and a second tile. A map region of interest is determined, wherein the map region of interest comprises at least a portion of the first tile. The previous map data for the one or more changed or new links intersected by the tile boundary is used or displayed when a map update for the second tile has not been received and is not used or displayed when a map update for the second tile has been received.
Andere Erfinder:innenPatent anzeigen -
Method, Apparatus, and Computer Program Product for Map Data Agnostic Route Fingerprints
Angemeldet am US 20200386556
Provided herein is a method of generating and communicating map data agnostic routes between systems. Methods may include: providing an indication of a route request between an origin and one or more points-of-interest; identifying a starting road segment corresponding to the origin and a point-of-interest road segment corresponding to each of the points-of-interest; receiving intermediate points and corresponding intermediate segments for a route between the starting road segment and the…
Provided herein is a method of generating and communicating map data agnostic routes between systems. Methods may include: providing an indication of a route request between an origin and one or more points-of-interest; identifying a starting road segment corresponding to the origin and a point-of-interest road segment corresponding to each of the points-of-interest; receiving intermediate points and corresponding intermediate segments for a route between the starting road segment and the point-of-interest road segments; generating at least one route between the starting road segment and a corresponding one of the point-of-interest road segments and including the one or more intermediate segments, where the route includes a plurality of route fragments; generating a fingerprint for each route fragment; receiving, in response to the route request, a server-provided fingerprint for each route fragment; and comparing the generated fingerprints for each route fragment with the server-provided fingerprints for each route fragment.
Andere Erfinder:innenPatent anzeigen -
Method, Apparatus, and Computer Program Product for Map Data Agnostic Route Fingerprints
Angemeldet am US 20200388153
Provided herein is a method of generating and communicating map data agnostic routes between systems. Methods may include: providing an indication of a route request between an origin and a destination; identifying a starting road segment of the origin; identifying a target road segment of the destination; receiving one or more intermediate points for a route between the starting road segment and the target road segment; identifying one or more intermediate segments corresponding to the one or…
Provided herein is a method of generating and communicating map data agnostic routes between systems. Methods may include: providing an indication of a route request between an origin and a destination; identifying a starting road segment of the origin; identifying a target road segment of the destination; receiving one or more intermediate points for a route between the starting road segment and the target road segment; identifying one or more intermediate segments corresponding to the one or more intermediate points; establishing a route between the starting road segment and the target road segment, the route including a plurality of road segments and including the one or more intermediate segments, where the route includes a plurality of route fragments; generating a fingerprint for each route fragment; receiving a server-provided fingerprint for each route fragment; and comparing the generated fingerprints for each route fragment with the server-provided fingerprints for each route fragment.
Andere Erfinder:innenPatent anzeigen -
Bloom Filter Route Decoding
Angemeldet am US 20200370902
A route response is received by a mobile apparatus storing a mobile version of a digital map. The route response includes information identifying starting and target locations of a route and a bloom filter encoding a route segment set defined by the route. Decoded starting and target segments for the route are identified from the mobile version of the digital map based on the information identifying the starting and target locations. Map information is accessed for determining a cost value for…
A route response is received by a mobile apparatus storing a mobile version of a digital map. The route response includes information identifying starting and target locations of a route and a bloom filter encoding a route segment set defined by the route. Decoded starting and target segments for the route are identified from the mobile version of the digital map based on the information identifying the starting and target locations. Map information is accessed for determining a cost value for segments of the digital map. A segment that satisfies the bloom filter is assigned a minimal cost value. A decoded route from the decoded starting segment to the decoded target segment is determined using a cost minimization route determination algorithm based on the cost value assigned to the segments. The decoded route is provided via a user interface and/or a vehicle is controlled to traverse the decoded route.
Andere Erfinder:innenPatent anzeigen -
Decoding Routes to Pois in Proximity Searches Using Bloom Filters
Ausgestellt am US 20200370908
Patent anzeigenA POI route response is received that comprises information identifying a starting location and a particular number of POIs, and a bloom filter encoding a route segment set defined by routes from the starting location to each of the particular number of POIs. The information identifying the starting location is used to identify a decoded starting segment of the mobile version of the digital map. Map information is accessed for assigning a cost value to segments of the digital map. A segment…
A POI route response is received that comprises information identifying a starting location and a particular number of POIs, and a bloom filter encoding a route segment set defined by routes from the starting location to each of the particular number of POIs. The information identifying the starting location is used to identify a decoded starting segment of the mobile version of the digital map. Map information is accessed for assigning a cost value to segments of the digital map. A segment that satisfies the bloom filter is assigned a minimal cost value. A first decoded route is determined based on the cost value assigned to the segments. The first decoded route is a route from the decoded starting segment to a first POI. The first decoded route is provided via a user interface of the mobile apparatus and/or a vehicle is controlled to traverse the first decoded route.
-
Decoding Parking Search Cruise Routes Using Bloom Filters
Angemeldet am US 20200370917
A parking cruise route response is received comprising information identifying a starting location and a target location of a parking cruise route and a bloom filter encoding a route segment set defined by the parking cruise route. Map information of the mobile version of the digital map is accessed for assigning a cost value to segments of the digital map. A segment that satisfies the bloom filter is assigned a minimal cost value and a segment that does not satisfy the bloom filter is assigned…
A parking cruise route response is received comprising information identifying a starting location and a target location of a parking cruise route and a bloom filter encoding a route segment set defined by the parking cruise route. Map information of the mobile version of the digital map is accessed for assigning a cost value to segments of the digital map. A segment that satisfies the bloom filter is assigned a minimal cost value and a segment that does not satisfy the bloom filter is assigned a positive cost value. A decoded route is determined from the decoded starting segment to the decoded target segment based on the cost value assigned to the segments. The decoded route is provided via a user interface and/or a vehicle associated with the mobile apparatus is controlled to traverse the decoded route and search for an available parking spot along the decoded route.
Andere Erfinder:innenPatent anzeigen -
Bloom Filter Multiple Traffic-aware Route Decoding
Angemeldet am US 20200370911
A route response provided by a network apparatus is received. The route response comprises route information and one or more delay bloom filters. The route response is received by a mobile apparatus comprising a processor, memory storing a mobile version of a digital map, and a communication interface. A decoded route is determined based on the route information and the mobile version of the digital map. Based on the one or more delay bloom filters, an expected traffic delay for at least one…
A route response provided by a network apparatus is received. The route response comprises route information and one or more delay bloom filters. The route response is received by a mobile apparatus comprising a processor, memory storing a mobile version of a digital map, and a communication interface. A decoded route is determined based on the route information and the mobile version of the digital map. Based on the one or more delay bloom filters, an expected traffic delay for at least one adjacent segment of the decoded route is determined. An adjacent segment is a segment of the digital map that intersects the decoded route and is not a segment of the decoded route. The decoded route and the expected traffic delay for the at least one adjacent segment of the decoded route is provided via a user interface.
Andere Erfinder:innenPatent anzeigen -
Bloom Filter Route Encoding
Angemeldet am US 20200370903
A route is determined comprising a list of route segments to be traveled from the network version starting segment to the network version target segment. Map version agnostic information identifying each segment of the list of route segments is accessed from the network version of the digital map. A map version agnostic identifier is generated for each route segment of the list of route segments based on the accessed map version agnostic information. The map version agnostic identifier for each…
A route is determined comprising a list of route segments to be traveled from the network version starting segment to the network version target segment. Map version agnostic information identifying each segment of the list of route segments is accessed from the network version of the digital map. A map version agnostic identifier is generated for each route segment of the list of route segments based on the accessed map version agnostic information. The map version agnostic identifier for each route segment is coded using at least one coding function to generate at least one coded map version agnostic identifier for each route segment. A bloom filter is generated based on the coded map version agnostic identifiers for each route segment. The bloom filter is provided such that a mobile apparatus receives the bloom filter.
Andere Erfinder:innenPatent anzeigen -
Encoding Parking Search Cruise Routes Using Bloom Filters
Angemeldet am US 20200370916
A parking cruise request is received. A network version starting segment is identified and a route determination algorithm is expended starting at the network version starting segment. When the route determination algorithm is expanded to a new segment, a cost value is determined for the new segment based at least on the likelihood of finding parking on the new segment. Responsive to determining that the likelihood of finding parking along the cruise route does satisfy the threshold probability…
A parking cruise request is received. A network version starting segment is identified and a route determination algorithm is expended starting at the network version starting segment. When the route determination algorithm is expanded to a new segment, a cost value is determined for the new segment based at least on the likelihood of finding parking on the new segment. Responsive to determining that the likelihood of finding parking along the cruise route does satisfy the threshold probability requirement, map version agnostic identifiers for each segment of the cruise route are generated. Each of the map version agnostic identifiers are coded using at least one coding function to generate coded map version agnostic identifiers. A bloom filter having the coded map version agnostic identifiers as members is generated. A parking cruise route response comprising the bloom filter is provided such that a mobile apparatus receives the parking cruise route response.
Andere Erfinder:innenPatent anzeigen -
Encoding Routes to POIs in Proximity Searches Using Bloom Filters
Angemeldet am US 20200370907
A POI request comprising query criteria and information identifying a starting location is received. A network version starting segment is identified based on the information identifying the starting location. A route determination algorithm is expanded, starting at the starting segment. When the route determination algorithm is expanded to a new segment, it is determined whether any POIs associated with the new segment match the query criteria. Responsive to determining that a POI associated…
A POI request comprising query criteria and information identifying a starting location is received. A network version starting segment is identified based on the information identifying the starting location. A route determination algorithm is expanded, starting at the starting segment. When the route determination algorithm is expanded to a new segment, it is determined whether any POIs associated with the new segment match the query criteria. Responsive to determining that a POI associated with the new segment satisfies the query criteria, a POI route from the starting segment to the POI is extracted. Map version agnostic identifiers are generated for each segment of the POI routes. Each of the map version agnostic identifiers are coded using at least one coding function. A bloom filter having the coded map version agnostic identifiers as members is generated. The bloom filter is provided such that a mobile apparatus receives the bloom filter.
Andere Erfinder:innenPatent anzeigen -
Method, Apparatus and Computer Program Product for Providing Route Guidance to Multiple Points of Interest
Ausgestellt am US 20180259356
A method, apparatus, and computer program product are therefore provided for providing a navigation user interface to a plurality of points of interest. Methods may include receiving an indication of a location; receiving an indication of a category of points of interest; identifying a plurality of points of interest associated with the category; generating point of interest specific routes from the location to each of the plurality of points of interest; identifying portions of the point of…
A method, apparatus, and computer program product are therefore provided for providing a navigation user interface to a plurality of points of interest. Methods may include receiving an indication of a location; receiving an indication of a category of points of interest; identifying a plurality of points of interest associated with the category; generating point of interest specific routes from the location to each of the plurality of points of interest; identifying portions of the point of interest specific routes that are common to more than one point of interest; generating a plurality of consolidated routes, where multiple points of interest are located along at least one of the plurality of consolidated routes; and providing for presentation of the plurality of consolidated routes, where each of the plurality of consolidated routes is distinguished, based at least in part, on the number of points of interest that are located along the respective consolidated route.
Andere Erfinder:innenPatent anzeigen -
Method, Apparatus, and System for Real-time Detection of Road Closures
Angemeldet am US 20200090503
An approach is provided for detecting traffic anomalies in real-time using sparse probe-data. The approach involves processing probe data collected from a partition of a digital map to determine a probe origin point, a probe destination point, or a combination thereof. The approach also involves generating an origin/destination matrix for the partition based on the origin point, destination point, or combination thereof. The approach further involves calculating an estimated traffic flow for…
An approach is provided for detecting traffic anomalies in real-time using sparse probe-data. The approach involves processing probe data collected from a partition of a digital map to determine a probe origin point, a probe destination point, or a combination thereof. The approach also involves generating an origin/destination matrix for the partition based on the origin point, destination point, or combination thereof. The approach further involves calculating an estimated traffic flow for road segments of the partition based on the matrix. The approach also involves determining a road segment from among the plurality for which the estimated traffic flow differs by more than a threshold value from an observed traffic flow indicated by the probe data for the least one road segment. The approach further involves providing data to indicate a detection of the traffic anomaly on the at least one road segment based on the difference.
Andere Erfinder:innenPatent anzeigen -
Method, Apparatus, and Computer Program Product for Parking Availability Estimation Based on Probe Data Collection
Ausgestellt am US US 20180053417
A method, apparatus, and computer program product are provided for predicting parking availability for one or more road segments based on the map-matched probe data points. A method may include: receiving probe data points from a vehicle, where each probe data point includes a location; determining, from the probe data points, a parking location of the vehicle on a road segment, where the relative location along the road segment on which the vehicle parked can be determined; and estimating…
A method, apparatus, and computer program product are provided for predicting parking availability for one or more road segments based on the map-matched probe data points. A method may include: receiving probe data points from a vehicle, where each probe data point includes a location; determining, from the probe data points, a parking location of the vehicle on a road segment, where the relative location along the road segment on which the vehicle parked can be determined; and estimating availability of other parking spaces along the road segment based on the relative location.
Andere Erfinder:innenPatent anzeigen -
Stitching mixed-version map tiles in hybrid navigation for partial map updates
Ausgestellt am US US20170322036
Methods, apparatus, computer program products, and systems related to partial map updates are provided. An example embodiment provides a method comprising receiving updated map data comprises a plurality of links. One or more changed or new are identified links. The method further comprises determining a tiling of the updated map data and determining, based on the tiling of the updated map data, that a tile boundary between a first tile and a second tile intersects at least one of the one or…
Methods, apparatus, computer program products, and systems related to partial map updates are provided. An example embodiment provides a method comprising receiving updated map data comprises a plurality of links. One or more changed or new are identified links. The method further comprises determining a tiling of the updated map data and determining, based on the tiling of the updated map data, that a tile boundary between a first tile and a second tile intersects at least one of the one or more changed or new links. The method further comprises compiling a map update based on the updated map data, previous map data comprising at least one of the changed or new links intersected by the tile boundary, and the tiling, and providing the map update for at least the first tile.
Andere Erfinder:innenPatent anzeigen -
Predicting short term travel behavior with unknown destination
Ausgestellt am US US20170268894
Methods, apparatus, systems, and computer program products for predicting short term travel behavior of a user without knowing the user's destination. In one embodiment, a method is provided. The method comprises receiving historical location information for a vehicle and querying a set of indexed partial routes. A partial route of the set of indexed partial routes has a compiled quantity assigned thereto. The method further comprises reducing the set of indexed partial routes to a set of…
Methods, apparatus, systems, and computer program products for predicting short term travel behavior of a user without knowing the user's destination. In one embodiment, a method is provided. The method comprises receiving historical location information for a vehicle and querying a set of indexed partial routes. A partial route of the set of indexed partial routes has a compiled quantity assigned thereto. The method further comprises reducing the set of indexed partial routes to a set of candidate partial routes based at least in part on the historical location information and identifying a most likely partial route from the set of candidate partial routes based at least in part on the compiled quantity associated with each of the candidate partial routes.
Andere Erfinder:innenPatent anzeigen -
Efficient and error tolerant mapping from a source graph to a target graph
Ausgestellt am US 20170219358
Patent anzeigenMethods, apparatus, and computer program products are provided. An example method comprises identifying an object in a source graph; defining a closure graph around the object in the source graph; building a closure set around the object based on the closure graph; identifying the anchor nodes of the closure set on the target graph; and deflating the closure set on the target graph to identify a target object in the target graph that corresponds to the object in the source graph. The object is…
Methods, apparatus, and computer program products are provided. An example method comprises identifying an object in a source graph; defining a closure graph around the object in the source graph; building a closure set around the object based on the closure graph; identifying the anchor nodes of the closure set on the target graph; and deflating the closure set on the target graph to identify a target object in the target graph that corresponds to the object in the source graph. The object is identified by a directed way and an offset there along. An anchor node is a junction that is tagged with a junction identifier configured to uniquely identify the junction in both the source graph and a target graph.
-
Indexing Routes Using Similarity Hashing
Ausgestellt am US US20170016733
Patent anzeigenA method and apparatus for indexing routes using similarity hashing. In an embodiment, a processor identifies a route wherein the route includes one or more links. The processor identifies a route attribute wherein the route attribute describes the route. The processor hashes the one or more links to determine a minimum link with a minimum hash value. The processor assigns the route attribute to the minimum link.
-
Midpoint-based map-agnostic navigation routing
Ausgestellt am US US20160370193
Systems, apparatuses, and methods are provided for determining a navigation route. A route is requested by a navigation device between a starting location and a destination location. The route request is received by an external processor for analysis. A navigation route is determined by the external processor and its associated map version. The determined navigation route is then encoded with geographic data for each path segment along the route. The encoded navigation route is transmitted to…
Systems, apparatuses, and methods are provided for determining a navigation route. A route is requested by a navigation device between a starting location and a destination location. The route request is received by an external processor for analysis. A navigation route is determined by the external processor and its associated map version. The determined navigation route is then encoded with geographic data for each path segment along the route. The encoded navigation route is transmitted to the navigation devic
Andere Erfinder:innen -
Decision-based map-agnostic navigation routing
Ausgestellt am US US20160370192
Systems, apparatuses, and methods are provided for determining a navigation route. A route is requested by a navigation device between a starting location and a destination location. The route request is received by an external processor for analysis. A navigation route is determined by the external processor and its associated map version. The determined navigation route is then encoded with a sequence of path decisions along the route. The encoded navigation route is transmitted to the…
Systems, apparatuses, and methods are provided for determining a navigation route. A route is requested by a navigation device between a starting location and a destination location. The route request is received by an external processor for analysis. A navigation route is determined by the external processor and its associated map version. The determined navigation route is then encoded with a sequence of path decisions along the route. The encoded navigation route is transmitted to the navigation device.
Andere Erfinder:innen -
Trail interpolation
Ausgestellt am EU WO2015186020
A method comprising: collecting a plurality of probe data from a plurality of probe points by a probing device, said probe data comprising at least positional information, a speed vector and a direction of travel of the probing device and a timestamp of recording the probe data at a probe point; and estimating a trajectory of the probing device between two consecutive probe points as a cubic Hermite spline having the positions of said two consecutive probe points as control points and the speed…
A method comprising: collecting a plurality of probe data from a plurality of probe points by a probing device, said probe data comprising at least positional information, a speed vector and a direction of travel of the probing device and a timestamp of recording the probe data at a probe point; and estimating a trajectory of the probing device between two consecutive probe points as a cubic Hermite spline having the positions of said two consecutive probe points as control points and the speed vectors of said two consecutive probe points as control vectors.
Andere Erfinder:innenPatent anzeigen -
Method and apparatus for probe-based routing
Ausgestellt am US US20150134850
An approach is provided for providing routing calculations and route guidance based on geographic positioning and/or other sensor data from one or more mobile devices independent of map data. A routing platform processes and/or facilitates a processing of one or more probe data samples associated with at least one mobile device to determine one or more device tracks. The routing platform processes and/or facilitates a processing of the one or more device tracks to determine at least one…
An approach is provided for providing routing calculations and route guidance based on geographic positioning and/or other sensor data from one or more mobile devices independent of map data. A routing platform processes and/or facilitates a processing of one or more probe data samples associated with at least one mobile device to determine one or more device tracks. The routing platform processes and/or facilitates a processing of the one or more device tracks to determine at least one tessellation, wherein the at least one tessellation is a subdivision of a plane or sphere into one or more tiles and a plurality of segments. The routing platform further determines one or more relationships between one or more of the plurality of segments based, at least in part, on a mapping of the one or more device tracks against the at least one tessellation...
Andere Erfinder:innenPatent anzeigen -
Method of operating a navigation system to provide geographic location information
Ausgestellt am US US20110184636
A computer implemented method of operating a navigation system to provide geographic location information is provided. The method comprises receiving a query text string representing a query for a geographic location from a user and obtaining data records that represent a plurality of candidate geographic locations. The method computes a text matching score that indicates how much of the query text string matches a record text string of the candidate geographic location and applies a usage…
A computer implemented method of operating a navigation system to provide geographic location information is provided. The method comprises receiving a query text string representing a query for a geographic location from a user and obtaining data records that represent a plurality of candidate geographic locations. The method computes a text matching score that indicates how much of the query text string matches a record text string of the candidate geographic location and applies a usage pattern weight to the text matching score to obtain an overall score value for the candidate geographic location. The candidate geographic locations are ranked based on the overall score valu
Andere Erfinder:innen -
Auszeichnungen/Preise
-
Diploma Thesis of the Year
Institute of Computer Science
Sprachen
-
German
-
-
English
-
Erhaltene Empfehlungen
3 Personen haben Dr. Daniel Rolf empfohlen
Jetzt anmelden und ansehen