IP Library Patent Application 16917478
Patent Application
App. No. 16/917,478

SYSTEMS AND METHODS FOR ENCODING AND SEARCHING SCENARIO INFORMATION

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 None
App. No.
16/917,478
Abstract

Systems, methods, and non-transitory computer-readable media can receive a search query including one or more high-level primitives. One or more low-level parameters describing behavior of at least one agent associated with at least one value that satisfies at least one annotation rule associated with the one or more high-level primitives can be determined. In response to determining that the at least one value satisfies the at least one annotation rule, one or more scenarios associated with the one or more low-level parameters that satisfy the at least one annotation rule can be identified by using the one or more high-level primitives included in the search query. Information describing the one or more identified scenarios in response to the search query can be provided.

Claims (57)

1 . A computer-implemented method comprising:

receiving, by a computing system, a search query including one or more high-level primitives;

determining, by the computing system, one or more low-level parameters describing behavior of at least one agent associated with at least one value that satisfies at least one annotation rule associated with the one or more high-level primitives;

in response to determining, by the computing system, that the at least one value satisfies the at least one annotation rule, identifying one or more scenarios associated with the one or more low-level parameters that satisfy the at least one annotation rule by using the one or more high-level primitives included in the search query; and

providing, by the computing system, information describing the one or more identified scenarios in response to the search query.

2 . The computer-implemented method of claim 1 , wherein the at least one annotation rule includes at least one of a low-level parameter rule or a time-window rule.

3 . The computer-implemented method of claim 1 , wherein the one or more high-level primitives are capable of being used to identify the one or more identified scenarios in lieu of including the low-level parameters in the search query.

4 . The computer-implemented method of claim 1 , wherein the search query includes at least a first keyword and a second keyword that are associated with the one or more high-level primitives, and the method further comprises:

determining, by the computing system, that the first keyword is associated with a first high-level primitive and the second keyword is associated with a second high-level primitive;

performing, by the computing system, an inner join or an outer join of the search query based on the first keyword and the second keyword;

determining, by the computing system, that the one or more identified scenarios satisfy the at least one annotation rule associated with the first and second keywords; and

providing, by the computing system, the one or more identified scenarios that satisfy the at least one annotation rule associated with both the first keyword and the second keyword.

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

determining, by the computing system, a set of low-level parameters associated with an agent involved in a scenario;

determining, by the computing system, that the set of low-level parameters satisfy an annotation rule associated with at least one high-level primitive; and

associating, by the computing system, the scenario with the at least one high-level primitive based upon the set of low-level parameters satisfying the at least one annotation rule.

6 . The computer-implemented method of claim 5 , wherein the set of low-level parameters describe at least one spatial parameter and at least one temporal parameter of the agent.

7 . The computer-implemented method of claim 5 , further comprising:

receiving, by the computing system, a new high-level primitive associated with a new annotation rule;

adding, by the computing system, the new high-level primitive to a collection of the one or more high-level primitives;

determining, by the computing system, that the set of low-level parameters satisfy the new annotation rule associated with the new high-level primitive; and

associating, by the computing system, the at least one scenario with the new high-level primitive based upon satisfaction of the new one annotation rule.

8 . The computer-implemented method of claim 1 , wherein the search query comprises at least one of a natural language query based on text descriptions associated with scenarios, a keyword query based on high-level primitives associated with the scenarios, or a structured query language (SQL) query.

9 . The computer-implemented method of claim 1 , wherein, in response to determining that the at least one value satisfies the at least one annotation rule, the one or more high-level primitives are utilized in the search query to search for the one or more identified scenarios in lieu of the search query including the one or more low-level parameters.

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

determining, by the computing system, one or more keywords associated with a scenario; and

indexing, by the computing system, the scenario in the catalog based on the one or more associated keywords.

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

receiving, by the computing system, an additional scenario associated with one or more low-level parameters;

determining that the one or more low-level parameters do not satisfy annotation rules associated with high-level primitives in the index; and

in response to the determining, generating an additional high-level primitive that identifies the one or more low-level parameters associated with the additional scenario.

12 . 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:

receiving a search query including one or more high-level primitives;

determining one or more low-level parameters describing behavior of at least one agent associated with at least one value that satisfies at least one annotation rule associated with the one or more high-level primitives;

in response to determining that the at least one value satisfies the at least one annotation rule, identifying one or more scenarios associated with the one or more low-level parameters that satisfy the at least one annotation rule by using the one or more high-level primitives included in the search query; and

providing information describing the one or more identified scenarios in response to the search query.

13 . The system of claim 12 , wherein, in response to determining that the at least one value satisfies the at least one annotation rule, the one or more high-level primitives are utilized in the search query to search for the one or more identified scenarios in lieu of the search query including the one or more low-level parameters.

14 . The system of claim 12 , wherein the one or more keywords include a keyword that references an agent cut-in, an agent cut-out, an agent performing a left turn, an agent performing a right turn, an agent slowing down, an agent speeding up, an agent performing a lane change, an agent performing a nudge, or an agent performing a lane merge.

15 . The system of claim 12 , wherein the one or more keywords comprises a first keyword and a second keyword, wherein, in response to, determining the at least one scenario that satisfies the one or more keywords, the at least one processor further causes the system to perform:

performing an inner join based on the first keyword and the second keyword; and

providing scenarios that satisfy both the first keyword and the second keyword.

16 . The system of claim 12 , wherein the at least one processor further causes the system to perform:

determining a set of low-level parameters associated with an agent involved in a scenario;

determining that the set of low-level parameters satisfy at least one annotation rule associated with at least one high-level primitive; and

associating the at least one scenario with the at least one high-level primitive based upon satisfaction of the at least one annotation rule.

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

receiving a search query including one or more high-level primitives;

determining one or more low-level parameters describing behavior of at least one agent associated with at least one value that satisfies at least one annotation rule associated with the one or more high-level primitives;

in response to determining that the at least one value satisfies the at least one annotation rule, identifying one or more scenarios associated with the one or more low-level parameters that satisfy the at least one annotation rule by using the one or more high-level primitives included in the search query; and

providing information describing the one or more identified scenarios in response to the search query.

18 . The non-transitory computer-readable storage medium of claim 17 , wherein, in response to determining that the at least one value satisfies the at least one annotation rule, the one or more high-level primitives are utilized in the search query to search for the one or more identified scenarios in lieu of the search query including the one or more low-level parameters.

19 . The non-transitory computer-readable storage medium of claim 17 , wherein the one or more keywords include a keyword that references an agent cut-in, an agent cut-out, an agent performing a left turn, an agent performing a right turn, an agent slowing down, an agent speeding up, an agent performing a lane change, an agent performing a nudge, or an agent performing a lane merge.

20 . The non-transitory computer-readable storage medium of claim 17 , wherein the one or more keywords comprises a first keyword and a second keyword, wherein, in response to determining that the at least one scenario satisfies the one or more keywords, the at least one processor further causes the computing system to perform:

performing an inner join based on the first keyword and the second keyword; and

providing scenarios that satisfy both the first keyword and the second keyword.

Assignments (2)
SECURITY INTEREST Recorded Nov 3, 2022
From: LYFT, INC.
To: JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT
Reel/Frame 061880/0237 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 13, 2020
From: DANNA, EMILIE JEANNE ANNE
To: LYFT, INC.
Reel/Frame 053484/0653 →