Patents by Inventor Richard F. Poppen
Richard F. Poppen has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 10839034Abstract: High-precision local search is performed on the Internet. A map image-rendering software provider embeds spatial keys into maps, which are then provided to producers of Internet content such as map providers. For example, a homeowner may post a message on a web bulletin board advertising his house for sale, and including a map showing the location of the house. When a search engine's web crawler encounters a page having a spatial key embedded in an image, the spatial key is indexed with the other content on the page. Because the spatial key identifies a small geographic area, indexing the content with the spatial key allows search queries to be limited by area and still provide useful results. Thus, a user of a search engine searching for “house for sale” in a specific area will be directed to web pages that meet the geographic and content search terms.Type: GrantFiled: August 21, 2018Date of Patent: November 17, 2020Assignee: Uber Technologies, Inc.Inventors: Richard F. Poppen, Geoffrey Rummens Hendrey
-
Patent number: 10713285Abstract: Specified streets or intersections that are within a specified distance of a specified city can be found by a search, even when they are not actually in that city. For computational efficiency, some addresses are included in search results even when they exceed the specified distance from the specified city by a small amount (“false positives”). The search method guarantees that no instance of the street name within the specified distance of the specified city is erroneously missed (“false negatives”).Type: GrantFiled: August 29, 2016Date of Patent: July 14, 2020Assignee: Uber Technologies, Inc.Inventors: Brian E. Smartt, Richard F. Poppen, Linnea A. Dunn
-
Publication number: 20200103246Abstract: A system includes a GPS module, user interface module, database and routing engine. To find nearby POIs in one embodiment the routing engine identifies POIs in the database located within a threshold distance from the planned route in Euclidean distance. The routing engine filters the results by exploring the road network to determine whether each of the POIs is within the threshold distance of the route in driving distance. The filtering may include exploring outward from the POI, until all roads within the threshold distance are explored or the route is reached; alternatively, distance to the POIs is checked by exploring outward from the route until all roads within the threshold distance of the route have been exposed. For those POIs reached in the exploration, the nearest point on the route and the distance to that point are known. Similar searches are performed based on driving time rather than distance.Type: ApplicationFiled: December 4, 2019Publication date: April 2, 2020Inventors: Richard F. Poppen, Weidong Tang, Daniel R. Brownstone
-
Patent number: 10527444Abstract: A system includes a GPS module, user interface module, database and routing engine. To find nearby POIs in one embodiment the routing engine identifies POIs in the database located within a threshold distance from the planned route in Euclidean distance. The routing engine filters the results by exploring the road network to determine whether each of the POIs is within the threshold distance of the route in driving distance. The filtering may include exploring outward from the POI, until all roads within the threshold distance are explored or the route is reached; alternatively, distance to the POIs is checked by exploring outward from the route until all roads within the threshold distance of the route have been exposed. For those POIs reached in the exploration, the nearest point on the route and the distance to that point are known. Similar searches are performed based on driving time rather than distance.Type: GrantFiled: August 29, 2017Date of Patent: January 7, 2020Assignee: Uber Technologies, Inc.Inventors: Richard F. Poppen, Weidong Tang, Daniel R. Brownstone
-
Patent number: 10444026Abstract: A routing module identifies POIs that can be reached from a route with a cost less than distance m. A routing engine performs a reverse exploration on nodes in the planned route to locate POIs from which the route can be reached with a cost of less than a second cost n. POIs identified as being reachable from the route with a cost of less than m, and from which the route is reachable with a cost less than n are then further filtered to identify a subset of the POIs for which the sum of the time or distance from the route to the POI and the time or distance from the POI back to the route is less than a threshold time or distance, t.Type: GrantFiled: September 14, 2017Date of Patent: October 15, 2019Assignee: Uber Technologies, Inc.Inventors: Richard F. Poppen, Weidong Tang
-
Publication number: 20180357250Abstract: High-precision local search is performed on the Internet. A map image-rendering software provider embeds spatial keys into maps, which are then provided to producers of Internet content such as map providers. For example, a homeowner may post a message on a web bulletin board advertising his house for sale, and including a map showing the location of the house. When a search engine's web crawler encounters a page having a spatial key embedded in an image, the spatial key is indexed with the other content on the page. Because the spatial key identifies a small geographic area, indexing the content with the spatial key allows search queries to be limited by area and still provide useful results. Thus, a user of a search engine searching for “house for sale” in a specific area will be directed to web pages that meet the geographic and content search terms.Type: ApplicationFiled: August 21, 2018Publication date: December 13, 2018Inventors: Richard F. Poppen, Geoffrey Rummens Hendrey
-
Patent number: 10068025Abstract: High-precision local search is performed on the Internet. A map image-rendering software provider embeds spatial keys into maps, which are then provided to producers of Internet content such as map providers. For example, a homeowner may post a message on a web bulletin board advertising his house for sale, and including a map showing the location of the house. When a search engine's web crawler encounters a page having a spatial key embedded in an image, the spatial key is indexed with the other content on the page. Because the spatial key identifies a small geographic area, indexing the content with the spatial key allows search queries to be limited by area and still provide useful results. Thus, a user of a search engine searching for “house for sale” in a specific area will be directed to web pages that meet the geographic and content search terms.Type: GrantFiled: August 11, 2015Date of Patent: September 4, 2018Assignee: UBER TECHNOLOGIES, INC.Inventors: Richard F. Poppen, Geoffrey R. Hendrey
-
Publication number: 20180023969Abstract: A routing module identifies POIs that can be reached from a route with a cost less than distance m. A routing engine performs a reverse exploration on nodes in the planned route to locate POIs from which the route can be reached with a cost of less than a second cost n. POIs identified as being reachable from the route with a cost of less than m, and from which the route is reachable with a cost less than n are then further filtered to identify a subset of the POIs for which the sum of the time or distance from the route to the POI and the time or distance from the POI back to the route is less than a threshold time or distance, t.Type: ApplicationFiled: September 14, 2017Publication date: January 25, 2018Inventors: Richard F. Poppen, Weidong Tang
-
Publication number: 20180010920Abstract: A system includes a GPS module, user interface module, database and routing engine. To find nearby POIs in one embodiment the routing engine identifies POIs in the database located within a threshold distance from the planned route in Euclidean distance. The routing engine filters the results by exploring the road network to determine whether each of the POIs is within the threshold distance of the route in driving distance. The filtering may include exploring outward from the POI, until all roads within the threshold distance are explored or the route is reached; alternatively, distance to the POIs is checked by exploring outward from the route until all roads within the threshold distance of the route have been exposed. For those POIs reached in the exploration, the nearest point on the route and the distance to that point are known. Similar searches are performed based on driving time rather than distance.Type: ApplicationFiled: August 29, 2017Publication date: January 11, 2018Inventors: Richard F. Poppen, Weidong Tang, Daniel R. Brownstone
-
Patent number: 9791284Abstract: A routing module identifies POIs that can be reached from a route with a cost less than distance m. A routing engine performs a reverse exploration on nodes in the planned route to locate POIs from which the route can be reached with a cost of less than a second cost n. POIs identified as being reachable from the route with a cost of less than m, and from which the route is reachable with a cost less than n are then further filtered to identify a subset of the POIs for which the sum of the time or distance from the route to the POI and the time or distance from the POI back to the route is less than a threshold time or distance, t.Type: GrantFiled: October 6, 2016Date of Patent: October 17, 2017Assignee: Uber Technologies, Inc.Inventors: Richard F. Poppen, Weidong Tang
-
Patent number: 9778059Abstract: A system includes a GPS module, user interface module, database and routing engine. To find nearby POIs in one embodiment the routing engine identifies POIs in the database located within a threshold distance from the planned route in Euclidean distance. The routing engine filters the results by exploring the road network to determine whether each of the POIs is within the threshold distance of the route in driving distance. The filtering may include exploring outward from the POI, until all roads within the threshold distance are explored or the route is reached; alternatively, distance to the POIs is checked by exploring outward from the route until all roads within the threshold distance of the route have been exposed. For those POIs reached in the exploration, the nearest point on the route and the distance to that point are known. Similar searches are performed based on driving time rather than distance.Type: GrantFiled: March 28, 2016Date of Patent: October 3, 2017Assignee: UBER TECHNOLOGIES, INC.Inventors: Richard F. Poppen, Weidong Tang, Daniel R. Brownstone
-
Publication number: 20170023374Abstract: A routing module identifies POIs that can be reached from a route with a cost less than distance m. A routing engine performs a reverse exploration on nodes in the planned route to locate POIs from which the route can be reached with a cost of less than a second cost n. POIs identified as being reachable from the route with a cost of less than m, and from which the route is reachable with a cost less than n are then further filtered to identify a subset of the POIs for which the sum of the time or distance from the route to the POI and the time or distance from the POI back to the route is less than a threshold time or distance, t.Type: ApplicationFiled: October 6, 2016Publication date: January 26, 2017Inventors: Richard F. Poppen, Weidong Tang
-
Publication number: 20160364411Abstract: Specified streets or intersections that are within a specified distance of a specified city can be found by a search, even when they are not actually in that city. For computational efficiency, some addresses are included in search results even when they exceed the specified distance from the specified city by a small amount (“false positives”). The search method guarantees that no instance of the street name within the specified distance of the specified city is erroneously missed (“false negatives”).Type: ApplicationFiled: August 29, 2016Publication date: December 15, 2016Inventors: Brian E. Smartt, Richard F. Poppen, Linnea A. Dunn
-
Patent number: 9488486Abstract: A routing module identifies POIs that can be reached from a route with a cost less than distance m. A routing engine performs a reverse exploration on nodes in the planned route to locate POIs from which the route can be reached with a cost of less than a second cost n. POIs identified as being reachable from the route with a cost of less than m, and from which the route is reachable with a cost less than n are then further filtered to identify a subset of the POIs for which the sum of the time or distance from the route to the POI and the time or distance from the POI back to the route is less than a threshold time or distance, t.Type: GrantFiled: September 4, 2015Date of Patent: November 8, 2016Assignee: UBER TECHNOLOGIES, INC.Inventors: Richard F. Poppen, Weidong Tang
-
Patent number: 9453739Abstract: Specified streets or intersections that are within a specified distance of a specified city can be found by a search, even when they are not actually in that city. For computational efficiency, some addresses are included in search results even when they exceed the specified distance from the specified city by a small amount (“false positives”). The search method guarantees that no instance of the street name within the specified distance of the specified city is erroneously missed (“false negatives”).Type: GrantFiled: September 14, 2010Date of Patent: September 27, 2016Assignee: Uber Technologies, Inc.Inventors: Brian E. Smartt, Richard F. Poppen, Linnea A. Dunn
-
Publication number: 20160209229Abstract: A system includes a GPS module, user interface module, database and routing engine. To find nearby POIs in one embodiment the routing engine identifies POIs in the database located within a threshold distance from the planned route in Euclidean distance. The routing engine filters the results by exploring the road network to determine whether each of the POIs is within the threshold distance of the route in driving distance. The filtering may include exploring outward from the POI, until all roads within the threshold distance are explored or the route is reached; alternatively, distance to the POIs is checked by exploring outward from the route until all roads within the threshold distance of the route have been exposed. For those POIs reached in the exploration, the nearest point on the route and the distance to that point are known. Similar searches are performed based on driving time rather than distance.Type: ApplicationFiled: March 28, 2016Publication date: July 21, 2016Inventors: Richard F. Poppen, Weidong Tang, Daniel R. Brownstone
-
Publication number: 20160154807Abstract: High-precision local search is performed on the Internet. A map image-rendering software provider embeds spatial keys into maps, which are then provided to producers of Internet content such as map providers. For example, a homeowner may post a message on a web bulletin board advertising his house for sale, and including a map showing the location of the house. When a search engine's web crawler encounters a page having a spatial key embedded in an image, the spatial key is indexed with the other content on the page. Because the spatial key identifies a small geographic area, indexing the content with the spatial key allows search queries to be limited by area and still provide useful results. Thus, a user of a search engine searching for “house for sale” in a specific area will be directed to web pages that meet the geographic and content search terms.Type: ApplicationFiled: August 11, 2015Publication date: June 2, 2016Inventors: Richard F. Poppen, Geoffrey R. Hendrey
-
Patent number: 9304008Abstract: A system includes a GPS module, user interface module, database and routing engine. To find nearby POIs in one embodiment the routing engine identifies POIs in the database located within a threshold distance from the planned route in Euclidean distance. The routing engine filters the results by exploring the road network to determine whether each of the POIs is within the threshold distance of the route in driving distance. The filtering may include exploring outward from the POI, until all roads within the threshold distance are explored or the route is reached; alternatively, distance to the POIs is checked by exploring outward from the route until all roads within the threshold distance of the route have been exposed. For those POIs reached in the exploration, the nearest point on the route and the distance to that point are known. Similar searches are performed based on driving time rather than distance.Type: GrantFiled: April 1, 2009Date of Patent: April 5, 2016Assignee: Uber Technologies, IncInventors: Richard F. Poppen, Weidong Tang, Daniel R. Brownstone
-
Publication number: 20150377642Abstract: A routing module identifies POIs that can be reached from a route with a cost less than distance m. A routing engine performs a reverse exploration on nodes in the planned route to locate POIs from which the route can be reached with a cost of less than a second cost n. POIs identified as being reachable from the route with a cost of less than m, and from which the route is reachable with a cost less than n are then further filtered to identify a subset of the POIs for which the sum of the time or distance from the route to the POI and the time or distance from the POI back to the route is less than a threshold time or distance, t.Type: ApplicationFiled: September 4, 2015Publication date: December 31, 2015Inventors: Richard F. Poppen, Weidong Tang
-
Patent number: 9151614Abstract: A routing module identifies POIs that can be reached from a route with a cost less than distance m. A routing engine performs a reverse exploration on nodes in the planned route to locate POIs from which the route can be reached with a cost of less than a second cost n. POIs identified as being reachable from the route with a cost of less than m, and from which the route is reachable with a cost less than n are then further filtered to identify a subset of the POIs for which the sum of the time or distance from the route to the POI and the time or distance from the POI back to the route is less than a threshold time or distance, t.Type: GrantFiled: January 23, 2013Date of Patent: October 6, 2015Assignee: Uber Technologies, Inc.Inventors: Richard F. Poppen, Weidong Tang