IP Library Granted Patent US 12,277,095
Granted Patent B2
US 12,277,095 · App. 17/902,490 · Granted Apr 15, 2025

Approaches for encoding environmental information

Inventors: Lina Dong (San Francisco, CA); Weiyi Hou (Mountain View, CA); Somesh Khandelwal (San Jose, CA); Ivan Kirigin (Redwood City, CA); Shaojing Li (Mountain View, CA); Ying Liu (Los Altos, CA); David Tse-Zhou Lu (Menlo Park, CA); Robert Charles Kyle Pinkerton (Redwood City, CA); Vinay Shet (Fremont, CA); Shaohui Sun (San Francisco, CA)
Assignee: Lyft, Inc.
G06F16/211G06F16/285G06N20/00G06V10/762G06V10/764G06V20/56G05D1/0088G05D1/0276
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,277,095
App. No.
17/902,490
Granted
Apr 15, 2025
Kind
B2
Abstract

Systems, methods, and non-transitory computer-readable media can access a plurality of schema-based encodings providing a structured representation of an environment captured by one or more sensors associated with a plurality of vehicles traveling through the environment. The plurality of schema-based encodings can be clustered into one or more clusters of schema-based encodings. At least one scenario associated with the environment can be determined based at least in part on the one or more clusters of schema-based encodings.

Claims (41)

1. A computer-implemented method comprising:

encoding, by a computing system, metadata for a map region based on map features that describe agents, actions performed by the agents at different times over a period of time, and environment associated with the map region;

determining, by the computing system, one or more scenarios for the map region based on the metadata;

determining, by the computing system, one or more first frequencies for the one or more scenarios in the map region;

identifying, by the computing system, a second map region associated with one or more second frequencies for the one or more scenarios, wherein the one or more second frequencies are within one or more threshold frequency differences of the one or more first frequencies; and

generating, by the computing system, a risk profile for the map region based on the one or more scenarios, the metadata, and a risk profile for the second map region, wherein the risk profile includes a first level of risk of encountering people and a second level of risk of encountering non-moving objects.

2. The computer-implemented method of claim 1 , wherein the map features include zone information of a road segment in the map region, a road segment quality of the road segment, and contextual information of the road segment.

3. The computer-implemented method of claim 1 , further comprising:

modifying, by the computing system, operation of a vehicle in the map region based on the risk profile for the map region.

4. The computer-implemented method of claim 1 , wherein the determining the one or more scenarios comprises:

generating, by the computing system, one or more histograms that represent one or more frequencies associated with one or more scenario families that include the one or more scenarios.

5. The computer-implemented method of claim 1 , wherein the one or more scenarios are associated with one or more levels of difficulty for navigation, and wherein the risk profile for the map region is based on the one or more levels of difficulty for navigation.

6. The computer-implemented method of claim 1 , wherein the risk profile for the map region is based on risk profiles of other map regions that satisfy a threshold similarity with respect to frequencies of scenario families for the map region.

7. The computer-implemented method of claim 1 , wherein the one or more scenarios are associated with a set of predefined scenario families that correspond with interactions of objects detected at the map region.

8. The computer-implemented method of claim 1 , wherein the metadata includes a time-based representation of objects detected over the period of time at the map region and information obtained from a semantic map associated with the map region.

9. The computer-implemented method of claim 1 , wherein the metadata is encoded based on a predefined scenario schema, and wherein the predefined scenario schema provides a structured representation of the map features associated with the map region.

10. A system comprising:

at least one processor; and

a memory storing instructions that, when executed by the at least one processor, cause the system to perform operations comprising:

encoding metadata for a map region based on map features that describe agents, actions performed by the agents over a period of time, and environment associated with the map region;

determining one or more scenarios for the map region based on the metadata;

determining one or more first frequencies for the one or more scenarios in the map region;

identifying a second map region associated with one or more second frequencies for the one or more scenarios, wherein the one or more second frequencies are within one or more threshold frequency differences of the one or more first frequencies; and

generating a risk profile for the map region based on the one or more scenarios, the metadata, and a risk profile for the second map region, wherein the risk profile includes a first level of risk of encountering people and a second level of risk of encountering non-moving objects.

11. The system of claim 10 , wherein the map features include zone information of a road segment in the map region, a road segment quality of the road segment, and contextual information of the road segment.

12. The system of claim 10 , the operations further comprising:

modifying operation of a vehicle in the map region based on the risk profile for the map region.

13. The system of claim 10 , wherein the determining the one or more scenarios comprises:

generating one or more histograms that represent one or more frequencies associated with the one or more scenarios.

14. The system of claim 10 , wherein the one or more scenarios are associated with one or more levels of difficulty for navigation, and wherein the risk profile for the map region is based on the one or more levels of difficulty for navigation.

15. A non-transitory computer-readable storage medium including instructions that, when executed by at least on processor of a computing system, cause the computing system to perform operations comprising:

encoding metadata for a map region based on map features that describe agents, actions performed by the agents over a period of time, and environment associated with the map region;

determining one or more scenarios for the map region based on the metadata;

determining one or more first frequencies for the one or more scenarios in the map region;

identifying a second map region associated with one or more second frequencies for the one or more scenarios, wherein the one or more second frequencies are within one or more threshold frequency differences of the one or more first frequencies; and

generating a risk profile for the map region based on the one or more scenarios, the metadata, and a risk profile for the second map region, wherein the risk profile includes a first level of risk of encountering people and a second level of risk of encountering non-moving objects.

16. The non-transitory computer-readable storage medium of claim 15 , wherein the map features include zone information of a road segment in the map region, a road segment quality of the road segment, and contextual information of the road segment.

17. The non-transitory computer-readable storage medium of claim 15 , the operations further comprising:

modifying operation of a vehicle in the map region based on the risk profile for the map region.

18. The non-transitory computer-readable storage medium of claim 15 , wherein the determining the one or more scenarios comprises:

generating one or more histograms that represent one or more frequencies associated with the one or more scenarios.

Assignments (1)
SECURITY INTEREST Recorded Nov 3, 2022
From: LYFT, INC.
To: JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT
Reel/Frame 061880/0237 →
Continuity (2)
Continuation 16457468 · Jun 28, 2019
Related Publication 20230110659A1 · Apr 13, 2023
References Cited (118)
US 7680749B1 · Golding et al. · 2010 [cited by applicant]
US 8489316B1 · Hedges · 2013 [cited by applicant]
US 9672734B1 · Ratnasingam · 2017 [cited by applicant]
US 9881503B1 · Goldman-Shenhar · 2018 [cited by applicant]
US 10186156B2 · Sweeney · 2019 [cited by applicant]
US 10338594B2 · Long · 2019 [cited by applicant]
US 10372132B2 · Herz et al. · 2019 [cited by applicant]
US 10414395B1 · Sapp et al. · 2019 [cited by applicant]
US 10479356B1 · Haque et al. · 2019 [cited by applicant]
US 10699647B2 · Wang · 2020 [cited by examiner]
US 10992755B1 · Tran · 2021 [cited by applicant]
US 11126180B1 · Kobilarov · 2021 [cited by examiner]
US 11150660B1 · Kabirzadeh et al. · 2021 [cited by applicant]
US 11200429B1 · Evans et al. · 2021 [cited by applicant]
US 11409304B1 · Cai et al. · 2022 [cited by applicant]
US 20030131069A1 · Lucovsky et al. · 2003 [cited by applicant]
US 20030131142A1 · Horvitz et al. · 2003 [cited by applicant]
US 20040210500A1 · Sobel et al. · 2004 [cited by applicant]
US 20050044108A1 · Shah et al. · 2005 [cited by applicant]
US 20050049993A1 · Nori et al. · 2005 [cited by applicant]
US 20050137769A1 · Takamatsu et al. · 2005 [cited by applicant]
US 20060036642A1 · Horvitz et al. · 2006 [cited by applicant]
US 20080071465A1 · Chapman et al. · 2008 [cited by applicant]
US 20080162498A1 · Omoigui · 2008 [cited by applicant]
US 20090177685A1 · Ellis et al. · 2009 [cited by applicant]
US 20090240728A1 · Shukla et al. · 2009 [cited by applicant]
US 20100017060A1 · Zhang · 2010 [cited by applicant]
US 20110251735A1 · Hayashi · 2011 [cited by applicant]
US 20120078595A1 · Balandin et al. · 2012 [cited by applicant]
US 20120078905A1 · Lin et al. · 2012 [cited by applicant]
US 20120191716A1 · Omoigui · 2012 [cited by applicant]
US 20120209505A1 · Breed et al. · 2012 [cited by applicant]
US 20120259732A1 · Sasankan et al. · 2012 [cited by applicant]
US 20120330540A1 · Ozaki et al. · 2012 [cited by applicant]
US 20130166205A1 · Ikeda et al. · 2013 [cited by applicant]
US 20130278442A1 · Rubin et al. · 2013 [cited by applicant]
US 20140032581A1 · Young · 2014 [cited by applicant]
US 20140257659A1 · Dariush · 2014 [cited by applicant]
US 20150269198A1 · Cornish et al. · 2015 [cited by applicant]
US 20150291146A1 · Prakah-Asante et al. · 2015 [cited by applicant]
US 20160061625A1 · Wang · 2016 [cited by applicant]
US 20160171521A1 · Ramirez · 2016 [cited by applicant]
US 20160223343A1 · Averbuch · 2016 [cited by applicant]
US 20160275730A1 · Bonhomme · 2016 [cited by applicant]
US 20160334797A1 · Ross · 2016 [cited by applicant]
US 20160357788A1 · Wilkes et al. · 2016 [cited by applicant]
US 20170010107A1 · Shashua · 2017 [cited by applicant]
US 20170017529A1 · Elvanoglu et al. · 2017 [cited by applicant]
US 20170089710A1 · Slusar · 2017 [cited by applicant]
US 20170113685A1 · Sendhoff · 2017 [cited by applicant]
US 20170132334A1 · Levinson et al. · 2017 [cited by applicant]
US 20170177937A1 · Harmsen · 2017 [cited by applicant]
US 20170200063A1 · Nariyambut Murali et al. · 2017 [cited by applicant]
US 20170241791A1 · Madigan · 2017 [cited by applicant]
US 20170270372A1 · Stein · 2017 [cited by applicant]
US 20170286782A1 · Pillai et al. · 2017 [cited by applicant]
US 20170293763A1 · Shear et al. · 2017 [cited by applicant]
US 20180005254A1 · Bai et al. · 2018 [cited by applicant]
US 20180023964A1 · Ivanov et al. · 2018 [cited by applicant]
US 20180136979A1 · Morris · 2018 [cited by applicant]
US 20180137373A1 · Rasmusson, Jr. · 2018 [cited by applicant]
US 20180149491A1 · Tayama · 2018 [cited by applicant]
US 20180181095A1 · Funk et al. · 2018 [cited by applicant]
US 20180217600A1 · Shashua et al. · 2018 [cited by applicant]
US 20180246752A1 · Bonetta et al. · 2018 [cited by applicant]
US 20180288060A1 · Jackson et al. · 2018 [cited by applicant]
US 20180316695A1 · Esman · 2018 [cited by applicant]
US 20190019329A1 · Eyler et al. · 2019 [cited by applicant]
US 20190042867A1 · Chen et al. · 2019 [cited by applicant]
US 20190049948A1 · Patel et al. · 2019 [cited by applicant]
US 20190049968A1 · Dean · 2019 [cited by applicant]
US 20190108753A1 · Kaiser · 2019 [cited by examiner]
US 20190143992A1 · Sohn et al. · 2019 [cited by applicant]
US 20190171797A1 · Morris · 2019 [cited by applicant]
US 20190174397A1 · Naqvi · 2019 [cited by applicant]
US 20190205310A1 · Satkunarajah et al. · 2019 [cited by applicant]
US 20190243371A1 · Nister · 2019 [cited by applicant]
US 20190244040A1 · Hermann · 2019 [cited by applicant]
US 20190256087A1 · Kim et al. · 2019 [cited by applicant]
US 20190258251A1 · Ditty · 2019 [cited by applicant]
US 20190258878A1 · Koivisto · 2019 [cited by applicant]
US 20190266139A1 · Kumarasamy et al. · 2019 [cited by applicant]
US 20190277646A1 · Iagnemma · 2019 [cited by examiner]
US 20190370615A1 · Murphy et al. · 2019 [cited by applicant]
US 20190377354A1 · Shalev-Shwartz et al. · 2019 [cited by applicant]
US 20200013088A1 · Naqvi · 2020 [cited by applicant]
US 20200019161A1 · Stenneth · 2020 [cited by examiner]
US 20200042626A1 · Curtis et al. · 2020 [cited by applicant]
US 20200042651A1 · Curtis et al. · 2020 [cited by applicant]
US 20200050190A1 · Patel et al. · 2020 [cited by applicant]
US 20200050483A1 · Shear et al. · 2020 [cited by applicant]
US 20200081445A1 · Stetson et al. · 2020 [cited by applicant]
US 20200117200A1 · Akella et al. · 2020 [cited by applicant]
US 20200151353A1 · Struttmann · 2020 [cited by applicant]
US 20200180610A1 · Schneider et al. · 2020 [cited by applicant]
US 20200183794A1 · Dwarampudi et al. · 2020 [cited by applicant]
US 20200201890A1 · Viswanathan · 2020 [cited by applicant]
US 20200204534A1 · Beecham et al. · 2020 [cited by applicant]
US 20200285788A1 · Brebner · 2020 [cited by applicant]
US 20200351322A1 · Magzimof et al. · 2020 [cited by applicant]
US 20200394455A1 · Lee et al. · 2020 [cited by applicant]
US 20210011150A1 · Bialer et al. · 2021 [cited by applicant]
US 20210021539A1 · Shear et al. · 2021 [cited by applicant]
US 20210041873A1 · Kim et al. · 2021 [cited by applicant]
US 20210053561A1 · Beller et al. · 2021 [cited by applicant]
US 20210055732A1 · Caldwell et al. · 2021 [cited by applicant]
US 20210097148A1 · Bagschik et al. · 2021 [cited by applicant]
US 20210142526A1 · Mantyjarvi et al. · 2021 [cited by applicant]
US 20210341921A1 · Davis · 2021 [cited by examiner]
US 20210350147A1 · Yuan et al. · 2021 [cited by applicant]
US 20220011130A1 · Hanniel et al. · 2022 [cited by applicant]
US 20220113371A1 · Han et al. · 2022 [cited by applicant]
US 20220163348A1 · Zhang et al. · 2022 [cited by applicant]
EP 3342683 · 2018 [cited by applicant]
JP 2010134499A · 2010 [cited by applicant]
International Patent Application No. PCT/US2019/045780, Search Report and Written Opinion mailed Nov. 27. 2019, 10 pages. [cited by applicant]
International Patent Application No. PCT/US2020/039444, Search Report and Written Opinion mailed Oct. 13, 2020, 10 pages. [cited by applicant]
Mexican Patent Application No. MX/a/2021/001872, Office Action mailed Jun. 21, 2024, 3 pages. [cited by applicant]
Cited By (1)
US 12,546,607